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 2843e519524SHoward Hinnant random_shuffle(RandomAccessIterator first, RandomAccessIterator last); 2853e519524SHoward Hinnant 2863e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 2873e519524SHoward Hinnant void 2883e519524SHoward Hinnant random_shuffle(RandomAccessIterator first, RandomAccessIterator last, RandomNumberGenerator& rand); 2893e519524SHoward Hinnant 290f9d540b0SHoward Hinnanttemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 291f9d540b0SHoward Hinnant void shuffle(RandomAccessIterator first, RandomAccessIterator last, 292fb340102SHoward Hinnant UniformRandomNumberGenerator&& g); 293f9d540b0SHoward Hinnant 2943e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 2953e519524SHoward Hinnant bool 2963e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 2973e519524SHoward Hinnant 2983e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 2993e519524SHoward Hinnant ForwardIterator 3003e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3013e519524SHoward Hinnant 3023e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 3033e519524SHoward Hinnant class OutputIterator2, class Predicate> 3043e519524SHoward Hinnant pair<OutputIterator1, OutputIterator2> 3053e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 3063e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 3073e519524SHoward Hinnant Predicate pred); 3083e519524SHoward Hinnant 3093e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3103e519524SHoward Hinnant ForwardIterator 3113e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3123e519524SHoward Hinnant 3133e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 3143e519524SHoward Hinnant ForwardIterator 3153e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 3163e519524SHoward Hinnant 3173e519524SHoward Hinnanttemplate <class ForwardIterator> 3183e519524SHoward Hinnant bool 3193e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 3203e519524SHoward Hinnant 3213e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3223e519524SHoward Hinnant bool 3233e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 3243e519524SHoward Hinnant 3253e519524SHoward Hinnanttemplate<class ForwardIterator> 3263e519524SHoward Hinnant ForwardIterator 3273e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 3283e519524SHoward Hinnant 3293e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3303e519524SHoward Hinnant ForwardIterator 3313e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 3323e519524SHoward Hinnant 3333e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3343e519524SHoward Hinnant void 3353e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 3363e519524SHoward Hinnant 3373e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3383e519524SHoward Hinnant void 3393e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3403e519524SHoward Hinnant 3413e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3423e519524SHoward Hinnant void 3433e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 3443e519524SHoward Hinnant 3453e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3463e519524SHoward Hinnant void 3473e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3483e519524SHoward Hinnant 3493e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3503e519524SHoward Hinnant void 3513e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 3523e519524SHoward Hinnant 3533e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3543e519524SHoward Hinnant void 3553e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 3563e519524SHoward Hinnant 3573e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 3583e519524SHoward Hinnant RandomAccessIterator 3593e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3603e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 3613e519524SHoward Hinnant 3623e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 3633e519524SHoward Hinnant RandomAccessIterator 3643e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3653e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 3663e519524SHoward Hinnant 3673e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3683e519524SHoward Hinnant void 3693e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 3703e519524SHoward Hinnant 3713e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3723e519524SHoward Hinnant void 3733e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 3743e519524SHoward Hinnant 3753e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3763e519524SHoward Hinnant ForwardIterator 3773e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 3783e519524SHoward Hinnant 3793e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3803e519524SHoward Hinnant ForwardIterator 3813e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3823e519524SHoward Hinnant 3833e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3843e519524SHoward Hinnant ForwardIterator 3853e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 3863e519524SHoward Hinnant 3873e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3883e519524SHoward Hinnant ForwardIterator 3893e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3903e519524SHoward Hinnant 3913e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3923e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3933e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 3943e519524SHoward Hinnant 3953e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3963e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3973e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3983e519524SHoward Hinnant 3993e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 4003e519524SHoward Hinnant bool 4013e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 4023e519524SHoward Hinnant 4033e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 4043e519524SHoward Hinnant bool 4053e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4063e519524SHoward Hinnant 4073e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4083e519524SHoward Hinnant OutputIterator 4093e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4103e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4113e519524SHoward Hinnant 4123e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4133e519524SHoward Hinnant OutputIterator 4143e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4153e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4163e519524SHoward Hinnant 4173e519524SHoward Hinnanttemplate <class BidirectionalIterator> 4183e519524SHoward Hinnant void 4193e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 4203e519524SHoward Hinnant 4213e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 4223e519524SHoward Hinnant void 4233e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 4243e519524SHoward Hinnant 4253e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 4263e519524SHoward Hinnant bool 4273e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 4283e519524SHoward Hinnant 4293e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 4303e519524SHoward Hinnant bool 4313e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 4323e519524SHoward Hinnant 4333e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4343e519524SHoward Hinnant OutputIterator 4353e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4363e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4373e519524SHoward Hinnant 4383e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4393e519524SHoward Hinnant OutputIterator 4403e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4413e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4423e519524SHoward Hinnant 4433e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4443e519524SHoward Hinnant OutputIterator 4453e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4463e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4473e519524SHoward Hinnant 4483e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4493e519524SHoward Hinnant OutputIterator 4503e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4513e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4523e519524SHoward Hinnant 4533e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4543e519524SHoward Hinnant OutputIterator 4553e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4563e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4573e519524SHoward Hinnant 4583e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4593e519524SHoward Hinnant OutputIterator 4603e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4613e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4623e519524SHoward Hinnant 4633e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4643e519524SHoward Hinnant OutputIterator 4653e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4663e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4673e519524SHoward Hinnant 4683e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4693e519524SHoward Hinnant OutputIterator 4703e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4713e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4723e519524SHoward Hinnant 4733e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4743e519524SHoward Hinnant void 4753e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 4763e519524SHoward Hinnant 4773e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4783e519524SHoward Hinnant void 4793e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4803e519524SHoward Hinnant 4813e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4823e519524SHoward Hinnant void 4833e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 4843e519524SHoward Hinnant 4853e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4863e519524SHoward Hinnant void 4873e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4883e519524SHoward Hinnant 4893e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4903e519524SHoward Hinnant void 4913e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 4923e519524SHoward Hinnant 4933e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4943e519524SHoward Hinnant void 4953e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4963e519524SHoward Hinnant 4973e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4983e519524SHoward Hinnant void 4993e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 5003e519524SHoward Hinnant 5013e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5023e519524SHoward Hinnant void 5033e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5043e519524SHoward Hinnant 5053e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5063e519524SHoward Hinnant bool 5073e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 5083e519524SHoward Hinnant 5093e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5103e519524SHoward Hinnant bool 5113e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5123e519524SHoward Hinnant 5133e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5143e519524SHoward Hinnant RandomAccessIterator 5153e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 5163e519524SHoward Hinnant 5173e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5183e519524SHoward Hinnant RandomAccessIterator 5193e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5203e519524SHoward Hinnant 5214eb27b79SHoward Hinnanttemplate <class ForwardIterator> 5224eb27b79SHoward Hinnant ForwardIterator 5234eb27b79SHoward Hinnant min_element(ForwardIterator first, ForwardIterator last); 5244eb27b79SHoward Hinnant 5254eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5264eb27b79SHoward Hinnant ForwardIterator 5274eb27b79SHoward Hinnant min_element(ForwardIterator first, ForwardIterator last, Compare comp); 5284eb27b79SHoward Hinnant 5293e519524SHoward Hinnanttemplate <class T> 5303e519524SHoward Hinnant const T& 5313e519524SHoward Hinnant min(const T& a, const T& b); 5323e519524SHoward Hinnant 5333e519524SHoward Hinnanttemplate <class T, class Compare> 5343e519524SHoward Hinnant const T& 5353e519524SHoward Hinnant min(const T& a, const T& b, Compare comp); 5363e519524SHoward Hinnant 5373e519524SHoward Hinnanttemplate<class T> 5384eb27b79SHoward Hinnant T 5394eb27b79SHoward Hinnant min(initializer_list<T> t); 5403e519524SHoward Hinnant 5413e519524SHoward Hinnanttemplate<class T, class Compare> 5424eb27b79SHoward Hinnant T 5434eb27b79SHoward Hinnant min(initializer_list<T> t, Compare comp); 5443e519524SHoward Hinnant 5453e519524SHoward Hinnanttemplate <class ForwardIterator> 5463e519524SHoward Hinnant ForwardIterator 5473e519524SHoward Hinnant max_element(ForwardIterator first, ForwardIterator last); 5483e519524SHoward Hinnant 5493e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5503e519524SHoward Hinnant ForwardIterator 5513e519524SHoward Hinnant max_element(ForwardIterator first, ForwardIterator last, Compare comp); 5523e519524SHoward Hinnant 5534eb27b79SHoward Hinnanttemplate <class T> 5544eb27b79SHoward Hinnant const T& 5554eb27b79SHoward Hinnant max(const T& a, const T& b); 5564eb27b79SHoward Hinnant 5574eb27b79SHoward Hinnanttemplate <class T, class Compare> 5584eb27b79SHoward Hinnant const T& 5594eb27b79SHoward Hinnant max(const T& a, const T& b, Compare comp); 5604eb27b79SHoward Hinnant 5614eb27b79SHoward Hinnanttemplate<class T> 5624eb27b79SHoward Hinnant T 5634eb27b79SHoward Hinnant max(initializer_list<T> t); 5644eb27b79SHoward Hinnant 5654eb27b79SHoward Hinnanttemplate<class T, class Compare> 5664eb27b79SHoward Hinnant T 5674eb27b79SHoward Hinnant max(initializer_list<T> t, Compare comp); 5684eb27b79SHoward Hinnant 5694eb27b79SHoward Hinnanttemplate<class ForwardIterator> 5704eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5714eb27b79SHoward Hinnant minmax_element(ForwardIterator first, ForwardIterator last); 5724eb27b79SHoward Hinnant 5734eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 5744eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5754eb27b79SHoward Hinnant minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); 5764eb27b79SHoward Hinnant 5774eb27b79SHoward Hinnanttemplate<class T> 5784eb27b79SHoward Hinnant pair<const T&, const T&> 5794eb27b79SHoward Hinnant minmax(const T& a, const T& b); 5804eb27b79SHoward Hinnant 5814eb27b79SHoward Hinnanttemplate<class T, class Compare> 5824eb27b79SHoward Hinnant pair<const T&, const T&> 5834eb27b79SHoward Hinnant minmax(const T& a, const T& b, Compare comp); 5844eb27b79SHoward Hinnant 5854eb27b79SHoward Hinnanttemplate<class T> 5864eb27b79SHoward Hinnant pair<T, T> 5874eb27b79SHoward Hinnant minmax(initializer_list<T> t); 5884eb27b79SHoward Hinnant 5894eb27b79SHoward Hinnanttemplate<class T, class Compare> 5904eb27b79SHoward Hinnant pair<T, T> 5914eb27b79SHoward Hinnant minmax(initializer_list<T> t, Compare comp); 5924eb27b79SHoward Hinnant 5933e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 5943e519524SHoward Hinnant bool 5953e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 5963e519524SHoward Hinnant 5973e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 5983e519524SHoward Hinnant bool 5993e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 6003e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 6013e519524SHoward Hinnant 6023e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6033e519524SHoward Hinnant bool 6043e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 6053e519524SHoward Hinnant 6063e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6073e519524SHoward Hinnant bool 6083e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6093e519524SHoward Hinnant 6103e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6113e519524SHoward Hinnant bool 6123e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 6133e519524SHoward Hinnant 6143e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6153e519524SHoward Hinnant bool 6163e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6173e519524SHoward Hinnant 6183e519524SHoward Hinnant} // std 6193e519524SHoward Hinnant 6203e519524SHoward Hinnant*/ 6213e519524SHoward Hinnant 6223e519524SHoward Hinnant#include <__config> 6233e519524SHoward Hinnant#include <initializer_list> 6243e519524SHoward Hinnant#include <type_traits> 6253e519524SHoward Hinnant#include <cstring> 6263e519524SHoward Hinnant#include <utility> 6273e519524SHoward Hinnant#include <memory> 6283e519524SHoward Hinnant#include <iterator> 629a1d07d57SHoward Hinnant#include <cstddef> 6303e519524SHoward Hinnant 6315d1a701dSHoward Hinnant#if defined(__IBMCPP__) 6325d1a701dSHoward Hinnant#include "support/ibm/support.h" 6335d1a701dSHoward Hinnant#endif 634*5f878d4bSHoward Hinnant#if defined(_LIBCPP_MSVCRT) || defined(__MINGW32__) 635*5f878d4bSHoward Hinnant#include "support/win32/support.h" 636*5f878d4bSHoward Hinnant#endif 6375d1a701dSHoward Hinnant 638ab4f4382SHoward Hinnant#include <__undef_min_max> 639ab4f4382SHoward Hinnant 640073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6413e519524SHoward Hinnant#pragma GCC system_header 642073458b1SHoward Hinnant#endif 6433e519524SHoward Hinnant 6443e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6453e519524SHoward Hinnant 6463e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6473e519524SHoward Hinnantstruct __equal_to 6483e519524SHoward Hinnant{ 6493e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6503e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 6513e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 6523e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6533e519524SHoward Hinnant}; 6543e519524SHoward Hinnant 6553e519524SHoward Hinnanttemplate <class _T1> 6563e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6573e519524SHoward Hinnant{ 6583e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6593e519524SHoward Hinnant}; 6603e519524SHoward Hinnant 6613e519524SHoward Hinnanttemplate <class _T1> 6623e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6633e519524SHoward Hinnant{ 6643e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6653e519524SHoward Hinnant}; 6663e519524SHoward Hinnant 6673e519524SHoward Hinnanttemplate <class _T1> 6683e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6693e519524SHoward Hinnant{ 6703e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6713e519524SHoward Hinnant}; 6723e519524SHoward Hinnant 6733e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6743e519524SHoward Hinnantstruct __less 6753e519524SHoward Hinnant{ 6763e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6773e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 6783e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 6793e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 6803e519524SHoward Hinnant}; 6813e519524SHoward Hinnant 6823e519524SHoward Hinnanttemplate <class _T1> 6833e519524SHoward Hinnantstruct __less<_T1, _T1> 6843e519524SHoward Hinnant{ 6853e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6863e519524SHoward Hinnant}; 6873e519524SHoward Hinnant 6883e519524SHoward Hinnanttemplate <class _T1> 6893e519524SHoward Hinnantstruct __less<const _T1, _T1> 6903e519524SHoward Hinnant{ 6913e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6923e519524SHoward Hinnant}; 6933e519524SHoward Hinnant 6943e519524SHoward Hinnanttemplate <class _T1> 6953e519524SHoward Hinnantstruct __less<_T1, const _T1> 6963e519524SHoward Hinnant{ 6973e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6983e519524SHoward Hinnant}; 6993e519524SHoward Hinnant 7003e519524SHoward Hinnanttemplate <class _Predicate> 7013e519524SHoward Hinnantclass __negate 7023e519524SHoward Hinnant{ 7033e519524SHoward Hinnantprivate: 7043e519524SHoward Hinnant _Predicate __p_; 7053e519524SHoward Hinnantpublic: 7063e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY __negate() {} 7073e519524SHoward Hinnant 7083e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7093e519524SHoward Hinnant explicit __negate(_Predicate __p) : __p_(__p) {} 7103e519524SHoward Hinnant 7113e519524SHoward Hinnant template <class _T1> 7123e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7133e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 7143e519524SHoward Hinnant 7153e519524SHoward Hinnant template <class _T1, class _T2> 7163e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7173e519524SHoward Hinnant bool operator()(const _T1& __x, const _T2& __y) {return !__p_(__x, __y);} 7183e519524SHoward Hinnant}; 7193e519524SHoward Hinnant 720145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 7213e519524SHoward Hinnant 7223e519524SHoward Hinnanttemplate <class _Compare> 7233e519524SHoward Hinnantstruct __debug_less 7243e519524SHoward Hinnant{ 7253e519524SHoward Hinnant _Compare __comp_; 7263e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 7273e519524SHoward Hinnant template <class _Tp, class _Up> 7283e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 7293e519524SHoward Hinnant { 7303e519524SHoward Hinnant bool __r = __comp_(__x, __y); 7313e519524SHoward Hinnant if (__r) 732f554add5SHoward Hinnant _LIBCPP_ASSERT(!__comp_(__y, __x), "Comparator does not induce a strict weak ordering"); 7333e519524SHoward Hinnant return __r; 7343e519524SHoward Hinnant } 7353e519524SHoward Hinnant}; 7363e519524SHoward Hinnant 737145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 7383e519524SHoward Hinnant 739c8edcb36SHoward Hinnant// Precondition: __x != 0 740c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 741c206366fSHoward Hinnantunsigned 742c206366fSHoward Hinnant__ctz(unsigned __x) 743c206366fSHoward Hinnant{ 744c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_ctz(__x)); 745c206366fSHoward Hinnant} 746c206366fSHoward Hinnant 747c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 748c206366fSHoward Hinnantunsigned long 749c206366fSHoward Hinnant__ctz(unsigned long __x) 750c206366fSHoward Hinnant{ 751c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_ctzl(__x)); 752c206366fSHoward Hinnant} 753c206366fSHoward Hinnant 754c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 755c206366fSHoward Hinnantunsigned long long 756c206366fSHoward Hinnant__ctz(unsigned long long __x) 757c206366fSHoward Hinnant{ 758c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_ctzll(__x)); 759c206366fSHoward Hinnant} 760c8edcb36SHoward Hinnant 761c8edcb36SHoward Hinnant// Precondition: __x != 0 762c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 763c206366fSHoward Hinnantunsigned 764c206366fSHoward Hinnant__clz(unsigned __x) 765c206366fSHoward Hinnant{ 766c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_clz(__x)); 767c206366fSHoward Hinnant} 768c206366fSHoward Hinnant 769c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 770c206366fSHoward Hinnantunsigned long 771c206366fSHoward Hinnant__clz(unsigned long __x) 772c206366fSHoward Hinnant{ 773c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_clzl (__x)); 774c206366fSHoward Hinnant} 775c206366fSHoward Hinnant 776c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 777c206366fSHoward Hinnantunsigned long long 778c206366fSHoward Hinnant__clz(unsigned long long __x) 779c206366fSHoward Hinnant{ 780c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_clzll(__x)); 781c206366fSHoward Hinnant} 782c8edcb36SHoward Hinnant 783c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) {return __builtin_popcount (__x);} 784c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) {return __builtin_popcountl (__x);} 785c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) {return __builtin_popcountll(__x);} 786c8edcb36SHoward Hinnant 7873e519524SHoward Hinnant// all_of 7883e519524SHoward Hinnant 7893e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 7903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7913e519524SHoward Hinnantbool 7923e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7933e519524SHoward Hinnant{ 7943e519524SHoward Hinnant for (; __first != __last; ++__first) 7953e519524SHoward Hinnant if (!__pred(*__first)) 7963e519524SHoward Hinnant return false; 7973e519524SHoward Hinnant return true; 7983e519524SHoward Hinnant} 7993e519524SHoward Hinnant 8003e519524SHoward Hinnant// any_of 8013e519524SHoward Hinnant 8023e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8043e519524SHoward Hinnantbool 8053e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8063e519524SHoward Hinnant{ 8073e519524SHoward Hinnant for (; __first != __last; ++__first) 8083e519524SHoward Hinnant if (__pred(*__first)) 8093e519524SHoward Hinnant return true; 8103e519524SHoward Hinnant return false; 8113e519524SHoward Hinnant} 8123e519524SHoward Hinnant 8133e519524SHoward Hinnant// none_of 8143e519524SHoward Hinnant 8153e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8173e519524SHoward Hinnantbool 8183e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8193e519524SHoward Hinnant{ 8203e519524SHoward Hinnant for (; __first != __last; ++__first) 8213e519524SHoward Hinnant if (__pred(*__first)) 8223e519524SHoward Hinnant return false; 8233e519524SHoward Hinnant return true; 8243e519524SHoward Hinnant} 8253e519524SHoward Hinnant 8263e519524SHoward Hinnant// for_each 8273e519524SHoward Hinnant 8283e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 8293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8303e519524SHoward Hinnant_Function 8313e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 8323e519524SHoward Hinnant{ 8333e519524SHoward Hinnant for (; __first != __last; ++__first) 8343e519524SHoward Hinnant __f(*__first); 835179b1f8cSHoward Hinnant return _VSTD::move(__f); // explicitly moved for (emulated) C++03 8363e519524SHoward Hinnant} 8373e519524SHoward Hinnant 8383e519524SHoward Hinnant// find 8393e519524SHoward Hinnant 8403e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 8413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8423e519524SHoward Hinnant_InputIterator 843e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 8443e519524SHoward Hinnant{ 8453e519524SHoward Hinnant for (; __first != __last; ++__first) 846e4383379SHoward Hinnant if (*__first == __value_) 8473e519524SHoward Hinnant break; 8483e519524SHoward Hinnant return __first; 8493e519524SHoward Hinnant} 8503e519524SHoward Hinnant 8513e519524SHoward Hinnant// find_if 8523e519524SHoward Hinnant 8533e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8553e519524SHoward Hinnant_InputIterator 8563e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8573e519524SHoward Hinnant{ 8583e519524SHoward Hinnant for (; __first != __last; ++__first) 8593e519524SHoward Hinnant if (__pred(*__first)) 8603e519524SHoward Hinnant break; 8613e519524SHoward Hinnant return __first; 8623e519524SHoward Hinnant} 8633e519524SHoward Hinnant 8643e519524SHoward Hinnant// find_if_not 8653e519524SHoward Hinnant 8663e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 8673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8683e519524SHoward Hinnant_InputIterator 8693e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8703e519524SHoward Hinnant{ 8713e519524SHoward Hinnant for (; __first != __last; ++__first) 8723e519524SHoward Hinnant if (!__pred(*__first)) 8733e519524SHoward Hinnant break; 8743e519524SHoward Hinnant return __first; 8753e519524SHoward Hinnant} 8763e519524SHoward Hinnant 8773e519524SHoward Hinnant// find_end 8783e519524SHoward Hinnant 8793e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 8803e519524SHoward Hinnant_ForwardIterator1 8813e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 8823e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 8833e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 8843e519524SHoward Hinnant{ 8853e519524SHoward Hinnant // modeled after search algorithm 8863e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 8873e519524SHoward Hinnant if (__first2 == __last2) 8883e519524SHoward Hinnant return __r; 8893e519524SHoward Hinnant while (true) 8903e519524SHoward Hinnant { 8913e519524SHoward Hinnant while (true) 8923e519524SHoward Hinnant { 8933e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 8943e519524SHoward Hinnant return __r; // (or __last1 if never found) 8953e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 8963e519524SHoward Hinnant break; 8973e519524SHoward Hinnant ++__first1; 8983e519524SHoward Hinnant } 8993e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 9003e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 9013e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 9023e519524SHoward Hinnant while (true) 9033e519524SHoward Hinnant { 9043e519524SHoward Hinnant if (++__m2 == __last2) 9053e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 9063e519524SHoward Hinnant __r = __first1; 9073e519524SHoward Hinnant ++__first1; 9083e519524SHoward Hinnant break; 9093e519524SHoward Hinnant } 9103e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 9113e519524SHoward Hinnant return __r; 9123e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 9133e519524SHoward Hinnant { 9143e519524SHoward Hinnant ++__first1; 9153e519524SHoward Hinnant break; 9163e519524SHoward Hinnant } // else there is a match, check next elements 9173e519524SHoward Hinnant } 9183e519524SHoward Hinnant } 9193e519524SHoward Hinnant} 9203e519524SHoward Hinnant 9213e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 9223e519524SHoward Hinnant_BidirectionalIterator1 9233e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 9243e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 9253e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 9263e519524SHoward Hinnant{ 9273e519524SHoward Hinnant // modeled after search algorithm (in reverse) 9283e519524SHoward Hinnant if (__first2 == __last2) 9293e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 9303e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 9313e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 9323e519524SHoward Hinnant --__l2; 9333e519524SHoward Hinnant while (true) 9343e519524SHoward Hinnant { 9353e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 9363e519524SHoward Hinnant while (true) 9373e519524SHoward Hinnant { 9383e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 9393e519524SHoward Hinnant return __last1; 9403e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9413e519524SHoward Hinnant break; 9423e519524SHoward Hinnant } 9433e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 9443e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 9453e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 9463e519524SHoward Hinnant while (true) 9473e519524SHoward Hinnant { 9483e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 9493e519524SHoward Hinnant return __m1; 9503e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 9513e519524SHoward Hinnant return __last1; 9523e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 9533e519524SHoward Hinnant { 9543e519524SHoward Hinnant break; 9553e519524SHoward Hinnant } // else there is a match, check next elements 9563e519524SHoward Hinnant } 9573e519524SHoward Hinnant } 9583e519524SHoward Hinnant} 9593e519524SHoward Hinnant 9603e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 9613e519524SHoward Hinnant_RandomAccessIterator1 9623e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 9633e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 9643e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 9653e519524SHoward Hinnant{ 9663e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 9673e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 9683e519524SHoward Hinnant if (__len2 == 0) 9693e519524SHoward Hinnant return __last1; 9703e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 9713e519524SHoward Hinnant if (__len1 < __len2) 9723e519524SHoward Hinnant return __last1; 9733e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 9743e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 9753e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 9763e519524SHoward Hinnant --__l2; 9773e519524SHoward Hinnant while (true) 9783e519524SHoward Hinnant { 9793e519524SHoward Hinnant while (true) 9803e519524SHoward Hinnant { 9813e519524SHoward Hinnant if (__s == __l1) 9823e519524SHoward Hinnant return __last1; 9833e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9843e519524SHoward Hinnant break; 9853e519524SHoward Hinnant } 9863e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 9873e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 9883e519524SHoward Hinnant while (true) 9893e519524SHoward Hinnant { 9903e519524SHoward Hinnant if (__m2 == __first2) 9913e519524SHoward Hinnant return __m1; 9923e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 9933e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 9943e519524SHoward Hinnant { 9953e519524SHoward Hinnant break; 9963e519524SHoward Hinnant } 9973e519524SHoward Hinnant } 9983e519524SHoward Hinnant } 9993e519524SHoward Hinnant} 10003e519524SHoward Hinnant 10013e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10033e519524SHoward Hinnant_ForwardIterator1 10043e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10053e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10063e519524SHoward Hinnant{ 1007ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 10083e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 10093e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 10103e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 10113e519524SHoward Hinnant} 10123e519524SHoward Hinnant 10133e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10153e519524SHoward Hinnant_ForwardIterator1 10163e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10173e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10183e519524SHoward Hinnant{ 10193e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10203e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1021ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10223e519524SHoward Hinnant} 10233e519524SHoward Hinnant 10243e519524SHoward Hinnant// find_first_of 10253e519524SHoward Hinnant 10263e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10273e519524SHoward Hinnant_ForwardIterator1 10283e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10293e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10303e519524SHoward Hinnant{ 10313e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 10323e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 10333e519524SHoward Hinnant if (__pred(*__first1, *__j)) 10343e519524SHoward Hinnant return __first1; 10353e519524SHoward Hinnant return __last1; 10363e519524SHoward Hinnant} 10373e519524SHoward Hinnant 10383e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10403e519524SHoward Hinnant_ForwardIterator1 10413e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10423e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10433e519524SHoward Hinnant{ 10443e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10453e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1046ce48a113SHoward Hinnant return _VSTD::find_first_of(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10473e519524SHoward Hinnant} 10483e519524SHoward Hinnant 10493e519524SHoward Hinnant// adjacent_find 10503e519524SHoward Hinnant 10513e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 10523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10533e519524SHoward Hinnant_ForwardIterator 10543e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 10553e519524SHoward Hinnant{ 10563e519524SHoward Hinnant if (__first != __last) 10573e519524SHoward Hinnant { 10583e519524SHoward Hinnant _ForwardIterator __i = __first; 10593e519524SHoward Hinnant while (++__i != __last) 10603e519524SHoward Hinnant { 10613e519524SHoward Hinnant if (__pred(*__first, *__i)) 10623e519524SHoward Hinnant return __first; 10633e519524SHoward Hinnant __first = __i; 10643e519524SHoward Hinnant } 10653e519524SHoward Hinnant } 10663e519524SHoward Hinnant return __last; 10673e519524SHoward Hinnant} 10683e519524SHoward Hinnant 10693e519524SHoward Hinnanttemplate <class _ForwardIterator> 10703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10713e519524SHoward Hinnant_ForwardIterator 10723e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 10733e519524SHoward Hinnant{ 10743e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1075ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 10763e519524SHoward Hinnant} 10773e519524SHoward Hinnant 10783e519524SHoward Hinnant// count 10793e519524SHoward Hinnant 10803e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 10813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10823e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1083e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 10843e519524SHoward Hinnant{ 10853e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 10863e519524SHoward Hinnant for (; __first != __last; ++__first) 1087e4383379SHoward Hinnant if (*__first == __value_) 10883e519524SHoward Hinnant ++__r; 10893e519524SHoward Hinnant return __r; 10903e519524SHoward Hinnant} 10913e519524SHoward Hinnant 10923e519524SHoward Hinnant// count_if 10933e519524SHoward Hinnant 10943e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 10953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10963e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 10973e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 10983e519524SHoward Hinnant{ 10993e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11003e519524SHoward Hinnant for (; __first != __last; ++__first) 11013e519524SHoward Hinnant if (__pred(*__first)) 11023e519524SHoward Hinnant ++__r; 11033e519524SHoward Hinnant return __r; 11043e519524SHoward Hinnant} 11053e519524SHoward Hinnant 11063e519524SHoward Hinnant// mismatch 11073e519524SHoward Hinnant 11083e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11103e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11113e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11123e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 11133e519524SHoward Hinnant{ 11143e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 11153e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11163e519524SHoward Hinnant break; 11173e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11183e519524SHoward Hinnant} 11193e519524SHoward Hinnant 11203e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11223e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11233e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11243e519524SHoward Hinnant{ 11253e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11263e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1127ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11283e519524SHoward Hinnant} 11293e519524SHoward Hinnant 11300b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 11310b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11320b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11330b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11340b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11350b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 11360b0bbd2fSMarshall Clow _BinaryPredicate __pred) 11370b0bbd2fSMarshall Clow{ 11380b0bbd2fSMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2) 11390b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 11400b0bbd2fSMarshall Clow break; 11410b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11420b0bbd2fSMarshall Clow} 11430b0bbd2fSMarshall Clow 11440b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 11450b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11460b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11470b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11480b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 11490b0bbd2fSMarshall Clow{ 11500b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11510b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 11520b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11530b0bbd2fSMarshall Clow} 11540b0bbd2fSMarshall Clow#endif 11550b0bbd2fSMarshall Clow 11563e519524SHoward Hinnant// equal 11573e519524SHoward Hinnant 11583e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11603e519524SHoward Hinnantbool 11613e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 11623e519524SHoward Hinnant{ 11633e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 11643e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11653e519524SHoward Hinnant return false; 11663e519524SHoward Hinnant return true; 11673e519524SHoward Hinnant} 11683e519524SHoward Hinnant 11693e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11713e519524SHoward Hinnantbool 11723e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11733e519524SHoward Hinnant{ 11743e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11753e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1176ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11773e519524SHoward Hinnant} 11783e519524SHoward Hinnant 11790b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 11800b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 11810b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11820b0bbd2fSMarshall Clowbool 11830b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 11840b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 11850b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 11860b0bbd2fSMarshall Clow{ 11870b0bbd2fSMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2) 11880b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 11890b0bbd2fSMarshall Clow return false; 11900b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 11910b0bbd2fSMarshall Clow} 11920b0bbd2fSMarshall Clow 11930b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 11940b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11950b0bbd2fSMarshall Clowbool 11960b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 11970b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 11980b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 11990b0bbd2fSMarshall Clow{ 12000b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 12010b0bbd2fSMarshall Clow return false; 12020b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 12030b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 12040b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 12050b0bbd2fSMarshall Clow} 12060b0bbd2fSMarshall Clow 12070b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12080b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12090b0bbd2fSMarshall Clowbool 12100b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12110b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 12120b0bbd2fSMarshall Clow{ 12130b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 12140b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 12150b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12160b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12170b0bbd2fSMarshall Clow} 12180b0bbd2fSMarshall Clow 12190b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 12200b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12210b0bbd2fSMarshall Clowbool 12220b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12230b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12240b0bbd2fSMarshall Clow{ 12250b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12260b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12270b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 12280b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12290b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12300b0bbd2fSMarshall Clow} 12310b0bbd2fSMarshall Clow#endif 12320b0bbd2fSMarshall Clow 12333e519524SHoward Hinnant// is_permutation 12343e519524SHoward Hinnant 12353e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 12363e519524SHoward Hinnantbool 12373e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12383e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 12393e519524SHoward Hinnant{ 12403e519524SHoward Hinnant // shorten sequences as much as possible by lopping of any equal parts 12413e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 12423e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12433e519524SHoward Hinnant goto __not_done; 12443e519524SHoward Hinnant return true; 12453e519524SHoward Hinnant__not_done: 12463e519524SHoward Hinnant // __first1 != __last1 && *__first1 != *__first2 12473e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1248ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 12493e519524SHoward Hinnant if (__l1 == _D1(1)) 12503e519524SHoward Hinnant return false; 1251ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 12523e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 12533e519524SHoward Hinnant // equal elements in [f2, l2) 12543e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 12553e519524SHoward Hinnant { 12563e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 12573e519524SHoward Hinnant for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 12583e519524SHoward Hinnant if (__pred(*__j, *__i)) 12593e519524SHoward Hinnant goto __next_iter; 12603e519524SHoward Hinnant { 12613e519524SHoward Hinnant // Count number of *__i in [f2, l2) 12623e519524SHoward Hinnant _D1 __c2 = 0; 12633e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 12643e519524SHoward Hinnant if (__pred(*__i, *__j)) 12653e519524SHoward Hinnant ++__c2; 12663e519524SHoward Hinnant if (__c2 == 0) 12673e519524SHoward Hinnant return false; 12683e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 12693e519524SHoward Hinnant _D1 __c1 = 1; 1270ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 12713e519524SHoward Hinnant if (__pred(*__i, *__j)) 12723e519524SHoward Hinnant ++__c1; 12733e519524SHoward Hinnant if (__c1 != __c2) 12743e519524SHoward Hinnant return false; 12753e519524SHoward Hinnant } 12763e519524SHoward Hinnant__next_iter:; 12773e519524SHoward Hinnant } 12783e519524SHoward Hinnant return true; 12793e519524SHoward Hinnant} 12803e519524SHoward Hinnant 12813e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 12823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12833e519524SHoward Hinnantbool 12843e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12853e519524SHoward Hinnant _ForwardIterator2 __first2) 12863e519524SHoward Hinnant{ 12873e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 12883e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1289ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12903e519524SHoward Hinnant} 12913e519524SHoward Hinnant 12920b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12930b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 12940b0bbd2fSMarshall Clowbool 12950b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12960b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 12970b0bbd2fSMarshall Clow _BinaryPredicate __pred, 12980b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 12990b0bbd2fSMarshall Clow{ 13000b0bbd2fSMarshall Clow // shorten sequences as much as possible by lopping of any equal parts 13010b0bbd2fSMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2) 13020b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 13030b0bbd2fSMarshall Clow goto __not_done; 13040b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 13050b0bbd2fSMarshall Clow__not_done: 13060b0bbd2fSMarshall Clow // __first1 != __last1 && __first2 != __last2 && *__first1 != *__first2 13070b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 13080b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 13090b0bbd2fSMarshall Clow 13100b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1311fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 13120b0bbd2fSMarshall Clow if (__l1 != __l2) 13130b0bbd2fSMarshall Clow return false; 13140b0bbd2fSMarshall Clow 13150b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 13160b0bbd2fSMarshall Clow // equal elements in [f2, l2) 13170b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13180b0bbd2fSMarshall Clow { 13190b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 13200b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 13210b0bbd2fSMarshall Clow if (__pred(*__j, *__i)) 13220b0bbd2fSMarshall Clow goto __next_iter; 13230b0bbd2fSMarshall Clow { 13240b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 13250b0bbd2fSMarshall Clow _D1 __c2 = 0; 13260b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13270b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13280b0bbd2fSMarshall Clow ++__c2; 13290b0bbd2fSMarshall Clow if (__c2 == 0) 13300b0bbd2fSMarshall Clow return false; 13310b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 13320b0bbd2fSMarshall Clow _D1 __c1 = 1; 13330b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13340b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13350b0bbd2fSMarshall Clow ++__c1; 13360b0bbd2fSMarshall Clow if (__c1 != __c2) 13370b0bbd2fSMarshall Clow return false; 13380b0bbd2fSMarshall Clow } 13390b0bbd2fSMarshall Clow__next_iter:; 13400b0bbd2fSMarshall Clow } 13410b0bbd2fSMarshall Clow return true; 13420b0bbd2fSMarshall Clow} 13430b0bbd2fSMarshall Clow 13440b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 13450b0bbd2fSMarshall Clowbool 13460b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 13470b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 13480b0bbd2fSMarshall Clow _BinaryPredicate __pred, 13490b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 13500b0bbd2fSMarshall Clow{ 13510b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 13520b0bbd2fSMarshall Clow return false; 13530b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 13540b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 13550b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 13560b0bbd2fSMarshall Clow} 13570b0bbd2fSMarshall Clow 13580b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 13590b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13600b0bbd2fSMarshall Clowbool 13610b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13620b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 13630b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 13640b0bbd2fSMarshall Clow{ 13650b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 13660b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 13670b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 13680b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 13690b0bbd2fSMarshall Clow} 13700b0bbd2fSMarshall Clow 13710b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 13720b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13730b0bbd2fSMarshall Clowbool 13740b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13750b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 13760b0bbd2fSMarshall Clow{ 13770b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 13780b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 13790b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 13800b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 13810b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 13820b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 13830b0bbd2fSMarshall Clow} 13840b0bbd2fSMarshall Clow#endif 13850b0bbd2fSMarshall Clow 13863e519524SHoward Hinnant// search 13873e519524SHoward Hinnant 13883e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 13893e519524SHoward Hinnant_ForwardIterator1 13903e519524SHoward Hinnant__search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13913e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 13923e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 13933e519524SHoward Hinnant{ 13943e519524SHoward Hinnant if (__first2 == __last2) 13953e519524SHoward Hinnant return __first1; // Everything matches an empty sequence 13963e519524SHoward Hinnant while (true) 13973e519524SHoward Hinnant { 13983e519524SHoward Hinnant // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks 13993e519524SHoward Hinnant while (true) 14003e519524SHoward Hinnant { 14013e519524SHoward Hinnant if (__first1 == __last1) // return __last1 if no element matches *__first2 14023e519524SHoward Hinnant return __last1; 14033e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14043e519524SHoward Hinnant break; 14053e519524SHoward Hinnant ++__first1; 14063e519524SHoward Hinnant } 14073e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 14083e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 14093e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 14103e519524SHoward Hinnant while (true) 14113e519524SHoward Hinnant { 14123e519524SHoward Hinnant if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern) 14133e519524SHoward Hinnant return __first1; 14143e519524SHoward Hinnant if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found 14153e519524SHoward Hinnant return __last1; 14163e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1 14173e519524SHoward Hinnant { 14183e519524SHoward Hinnant ++__first1; 14193e519524SHoward Hinnant break; 14203e519524SHoward Hinnant } // else there is a match, check next elements 14213e519524SHoward Hinnant } 14223e519524SHoward Hinnant } 14233e519524SHoward Hinnant} 14243e519524SHoward Hinnant 14253e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 14263e519524SHoward Hinnant_RandomAccessIterator1 14273e519524SHoward Hinnant__search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 14283e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 14293e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 14303e519524SHoward Hinnant{ 14313e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type _D1; 14323e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator2>::difference_type _D2; 14333e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 14343e519524SHoward Hinnant _D2 __len2 = __last2 - __first2; 14353e519524SHoward Hinnant if (__len2 == 0) 14363e519524SHoward Hinnant return __first1; 14373e519524SHoward Hinnant _D1 __len1 = __last1 - __first1; 14383e519524SHoward Hinnant if (__len1 < __len2) 14393e519524SHoward Hinnant return __last1; 14403e519524SHoward Hinnant const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here 14413e519524SHoward Hinnant while (true) 14423e519524SHoward Hinnant { 14433e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 14443e519524SHoward Hinnant while (true) 14453e519524SHoward Hinnant { 14463e519524SHoward Hinnant if (__first1 == __s) 14473e519524SHoward Hinnant return __last1; 14483e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14493e519524SHoward Hinnant break; 14503e519524SHoward Hinnant ++__first1; 14513e519524SHoward Hinnant } 1452b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 14533e519524SHoward Hinnant for (_D1 __loop_unroll = (__s - __first1) / 4; __loop_unroll > 0; --__loop_unroll) 14543e519524SHoward Hinnant { 14553e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14563e519524SHoward Hinnant goto __phase2; 14573e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14583e519524SHoward Hinnant goto __phase2; 14593e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14603e519524SHoward Hinnant goto __phase2; 14613e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14623e519524SHoward Hinnant goto __phase2; 14633e519524SHoward Hinnant ++__first1; 14643e519524SHoward Hinnant } 14653e519524SHoward Hinnant switch (__s - __first1) 14663e519524SHoward Hinnant { 14673e519524SHoward Hinnant case 3: 14683e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14693e519524SHoward Hinnant break; 14703e519524SHoward Hinnant ++__first1; 14713e519524SHoward Hinnant case 2: 14723e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14733e519524SHoward Hinnant break; 14743e519524SHoward Hinnant ++__first1; 14753e519524SHoward Hinnant case 1: 14763e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14773e519524SHoward Hinnant break; 14783e519524SHoward Hinnant case 0: 14793e519524SHoward Hinnant return __last1; 14803e519524SHoward Hinnant } 14813e519524SHoward Hinnant __phase2: 1482b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 14833e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __first1; 14843e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __first2; 14853e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 14863e519524SHoward Hinnant while (true) 14873e519524SHoward Hinnant { 14883e519524SHoward Hinnant if (++__m2 == __last2) 14893e519524SHoward Hinnant return __first1; 14903e519524SHoward Hinnant ++__m1; // no need to check range on __m1 because __s guarantees we have enough source 14913e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 14923e519524SHoward Hinnant { 14933e519524SHoward Hinnant ++__first1; 14943e519524SHoward Hinnant break; 14953e519524SHoward Hinnant } 14963e519524SHoward Hinnant } 1497b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 14983e519524SHoward Hinnant ++__m2; 14993e519524SHoward Hinnant ++__m1; 15003e519524SHoward Hinnant for (_D2 __loop_unroll = (__last2 - __m2) / 4; __loop_unroll > 0; --__loop_unroll) 15013e519524SHoward Hinnant { 15023e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15033e519524SHoward Hinnant goto __continue; 15043e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15053e519524SHoward Hinnant goto __continue; 15063e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15073e519524SHoward Hinnant goto __continue; 15083e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15093e519524SHoward Hinnant goto __continue; 15103e519524SHoward Hinnant ++__m1; 15113e519524SHoward Hinnant ++__m2; 15123e519524SHoward Hinnant } 15133e519524SHoward Hinnant switch (__last2 - __m2) 15143e519524SHoward Hinnant { 15153e519524SHoward Hinnant case 3: 15163e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15173e519524SHoward Hinnant break; 15183e519524SHoward Hinnant ++__m1; 15193e519524SHoward Hinnant ++__m2; 15203e519524SHoward Hinnant case 2: 15213e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15223e519524SHoward Hinnant break; 15233e519524SHoward Hinnant ++__m1; 15243e519524SHoward Hinnant ++__m2; 15253e519524SHoward Hinnant case 1: 15263e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15273e519524SHoward Hinnant break; 15283e519524SHoward Hinnant case 0: 15293e519524SHoward Hinnant return __first1; 15303e519524SHoward Hinnant } 15313e519524SHoward Hinnant __continue: 15323e519524SHoward Hinnant ++__first1; 1533b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 15343e519524SHoward Hinnant } 15353e519524SHoward Hinnant} 15363e519524SHoward Hinnant 15373e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 15383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15393e519524SHoward Hinnant_ForwardIterator1 15403e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15413e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 15423e519524SHoward Hinnant{ 1543ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 15443e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 15453e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator1>::iterator_category(), 15463e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator2>::iterator_category()); 15473e519524SHoward Hinnant} 15483e519524SHoward Hinnant 15493e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 15503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15513e519524SHoward Hinnant_ForwardIterator1 15523e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15533e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15543e519524SHoward Hinnant{ 15553e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator1>::value_type __v1; 15563e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator2>::value_type __v2; 1557ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 15583e519524SHoward Hinnant} 15593e519524SHoward Hinnant 15603e519524SHoward Hinnant// search_n 15613e519524SHoward Hinnant 15623e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 15633e519524SHoward Hinnant_ForwardIterator 15643e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1565e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 15663e519524SHoward Hinnant{ 15673e519524SHoward Hinnant if (__count <= 0) 15683e519524SHoward Hinnant return __first; 15693e519524SHoward Hinnant while (true) 15703e519524SHoward Hinnant { 1571e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 15723e519524SHoward Hinnant while (true) 15733e519524SHoward Hinnant { 1574e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 15753e519524SHoward Hinnant return __last; 1576e4383379SHoward Hinnant if (__pred(*__first, __value_)) 15773e519524SHoward Hinnant break; 15783e519524SHoward Hinnant ++__first; 15793e519524SHoward Hinnant } 1580e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 15813e519524SHoward Hinnant _ForwardIterator __m = __first; 15823e519524SHoward Hinnant _Size __c(0); 15833e519524SHoward Hinnant while (true) 15843e519524SHoward Hinnant { 15853e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 15863e519524SHoward Hinnant return __first; 15873e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 15883e519524SHoward Hinnant return __last; 1589e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 15903e519524SHoward Hinnant { 15913e519524SHoward Hinnant __first = __m; 15923e519524SHoward Hinnant ++__first; 15933e519524SHoward Hinnant break; 15943e519524SHoward Hinnant } // else there is a match, check next elements 15953e519524SHoward Hinnant } 15963e519524SHoward Hinnant } 15973e519524SHoward Hinnant} 15983e519524SHoward Hinnant 15993e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 16003e519524SHoward Hinnant_RandomAccessIterator 16013e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1602e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 16033e519524SHoward Hinnant{ 16043e519524SHoward Hinnant if (__count <= 0) 16053e519524SHoward Hinnant return __first; 16063e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 16073e519524SHoward Hinnant if (__len < __count) 16083e519524SHoward Hinnant return __last; 16093e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 16103e519524SHoward Hinnant while (true) 16113e519524SHoward Hinnant { 1612e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16133e519524SHoward Hinnant while (true) 16143e519524SHoward Hinnant { 1615b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 16163e519524SHoward Hinnant return __last; 1617e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16183e519524SHoward Hinnant break; 16193e519524SHoward Hinnant ++__first; 16203e519524SHoward Hinnant } 1621e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16223e519524SHoward Hinnant _RandomAccessIterator __m = __first; 16233e519524SHoward Hinnant _Size __c(0); 16243e519524SHoward Hinnant while (true) 16253e519524SHoward Hinnant { 16263e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16273e519524SHoward Hinnant return __first; 16283e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1629e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16303e519524SHoward Hinnant { 16313e519524SHoward Hinnant __first = __m; 16323e519524SHoward Hinnant ++__first; 16333e519524SHoward Hinnant break; 16343e519524SHoward Hinnant } // else there is a match, check next elements 16353e519524SHoward Hinnant } 16363e519524SHoward Hinnant } 16373e519524SHoward Hinnant} 16383e519524SHoward Hinnant 16393e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 16403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16413e519524SHoward Hinnant_ForwardIterator 16423e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1643e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 16443e519524SHoward Hinnant{ 1645ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 1646e4383379SHoward Hinnant (__first, __last, __count, __value_, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 16473e519524SHoward Hinnant} 16483e519524SHoward Hinnant 16493e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 16503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16513e519524SHoward Hinnant_ForwardIterator 1652e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 16533e519524SHoward Hinnant{ 16543e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1655e4383379SHoward Hinnant return _VSTD::search_n(__first, __last, __count, __value_, __equal_to<__v, _Tp>()); 16563e519524SHoward Hinnant} 16573e519524SHoward Hinnant 16583e519524SHoward Hinnant// copy 16593e519524SHoward Hinnant 16603e519524SHoward Hinnanttemplate <class _Iter> 16613e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator 16623e519524SHoward Hinnant{ 16633e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16643e519524SHoward Hinnant}; 16653e519524SHoward Hinnant 16663e519524SHoward Hinnanttemplate <class _Iter> 16673e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<move_iterator<_Iter> > 16683e519524SHoward Hinnant{ 16693e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16703e519524SHoward Hinnant}; 16713e519524SHoward Hinnant 16723e519524SHoward Hinnanttemplate <class _Iter> 16733e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<__wrap_iter<_Iter> > 16743e519524SHoward Hinnant{ 16753e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16763e519524SHoward Hinnant}; 16773e519524SHoward Hinnant 16783e519524SHoward Hinnanttemplate <class _Iter> 16793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16803e519524SHoward Hinnant_Iter 16813e519524SHoward Hinnant__unwrap_iter(_Iter __i) 16823e519524SHoward Hinnant{ 16833e519524SHoward Hinnant return __i; 16843e519524SHoward Hinnant} 16853e519524SHoward Hinnant 16863e519524SHoward Hinnanttemplate <class _Tp> 16873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16883e519524SHoward Hinnanttypename enable_if 16893e519524SHoward Hinnant< 1690ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 16913e519524SHoward Hinnant _Tp* 16923e519524SHoward Hinnant>::type 16933e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 16943e519524SHoward Hinnant{ 16953e519524SHoward Hinnant return __i.base(); 16963e519524SHoward Hinnant} 16973e519524SHoward Hinnant 1698fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1699fc88dbd2SHoward Hinnant 17003e519524SHoward Hinnanttemplate <class _Tp> 17013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17023e519524SHoward Hinnanttypename enable_if 17033e519524SHoward Hinnant< 1704ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17053e519524SHoward Hinnant _Tp* 17063e519524SHoward Hinnant>::type 17073e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 17083e519524SHoward Hinnant{ 17093e519524SHoward Hinnant return __i.base(); 17103e519524SHoward Hinnant} 17113e519524SHoward Hinnant 1712fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1713fc88dbd2SHoward Hinnant 17143e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17163e519524SHoward Hinnant_OutputIterator 17173e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17183e519524SHoward Hinnant{ 17193e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 17203e519524SHoward Hinnant *__result = *__first; 17213e519524SHoward Hinnant return __result; 17223e519524SHoward Hinnant} 17233e519524SHoward Hinnant 17243e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17263e519524SHoward Hinnanttypename enable_if 17273e519524SHoward Hinnant< 17283e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1729ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17303e519524SHoward Hinnant _Up* 17313e519524SHoward Hinnant>::type 17323e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 17333e519524SHoward Hinnant{ 17343e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 1735ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17363e519524SHoward Hinnant return __result + __n; 17373e519524SHoward Hinnant} 17383e519524SHoward Hinnant 17393e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17413e519524SHoward Hinnant_OutputIterator 17423e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17433e519524SHoward Hinnant{ 1744ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17453e519524SHoward Hinnant} 17463e519524SHoward Hinnant 17473e519524SHoward Hinnant// copy_backward 17483e519524SHoward Hinnant 1749d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 17503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17513e519524SHoward Hinnant_OutputIterator 1752d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 17533e519524SHoward Hinnant{ 17543e519524SHoward Hinnant while (__first != __last) 17553e519524SHoward Hinnant *--__result = *--__last; 17563e519524SHoward Hinnant return __result; 17573e519524SHoward Hinnant} 17583e519524SHoward Hinnant 17593e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17613e519524SHoward Hinnanttypename enable_if 17623e519524SHoward Hinnant< 17633e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1764ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17653e519524SHoward Hinnant _Up* 17663e519524SHoward Hinnant>::type 17673e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 17683e519524SHoward Hinnant{ 17693e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17703e519524SHoward Hinnant __result -= __n; 1771ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17723e519524SHoward Hinnant return __result; 17733e519524SHoward Hinnant} 17743e519524SHoward Hinnant 17753e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 17763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17773e519524SHoward Hinnant_BidirectionalIterator2 17783e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 17793e519524SHoward Hinnant _BidirectionalIterator2 __result) 17803e519524SHoward Hinnant{ 1781ce48a113SHoward Hinnant return _VSTD::__copy_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17823e519524SHoward Hinnant} 17833e519524SHoward Hinnant 17843e519524SHoward Hinnant// copy_if 17853e519524SHoward Hinnant 17863e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 17873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17883e519524SHoward Hinnant_OutputIterator 17893e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 17903e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 17913e519524SHoward Hinnant{ 17923e519524SHoward Hinnant for (; __first != __last; ++__first) 17933e519524SHoward Hinnant { 17943e519524SHoward Hinnant if (__pred(*__first)) 17953e519524SHoward Hinnant { 17963e519524SHoward Hinnant *__result = *__first; 17973e519524SHoward Hinnant ++__result; 17983e519524SHoward Hinnant } 17993e519524SHoward Hinnant } 18003e519524SHoward Hinnant return __result; 18013e519524SHoward Hinnant} 18023e519524SHoward Hinnant 18033e519524SHoward Hinnant// copy_n 18043e519524SHoward Hinnant 18053e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18073e519524SHoward Hinnanttypename enable_if 18083e519524SHoward Hinnant< 18093e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 18103e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 18113e519524SHoward Hinnant _OutputIterator 18123e519524SHoward Hinnant>::type 18133e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 18143e519524SHoward Hinnant{ 181599847d2bSHoward Hinnant if (__n > 0) 181699847d2bSHoward Hinnant { 18173e519524SHoward Hinnant *__result = *__first; 181899847d2bSHoward Hinnant ++__result; 181999847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 182099847d2bSHoward Hinnant { 182199847d2bSHoward Hinnant ++__first; 182299847d2bSHoward Hinnant *__result = *__first; 182399847d2bSHoward Hinnant ++__result; 182499847d2bSHoward Hinnant } 182599847d2bSHoward Hinnant } 18263e519524SHoward Hinnant return __result; 18273e519524SHoward Hinnant} 18283e519524SHoward Hinnant 18293e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18313e519524SHoward Hinnanttypename enable_if 18323e519524SHoward Hinnant< 18333e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 18343e519524SHoward Hinnant _OutputIterator 18353e519524SHoward Hinnant>::type 18363e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 18373e519524SHoward Hinnant{ 1838ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 18393e519524SHoward Hinnant} 18403e519524SHoward Hinnant 18413e519524SHoward Hinnant// move 18423e519524SHoward Hinnant 18433e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18453e519524SHoward Hinnant_OutputIterator 18463e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18473e519524SHoward Hinnant{ 18483e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 1849ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 18503e519524SHoward Hinnant return __result; 18513e519524SHoward Hinnant} 18523e519524SHoward Hinnant 18533e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18553e519524SHoward Hinnanttypename enable_if 18563e519524SHoward Hinnant< 18573e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1858ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18593e519524SHoward Hinnant _Up* 18603e519524SHoward Hinnant>::type 18613e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 18623e519524SHoward Hinnant{ 18633e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 1864ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18653e519524SHoward Hinnant return __result + __n; 18663e519524SHoward Hinnant} 18673e519524SHoward Hinnant 18683e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18703e519524SHoward Hinnant_OutputIterator 18713e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18723e519524SHoward Hinnant{ 1873ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18743e519524SHoward Hinnant} 18753e519524SHoward Hinnant 18763e519524SHoward Hinnant// move_backward 18773e519524SHoward Hinnant 18783e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18803e519524SHoward Hinnant_OutputIterator 18813e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18823e519524SHoward Hinnant{ 18833e519524SHoward Hinnant while (__first != __last) 1884ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 18853e519524SHoward Hinnant return __result; 18863e519524SHoward Hinnant} 18873e519524SHoward Hinnant 18883e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18903e519524SHoward Hinnanttypename enable_if 18913e519524SHoward Hinnant< 18923e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1893ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18943e519524SHoward Hinnant _Up* 18953e519524SHoward Hinnant>::type 18963e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 18973e519524SHoward Hinnant{ 18983e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18993e519524SHoward Hinnant __result -= __n; 1900ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19013e519524SHoward Hinnant return __result; 19023e519524SHoward Hinnant} 19033e519524SHoward Hinnant 19043e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 19053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19063e519524SHoward Hinnant_BidirectionalIterator2 19073e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 19083e519524SHoward Hinnant _BidirectionalIterator2 __result) 19093e519524SHoward Hinnant{ 1910ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19113e519524SHoward Hinnant} 19123e519524SHoward Hinnant 19133e519524SHoward Hinnant// iter_swap 19143e519524SHoward Hinnant 1915a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 19163e519524SHoward Hinnant 19173e519524SHoward Hinnant// transform 19183e519524SHoward Hinnant 19193e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 19203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19213e519524SHoward Hinnant_OutputIterator 19223e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 19233e519524SHoward Hinnant{ 19243e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 19253e519524SHoward Hinnant *__result = __op(*__first); 19263e519524SHoward Hinnant return __result; 19273e519524SHoward Hinnant} 19283e519524SHoward Hinnant 19293e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 19303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19313e519524SHoward Hinnant_OutputIterator 19323e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 19333e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 19343e519524SHoward Hinnant{ 19353e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2, ++__result) 19363e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 19373e519524SHoward Hinnant return __result; 19383e519524SHoward Hinnant} 19393e519524SHoward Hinnant 19403e519524SHoward Hinnant// replace 19413e519524SHoward Hinnant 19423e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19443e519524SHoward Hinnantvoid 19453e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 19463e519524SHoward Hinnant{ 19473e519524SHoward Hinnant for (; __first != __last; ++__first) 19483e519524SHoward Hinnant if (*__first == __old_value) 19493e519524SHoward Hinnant *__first = __new_value; 19503e519524SHoward Hinnant} 19513e519524SHoward Hinnant 19523e519524SHoward Hinnant// replace_if 19533e519524SHoward Hinnant 19543e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 19553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19563e519524SHoward Hinnantvoid 19573e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 19583e519524SHoward Hinnant{ 19593e519524SHoward Hinnant for (; __first != __last; ++__first) 19603e519524SHoward Hinnant if (__pred(*__first)) 19613e519524SHoward Hinnant *__first = __new_value; 19623e519524SHoward Hinnant} 19633e519524SHoward Hinnant 19643e519524SHoward Hinnant// replace_copy 19653e519524SHoward Hinnant 19663e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 19673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19683e519524SHoward Hinnant_OutputIterator 19693e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19703e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 19713e519524SHoward Hinnant{ 19723e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 19733e519524SHoward Hinnant if (*__first == __old_value) 19743e519524SHoward Hinnant *__result = __new_value; 19753e519524SHoward Hinnant else 19763e519524SHoward Hinnant *__result = *__first; 19773e519524SHoward Hinnant return __result; 19783e519524SHoward Hinnant} 19793e519524SHoward Hinnant 19803e519524SHoward Hinnant// replace_copy_if 19813e519524SHoward Hinnant 19823e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 19833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19843e519524SHoward Hinnant_OutputIterator 19853e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19863e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 19873e519524SHoward Hinnant{ 19883e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 19893e519524SHoward Hinnant if (__pred(*__first)) 19903e519524SHoward Hinnant *__result = __new_value; 19913e519524SHoward Hinnant else 19923e519524SHoward Hinnant *__result = *__first; 19933e519524SHoward Hinnant return __result; 19943e519524SHoward Hinnant} 19953e519524SHoward Hinnant 19963e519524SHoward Hinnant// fill_n 19973e519524SHoward Hinnant 19983e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 19993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20003e519524SHoward Hinnant_OutputIterator 20010f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20023e519524SHoward Hinnant{ 20033e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 2004e4383379SHoward Hinnant *__first = __value_; 20053e519524SHoward Hinnant return __first; 20063e519524SHoward Hinnant} 20073e519524SHoward Hinnant 20080f242beaSHoward Hinnanttemplate <class _Tp, class _Size, class _Up> 20093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20100f242beaSHoward Hinnanttypename enable_if 20110f242beaSHoward Hinnant< 20120f242beaSHoward Hinnant is_integral<_Tp>::value && sizeof(_Tp) == 1 && 20130f242beaSHoward Hinnant !is_same<_Tp, bool>::value && 20140f242beaSHoward Hinnant is_integral<_Up>::value && sizeof(_Up) == 1, 20150f242beaSHoward Hinnant _Tp* 20160f242beaSHoward Hinnant>::type 20170f242beaSHoward Hinnant__fill_n(_Tp* __first, _Size __n,_Up __value_) 20183e519524SHoward Hinnant{ 20193e519524SHoward Hinnant if (__n > 0) 2020e4383379SHoward Hinnant _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n)); 20213e519524SHoward Hinnant return __first + __n; 20223e519524SHoward Hinnant} 20233e519524SHoward Hinnant 20243e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20263e519524SHoward Hinnant_OutputIterator 2027e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20283e519524SHoward Hinnant{ 20290f242beaSHoward Hinnant return _VSTD::__fill_n(__first, __n, __value_); 20303e519524SHoward Hinnant} 20313e519524SHoward Hinnant 20323e519524SHoward Hinnant// fill 20333e519524SHoward Hinnant 20343e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20363e519524SHoward Hinnantvoid 2037e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 20383e519524SHoward Hinnant{ 20393e519524SHoward Hinnant for (; __first != __last; ++__first) 2040e4383379SHoward Hinnant *__first = __value_; 20413e519524SHoward Hinnant} 20423e519524SHoward Hinnant 20433e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 20443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20453e519524SHoward Hinnantvoid 2046e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 20473e519524SHoward Hinnant{ 2048e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 20493e519524SHoward Hinnant} 20503e519524SHoward Hinnant 20513e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20533e519524SHoward Hinnantvoid 2054e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20553e519524SHoward Hinnant{ 2056e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 20573e519524SHoward Hinnant} 20583e519524SHoward Hinnant 20593e519524SHoward Hinnant// generate 20603e519524SHoward Hinnant 20613e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 20623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20633e519524SHoward Hinnantvoid 20643e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 20653e519524SHoward Hinnant{ 20663e519524SHoward Hinnant for (; __first != __last; ++__first) 20673e519524SHoward Hinnant *__first = __gen(); 20683e519524SHoward Hinnant} 20693e519524SHoward Hinnant 20703e519524SHoward Hinnant// generate_n 20713e519524SHoward Hinnant 20723e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 20733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20743e519524SHoward Hinnant_OutputIterator 20753e519524SHoward Hinnantgenerate_n(_OutputIterator __first, _Size __n, _Generator __gen) 20763e519524SHoward Hinnant{ 20773e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 20783e519524SHoward Hinnant *__first = __gen(); 20793e519524SHoward Hinnant return __first; 20803e519524SHoward Hinnant} 20813e519524SHoward Hinnant 20823e519524SHoward Hinnant// remove 20833e519524SHoward Hinnant 20843e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20853e519524SHoward Hinnant_ForwardIterator 2086e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20873e519524SHoward Hinnant{ 2088e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 20893e519524SHoward Hinnant if (__first != __last) 20903e519524SHoward Hinnant { 20913e519524SHoward Hinnant _ForwardIterator __i = __first; 20923e519524SHoward Hinnant while (++__i != __last) 20933e519524SHoward Hinnant { 2094e4383379SHoward Hinnant if (!(*__i == __value_)) 20953e519524SHoward Hinnant { 2096ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 20973e519524SHoward Hinnant ++__first; 20983e519524SHoward Hinnant } 20993e519524SHoward Hinnant } 21003e519524SHoward Hinnant } 21013e519524SHoward Hinnant return __first; 21023e519524SHoward Hinnant} 21033e519524SHoward Hinnant 21043e519524SHoward Hinnant// remove_if 21053e519524SHoward Hinnant 21063e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 21073e519524SHoward Hinnant_ForwardIterator 21083e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 21093e519524SHoward Hinnant{ 2110ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 21113e519524SHoward Hinnant (__first, __last, __pred); 21123e519524SHoward Hinnant if (__first != __last) 21133e519524SHoward Hinnant { 21143e519524SHoward Hinnant _ForwardIterator __i = __first; 21153e519524SHoward Hinnant while (++__i != __last) 21163e519524SHoward Hinnant { 21173e519524SHoward Hinnant if (!__pred(*__i)) 21183e519524SHoward Hinnant { 2119ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21203e519524SHoward Hinnant ++__first; 21213e519524SHoward Hinnant } 21223e519524SHoward Hinnant } 21233e519524SHoward Hinnant } 21243e519524SHoward Hinnant return __first; 21253e519524SHoward Hinnant} 21263e519524SHoward Hinnant 21273e519524SHoward Hinnant// remove_copy 21283e519524SHoward Hinnant 21293e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 21303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21313e519524SHoward Hinnant_OutputIterator 2132e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 21333e519524SHoward Hinnant{ 21343e519524SHoward Hinnant for (; __first != __last; ++__first) 21353e519524SHoward Hinnant { 2136e4383379SHoward Hinnant if (!(*__first == __value_)) 21373e519524SHoward Hinnant { 21383e519524SHoward Hinnant *__result = *__first; 21393e519524SHoward Hinnant ++__result; 21403e519524SHoward Hinnant } 21413e519524SHoward Hinnant } 21423e519524SHoward Hinnant return __result; 21433e519524SHoward Hinnant} 21443e519524SHoward Hinnant 21453e519524SHoward Hinnant// remove_copy_if 21463e519524SHoward Hinnant 21473e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 21483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21493e519524SHoward Hinnant_OutputIterator 21503e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 21513e519524SHoward Hinnant{ 21523e519524SHoward Hinnant for (; __first != __last; ++__first) 21533e519524SHoward Hinnant { 21543e519524SHoward Hinnant if (!__pred(*__first)) 21553e519524SHoward Hinnant { 21563e519524SHoward Hinnant *__result = *__first; 21573e519524SHoward Hinnant ++__result; 21583e519524SHoward Hinnant } 21593e519524SHoward Hinnant } 21603e519524SHoward Hinnant return __result; 21613e519524SHoward Hinnant} 21623e519524SHoward Hinnant 21633e519524SHoward Hinnant// unique 21643e519524SHoward Hinnant 21653e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 21663e519524SHoward Hinnant_ForwardIterator 21673e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 21683e519524SHoward Hinnant{ 2169ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 21703e519524SHoward Hinnant (__first, __last, __pred); 21713e519524SHoward Hinnant if (__first != __last) 21723e519524SHoward Hinnant { 21733e519524SHoward Hinnant // ... a a ? ... 21743e519524SHoward Hinnant // f i 21753e519524SHoward Hinnant _ForwardIterator __i = __first; 21763e519524SHoward Hinnant for (++__i; ++__i != __last;) 21773e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2178ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 21793e519524SHoward Hinnant ++__first; 21803e519524SHoward Hinnant } 21813e519524SHoward Hinnant return __first; 21823e519524SHoward Hinnant} 21833e519524SHoward Hinnant 21843e519524SHoward Hinnanttemplate <class _ForwardIterator> 21853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21863e519524SHoward Hinnant_ForwardIterator 21873e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 21883e519524SHoward Hinnant{ 21893e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2190ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 21913e519524SHoward Hinnant} 21923e519524SHoward Hinnant 21933e519524SHoward Hinnant// unique_copy 21943e519524SHoward Hinnant 21953e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 21963e519524SHoward Hinnant_OutputIterator 21973e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 21983e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 21993e519524SHoward Hinnant{ 22003e519524SHoward Hinnant if (__first != __last) 22013e519524SHoward Hinnant { 22023e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 22033e519524SHoward Hinnant *__result = __t; 22043e519524SHoward Hinnant ++__result; 22053e519524SHoward Hinnant while (++__first != __last) 22063e519524SHoward Hinnant { 22073e519524SHoward Hinnant if (!__pred(__t, *__first)) 22083e519524SHoward Hinnant { 22093e519524SHoward Hinnant __t = *__first; 22103e519524SHoward Hinnant *__result = __t; 22113e519524SHoward Hinnant ++__result; 22123e519524SHoward Hinnant } 22133e519524SHoward Hinnant } 22143e519524SHoward Hinnant } 22153e519524SHoward Hinnant return __result; 22163e519524SHoward Hinnant} 22173e519524SHoward Hinnant 22183e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 22193e519524SHoward Hinnant_OutputIterator 22203e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22213e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 22223e519524SHoward Hinnant{ 22233e519524SHoward Hinnant if (__first != __last) 22243e519524SHoward Hinnant { 22253e519524SHoward Hinnant _ForwardIterator __i = __first; 22263e519524SHoward Hinnant *__result = *__i; 22273e519524SHoward Hinnant ++__result; 22283e519524SHoward Hinnant while (++__first != __last) 22293e519524SHoward Hinnant { 22303e519524SHoward Hinnant if (!__pred(*__i, *__first)) 22313e519524SHoward Hinnant { 22323e519524SHoward Hinnant *__result = *__first; 22333e519524SHoward Hinnant ++__result; 22343e519524SHoward Hinnant __i = __first; 22353e519524SHoward Hinnant } 22363e519524SHoward Hinnant } 22373e519524SHoward Hinnant } 22383e519524SHoward Hinnant return __result; 22393e519524SHoward Hinnant} 22403e519524SHoward Hinnant 22413e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 22423e519524SHoward Hinnant_ForwardIterator 22433e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 22443e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 22453e519524SHoward Hinnant{ 22463e519524SHoward Hinnant if (__first != __last) 22473e519524SHoward Hinnant { 22483e519524SHoward Hinnant *__result = *__first; 22493e519524SHoward Hinnant while (++__first != __last) 22503e519524SHoward Hinnant if (!__pred(*__result, *__first)) 22513e519524SHoward Hinnant *++__result = *__first; 22523e519524SHoward Hinnant ++__result; 22533e519524SHoward Hinnant } 22543e519524SHoward Hinnant return __result; 22553e519524SHoward Hinnant} 22563e519524SHoward Hinnant 22573e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 22583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22593e519524SHoward Hinnant_OutputIterator 22603e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 22613e519524SHoward Hinnant{ 2262ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 22633e519524SHoward Hinnant (__first, __last, __result, __pred, 22643e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 22653e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 22663e519524SHoward Hinnant} 22673e519524SHoward Hinnant 22683e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 22693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22703e519524SHoward Hinnant_OutputIterator 22713e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 22723e519524SHoward Hinnant{ 22733e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2274ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 22753e519524SHoward Hinnant} 22763e519524SHoward Hinnant 22773e519524SHoward Hinnant// reverse 22783e519524SHoward Hinnant 22793e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 22803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22813e519524SHoward Hinnantvoid 22823e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 22833e519524SHoward Hinnant{ 22843e519524SHoward Hinnant while (__first != __last) 22853e519524SHoward Hinnant { 22863e519524SHoward Hinnant if (__first == --__last) 22873e519524SHoward Hinnant break; 22883e519524SHoward Hinnant swap(*__first, *__last); 22893e519524SHoward Hinnant ++__first; 22903e519524SHoward Hinnant } 22913e519524SHoward Hinnant} 22923e519524SHoward Hinnant 22933e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 22943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22953e519524SHoward Hinnantvoid 22963e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 22973e519524SHoward Hinnant{ 22983e519524SHoward Hinnant if (__first != __last) 22993e519524SHoward Hinnant for (; __first < --__last; ++__first) 23003e519524SHoward Hinnant swap(*__first, *__last); 23013e519524SHoward Hinnant} 23023e519524SHoward Hinnant 23033e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23053e519524SHoward Hinnantvoid 23063e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 23073e519524SHoward Hinnant{ 2308ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 23093e519524SHoward Hinnant} 23103e519524SHoward Hinnant 23113e519524SHoward Hinnant// reverse_copy 23123e519524SHoward Hinnant 23133e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 23143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23153e519524SHoward Hinnant_OutputIterator 23163e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 23173e519524SHoward Hinnant{ 23183e519524SHoward Hinnant for (; __first != __last; ++__result) 23193e519524SHoward Hinnant *__result = *--__last; 23203e519524SHoward Hinnant return __result; 23213e519524SHoward Hinnant} 23223e519524SHoward Hinnant 23233e519524SHoward Hinnant// rotate 23243e519524SHoward Hinnant 23253e519524SHoward Hinnanttemplate <class _ForwardIterator> 23263e519524SHoward Hinnant_ForwardIterator 2327aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 23283e519524SHoward Hinnant{ 2329aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2330aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2331aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2332aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2333aca09de3SHoward Hinnant return __lm1; 2334aca09de3SHoward Hinnant} 2335aca09de3SHoward Hinnant 2336aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2337aca09de3SHoward Hinnant_BidirectionalIterator 2338aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2339aca09de3SHoward Hinnant{ 2340aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2341aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2342aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2343aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2344aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2345aca09de3SHoward Hinnant return __fp1; 2346aca09de3SHoward Hinnant} 2347aca09de3SHoward Hinnant 2348aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2349aca09de3SHoward Hinnant_ForwardIterator 2350aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2351aca09de3SHoward Hinnant{ 23523e519524SHoward Hinnant _ForwardIterator __i = __middle; 23533e519524SHoward Hinnant while (true) 23543e519524SHoward Hinnant { 23553e519524SHoward Hinnant swap(*__first, *__i); 23563e519524SHoward Hinnant ++__first; 23573e519524SHoward Hinnant if (++__i == __last) 23583e519524SHoward Hinnant break; 23593e519524SHoward Hinnant if (__first == __middle) 23603e519524SHoward Hinnant __middle = __i; 23613e519524SHoward Hinnant } 23623e519524SHoward Hinnant _ForwardIterator __r = __first; 23633e519524SHoward Hinnant if (__first != __middle) 23643e519524SHoward Hinnant { 23653e519524SHoward Hinnant __i = __middle; 23663e519524SHoward Hinnant while (true) 23673e519524SHoward Hinnant { 23683e519524SHoward Hinnant swap(*__first, *__i); 23693e519524SHoward Hinnant ++__first; 23703e519524SHoward Hinnant if (++__i == __last) 23713e519524SHoward Hinnant { 23723e519524SHoward Hinnant if (__first == __middle) 23733e519524SHoward Hinnant break; 23743e519524SHoward Hinnant __i = __middle; 23753e519524SHoward Hinnant } 23763e519524SHoward Hinnant else if (__first == __middle) 23773e519524SHoward Hinnant __middle = __i; 23783e519524SHoward Hinnant } 23793e519524SHoward Hinnant } 23803e519524SHoward Hinnant return __r; 23813e519524SHoward Hinnant} 23823e519524SHoward Hinnant 23833e519524SHoward Hinnanttemplate<typename _Integral> 23843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23853e519524SHoward Hinnant_Integral 23863e519524SHoward Hinnant__gcd(_Integral __x, _Integral __y) 23873e519524SHoward Hinnant{ 23883e519524SHoward Hinnant do 23893e519524SHoward Hinnant { 23903e519524SHoward Hinnant _Integral __t = __x % __y; 23913e519524SHoward Hinnant __x = __y; 23923e519524SHoward Hinnant __y = __t; 23933e519524SHoward Hinnant } while (__y); 23943e519524SHoward Hinnant return __x; 23953e519524SHoward Hinnant} 23963e519524SHoward Hinnant 23973e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 23983e519524SHoward Hinnant_RandomAccessIterator 2399aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 24003e519524SHoward Hinnant{ 24013e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 24023e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 24033e519524SHoward Hinnant 24043e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 24053e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 24063e519524SHoward Hinnant if (__m1 == __m2) 24073e519524SHoward Hinnant { 2408ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 24093e519524SHoward Hinnant return __middle; 24103e519524SHoward Hinnant } 2411aca09de3SHoward Hinnant const difference_type __g = _VSTD::__gcd(__m1, __m2); 24123e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 24133e519524SHoward Hinnant { 2414aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 24153e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 24163e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 24173e519524SHoward Hinnant do 24183e519524SHoward Hinnant { 2419aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 24203e519524SHoward Hinnant __p1 = __p2; 24213e519524SHoward Hinnant const difference_type __d = __last - __p2; 24223e519524SHoward Hinnant if (__m1 < __d) 24233e519524SHoward Hinnant __p2 += __m1; 24243e519524SHoward Hinnant else 24253e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 24263e519524SHoward Hinnant } while (__p2 != __p); 2427aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 24283e519524SHoward Hinnant } 24293e519524SHoward Hinnant return __first + __m2; 24303e519524SHoward Hinnant} 24313e519524SHoward Hinnant 24323e519524SHoward Hinnanttemplate <class _ForwardIterator> 24333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24343e519524SHoward Hinnant_ForwardIterator 2435aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2436aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2437aca09de3SHoward Hinnant{ 2438aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2439aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2440aca09de3SHoward Hinnant { 2441aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2442aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2443aca09de3SHoward Hinnant } 2444aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2445aca09de3SHoward Hinnant} 2446aca09de3SHoward Hinnant 2447aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2448aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2449aca09de3SHoward Hinnant_BidirectionalIterator 2450aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2451aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2452aca09de3SHoward Hinnant{ 2453aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2454aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2455aca09de3SHoward Hinnant { 2456aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2457aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2458aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2459aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2460aca09de3SHoward Hinnant } 2461aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2462aca09de3SHoward Hinnant} 2463aca09de3SHoward Hinnant 2464aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2465aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2466aca09de3SHoward Hinnant_RandomAccessIterator 2467aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2468aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2469aca09de3SHoward Hinnant{ 2470aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2471aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2472aca09de3SHoward Hinnant { 2473aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2474aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2475aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2476aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2477aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2478aca09de3SHoward Hinnant } 2479aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2480aca09de3SHoward Hinnant} 2481aca09de3SHoward Hinnant 2482aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2483aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2484aca09de3SHoward Hinnant_ForwardIterator 24853e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 24863e519524SHoward Hinnant{ 2487aca09de3SHoward Hinnant if (__first == __middle) 2488aca09de3SHoward Hinnant return __last; 2489aca09de3SHoward Hinnant if (__middle == __last) 2490aca09de3SHoward Hinnant return __first; 2491ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2492aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 24933e519524SHoward Hinnant} 24943e519524SHoward Hinnant 24953e519524SHoward Hinnant// rotate_copy 24963e519524SHoward Hinnant 24973e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 24983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24993e519524SHoward Hinnant_OutputIterator 25003e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 25013e519524SHoward Hinnant{ 2502ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 25033e519524SHoward Hinnant} 25043e519524SHoward Hinnant 25053e519524SHoward Hinnant// min_element 25063e519524SHoward Hinnant 25073e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25093e519524SHoward Hinnant_ForwardIterator 25103e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25113e519524SHoward Hinnant{ 25123e519524SHoward Hinnant if (__first != __last) 25133e519524SHoward Hinnant { 25143e519524SHoward Hinnant _ForwardIterator __i = __first; 25153e519524SHoward Hinnant while (++__i != __last) 25163e519524SHoward Hinnant if (__comp(*__i, *__first)) 25173e519524SHoward Hinnant __first = __i; 25183e519524SHoward Hinnant } 25193e519524SHoward Hinnant return __first; 25203e519524SHoward Hinnant} 25213e519524SHoward Hinnant 25223e519524SHoward Hinnanttemplate <class _ForwardIterator> 25233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25243e519524SHoward Hinnant_ForwardIterator 25253e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 25263e519524SHoward Hinnant{ 2527ce48a113SHoward Hinnant return _VSTD::min_element(__first, __last, 25284eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25294eb27b79SHoward Hinnant} 25304eb27b79SHoward Hinnant 25314eb27b79SHoward Hinnant// min 25324eb27b79SHoward Hinnant 25334eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25344eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25354eb27b79SHoward Hinnantconst _Tp& 25364eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 25374eb27b79SHoward Hinnant{ 25384eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 25394eb27b79SHoward Hinnant} 25404eb27b79SHoward Hinnant 25414eb27b79SHoward Hinnanttemplate <class _Tp> 25424eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25434eb27b79SHoward Hinnantconst _Tp& 25444eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 25454eb27b79SHoward Hinnant{ 2546ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 25474eb27b79SHoward Hinnant} 25484eb27b79SHoward Hinnant 254954976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 255054976f26SHoward Hinnant 25514eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 25524eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25534eb27b79SHoward Hinnant_Tp 25544eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 25554eb27b79SHoward Hinnant{ 2556ce48a113SHoward Hinnant return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 25574eb27b79SHoward Hinnant} 25584eb27b79SHoward Hinnant 25594eb27b79SHoward Hinnanttemplate<class _Tp> 25604eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25614eb27b79SHoward Hinnant_Tp 25624eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 25634eb27b79SHoward Hinnant{ 2564ce48a113SHoward Hinnant return *_VSTD::min_element(__t.begin(), __t.end()); 25653e519524SHoward Hinnant} 25663e519524SHoward Hinnant 256754976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 256854976f26SHoward Hinnant 25693e519524SHoward Hinnant// max_element 25703e519524SHoward Hinnant 25713e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25733e519524SHoward Hinnant_ForwardIterator 25743e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25753e519524SHoward Hinnant{ 25763e519524SHoward Hinnant if (__first != __last) 25773e519524SHoward Hinnant { 25783e519524SHoward Hinnant _ForwardIterator __i = __first; 25793e519524SHoward Hinnant while (++__i != __last) 25803e519524SHoward Hinnant if (__comp(*__first, *__i)) 25813e519524SHoward Hinnant __first = __i; 25823e519524SHoward Hinnant } 25833e519524SHoward Hinnant return __first; 25843e519524SHoward Hinnant} 25853e519524SHoward Hinnant 25863e519524SHoward Hinnanttemplate <class _ForwardIterator> 25873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25883e519524SHoward Hinnant_ForwardIterator 25893e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 25903e519524SHoward Hinnant{ 2591ce48a113SHoward Hinnant return _VSTD::max_element(__first, __last, 25924eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25934eb27b79SHoward Hinnant} 25944eb27b79SHoward Hinnant 25954eb27b79SHoward Hinnant// max 25964eb27b79SHoward Hinnant 25974eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25984eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25994eb27b79SHoward Hinnantconst _Tp& 26004eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26014eb27b79SHoward Hinnant{ 26024eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 26034eb27b79SHoward Hinnant} 26044eb27b79SHoward Hinnant 26054eb27b79SHoward Hinnanttemplate <class _Tp> 26064eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26074eb27b79SHoward Hinnantconst _Tp& 26084eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 26094eb27b79SHoward Hinnant{ 2610ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 26114eb27b79SHoward Hinnant} 26124eb27b79SHoward Hinnant 261354976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 261454976f26SHoward Hinnant 26154eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26164eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26174eb27b79SHoward Hinnant_Tp 26184eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 26194eb27b79SHoward Hinnant{ 2620ce48a113SHoward Hinnant return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 26214eb27b79SHoward Hinnant} 26224eb27b79SHoward Hinnant 26234eb27b79SHoward Hinnanttemplate<class _Tp> 26244eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26254eb27b79SHoward Hinnant_Tp 26264eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 26274eb27b79SHoward Hinnant{ 2628ce48a113SHoward Hinnant return *_VSTD::max_element(__t.begin(), __t.end()); 26293e519524SHoward Hinnant} 26303e519524SHoward Hinnant 263154976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 263254976f26SHoward Hinnant 26333e519524SHoward Hinnant// minmax_element 26343e519524SHoward Hinnant 26353e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26363e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26373e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26383e519524SHoward Hinnant{ 26393e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 26403e519524SHoward Hinnant if (__first != __last) 26413e519524SHoward Hinnant { 26423e519524SHoward Hinnant if (++__first != __last) 26433e519524SHoward Hinnant { 26443e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26453e519524SHoward Hinnant __result.first = __first; 26463e519524SHoward Hinnant else 26473e519524SHoward Hinnant __result.second = __first; 26483e519524SHoward Hinnant while (++__first != __last) 26493e519524SHoward Hinnant { 26503e519524SHoward Hinnant _ForwardIterator __i = __first; 26513e519524SHoward Hinnant if (++__first == __last) 26523e519524SHoward Hinnant { 26533e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 26543e519524SHoward Hinnant __result.first = __i; 26553e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 26563e519524SHoward Hinnant __result.second = __i; 26573e519524SHoward Hinnant break; 26583e519524SHoward Hinnant } 26593e519524SHoward Hinnant else 26603e519524SHoward Hinnant { 26613e519524SHoward Hinnant if (__comp(*__first, *__i)) 26623e519524SHoward Hinnant { 26633e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26643e519524SHoward Hinnant __result.first = __first; 26653e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 26663e519524SHoward Hinnant __result.second = __i; 26673e519524SHoward Hinnant } 26683e519524SHoward Hinnant else 26693e519524SHoward Hinnant { 26703e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 26713e519524SHoward Hinnant __result.first = __i; 26723e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 26733e519524SHoward Hinnant __result.second = __first; 26743e519524SHoward Hinnant } 26753e519524SHoward Hinnant } 26763e519524SHoward Hinnant } 26773e519524SHoward Hinnant } 26783e519524SHoward Hinnant } 26793e519524SHoward Hinnant return __result; 26803e519524SHoward Hinnant} 26813e519524SHoward Hinnant 26823e519524SHoward Hinnanttemplate <class _ForwardIterator> 26833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26843e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26853e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 26863e519524SHoward Hinnant{ 2687ce48a113SHoward Hinnant return _VSTD::minmax_element(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26883e519524SHoward Hinnant} 26893e519524SHoward Hinnant 26904eb27b79SHoward Hinnant// minmax 26914eb27b79SHoward Hinnant 26924eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26934eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26944eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 26954eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26964eb27b79SHoward Hinnant{ 26974eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 26984eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 26994eb27b79SHoward Hinnant} 27004eb27b79SHoward Hinnant 27014eb27b79SHoward Hinnanttemplate<class _Tp> 27024eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 27034eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27044eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 27054eb27b79SHoward Hinnant{ 2706ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 27074eb27b79SHoward Hinnant} 27084eb27b79SHoward Hinnant 270954976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 271054976f26SHoward Hinnant 27114eb27b79SHoward Hinnanttemplate<class _Tp> 27124eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 27134eb27b79SHoward Hinnantpair<_Tp, _Tp> 27144eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t) 27154eb27b79SHoward Hinnant{ 27164eb27b79SHoward Hinnant pair<const _Tp*, const _Tp*> __p = 2717ce48a113SHoward Hinnant _VSTD::minmax_element(__t.begin(), __t.end()); 27184eb27b79SHoward Hinnant return pair<_Tp, _Tp>(*__p.first, *__p.second); 27194eb27b79SHoward Hinnant} 27204eb27b79SHoward Hinnant 27214eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27224eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 27234eb27b79SHoward Hinnantpair<_Tp, _Tp> 27244eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 27254eb27b79SHoward Hinnant{ 27264eb27b79SHoward Hinnant pair<const _Tp*, const _Tp*> __p = 2727ce48a113SHoward Hinnant _VSTD::minmax_element(__t.begin(), __t.end(), __comp); 27284eb27b79SHoward Hinnant return pair<_Tp, _Tp>(*__p.first, *__p.second); 27294eb27b79SHoward Hinnant} 27304eb27b79SHoward Hinnant 273154976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 273254976f26SHoward Hinnant 27333e519524SHoward Hinnant// random_shuffle 27343e519524SHoward Hinnant 2735f9d540b0SHoward Hinnant// __independent_bits_engine 2736f9d540b0SHoward Hinnant 2737c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2738f9d540b0SHoward Hinnantstruct __log2_imp 27393e519524SHoward Hinnant{ 2740c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2741c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 27423e519524SHoward Hinnant}; 27433e519524SHoward Hinnant 2744c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2745c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 27463e519524SHoward Hinnant{ 2747f9d540b0SHoward Hinnant static const size_t value = 0; 27483e519524SHoward Hinnant}; 27493e519524SHoward Hinnant 2750c003db1fSHoward Hinnanttemplate <size_t _Rp> 2751c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 27523e519524SHoward Hinnant{ 2753c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 27543e519524SHoward Hinnant}; 27553e519524SHoward Hinnant 2756c003db1fSHoward Hinnanttemplate <class _UI, _UI _Xp> 2757f9d540b0SHoward Hinnantstruct __log2 27583e519524SHoward Hinnant{ 2759c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 2760f9d540b0SHoward Hinnant sizeof(_UI) * __CHAR_BIT__ - 1>::value; 27613e519524SHoward Hinnant}; 27623e519524SHoward Hinnant 2763f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2764f9d540b0SHoward Hinnantclass __independent_bits_engine 27653e519524SHoward Hinnant{ 2766f9d540b0SHoward Hinnantpublic: 2767f9d540b0SHoward Hinnant // types 2768f9d540b0SHoward Hinnant typedef _UIntType result_type; 2769f9d540b0SHoward Hinnant 2770f9d540b0SHoward Hinnantprivate: 2771f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2772f9d540b0SHoward Hinnant typedef typename conditional 2773f9d540b0SHoward Hinnant < 2774f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2775f9d540b0SHoward Hinnant result_type, 2776f9d540b0SHoward Hinnant _Engine_result_type 2777f9d540b0SHoward Hinnant >::type _Working_result_type; 2778f9d540b0SHoward Hinnant 2779f9d540b0SHoward Hinnant _Engine& __e_; 2780f9d540b0SHoward Hinnant size_t __w_; 2781f9d540b0SHoward Hinnant size_t __w0_; 2782f9d540b0SHoward Hinnant size_t __n_; 2783f9d540b0SHoward Hinnant size_t __n0_; 2784f9d540b0SHoward Hinnant _Working_result_type __y0_; 2785f9d540b0SHoward Hinnant _Working_result_type __y1_; 2786f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2787f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2788f9d540b0SHoward Hinnant 2789e386b7b3SHoward Hinnant#ifdef _LIBCPP_HAS_NO_CONSTEXPR 2790c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2791f9d540b0SHoward Hinnant + _Working_result_type(1); 2792e386b7b3SHoward Hinnant#else 2793e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2794e386b7b3SHoward Hinnant + _Working_result_type(1); 2795e386b7b3SHoward Hinnant#endif 2796e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2797e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2798e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2799f9d540b0SHoward Hinnant 2800f9d540b0SHoward Hinnantpublic: 2801f9d540b0SHoward Hinnant // constructors and seeding functions 2802f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2803f9d540b0SHoward Hinnant 2804f9d540b0SHoward Hinnant // generating functions 2805c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2806f9d540b0SHoward Hinnant 2807f9d540b0SHoward Hinnantprivate: 2808f9d540b0SHoward Hinnant result_type __eval(false_type); 2809f9d540b0SHoward Hinnant result_type __eval(true_type); 2810f9d540b0SHoward Hinnant}; 2811f9d540b0SHoward Hinnant 2812f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2813f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2814f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2815f9d540b0SHoward Hinnant : __e_(__e), 2816f9d540b0SHoward Hinnant __w_(__w) 2817f9d540b0SHoward Hinnant{ 2818f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2819f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2820c003db1fSHoward Hinnant if (_Rp == 0) 2821c003db1fSHoward Hinnant __y0_ = _Rp; 2822f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2823c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2824f9d540b0SHoward Hinnant else 2825f9d540b0SHoward Hinnant __y0_ = 0; 2826c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2827f9d540b0SHoward Hinnant { 2828f9d540b0SHoward Hinnant ++__n_; 2829f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2830f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2831c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2832f9d540b0SHoward Hinnant else 2833f9d540b0SHoward Hinnant __y0_ = 0; 2834f9d540b0SHoward Hinnant } 2835f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2836f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2837c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2838f9d540b0SHoward Hinnant else 2839f9d540b0SHoward Hinnant __y1_ = 0; 2840f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2841f9d540b0SHoward Hinnant _Engine_result_type(0); 2842f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2843f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2844f9d540b0SHoward Hinnant _Engine_result_type(~0); 28453e519524SHoward Hinnant} 28463e519524SHoward Hinnant 2847f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2848f9d540b0SHoward Hinnantinline 2849f9d540b0SHoward Hinnant_UIntType 2850f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 28513e519524SHoward Hinnant{ 2852f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 28533e519524SHoward Hinnant} 28543e519524SHoward Hinnant 2855f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2856f9d540b0SHoward Hinnant_UIntType 2857f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 28583e519524SHoward Hinnant{ 2859c003db1fSHoward Hinnant result_type _Sp = 0; 2860f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2861f9d540b0SHoward Hinnant { 2862f9d540b0SHoward Hinnant _Engine_result_type __u; 28633e519524SHoward Hinnant do 2864f9d540b0SHoward Hinnant { 2865f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2866f9d540b0SHoward Hinnant } while (__u >= __y0_); 28670176bc6cSHoward Hinnant if (__w0_ < _WDt) 2868c003db1fSHoward Hinnant _Sp <<= __w0_; 2869f9d540b0SHoward Hinnant else 2870c003db1fSHoward Hinnant _Sp = 0; 2871c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2872f9d540b0SHoward Hinnant } 2873f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2874f9d540b0SHoward Hinnant { 2875f9d540b0SHoward Hinnant _Engine_result_type __u; 2876f9d540b0SHoward Hinnant do 2877f9d540b0SHoward Hinnant { 2878f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2879f9d540b0SHoward Hinnant } while (__u >= __y1_); 28800176bc6cSHoward Hinnant if (__w0_ < _WDt - 1) 2881c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2882f9d540b0SHoward Hinnant else 2883c003db1fSHoward Hinnant _Sp = 0; 2884c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2885f9d540b0SHoward Hinnant } 2886c003db1fSHoward Hinnant return _Sp; 28873e519524SHoward Hinnant} 28883e519524SHoward Hinnant 2889f9d540b0SHoward Hinnant// uniform_int_distribution 28903e519524SHoward Hinnant 2891f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2892f9d540b0SHoward Hinnantclass uniform_int_distribution 28933e519524SHoward Hinnant{ 2894f9d540b0SHoward Hinnantpublic: 2895f9d540b0SHoward Hinnant // types 2896f9d540b0SHoward Hinnant typedef _IntType result_type; 2897f9d540b0SHoward Hinnant 2898f9d540b0SHoward Hinnant class param_type 2899f9d540b0SHoward Hinnant { 2900f9d540b0SHoward Hinnant result_type __a_; 2901f9d540b0SHoward Hinnant result_type __b_; 2902f9d540b0SHoward Hinnant public: 2903f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2904f9d540b0SHoward Hinnant 2905f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2906f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2907f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2908f9d540b0SHoward Hinnant 2909f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2910f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2911f9d540b0SHoward Hinnant 2912f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2913f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2914f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2915f9d540b0SHoward Hinnant {return !(__x == __y);} 29163e519524SHoward Hinnant }; 29173e519524SHoward Hinnant 2918f9d540b0SHoward Hinnantprivate: 2919f9d540b0SHoward Hinnant param_type __p_; 29203e519524SHoward Hinnant 2921f9d540b0SHoward Hinnantpublic: 2922f9d540b0SHoward Hinnant // constructors and reset functions 2923f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 2924f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2925f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 2926f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 2927f9d540b0SHoward Hinnant void reset() {} 2928f9d540b0SHoward Hinnant 2929f9d540b0SHoward Hinnant // generating functions 2930f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 2931f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 2932f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 2933f9d540b0SHoward Hinnant 2934f9d540b0SHoward Hinnant // property functions 2935f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 2936f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 2937f9d540b0SHoward Hinnant 2938f9d540b0SHoward Hinnant param_type param() const {return __p_;} 2939f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 2940f9d540b0SHoward Hinnant 2941f9d540b0SHoward Hinnant result_type min() const {return a();} 2942f9d540b0SHoward Hinnant result_type max() const {return b();} 2943f9d540b0SHoward Hinnant 2944f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 2945f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2946f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 2947f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 2948f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2949f9d540b0SHoward Hinnant {return !(__x == __y);} 29503e519524SHoward Hinnant}; 29513e519524SHoward Hinnant 2952f9d540b0SHoward Hinnanttemplate<class _IntType> 2953f9d540b0SHoward Hinnanttemplate<class _URNG> 2954f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 2955f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 29563e519524SHoward Hinnant{ 2957f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 2958f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 2959c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 2960c003db1fSHoward Hinnant if (_Rp == 1) 2961f9d540b0SHoward Hinnant return __p.a(); 2962f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 2963f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 2964c003db1fSHoward Hinnant if (_Rp == 0) 2965f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 2966c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 2967c003db1fSHoward Hinnant if ((_Rp & (_UIntType(~0) >> (_Dt - __w))) != 0) 2968f9d540b0SHoward Hinnant ++__w; 2969f9d540b0SHoward Hinnant _Eng __e(__g, __w); 2970f9d540b0SHoward Hinnant _UIntType __u; 2971f9d540b0SHoward Hinnant do 29723e519524SHoward Hinnant { 2973f9d540b0SHoward Hinnant __u = __e(); 2974c003db1fSHoward Hinnant } while (__u >= _Rp); 2975f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 29763e519524SHoward Hinnant} 2977f9d540b0SHoward Hinnant 2978f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 2979f9d540b0SHoward Hinnant 2980f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 2981f9d540b0SHoward Hinnant 2982f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 29833e519524SHoward Hinnant{ 2984f9d540b0SHoward Hinnant static unsigned __c_; 2985f9d540b0SHoward Hinnant 2986f9d540b0SHoward Hinnant __rs_default(); 2987f9d540b0SHoward Hinnantpublic: 2988b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 2989f9d540b0SHoward Hinnant 2990f9d540b0SHoward Hinnant static const result_type _Min = 0; 2991f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 2992f9d540b0SHoward Hinnant 2993f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 2994f9d540b0SHoward Hinnant ~__rs_default(); 2995f9d540b0SHoward Hinnant 2996f9d540b0SHoward Hinnant result_type operator()(); 2997f9d540b0SHoward Hinnant 2998788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 2999788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3000f9d540b0SHoward Hinnant 3001f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3002f9d540b0SHoward Hinnant}; 3003f9d540b0SHoward Hinnant 3004f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 30053e519524SHoward Hinnant 30063e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 30073e519524SHoward Hinnantvoid 30083e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 30093e519524SHoward Hinnant{ 30103e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3011c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3012c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 30133e519524SHoward Hinnant difference_type __d = __last - __first; 30143e519524SHoward Hinnant if (__d > 1) 30153e519524SHoward Hinnant { 3016c003db1fSHoward Hinnant _Dp __uid; 3017f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 3018f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3019007b26beSHoward Hinnant { 3020c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3021007b26beSHoward Hinnant if (__i != difference_type(0)) 3022007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3023007b26beSHoward Hinnant } 30243e519524SHoward Hinnant } 30253e519524SHoward Hinnant} 30263e519524SHoward Hinnant 30273e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 30283e519524SHoward Hinnantvoid 30293e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 30307609c9b6SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 30313e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 30323e519524SHoward Hinnant#else 30333e519524SHoward Hinnant _RandomNumberGenerator& __rand) 30343e519524SHoward Hinnant#endif 30353e519524SHoward Hinnant{ 30363e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 30373e519524SHoward Hinnant difference_type __d = __last - __first; 30383e519524SHoward Hinnant if (__d > 1) 30393e519524SHoward Hinnant { 30403e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3041007b26beSHoward Hinnant { 3042007b26beSHoward Hinnant difference_type __i = __rand(__d); 3043007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3044007b26beSHoward Hinnant } 30453e519524SHoward Hinnant } 30463e519524SHoward Hinnant} 30473e519524SHoward Hinnant 3048f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3049f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3050fb340102SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 3051fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3052fb340102SHoward Hinnant#else 3053f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3054fb340102SHoward Hinnant#endif 3055f9d540b0SHoward Hinnant{ 3056f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3057c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3058c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3059f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3060f9d540b0SHoward Hinnant if (__d > 1) 3061f9d540b0SHoward Hinnant { 3062c003db1fSHoward Hinnant _Dp __uid; 3063f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3064007b26beSHoward Hinnant { 3065c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3066007b26beSHoward Hinnant if (__i != difference_type(0)) 3067007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3068007b26beSHoward Hinnant } 3069f9d540b0SHoward Hinnant } 3070f9d540b0SHoward Hinnant} 3071f9d540b0SHoward Hinnant 30723e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 30733e519524SHoward Hinnantbool 30743e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 30753e519524SHoward Hinnant{ 30763e519524SHoward Hinnant for (; __first != __last; ++__first) 30773e519524SHoward Hinnant if (!__pred(*__first)) 30783e519524SHoward Hinnant break; 30793e519524SHoward Hinnant for (; __first != __last; ++__first) 30803e519524SHoward Hinnant if (__pred(*__first)) 30813e519524SHoward Hinnant return false; 30823e519524SHoward Hinnant return true; 30833e519524SHoward Hinnant} 30843e519524SHoward Hinnant 30853e519524SHoward Hinnant// partition 30863e519524SHoward Hinnant 30873e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 30883e519524SHoward Hinnant_ForwardIterator 30893e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 30903e519524SHoward Hinnant{ 30913e519524SHoward Hinnant while (true) 30923e519524SHoward Hinnant { 30933e519524SHoward Hinnant if (__first == __last) 30943e519524SHoward Hinnant return __first; 30953e519524SHoward Hinnant if (!__pred(*__first)) 30963e519524SHoward Hinnant break; 30973e519524SHoward Hinnant ++__first; 30983e519524SHoward Hinnant } 30993e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 31003e519524SHoward Hinnant { 31013e519524SHoward Hinnant if (__pred(*__p)) 31023e519524SHoward Hinnant { 31033e519524SHoward Hinnant swap(*__first, *__p); 31043e519524SHoward Hinnant ++__first; 31053e519524SHoward Hinnant } 31063e519524SHoward Hinnant } 31073e519524SHoward Hinnant return __first; 31083e519524SHoward Hinnant} 31093e519524SHoward Hinnant 31103e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 31113e519524SHoward Hinnant_BidirectionalIterator 31123e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 31133e519524SHoward Hinnant bidirectional_iterator_tag) 31143e519524SHoward Hinnant{ 31153e519524SHoward Hinnant while (true) 31163e519524SHoward Hinnant { 31173e519524SHoward Hinnant while (true) 31183e519524SHoward Hinnant { 31193e519524SHoward Hinnant if (__first == __last) 31203e519524SHoward Hinnant return __first; 31213e519524SHoward Hinnant if (!__pred(*__first)) 31223e519524SHoward Hinnant break; 31233e519524SHoward Hinnant ++__first; 31243e519524SHoward Hinnant } 31253e519524SHoward Hinnant do 31263e519524SHoward Hinnant { 31273e519524SHoward Hinnant if (__first == --__last) 31283e519524SHoward Hinnant return __first; 31293e519524SHoward Hinnant } while (!__pred(*__last)); 31303e519524SHoward Hinnant swap(*__first, *__last); 31313e519524SHoward Hinnant ++__first; 31323e519524SHoward Hinnant } 31333e519524SHoward Hinnant} 31343e519524SHoward Hinnant 31353e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 31363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 31373e519524SHoward Hinnant_ForwardIterator 31383e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 31393e519524SHoward Hinnant{ 3140ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 31413e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 31423e519524SHoward Hinnant} 31433e519524SHoward Hinnant 31443e519524SHoward Hinnant// partition_copy 31453e519524SHoward Hinnant 31463e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 31473e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 31483e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 31493e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 31503e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 31513e519524SHoward Hinnant _Predicate __pred) 31523e519524SHoward Hinnant{ 31533e519524SHoward Hinnant for (; __first != __last; ++__first) 31543e519524SHoward Hinnant { 31553e519524SHoward Hinnant if (__pred(*__first)) 31563e519524SHoward Hinnant { 31573e519524SHoward Hinnant *__out_true = *__first; 31583e519524SHoward Hinnant ++__out_true; 31593e519524SHoward Hinnant } 31603e519524SHoward Hinnant else 31613e519524SHoward Hinnant { 31623e519524SHoward Hinnant *__out_false = *__first; 31633e519524SHoward Hinnant ++__out_false; 31643e519524SHoward Hinnant } 31653e519524SHoward Hinnant } 31663e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 31673e519524SHoward Hinnant} 31683e519524SHoward Hinnant 31693e519524SHoward Hinnant// partition_point 31703e519524SHoward Hinnant 31713e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 31723e519524SHoward Hinnant_ForwardIterator 31733e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 31743e519524SHoward Hinnant{ 31753e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3176ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 31773e519524SHoward Hinnant while (__len != 0) 31783e519524SHoward Hinnant { 31793e519524SHoward Hinnant difference_type __l2 = __len / 2; 31803e519524SHoward Hinnant _ForwardIterator __m = __first; 3181ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 31823e519524SHoward Hinnant if (__pred(*__m)) 31833e519524SHoward Hinnant { 31843e519524SHoward Hinnant __first = ++__m; 31853e519524SHoward Hinnant __len -= __l2 + 1; 31863e519524SHoward Hinnant } 31873e519524SHoward Hinnant else 31883e519524SHoward Hinnant __len = __l2; 31893e519524SHoward Hinnant } 31903e519524SHoward Hinnant return __first; 31913e519524SHoward Hinnant} 31923e519524SHoward Hinnant 31933e519524SHoward Hinnant// stable_partition 31943e519524SHoward Hinnant 31953e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 31963e519524SHoward Hinnant_ForwardIterator 31973e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 31983e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 31993e519524SHoward Hinnant{ 32003e519524SHoward Hinnant // *__first is known to be false 32013e519524SHoward Hinnant // __len >= 1 32023e519524SHoward Hinnant if (__len == 1) 32033e519524SHoward Hinnant return __first; 32043e519524SHoward Hinnant if (__len == 2) 32053e519524SHoward Hinnant { 32063e519524SHoward Hinnant _ForwardIterator __m = __first; 32073e519524SHoward Hinnant if (__pred(*++__m)) 32083e519524SHoward Hinnant { 32093e519524SHoward Hinnant swap(*__first, *__m); 32103e519524SHoward Hinnant return __m; 32113e519524SHoward Hinnant } 32123e519524SHoward Hinnant return __first; 32133e519524SHoward Hinnant } 32143e519524SHoward Hinnant if (__len <= __p.second) 32153e519524SHoward Hinnant { // The buffer is big enough to use 32163e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 32173e519524SHoward Hinnant __destruct_n __d(0); 32183e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 32193e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 32203e519524SHoward Hinnant // Update __first to always point to the end of the trues 32213e519524SHoward Hinnant value_type* __t = __p.first; 3222ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 32233e519524SHoward Hinnant __d.__incr((value_type*)0); 32243e519524SHoward Hinnant ++__t; 32253e519524SHoward Hinnant _ForwardIterator __i = __first; 32263e519524SHoward Hinnant while (++__i != __last) 32273e519524SHoward Hinnant { 32283e519524SHoward Hinnant if (__pred(*__i)) 32293e519524SHoward Hinnant { 3230ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 32313e519524SHoward Hinnant ++__first; 32323e519524SHoward Hinnant } 32333e519524SHoward Hinnant else 32343e519524SHoward Hinnant { 3235ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 32363e519524SHoward Hinnant __d.__incr((value_type*)0); 32373e519524SHoward Hinnant ++__t; 32383e519524SHoward Hinnant } 32393e519524SHoward Hinnant } 32403e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 32413e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 32423e519524SHoward Hinnant __i = __first; 32433e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3244ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 32453e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 32463e519524SHoward Hinnant return __first; 32473e519524SHoward Hinnant } 32483e519524SHoward Hinnant // Else not enough buffer, do in place 32493e519524SHoward Hinnant // __len >= 3 32503e519524SHoward Hinnant _ForwardIterator __m = __first; 32513e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3252ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 32533e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 32543e519524SHoward Hinnant // F????????????????? 32553e519524SHoward Hinnant // f m l 32563e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 32573e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 32583e519524SHoward Hinnant // TTTFFFFF?????????? 32593e519524SHoward Hinnant // f ff m l 32603e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 32613e519524SHoward Hinnant _ForwardIterator __m1 = __m; 32623e519524SHoward Hinnant _ForwardIterator __second_false = __last; 32633e519524SHoward Hinnant _Distance __len_half = __len - __len2; 32643e519524SHoward Hinnant while (__pred(*__m1)) 32653e519524SHoward Hinnant { 32663e519524SHoward Hinnant if (++__m1 == __last) 32673e519524SHoward Hinnant goto __second_half_done; 32683e519524SHoward Hinnant --__len_half; 32693e519524SHoward Hinnant } 32703e519524SHoward Hinnant // TTTFFFFFTTTF?????? 32713e519524SHoward Hinnant // f ff m m1 l 32723e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 32733e519524SHoward Hinnant__second_half_done: 32743e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 32753e519524SHoward Hinnant // f ff m sf l 3276ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 32773e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 32783e519524SHoward Hinnant // | 32793e519524SHoward Hinnant} 32803e519524SHoward Hinnant 32813e519524SHoward Hinnantstruct __return_temporary_buffer 32823e519524SHoward Hinnant{ 32833e519524SHoward Hinnant template <class _Tp> 3284ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 32853e519524SHoward Hinnant}; 32863e519524SHoward Hinnant 32873e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 32883e519524SHoward Hinnant_ForwardIterator 32893e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 32903e519524SHoward Hinnant forward_iterator_tag) 32913e519524SHoward Hinnant{ 32923e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 32933e519524SHoward Hinnant // Either prove all true and return __first or point to first false 32943e519524SHoward Hinnant while (true) 32953e519524SHoward Hinnant { 32963e519524SHoward Hinnant if (__first == __last) 32973e519524SHoward Hinnant return __first; 32983e519524SHoward Hinnant if (!__pred(*__first)) 32993e519524SHoward Hinnant break; 33003e519524SHoward Hinnant ++__first; 33013e519524SHoward Hinnant } 33023e519524SHoward Hinnant // We now have a reduced range [__first, __last) 33033e519524SHoward Hinnant // *__first is known to be false 33043e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 33053e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3306ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 33073e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 33083e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 33093e519524SHoward Hinnant if (__len >= __alloc_limit) 33103e519524SHoward Hinnant { 3311ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 33123e519524SHoward Hinnant __h.reset(__p.first); 33133e519524SHoward Hinnant } 33143e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 33153e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 33163e519524SHoward Hinnant} 33173e519524SHoward Hinnant 33183e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 33193e519524SHoward Hinnant_BidirectionalIterator 33203e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 33213e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 33223e519524SHoward Hinnant{ 33233e519524SHoward Hinnant // *__first is known to be false 33243e519524SHoward Hinnant // *__last is known to be true 33253e519524SHoward Hinnant // __len >= 2 33263e519524SHoward Hinnant if (__len == 2) 33273e519524SHoward Hinnant { 33283e519524SHoward Hinnant swap(*__first, *__last); 33293e519524SHoward Hinnant return __last; 33303e519524SHoward Hinnant } 33313e519524SHoward Hinnant if (__len == 3) 33323e519524SHoward Hinnant { 33333e519524SHoward Hinnant _BidirectionalIterator __m = __first; 33343e519524SHoward Hinnant if (__pred(*++__m)) 33353e519524SHoward Hinnant { 33363e519524SHoward Hinnant swap(*__first, *__m); 33373e519524SHoward Hinnant swap(*__m, *__last); 33383e519524SHoward Hinnant return __last; 33393e519524SHoward Hinnant } 33403e519524SHoward Hinnant swap(*__m, *__last); 33413e519524SHoward Hinnant swap(*__first, *__m); 33423e519524SHoward Hinnant return __m; 33433e519524SHoward Hinnant } 33443e519524SHoward Hinnant if (__len <= __p.second) 33453e519524SHoward Hinnant { // The buffer is big enough to use 33463e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 33473e519524SHoward Hinnant __destruct_n __d(0); 33483e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 33493e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 33503e519524SHoward Hinnant // Update __first to always point to the end of the trues 33513e519524SHoward Hinnant value_type* __t = __p.first; 3352ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 33533e519524SHoward Hinnant __d.__incr((value_type*)0); 33543e519524SHoward Hinnant ++__t; 33553e519524SHoward Hinnant _BidirectionalIterator __i = __first; 33563e519524SHoward Hinnant while (++__i != __last) 33573e519524SHoward Hinnant { 33583e519524SHoward Hinnant if (__pred(*__i)) 33593e519524SHoward Hinnant { 3360ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 33613e519524SHoward Hinnant ++__first; 33623e519524SHoward Hinnant } 33633e519524SHoward Hinnant else 33643e519524SHoward Hinnant { 3365ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 33663e519524SHoward Hinnant __d.__incr((value_type*)0); 33673e519524SHoward Hinnant ++__t; 33683e519524SHoward Hinnant } 33693e519524SHoward Hinnant } 33703e519524SHoward Hinnant // move *__last, known to be true 3371ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 33723e519524SHoward Hinnant __i = ++__first; 33733e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 33743e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 33753e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3376ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 33773e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 33783e519524SHoward Hinnant return __first; 33793e519524SHoward Hinnant } 33803e519524SHoward Hinnant // Else not enough buffer, do in place 33813e519524SHoward Hinnant // __len >= 4 33823e519524SHoward Hinnant _BidirectionalIterator __m = __first; 33833e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3384ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 33853e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 33863e519524SHoward Hinnant // F????????????????T 33873e519524SHoward Hinnant // f m l 33883e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 33893e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 33903e519524SHoward Hinnant _Distance __len_half = __len2; 33913e519524SHoward Hinnant while (!__pred(*--__m1)) 33923e519524SHoward Hinnant { 33933e519524SHoward Hinnant if (__m1 == __first) 33943e519524SHoward Hinnant goto __first_half_done; 33953e519524SHoward Hinnant --__len_half; 33963e519524SHoward Hinnant } 33973e519524SHoward Hinnant // F???TFFF?????????T 33983e519524SHoward Hinnant // f m1 m l 33993e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 34003e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 34013e519524SHoward Hinnant__first_half_done: 34023e519524SHoward Hinnant // TTTFFFFF?????????T 34033e519524SHoward Hinnant // f ff m l 34043e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 34053e519524SHoward Hinnant __m1 = __m; 34063e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 34073e519524SHoward Hinnant ++__second_false; 34083e519524SHoward Hinnant __len_half = __len - __len2; 34093e519524SHoward Hinnant while (__pred(*__m1)) 34103e519524SHoward Hinnant { 34113e519524SHoward Hinnant if (++__m1 == __last) 34123e519524SHoward Hinnant goto __second_half_done; 34133e519524SHoward Hinnant --__len_half; 34143e519524SHoward Hinnant } 34153e519524SHoward Hinnant // TTTFFFFFTTTF?????T 34163e519524SHoward Hinnant // f ff m m1 l 34173e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 34183e519524SHoward Hinnant__second_half_done: 34193e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 34203e519524SHoward Hinnant // f ff m sf l 3421ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 34223e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 34233e519524SHoward Hinnant // | 34243e519524SHoward Hinnant} 34253e519524SHoward Hinnant 34263e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 34273e519524SHoward Hinnant_BidirectionalIterator 34283e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34293e519524SHoward Hinnant bidirectional_iterator_tag) 34303e519524SHoward Hinnant{ 34313e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 34323e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 34333e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 34343e519524SHoward Hinnant // Either prove all true and return __first or point to first false 34353e519524SHoward Hinnant while (true) 34363e519524SHoward Hinnant { 34373e519524SHoward Hinnant if (__first == __last) 34383e519524SHoward Hinnant return __first; 34393e519524SHoward Hinnant if (!__pred(*__first)) 34403e519524SHoward Hinnant break; 34413e519524SHoward Hinnant ++__first; 34423e519524SHoward Hinnant } 34433e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 34443e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 34453e519524SHoward Hinnant do 34463e519524SHoward Hinnant { 34473e519524SHoward Hinnant if (__first == --__last) 34483e519524SHoward Hinnant return __first; 34493e519524SHoward Hinnant } while (!__pred(*__last)); 34503e519524SHoward Hinnant // We now have a reduced range [__first, __last] 34513e519524SHoward Hinnant // *__first is known to be false 34523e519524SHoward Hinnant // *__last is known to be true 34533e519524SHoward Hinnant // __len >= 2 3454ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 34553e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 34563e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 34573e519524SHoward Hinnant if (__len >= __alloc_limit) 34583e519524SHoward Hinnant { 3459ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 34603e519524SHoward Hinnant __h.reset(__p.first); 34613e519524SHoward Hinnant } 34623e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 34633e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 34643e519524SHoward Hinnant} 34653e519524SHoward Hinnant 34663e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 34673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 34683e519524SHoward Hinnant_ForwardIterator 34693e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 34703e519524SHoward Hinnant{ 34713e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 34723e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 34733e519524SHoward Hinnant} 34743e519524SHoward Hinnant 34753e519524SHoward Hinnant// is_sorted_until 34763e519524SHoward Hinnant 34773e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 34783e519524SHoward Hinnant_ForwardIterator 34793e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 34803e519524SHoward Hinnant{ 34813e519524SHoward Hinnant if (__first != __last) 34823e519524SHoward Hinnant { 34833e519524SHoward Hinnant _ForwardIterator __i = __first; 34843e519524SHoward Hinnant while (++__i != __last) 34853e519524SHoward Hinnant { 34863e519524SHoward Hinnant if (__comp(*__i, *__first)) 34873e519524SHoward Hinnant return __i; 34883e519524SHoward Hinnant __first = __i; 34893e519524SHoward Hinnant } 34903e519524SHoward Hinnant } 34913e519524SHoward Hinnant return __last; 34923e519524SHoward Hinnant} 34933e519524SHoward Hinnant 34943e519524SHoward Hinnanttemplate<class _ForwardIterator> 34953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 34963e519524SHoward Hinnant_ForwardIterator 34973e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 34983e519524SHoward Hinnant{ 3499ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35003e519524SHoward Hinnant} 35013e519524SHoward Hinnant 35023e519524SHoward Hinnant// is_sorted 35033e519524SHoward Hinnant 35043e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 35053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35063e519524SHoward Hinnantbool 35073e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35083e519524SHoward Hinnant{ 3509ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 35103e519524SHoward Hinnant} 35113e519524SHoward Hinnant 35123e519524SHoward Hinnanttemplate<class _ForwardIterator> 35133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35143e519524SHoward Hinnantbool 35153e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 35163e519524SHoward Hinnant{ 3517ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35183e519524SHoward Hinnant} 35193e519524SHoward Hinnant 35203e519524SHoward Hinnant// sort 35213e519524SHoward Hinnant 35223e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 35233e519524SHoward Hinnant 35243e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 35253e519524SHoward Hinnantunsigned 35263e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 35273e519524SHoward Hinnant{ 35283e519524SHoward Hinnant unsigned __r = 0; 35293e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 35303e519524SHoward Hinnant { 35313e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 35323e519524SHoward Hinnant return __r; // x <= y && y <= z 35333e519524SHoward Hinnant // x <= y && y > z 35343e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 35353e519524SHoward Hinnant __r = 1; 35363e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 35373e519524SHoward Hinnant { 35383e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 35393e519524SHoward Hinnant __r = 2; 35403e519524SHoward Hinnant } 35413e519524SHoward Hinnant return __r; // x <= y && y < z 35423e519524SHoward Hinnant } 35433e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 35443e519524SHoward Hinnant { 35453e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 35463e519524SHoward Hinnant __r = 1; 35473e519524SHoward Hinnant return __r; 35483e519524SHoward Hinnant } 35493e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 35503e519524SHoward Hinnant __r = 1; // x < y && x <= z 35513e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 35523e519524SHoward Hinnant { 35533e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 35543e519524SHoward Hinnant __r = 2; 35553e519524SHoward Hinnant } 35563e519524SHoward Hinnant return __r; 35573e519524SHoward Hinnant} // x <= y && y <= z 35583e519524SHoward Hinnant 35593e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 35603e519524SHoward Hinnant 35613e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 35623e519524SHoward Hinnantunsigned 35633e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 35643e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 35653e519524SHoward Hinnant{ 35663e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 35673e519524SHoward Hinnant if (__c(*__x4, *__x3)) 35683e519524SHoward Hinnant { 35693e519524SHoward Hinnant swap(*__x3, *__x4); 35703e519524SHoward Hinnant ++__r; 35713e519524SHoward Hinnant if (__c(*__x3, *__x2)) 35723e519524SHoward Hinnant { 35733e519524SHoward Hinnant swap(*__x2, *__x3); 35743e519524SHoward Hinnant ++__r; 35753e519524SHoward Hinnant if (__c(*__x2, *__x1)) 35763e519524SHoward Hinnant { 35773e519524SHoward Hinnant swap(*__x1, *__x2); 35783e519524SHoward Hinnant ++__r; 35793e519524SHoward Hinnant } 35803e519524SHoward Hinnant } 35813e519524SHoward Hinnant } 35823e519524SHoward Hinnant return __r; 35833e519524SHoward Hinnant} 35843e519524SHoward Hinnant 35853e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 35863e519524SHoward Hinnant 35873e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 35883e519524SHoward Hinnantunsigned 35893e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 35903e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 35913e519524SHoward Hinnant{ 35923e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 35933e519524SHoward Hinnant if (__c(*__x5, *__x4)) 35943e519524SHoward Hinnant { 35953e519524SHoward Hinnant swap(*__x4, *__x5); 35963e519524SHoward Hinnant ++__r; 35973e519524SHoward Hinnant if (__c(*__x4, *__x3)) 35983e519524SHoward Hinnant { 35993e519524SHoward Hinnant swap(*__x3, *__x4); 36003e519524SHoward Hinnant ++__r; 36013e519524SHoward Hinnant if (__c(*__x3, *__x2)) 36023e519524SHoward Hinnant { 36033e519524SHoward Hinnant swap(*__x2, *__x3); 36043e519524SHoward Hinnant ++__r; 36053e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36063e519524SHoward Hinnant { 36073e519524SHoward Hinnant swap(*__x1, *__x2); 36083e519524SHoward Hinnant ++__r; 36093e519524SHoward Hinnant } 36103e519524SHoward Hinnant } 36113e519524SHoward Hinnant } 36123e519524SHoward Hinnant } 36133e519524SHoward Hinnant return __r; 36143e519524SHoward Hinnant} 36153e519524SHoward Hinnant 36163e519524SHoward Hinnant// Assumes size > 0 36173e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36183e519524SHoward Hinnantvoid 36193e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36203e519524SHoward Hinnant{ 36213e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 36223e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 36233e519524SHoward Hinnant { 3624ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 36253e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 36263e519524SHoward Hinnant (__first, __last, __comp); 36273e519524SHoward Hinnant if (__i != __first) 36283e519524SHoward Hinnant swap(*__first, *__i); 36293e519524SHoward Hinnant } 36303e519524SHoward Hinnant} 36313e519524SHoward Hinnant 36323e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36333e519524SHoward Hinnantvoid 36343e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36353e519524SHoward Hinnant{ 36363e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 36373e519524SHoward Hinnant if (__first != __last) 36383e519524SHoward Hinnant { 36393e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 36403e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 36413e519524SHoward Hinnant { 36423e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3643ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 36443e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3645ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3646ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 36473e519524SHoward Hinnant } 36483e519524SHoward Hinnant } 36493e519524SHoward Hinnant} 36503e519524SHoward Hinnant 36513e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 36523e519524SHoward Hinnantvoid 36533e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 36543e519524SHoward Hinnant{ 36553e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 36563e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 36573e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 36583e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 36593e519524SHoward Hinnant { 36603e519524SHoward Hinnant if (__comp(*__i, *__j)) 36613e519524SHoward Hinnant { 3662ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 36633e519524SHoward Hinnant _RandomAccessIterator __k = __j; 36643e519524SHoward Hinnant __j = __i; 36653e519524SHoward Hinnant do 36663e519524SHoward Hinnant { 3667ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 36683e519524SHoward Hinnant __j = __k; 36693e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3670ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 36713e519524SHoward Hinnant } 36723e519524SHoward Hinnant __j = __i; 36733e519524SHoward Hinnant } 36743e519524SHoward Hinnant} 36753e519524SHoward Hinnant 36763e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 36773e519524SHoward Hinnantbool 36783e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 36793e519524SHoward Hinnant{ 36803e519524SHoward Hinnant switch (__last - __first) 36813e519524SHoward Hinnant { 36823e519524SHoward Hinnant case 0: 36833e519524SHoward Hinnant case 1: 36843e519524SHoward Hinnant return true; 36853e519524SHoward Hinnant case 2: 36863e519524SHoward Hinnant if (__comp(*--__last, *__first)) 36873e519524SHoward Hinnant swap(*__first, *__last); 36883e519524SHoward Hinnant return true; 36893e519524SHoward Hinnant case 3: 3690ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 36913e519524SHoward Hinnant return true; 36923e519524SHoward Hinnant case 4: 3693ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 36943e519524SHoward Hinnant return true; 36953e519524SHoward Hinnant case 5: 3696ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 36973e519524SHoward Hinnant return true; 36983e519524SHoward Hinnant } 36993e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37003e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37013e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37023e519524SHoward Hinnant const unsigned __limit = 8; 37033e519524SHoward Hinnant unsigned __count = 0; 37043e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37053e519524SHoward Hinnant { 37063e519524SHoward Hinnant if (__comp(*__i, *__j)) 37073e519524SHoward Hinnant { 3708ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37093e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37103e519524SHoward Hinnant __j = __i; 37113e519524SHoward Hinnant do 37123e519524SHoward Hinnant { 3713ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37143e519524SHoward Hinnant __j = __k; 37153e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3716ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37173e519524SHoward Hinnant if (++__count == __limit) 37183e519524SHoward Hinnant return ++__i == __last; 37193e519524SHoward Hinnant } 37203e519524SHoward Hinnant __j = __i; 37213e519524SHoward Hinnant } 37223e519524SHoward Hinnant return true; 37233e519524SHoward Hinnant} 37243e519524SHoward Hinnant 37253e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37263e519524SHoward Hinnantvoid 37273e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 37283e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 37293e519524SHoward Hinnant{ 37303e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 37313e519524SHoward Hinnant if (__first1 != __last1) 37323e519524SHoward Hinnant { 37333e519524SHoward Hinnant __destruct_n __d(0); 37343e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 37353e519524SHoward Hinnant value_type* __last2 = __first2; 3736ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 37373e519524SHoward Hinnant __d.__incr((value_type*)0); 37383e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 37393e519524SHoward Hinnant { 37403e519524SHoward Hinnant value_type* __j2 = __last2; 37413e519524SHoward Hinnant value_type* __i2 = __j2; 37423e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 37433e519524SHoward Hinnant { 3744ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 37453e519524SHoward Hinnant __d.__incr((value_type*)0); 37463e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3747ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3748ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 37493e519524SHoward Hinnant } 37503e519524SHoward Hinnant else 37513e519524SHoward Hinnant { 3752ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 37533e519524SHoward Hinnant __d.__incr((value_type*)0); 37543e519524SHoward Hinnant } 37553e519524SHoward Hinnant } 37563e519524SHoward Hinnant __h.release(); 37573e519524SHoward Hinnant } 37583e519524SHoward Hinnant} 37593e519524SHoward Hinnant 37603e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37613e519524SHoward Hinnantvoid 37623e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37633e519524SHoward Hinnant{ 37643e519524SHoward Hinnant // _Compare is known to be a reference type 37653e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 37663e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3767ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3768ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 37693e519524SHoward Hinnant while (true) 37703e519524SHoward Hinnant { 37713e519524SHoward Hinnant __restart: 37723e519524SHoward Hinnant difference_type __len = __last - __first; 37733e519524SHoward Hinnant switch (__len) 37743e519524SHoward Hinnant { 37753e519524SHoward Hinnant case 0: 37763e519524SHoward Hinnant case 1: 37773e519524SHoward Hinnant return; 37783e519524SHoward Hinnant case 2: 37793e519524SHoward Hinnant if (__comp(*--__last, *__first)) 37803e519524SHoward Hinnant swap(*__first, *__last); 37813e519524SHoward Hinnant return; 37823e519524SHoward Hinnant case 3: 3783ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 37843e519524SHoward Hinnant return; 37853e519524SHoward Hinnant case 4: 3786ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 37873e519524SHoward Hinnant return; 37883e519524SHoward Hinnant case 5: 3789ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 37903e519524SHoward Hinnant return; 37913e519524SHoward Hinnant } 37923e519524SHoward Hinnant if (__len <= __limit) 37933e519524SHoward Hinnant { 3794ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 37953e519524SHoward Hinnant return; 37963e519524SHoward Hinnant } 37973e519524SHoward Hinnant // __len > 5 37983e519524SHoward Hinnant _RandomAccessIterator __m = __first; 37993e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 38003e519524SHoward Hinnant --__lm1; 38013e519524SHoward Hinnant unsigned __n_swaps; 38023e519524SHoward Hinnant { 38033e519524SHoward Hinnant difference_type __delta; 38043e519524SHoward Hinnant if (__len >= 1000) 38053e519524SHoward Hinnant { 38063e519524SHoward Hinnant __delta = __len/2; 38073e519524SHoward Hinnant __m += __delta; 38083e519524SHoward Hinnant __delta /= 2; 3809ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 38103e519524SHoward Hinnant } 38113e519524SHoward Hinnant else 38123e519524SHoward Hinnant { 38133e519524SHoward Hinnant __delta = __len/2; 38143e519524SHoward Hinnant __m += __delta; 3815ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 38163e519524SHoward Hinnant } 38173e519524SHoward Hinnant } 38183e519524SHoward Hinnant // *__m is median 38193e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 38203e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 38213e519524SHoward Hinnant _RandomAccessIterator __i = __first; 38223e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 38233e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 38243e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 38253e519524SHoward Hinnant // Prime the downward search with a guard. 38263e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 38273e519524SHoward Hinnant { 38283e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 38293e519524SHoward Hinnant // manually guard downward moving __j against __i 38303e519524SHoward Hinnant while (true) 38313e519524SHoward Hinnant { 38323e519524SHoward Hinnant if (__i == --__j) 38333e519524SHoward Hinnant { 38343e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 38353e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 38363e519524SHoward Hinnant ++__i; // __first + 1 38373e519524SHoward Hinnant __j = __last; 38383e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 38393e519524SHoward Hinnant { 38403e519524SHoward Hinnant while (true) 38413e519524SHoward Hinnant { 38423e519524SHoward Hinnant if (__i == __j) 38433e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 38443e519524SHoward Hinnant if (__comp(*__first, *__i)) 38453e519524SHoward Hinnant { 38463e519524SHoward Hinnant swap(*__i, *__j); 38473e519524SHoward Hinnant ++__n_swaps; 38483e519524SHoward Hinnant ++__i; 38493e519524SHoward Hinnant break; 38503e519524SHoward Hinnant } 38513e519524SHoward Hinnant ++__i; 38523e519524SHoward Hinnant } 38533e519524SHoward Hinnant } 38543e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 38553e519524SHoward Hinnant if (__i == __j) 38563e519524SHoward Hinnant return; 38573e519524SHoward Hinnant while (true) 38583e519524SHoward Hinnant { 38593e519524SHoward Hinnant while (!__comp(*__first, *__i)) 38603e519524SHoward Hinnant ++__i; 38613e519524SHoward Hinnant while (__comp(*__first, *--__j)) 38623e519524SHoward Hinnant ; 38633e519524SHoward Hinnant if (__i >= __j) 38643e519524SHoward Hinnant break; 38653e519524SHoward Hinnant swap(*__i, *__j); 38663e519524SHoward Hinnant ++__n_swaps; 38673e519524SHoward Hinnant ++__i; 38683e519524SHoward Hinnant } 38693e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 38703e519524SHoward Hinnant // The first part is sorted, sort the secod part 3871ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 38723e519524SHoward Hinnant __first = __i; 38733e519524SHoward Hinnant goto __restart; 38743e519524SHoward Hinnant } 38753e519524SHoward Hinnant if (__comp(*__j, *__m)) 38763e519524SHoward Hinnant { 38773e519524SHoward Hinnant swap(*__i, *__j); 38783e519524SHoward Hinnant ++__n_swaps; 38793e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 38803e519524SHoward Hinnant } 38813e519524SHoward Hinnant } 38823e519524SHoward Hinnant } 38833e519524SHoward Hinnant // It is known that *__i < *__m 38843e519524SHoward Hinnant ++__i; 38853e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 38863e519524SHoward Hinnant // if not yet partitioned... 38873e519524SHoward Hinnant if (__i < __j) 38883e519524SHoward Hinnant { 38893e519524SHoward Hinnant // known that *(__i - 1) < *__m 38903e519524SHoward Hinnant // known that __i <= __m 38913e519524SHoward Hinnant while (true) 38923e519524SHoward Hinnant { 38933e519524SHoward Hinnant // __m still guards upward moving __i 38943e519524SHoward Hinnant while (__comp(*__i, *__m)) 38953e519524SHoward Hinnant ++__i; 38963e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 38973e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 38983e519524SHoward Hinnant ; 38993e519524SHoward Hinnant if (__i > __j) 39003e519524SHoward Hinnant break; 39013e519524SHoward Hinnant swap(*__i, *__j); 39023e519524SHoward Hinnant ++__n_swaps; 39033e519524SHoward Hinnant // It is known that __m != __j 39043e519524SHoward Hinnant // If __m just moved, follow it 39053e519524SHoward Hinnant if (__m == __i) 39063e519524SHoward Hinnant __m = __j; 39073e519524SHoward Hinnant ++__i; 39083e519524SHoward Hinnant } 39093e519524SHoward Hinnant } 39103e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 39113e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 39123e519524SHoward Hinnant { 39133e519524SHoward Hinnant swap(*__i, *__m); 39143e519524SHoward Hinnant ++__n_swaps; 39153e519524SHoward Hinnant } 39163e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 39173e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 39183e519524SHoward Hinnant if (__n_swaps == 0) 39193e519524SHoward Hinnant { 3920ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 3921ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 39223e519524SHoward Hinnant { 39233e519524SHoward Hinnant if (__fs) 39243e519524SHoward Hinnant return; 39253e519524SHoward Hinnant __last = __i; 39263e519524SHoward Hinnant continue; 39273e519524SHoward Hinnant } 39283e519524SHoward Hinnant else 39293e519524SHoward Hinnant { 39303e519524SHoward Hinnant if (__fs) 39313e519524SHoward Hinnant { 39323e519524SHoward Hinnant __first = ++__i; 39333e519524SHoward Hinnant continue; 39343e519524SHoward Hinnant } 39353e519524SHoward Hinnant } 39363e519524SHoward Hinnant } 39373e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 39383e519524SHoward Hinnant if (__i - __first < __last - __i) 39393e519524SHoward Hinnant { 3940ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 3941ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 39423e519524SHoward Hinnant __first = ++__i; 39433e519524SHoward Hinnant } 39443e519524SHoward Hinnant else 39453e519524SHoward Hinnant { 3946ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 3947ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 39483e519524SHoward Hinnant __last = __i; 39493e519524SHoward Hinnant } 39503e519524SHoward Hinnant } 39513e519524SHoward Hinnant} 39523e519524SHoward Hinnant 39533e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 39543e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 39553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39563e519524SHoward Hinnantvoid 39573e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39583e519524SHoward Hinnant{ 3959145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 39603e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 39613e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 39623e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 3963145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 39643e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 39653e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 3966145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 39673e519524SHoward Hinnant} 39683e519524SHoward Hinnant 39693e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 39703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39713e519524SHoward Hinnantvoid 39723e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 39733e519524SHoward Hinnant{ 3974ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 39753e519524SHoward Hinnant} 39763e519524SHoward Hinnant 39773e519524SHoward Hinnanttemplate <class _Tp> 39783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39793e519524SHoward Hinnantvoid 39803e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 39813e519524SHoward Hinnant{ 3982ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 39833e519524SHoward Hinnant} 39843e519524SHoward Hinnant 39853e519524SHoward Hinnanttemplate <class _Tp> 39863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39873e519524SHoward Hinnantvoid 39883e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 39893e519524SHoward Hinnant{ 3990ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 39913e519524SHoward Hinnant} 39923e519524SHoward Hinnant 3993f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 3994f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 3995f554add5SHoward Hinnantvoid 3996f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 3997f554add5SHoward Hinnant{ 3998f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 3999f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4000f554add5SHoward Hinnant} 4001f554add5SHoward Hinnant 40020be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4003e4383379SHoward Hinnant#pragma warning( push ) 4004e4383379SHoward Hinnant#pragma warning( disable: 4231) 40050be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 4006f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4007f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4008f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4009f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4010f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4011f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4012f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4013f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4014f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4015f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4016f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4017f0544c20SHoward 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>&)) 4018f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4019f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4020f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40213e519524SHoward Hinnant 4022f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4023f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4024f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4025f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4026f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4027f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4028f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4029f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4030f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4031f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4032f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4033f0544c20SHoward 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>&)) 4034f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4035f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4036f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40373e519524SHoward Hinnant 4038f0544c20SHoward 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>&)) 40390be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4040e4383379SHoward Hinnant#pragma warning( pop ) 40410be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 40423e519524SHoward Hinnant 40433e519524SHoward Hinnant// lower_bound 40443e519524SHoward Hinnant 40453e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 40463e519524SHoward Hinnant_ForwardIterator 4047e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 40483e519524SHoward Hinnant{ 40493e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4050ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 40513e519524SHoward Hinnant while (__len != 0) 40523e519524SHoward Hinnant { 40533e519524SHoward Hinnant difference_type __l2 = __len / 2; 40543e519524SHoward Hinnant _ForwardIterator __m = __first; 4055ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4056e4383379SHoward Hinnant if (__comp(*__m, __value_)) 40573e519524SHoward Hinnant { 40583e519524SHoward Hinnant __first = ++__m; 40593e519524SHoward Hinnant __len -= __l2 + 1; 40603e519524SHoward Hinnant } 40613e519524SHoward Hinnant else 40623e519524SHoward Hinnant __len = __l2; 40633e519524SHoward Hinnant } 40643e519524SHoward Hinnant return __first; 40653e519524SHoward Hinnant} 40663e519524SHoward Hinnant 40673e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 40683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40693e519524SHoward Hinnant_ForwardIterator 4070e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 40713e519524SHoward Hinnant{ 4072145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 40733e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 40743e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4075e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 4076145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 40773e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4078e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4079145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 40803e519524SHoward Hinnant} 40813e519524SHoward Hinnant 40823e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 40833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40843e519524SHoward Hinnant_ForwardIterator 4085e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 40863e519524SHoward Hinnant{ 4087e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 40883e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 40893e519524SHoward Hinnant} 40903e519524SHoward Hinnant 40913e519524SHoward Hinnant// upper_bound 40923e519524SHoward Hinnant 40933e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 40943e519524SHoward Hinnant_ForwardIterator 4095e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 40963e519524SHoward Hinnant{ 40973e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4098ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 40993e519524SHoward Hinnant while (__len != 0) 41003e519524SHoward Hinnant { 41013e519524SHoward Hinnant difference_type __l2 = __len / 2; 41023e519524SHoward Hinnant _ForwardIterator __m = __first; 4103ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4104e4383379SHoward Hinnant if (__comp(__value_, *__m)) 41053e519524SHoward Hinnant __len = __l2; 41063e519524SHoward Hinnant else 41073e519524SHoward Hinnant { 41083e519524SHoward Hinnant __first = ++__m; 41093e519524SHoward Hinnant __len -= __l2 + 1; 41103e519524SHoward Hinnant } 41113e519524SHoward Hinnant } 41123e519524SHoward Hinnant return __first; 41133e519524SHoward Hinnant} 41143e519524SHoward Hinnant 41153e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41173e519524SHoward Hinnant_ForwardIterator 4118e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41193e519524SHoward Hinnant{ 4120145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41213e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41223e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4123e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 4124145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 41253e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4126e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4127145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 41283e519524SHoward Hinnant} 41293e519524SHoward Hinnant 41303e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 41313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41323e519524SHoward Hinnant_ForwardIterator 4133e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41343e519524SHoward Hinnant{ 4135e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 41363e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 41373e519524SHoward Hinnant} 41383e519524SHoward Hinnant 41393e519524SHoward Hinnant// equal_range 41403e519524SHoward Hinnant 41413e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41423e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4143e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41443e519524SHoward Hinnant{ 41453e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4146ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41473e519524SHoward Hinnant while (__len != 0) 41483e519524SHoward Hinnant { 41493e519524SHoward Hinnant difference_type __l2 = __len / 2; 41503e519524SHoward Hinnant _ForwardIterator __m = __first; 4151ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4152e4383379SHoward Hinnant if (__comp(*__m, __value_)) 41533e519524SHoward Hinnant { 41543e519524SHoward Hinnant __first = ++__m; 41553e519524SHoward Hinnant __len -= __l2 + 1; 41563e519524SHoward Hinnant } 4157e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 41583e519524SHoward Hinnant { 41593e519524SHoward Hinnant __last = __m; 41603e519524SHoward Hinnant __len = __l2; 41613e519524SHoward Hinnant } 41623e519524SHoward Hinnant else 41633e519524SHoward Hinnant { 41643e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 41653e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 41663e519524SHoward Hinnant ( 4167e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4168e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 41693e519524SHoward Hinnant ); 41703e519524SHoward Hinnant } 41713e519524SHoward Hinnant } 41723e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 41733e519524SHoward Hinnant} 41743e519524SHoward Hinnant 41753e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41773e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4178e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41793e519524SHoward Hinnant{ 4180145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41813e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41823e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4183e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4184145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 41853e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4186e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4187145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 41883e519524SHoward Hinnant} 41893e519524SHoward Hinnant 41903e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 41913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41923e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4193e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41943e519524SHoward Hinnant{ 4195e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 41963e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 41973e519524SHoward Hinnant} 41983e519524SHoward Hinnant 41993e519524SHoward Hinnant// binary_search 42003e519524SHoward Hinnant 42013e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42033e519524SHoward Hinnantbool 4204e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42053e519524SHoward Hinnant{ 4206e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4207e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 42083e519524SHoward Hinnant} 42093e519524SHoward Hinnant 42103e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42123e519524SHoward Hinnantbool 4213e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42143e519524SHoward Hinnant{ 4215145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42163e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42173e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4218e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4219145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42203e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4221e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4222145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42233e519524SHoward Hinnant} 42243e519524SHoward Hinnant 42253e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42273e519524SHoward Hinnantbool 4228e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42293e519524SHoward Hinnant{ 4230e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 42313e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42323e519524SHoward Hinnant} 42333e519524SHoward Hinnant 42343e519524SHoward Hinnant// merge 42353e519524SHoward Hinnant 42363e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 42373e519524SHoward Hinnant_OutputIterator 42383e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 42393e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 42403e519524SHoward Hinnant{ 42413e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 42423e519524SHoward Hinnant { 42433e519524SHoward Hinnant if (__first2 == __last2) 4244ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 42453e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 42463e519524SHoward Hinnant { 42473e519524SHoward Hinnant *__result = *__first2; 42483e519524SHoward Hinnant ++__first2; 42493e519524SHoward Hinnant } 42503e519524SHoward Hinnant else 42513e519524SHoward Hinnant { 42523e519524SHoward Hinnant *__result = *__first1; 42533e519524SHoward Hinnant ++__first1; 42543e519524SHoward Hinnant } 42553e519524SHoward Hinnant } 4256ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 42573e519524SHoward Hinnant} 42583e519524SHoward Hinnant 42593e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 42603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42613e519524SHoward Hinnant_OutputIterator 42623e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 42633e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 42643e519524SHoward Hinnant{ 4265145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42663e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42673e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4268ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4269145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42703e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4271ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4272145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42733e519524SHoward Hinnant} 42743e519524SHoward Hinnant 42753e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 42763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42773e519524SHoward Hinnant_OutputIterator 42783e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 42793e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 42803e519524SHoward Hinnant{ 42813e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 42823e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 42833e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 42843e519524SHoward Hinnant} 42853e519524SHoward Hinnant 42863e519524SHoward Hinnant// inplace_merge 42873e519524SHoward Hinnant 42883e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 42893e519524SHoward Hinnantvoid 42903e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 42913e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 42923e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 42933e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 42943e519524SHoward Hinnant{ 42953e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 42963e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 42973e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::pointer pointer; 42983e519524SHoward Hinnant __destruct_n __d(0); 42993e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 43003e519524SHoward Hinnant if (__len1 <= __len2) 43013e519524SHoward Hinnant { 43023e519524SHoward Hinnant value_type* __p = __buff; 43033e519524SHoward Hinnant for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), ++__i, ++__p) 4304ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 43053e519524SHoward Hinnant __merge<_Compare>(move_iterator<value_type*>(__buff), 43063e519524SHoward Hinnant move_iterator<value_type*>(__p), 43073e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__middle), 43083e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__last), 43093e519524SHoward Hinnant __first, __comp); 43103e519524SHoward Hinnant } 43113e519524SHoward Hinnant else 43123e519524SHoward Hinnant { 43133e519524SHoward Hinnant value_type* __p = __buff; 43143e519524SHoward Hinnant for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), ++__i, ++__p) 4315ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 43163e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 43173e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 43183e519524SHoward Hinnant __merge(move_iterator<_RBi>(_RBi(__middle)), move_iterator<_RBi>(_RBi(__first)), 43193e519524SHoward Hinnant move_iterator<_Rv>(_Rv(__p)), move_iterator<_Rv>(_Rv(__buff)), 43203e519524SHoward Hinnant _RBi(__last), __negate<_Compare>(__comp)); 43213e519524SHoward Hinnant } 43223e519524SHoward Hinnant} 43233e519524SHoward Hinnant 43243e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 43253e519524SHoward Hinnantvoid 43263e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 43273e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 43283e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 43293e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 43303e519524SHoward Hinnant{ 43313e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 43323e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 43333e519524SHoward Hinnant while (true) 43343e519524SHoward Hinnant { 43353e519524SHoward Hinnant // if __middle == __last, we're done 43363e519524SHoward Hinnant if (__len2 == 0) 43373e519524SHoward Hinnant return; 43383e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 43393e519524SHoward Hinnant for (; true; ++__first, --__len1) 43403e519524SHoward Hinnant { 43413e519524SHoward Hinnant if (__len1 == 0) 43423e519524SHoward Hinnant return; 43433e519524SHoward Hinnant if (__comp(*__middle, *__first)) 43443e519524SHoward Hinnant break; 43453e519524SHoward Hinnant } 43463e519524SHoward Hinnant if (__len1 <= __buff_size || __len2 <= __buff_size) 43473e519524SHoward Hinnant { 43483e519524SHoward Hinnant __buffered_inplace_merge<_Compare>(__first, __middle, __last, __comp, __len1, __len2, __buff); 43493e519524SHoward Hinnant return; 43503e519524SHoward Hinnant } 43513e519524SHoward Hinnant // __first < __middle < __last 43523e519524SHoward Hinnant // *__first > *__middle 43533e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 43543e519524SHoward Hinnant // all elements in: 43553e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 43563e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 43573e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 43583e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 43593e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 43603e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 43613e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 43623e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 43633e519524SHoward Hinnant // binary search smaller range 43643e519524SHoward Hinnant if (__len1 < __len2) 43653e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 43663e519524SHoward Hinnant __len21 = __len2 / 2; 43673e519524SHoward Hinnant __m2 = __middle; 4368ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 43693e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4370ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 43713e519524SHoward Hinnant } 43723e519524SHoward Hinnant else 43733e519524SHoward Hinnant { 43743e519524SHoward Hinnant if (__len1 == 1) 43753e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 43763e519524SHoward Hinnant // It is known *__first > *__middle 43773e519524SHoward Hinnant swap(*__first, *__middle); 43783e519524SHoward Hinnant return; 43793e519524SHoward Hinnant } 43803e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 43813e519524SHoward Hinnant __len11 = __len1 / 2; 43823e519524SHoward Hinnant __m1 = __first; 4383ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 43843e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4385ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 43863e519524SHoward Hinnant } 43873e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 43883e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 43893e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 43903e519524SHoward Hinnant // swap middle two partitions 4391ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 43923e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 43933e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 43943e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 43953e519524SHoward Hinnant { 43963e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 43973e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 43983e519524SHoward Hinnant __first = __middle; 43993e519524SHoward Hinnant __middle = __m2; 44003e519524SHoward Hinnant __len1 = __len12; 44013e519524SHoward Hinnant __len2 = __len22; 44023e519524SHoward Hinnant } 44033e519524SHoward Hinnant else 44043e519524SHoward Hinnant { 44053e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 44063e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 44073e519524SHoward Hinnant __last = __middle; 44083e519524SHoward Hinnant __middle = __m1; 44093e519524SHoward Hinnant __len1 = __len11; 44103e519524SHoward Hinnant __len2 = __len21; 44113e519524SHoward Hinnant } 44123e519524SHoward Hinnant } 44133e519524SHoward Hinnant} 44143e519524SHoward Hinnant 44153e519524SHoward Hinnanttemplate <class _Tp> 44163e519524SHoward Hinnantstruct __inplace_merge_switch 44173e519524SHoward Hinnant{ 4418ca740483SHoward Hinnant static const unsigned value = is_trivially_copy_assignable<_Tp>::value; 44193e519524SHoward Hinnant}; 44203e519524SHoward Hinnant 44213e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 44223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44233e519524SHoward Hinnantvoid 44243e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44253e519524SHoward Hinnant _Compare __comp) 44263e519524SHoward Hinnant{ 44273e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 44283e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4429ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4430ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4431ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 44323e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 44333e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 44343e519524SHoward Hinnant if (__inplace_merge_switch<value_type>::value && __buf_size > 8) 44353e519524SHoward Hinnant { 4436ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 44373e519524SHoward Hinnant __h.reset(__buf.first); 44383e519524SHoward Hinnant } 4439145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44403e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44413e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4442ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 44433e519524SHoward Hinnant __buf.first, __buf.second); 4444145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 44453e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4446ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 44473e519524SHoward Hinnant __buf.first, __buf.second); 4448145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 44493e519524SHoward Hinnant} 44503e519524SHoward Hinnant 44513e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 44523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44533e519524SHoward Hinnantvoid 44543e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 44553e519524SHoward Hinnant{ 4456ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 44573e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 44583e519524SHoward Hinnant} 44593e519524SHoward Hinnant 44603e519524SHoward Hinnant// stable_sort 44613e519524SHoward Hinnant 44623e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 44633e519524SHoward Hinnantvoid 44643e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 44653e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 44663e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 44673e519524SHoward Hinnant{ 44683e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 44693e519524SHoward Hinnant __destruct_n __d(0); 44703e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 44713e519524SHoward Hinnant for (; true; ++__result) 44723e519524SHoward Hinnant { 44733e519524SHoward Hinnant if (__first1 == __last1) 44743e519524SHoward Hinnant { 44753e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4476ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 44773e519524SHoward Hinnant __h.release(); 44783e519524SHoward Hinnant return; 44793e519524SHoward Hinnant } 44803e519524SHoward Hinnant if (__first2 == __last2) 44813e519524SHoward Hinnant { 44823e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4483ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 44843e519524SHoward Hinnant __h.release(); 44853e519524SHoward Hinnant return; 44863e519524SHoward Hinnant } 44873e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 44883e519524SHoward Hinnant { 4489ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 44903e519524SHoward Hinnant __d.__incr((value_type*)0); 44913e519524SHoward Hinnant ++__first2; 44923e519524SHoward Hinnant } 44933e519524SHoward Hinnant else 44943e519524SHoward Hinnant { 4495ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 44963e519524SHoward Hinnant __d.__incr((value_type*)0); 44973e519524SHoward Hinnant ++__first1; 44983e519524SHoward Hinnant } 44993e519524SHoward Hinnant } 45003e519524SHoward Hinnant} 45013e519524SHoward Hinnant 45023e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 45033e519524SHoward Hinnantvoid 45043e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 45053e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45063e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 45073e519524SHoward Hinnant{ 45083e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 45093e519524SHoward Hinnant { 45103e519524SHoward Hinnant if (__first2 == __last2) 45113e519524SHoward Hinnant { 45123e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4513ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45143e519524SHoward Hinnant return; 45153e519524SHoward Hinnant } 45163e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45173e519524SHoward Hinnant { 4518ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45193e519524SHoward Hinnant ++__first2; 45203e519524SHoward Hinnant } 45213e519524SHoward Hinnant else 45223e519524SHoward Hinnant { 4523ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45243e519524SHoward Hinnant ++__first1; 45253e519524SHoward Hinnant } 45263e519524SHoward Hinnant } 45273e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4528ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45293e519524SHoward Hinnant} 45303e519524SHoward Hinnant 45313e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45323e519524SHoward Hinnantvoid 45333e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 45343e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45353e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 45363e519524SHoward Hinnant 45373e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45383e519524SHoward Hinnantvoid 45393e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 45403e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45413e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 45423e519524SHoward Hinnant{ 45433e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 45443e519524SHoward Hinnant switch (__len) 45453e519524SHoward Hinnant { 45463e519524SHoward Hinnant case 0: 45473e519524SHoward Hinnant return; 45483e519524SHoward Hinnant case 1: 4549ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 45503e519524SHoward Hinnant return; 45513e519524SHoward Hinnant case 2: 45523e519524SHoward Hinnant __destruct_n __d(0); 45533e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 45543e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 45553e519524SHoward Hinnant { 4556ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 45573e519524SHoward Hinnant __d.__incr((value_type*)0); 45583e519524SHoward Hinnant ++__first2; 4559ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 45603e519524SHoward Hinnant } 45613e519524SHoward Hinnant else 45623e519524SHoward Hinnant { 4563ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 45643e519524SHoward Hinnant __d.__incr((value_type*)0); 45653e519524SHoward Hinnant ++__first2; 4566ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 45673e519524SHoward Hinnant } 45683e519524SHoward Hinnant __h2.release(); 45693e519524SHoward Hinnant return; 45703e519524SHoward Hinnant } 45713e519524SHoward Hinnant if (__len <= 8) 45723e519524SHoward Hinnant { 45733e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 45743e519524SHoward Hinnant return; 45753e519524SHoward Hinnant } 45763e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 45773e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 45783e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 45793e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 45803e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 45813e519524SHoward Hinnant} 45823e519524SHoward Hinnant 45833e519524SHoward Hinnanttemplate <class _Tp> 45843e519524SHoward Hinnantstruct __stable_sort_switch 45853e519524SHoward Hinnant{ 4586ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 45873e519524SHoward Hinnant}; 45883e519524SHoward Hinnant 45893e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45903e519524SHoward Hinnantvoid 45913e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 45923e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45933e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 45943e519524SHoward Hinnant{ 45953e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 45963e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 45973e519524SHoward Hinnant switch (__len) 45983e519524SHoward Hinnant { 45993e519524SHoward Hinnant case 0: 46003e519524SHoward Hinnant case 1: 46013e519524SHoward Hinnant return; 46023e519524SHoward Hinnant case 2: 46033e519524SHoward Hinnant if (__comp(*--__last, *__first)) 46043e519524SHoward Hinnant swap(*__first, *__last); 46053e519524SHoward Hinnant return; 46063e519524SHoward Hinnant } 46073e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 46083e519524SHoward Hinnant { 46093e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 46103e519524SHoward Hinnant return; 46113e519524SHoward Hinnant } 46123e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46133e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 46143e519524SHoward Hinnant if (__len <= __buff_size) 46153e519524SHoward Hinnant { 46163e519524SHoward Hinnant __destruct_n __d(0); 46173e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 46183e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 46193e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 46203e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 46213e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 46223e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 46233e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 46243e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 46253e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 46263e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 46273e519524SHoward Hinnant// __first, __comp); 46283e519524SHoward Hinnant return; 46293e519524SHoward Hinnant } 46303e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 46313e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 46323e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 46333e519524SHoward Hinnant} 46343e519524SHoward Hinnant 46353e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 46363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46373e519524SHoward Hinnantvoid 46383e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 46393e519524SHoward Hinnant{ 46403e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46413e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46423e519524SHoward Hinnant difference_type __len = __last - __first; 46433e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 46443e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 46453e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 46463e519524SHoward Hinnant { 4647ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 46483e519524SHoward Hinnant __h.reset(__buf.first); 46493e519524SHoward Hinnant } 4650145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 46513e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46523e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 46533e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4654145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 46553e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 46563e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4657145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 46583e519524SHoward Hinnant} 46593e519524SHoward Hinnant 46603e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 46613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46623e519524SHoward Hinnantvoid 46633e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 46643e519524SHoward Hinnant{ 4665ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 46663e519524SHoward Hinnant} 46673e519524SHoward Hinnant 46683e519524SHoward Hinnant// is_heap_until 46693e519524SHoward Hinnant 46703e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 46713e519524SHoward Hinnant_RandomAccessIterator 46723e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 46733e519524SHoward Hinnant{ 4674ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46753e519524SHoward Hinnant difference_type __len = __last - __first; 46763e519524SHoward Hinnant difference_type __p = 0; 46773e519524SHoward Hinnant difference_type __c = 1; 46783e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 46793e519524SHoward Hinnant while (__c < __len) 46803e519524SHoward Hinnant { 46813e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 46823e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 46833e519524SHoward Hinnant return __cp; 46843e519524SHoward Hinnant ++__c; 46853e519524SHoward Hinnant ++__cp; 46863e519524SHoward Hinnant if (__c == __len) 46873e519524SHoward Hinnant return __last; 46883e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 46893e519524SHoward Hinnant return __cp; 46903e519524SHoward Hinnant ++__p; 46913e519524SHoward Hinnant ++__pp; 46923e519524SHoward Hinnant __c = 2 * __p + 1; 46933e519524SHoward Hinnant } 46943e519524SHoward Hinnant return __last; 46953e519524SHoward Hinnant} 46963e519524SHoward Hinnant 46973e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 46983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46993e519524SHoward Hinnant_RandomAccessIterator 47003e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 47013e519524SHoward Hinnant{ 4702ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47033e519524SHoward Hinnant} 47043e519524SHoward Hinnant 47053e519524SHoward Hinnant// is_heap 47063e519524SHoward Hinnant 47073e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47093e519524SHoward Hinnantbool 47103e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47113e519524SHoward Hinnant{ 4712ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 47133e519524SHoward Hinnant} 47143e519524SHoward Hinnant 47153e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 47163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47173e519524SHoward Hinnantbool 47183e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 47193e519524SHoward Hinnant{ 4720ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47213e519524SHoward Hinnant} 47223e519524SHoward Hinnant 47233e519524SHoward Hinnant// push_heap 47243e519524SHoward Hinnant 47253e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47263e519524SHoward Hinnantvoid 47273e519524SHoward Hinnant__push_heap_front(_RandomAccessIterator __first, _RandomAccessIterator, _Compare __comp, 47283e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 47293e519524SHoward Hinnant{ 47303e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47313e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47323e519524SHoward Hinnant if (__len > 1) 47333e519524SHoward Hinnant { 47343e519524SHoward Hinnant difference_type __p = 0; 47353e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 47363e519524SHoward Hinnant difference_type __c = 2; 47373e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 47383e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 47393e519524SHoward Hinnant { 47403e519524SHoward Hinnant --__c; 47413e519524SHoward Hinnant --__cp; 47423e519524SHoward Hinnant } 47433e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47443e519524SHoward Hinnant { 4745ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__pp)); 47463e519524SHoward Hinnant do 47473e519524SHoward Hinnant { 4748ce48a113SHoward Hinnant *__pp = _VSTD::move(*__cp); 47493e519524SHoward Hinnant __pp = __cp; 47503e519524SHoward Hinnant __p = __c; 47513e519524SHoward Hinnant __c = (__p + 1) * 2; 47523e519524SHoward Hinnant if (__c > __len) 47533e519524SHoward Hinnant break; 47543e519524SHoward Hinnant __cp = __first + __c; 47553e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 47563e519524SHoward Hinnant { 47573e519524SHoward Hinnant --__c; 47583e519524SHoward Hinnant --__cp; 47593e519524SHoward Hinnant } 47603e519524SHoward Hinnant } while (__comp(__t, *__cp)); 4761ce48a113SHoward Hinnant *__pp = _VSTD::move(__t); 47623e519524SHoward Hinnant } 47633e519524SHoward Hinnant } 47643e519524SHoward Hinnant} 47653e519524SHoward Hinnant 47663e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47673e519524SHoward Hinnantvoid 47683e519524SHoward Hinnant__push_heap_back(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47693e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 47703e519524SHoward Hinnant{ 47713e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47723e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47733e519524SHoward Hinnant if (__len > 1) 47743e519524SHoward Hinnant { 47753e519524SHoward Hinnant __len = (__len - 2) / 2; 47763e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 47773e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 47783e519524SHoward Hinnant { 4779ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 47803e519524SHoward Hinnant do 47813e519524SHoward Hinnant { 4782ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 47833e519524SHoward Hinnant __last = __ptr; 47843e519524SHoward Hinnant if (__len == 0) 47853e519524SHoward Hinnant break; 47863e519524SHoward Hinnant __len = (__len - 1) / 2; 47873e519524SHoward Hinnant __ptr = __first + __len; 47883e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4789ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 47903e519524SHoward Hinnant } 47913e519524SHoward Hinnant } 47923e519524SHoward Hinnant} 47933e519524SHoward Hinnant 47943e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47963e519524SHoward Hinnantvoid 47973e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47983e519524SHoward Hinnant{ 4799145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48003e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48013e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48023e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __c, __last - __first); 4803145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48043e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48053e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __comp, __last - __first); 4806145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48073e519524SHoward Hinnant} 48083e519524SHoward Hinnant 48093e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48113e519524SHoward Hinnantvoid 48123e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48133e519524SHoward Hinnant{ 4814ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48153e519524SHoward Hinnant} 48163e519524SHoward Hinnant 48173e519524SHoward Hinnant// pop_heap 48183e519524SHoward Hinnant 48193e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48213e519524SHoward Hinnantvoid 48223e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48233e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48243e519524SHoward Hinnant{ 48253e519524SHoward Hinnant if (__len > 1) 48263e519524SHoward Hinnant { 48273e519524SHoward Hinnant swap(*__first, *--__last); 48283e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __last, __comp, __len-1); 48293e519524SHoward Hinnant } 48303e519524SHoward Hinnant} 48313e519524SHoward Hinnant 48323e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48343e519524SHoward Hinnantvoid 48353e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48363e519524SHoward Hinnant{ 4837145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48383e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48393e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48403e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 4841145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48423e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48433e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 4844145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48453e519524SHoward Hinnant} 48463e519524SHoward Hinnant 48473e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48493e519524SHoward Hinnantvoid 48503e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48513e519524SHoward Hinnant{ 4852ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48533e519524SHoward Hinnant} 48543e519524SHoward Hinnant 48553e519524SHoward Hinnant// make_heap 48563e519524SHoward Hinnant 48573e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48583e519524SHoward Hinnantvoid 48593e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48603e519524SHoward Hinnant{ 48613e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48623e519524SHoward Hinnant difference_type __n = __last - __first; 48633e519524SHoward Hinnant if (__n > 1) 48643e519524SHoward Hinnant { 48653e519524SHoward Hinnant __last = __first; 48663e519524SHoward Hinnant ++__last; 48673e519524SHoward Hinnant for (difference_type __i = 1; __i < __n;) 48683e519524SHoward Hinnant __push_heap_back<_Compare>(__first, ++__last, __comp, ++__i); 48693e519524SHoward Hinnant } 48703e519524SHoward Hinnant} 48713e519524SHoward Hinnant 48723e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48743e519524SHoward Hinnantvoid 48753e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48763e519524SHoward Hinnant{ 4877145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48783e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48793e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48803e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 4881145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48823e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48833e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 4884145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48853e519524SHoward Hinnant} 48863e519524SHoward Hinnant 48873e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48893e519524SHoward Hinnantvoid 48903e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48913e519524SHoward Hinnant{ 4892ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48933e519524SHoward Hinnant} 48943e519524SHoward Hinnant 48953e519524SHoward Hinnant// sort_heap 48963e519524SHoward Hinnant 48973e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48983e519524SHoward Hinnantvoid 48993e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49003e519524SHoward Hinnant{ 49013e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49023e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 49033e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 49043e519524SHoward Hinnant} 49053e519524SHoward Hinnant 49063e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49083e519524SHoward Hinnantvoid 49093e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49103e519524SHoward Hinnant{ 4911145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49123e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49133e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49143e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 4915145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49163e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49173e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 4918145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49193e519524SHoward Hinnant} 49203e519524SHoward Hinnant 49213e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49233e519524SHoward Hinnantvoid 49243e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49253e519524SHoward Hinnant{ 4926ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49273e519524SHoward Hinnant} 49283e519524SHoward Hinnant 49293e519524SHoward Hinnant// partial_sort 49303e519524SHoward Hinnant 49313e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49323e519524SHoward Hinnantvoid 49333e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 49343e519524SHoward Hinnant _Compare __comp) 49353e519524SHoward Hinnant{ 49363e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 49373e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 49383e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 49393e519524SHoward Hinnant { 49403e519524SHoward Hinnant if (__comp(*__i, *__first)) 49413e519524SHoward Hinnant { 49423e519524SHoward Hinnant swap(*__i, *__first); 49433e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __middle, __comp, __len); 49443e519524SHoward Hinnant } 49453e519524SHoward Hinnant } 49463e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 49473e519524SHoward Hinnant} 49483e519524SHoward Hinnant 49493e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49513e519524SHoward Hinnantvoid 49523e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 49533e519524SHoward Hinnant _Compare __comp) 49543e519524SHoward Hinnant{ 4955145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49563e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49573e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49583e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 4959145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49603e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49613e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 4962145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49633e519524SHoward Hinnant} 49643e519524SHoward Hinnant 49653e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49673e519524SHoward Hinnantvoid 49683e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 49693e519524SHoward Hinnant{ 4970ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 49713e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49723e519524SHoward Hinnant} 49733e519524SHoward Hinnant 49743e519524SHoward Hinnant// partial_sort_copy 49753e519524SHoward Hinnant 49763e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 49773e519524SHoward Hinnant_RandomAccessIterator 49783e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 49793e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 49803e519524SHoward Hinnant{ 49813e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 49823e519524SHoward Hinnant if (__r != __result_last) 49833e519524SHoward Hinnant { 49843e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = 0; 49853e519524SHoward Hinnant for (; __first != __last && __r != __result_last; ++__first, ++__r, ++__len) 49863e519524SHoward Hinnant *__r = *__first; 49873e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 49883e519524SHoward Hinnant for (; __first != __last; ++__first) 49893e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 49903e519524SHoward Hinnant { 49913e519524SHoward Hinnant *__result_first = *__first; 49923e519524SHoward Hinnant __push_heap_front<_Compare>(__result_first, __r, __comp, __len); 49933e519524SHoward Hinnant } 49943e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 49953e519524SHoward Hinnant } 49963e519524SHoward Hinnant return __r; 49973e519524SHoward Hinnant} 49983e519524SHoward Hinnant 49993e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 50003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50013e519524SHoward Hinnant_RandomAccessIterator 50023e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 50033e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50043e519524SHoward Hinnant{ 5005145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50063e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50073e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50083e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5009145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50103e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50113e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5012145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50133e519524SHoward Hinnant} 50143e519524SHoward Hinnant 50153e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 50163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50173e519524SHoward Hinnant_RandomAccessIterator 50183e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 50193e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 50203e519524SHoward Hinnant{ 5021ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 50223e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50233e519524SHoward Hinnant} 50243e519524SHoward Hinnant 50253e519524SHoward Hinnant// nth_element 50263e519524SHoward Hinnant 50273e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50283e519524SHoward Hinnantvoid 50293e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 50303e519524SHoward Hinnant{ 50313e519524SHoward Hinnant // _Compare is known to be a reference type 50323e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50333e519524SHoward Hinnant const difference_type __limit = 7; 50343e519524SHoward Hinnant while (true) 50353e519524SHoward Hinnant { 50363e519524SHoward Hinnant __restart: 5037b34b4819SHoward Hinnant if (__nth == __last) 5038b34b4819SHoward Hinnant return; 50393e519524SHoward Hinnant difference_type __len = __last - __first; 50403e519524SHoward Hinnant switch (__len) 50413e519524SHoward Hinnant { 50423e519524SHoward Hinnant case 0: 50433e519524SHoward Hinnant case 1: 50443e519524SHoward Hinnant return; 50453e519524SHoward Hinnant case 2: 50463e519524SHoward Hinnant if (__comp(*--__last, *__first)) 50473e519524SHoward Hinnant swap(*__first, *__last); 50483e519524SHoward Hinnant return; 50493e519524SHoward Hinnant case 3: 50503e519524SHoward Hinnant { 50513e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5052ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 50533e519524SHoward Hinnant return; 50543e519524SHoward Hinnant } 50553e519524SHoward Hinnant } 50563e519524SHoward Hinnant if (__len <= __limit) 50573e519524SHoward Hinnant { 50583e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 50593e519524SHoward Hinnant return; 50603e519524SHoward Hinnant } 50613e519524SHoward Hinnant // __len > __limit >= 3 50623e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 50633e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5064ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 50653e519524SHoward Hinnant // *__m is median 50663e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 50673e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 50683e519524SHoward Hinnant _RandomAccessIterator __i = __first; 50693e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 50703e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 50713e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 50723e519524SHoward Hinnant // Prime the downward search with a guard. 50733e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 50743e519524SHoward Hinnant { 50753e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 50763e519524SHoward Hinnant // manually guard downward moving __j against __i 50773e519524SHoward Hinnant while (true) 50783e519524SHoward Hinnant { 50793e519524SHoward Hinnant if (__i == --__j) 50803e519524SHoward Hinnant { 50813e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 50823e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 50833e519524SHoward Hinnant ++__i; // __first + 1 50843e519524SHoward Hinnant __j = __last; 50853e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 50863e519524SHoward Hinnant { 50873e519524SHoward Hinnant while (true) 50883e519524SHoward Hinnant { 50893e519524SHoward Hinnant if (__i == __j) 50903e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 50913e519524SHoward Hinnant if (__comp(*__first, *__i)) 50923e519524SHoward Hinnant { 50933e519524SHoward Hinnant swap(*__i, *__j); 50943e519524SHoward Hinnant ++__n_swaps; 50953e519524SHoward Hinnant ++__i; 50963e519524SHoward Hinnant break; 50973e519524SHoward Hinnant } 50983e519524SHoward Hinnant ++__i; 50993e519524SHoward Hinnant } 51003e519524SHoward Hinnant } 51013e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 51023e519524SHoward Hinnant if (__i == __j) 51033e519524SHoward Hinnant return; 51043e519524SHoward Hinnant while (true) 51053e519524SHoward Hinnant { 51063e519524SHoward Hinnant while (!__comp(*__first, *__i)) 51073e519524SHoward Hinnant ++__i; 51083e519524SHoward Hinnant while (__comp(*__first, *--__j)) 51093e519524SHoward Hinnant ; 51103e519524SHoward Hinnant if (__i >= __j) 51113e519524SHoward Hinnant break; 51123e519524SHoward Hinnant swap(*__i, *__j); 51133e519524SHoward Hinnant ++__n_swaps; 51143e519524SHoward Hinnant ++__i; 51153e519524SHoward Hinnant } 51163e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 51173e519524SHoward Hinnant // The first part is sorted, 51183e519524SHoward Hinnant if (__nth < __i) 51193e519524SHoward Hinnant return; 51203e519524SHoward Hinnant // __nth_element the secod part 51213e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 51223e519524SHoward Hinnant __first = __i; 51233e519524SHoward Hinnant goto __restart; 51243e519524SHoward Hinnant } 51253e519524SHoward Hinnant if (__comp(*__j, *__m)) 51263e519524SHoward Hinnant { 51273e519524SHoward Hinnant swap(*__i, *__j); 51283e519524SHoward Hinnant ++__n_swaps; 51293e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 51303e519524SHoward Hinnant } 51313e519524SHoward Hinnant } 51323e519524SHoward Hinnant } 51333e519524SHoward Hinnant ++__i; 51343e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51353e519524SHoward Hinnant // if not yet partitioned... 51363e519524SHoward Hinnant if (__i < __j) 51373e519524SHoward Hinnant { 51383e519524SHoward Hinnant // known that *(__i - 1) < *__m 51393e519524SHoward Hinnant while (true) 51403e519524SHoward Hinnant { 51413e519524SHoward Hinnant // __m still guards upward moving __i 51423e519524SHoward Hinnant while (__comp(*__i, *__m)) 51433e519524SHoward Hinnant ++__i; 51443e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 51453e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 51463e519524SHoward Hinnant ; 51473e519524SHoward Hinnant if (__i >= __j) 51483e519524SHoward Hinnant break; 51493e519524SHoward Hinnant swap(*__i, *__j); 51503e519524SHoward Hinnant ++__n_swaps; 51513e519524SHoward Hinnant // It is known that __m != __j 51523e519524SHoward Hinnant // If __m just moved, follow it 51533e519524SHoward Hinnant if (__m == __i) 51543e519524SHoward Hinnant __m = __j; 51553e519524SHoward Hinnant ++__i; 51563e519524SHoward Hinnant } 51573e519524SHoward Hinnant } 51583e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 51593e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 51603e519524SHoward Hinnant { 51613e519524SHoward Hinnant swap(*__i, *__m); 51623e519524SHoward Hinnant ++__n_swaps; 51633e519524SHoward Hinnant } 51643e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 51653e519524SHoward Hinnant if (__nth == __i) 51663e519524SHoward Hinnant return; 51673e519524SHoward Hinnant if (__n_swaps == 0) 51683e519524SHoward Hinnant { 51693e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 51703e519524SHoward Hinnant if (__nth < __i) 51713e519524SHoward Hinnant { 51723e519524SHoward Hinnant // Check for [__first, __i) already sorted 51733e519524SHoward Hinnant __j = __m = __first; 51743e519524SHoward Hinnant while (++__j != __i) 51753e519524SHoward Hinnant { 51763e519524SHoward Hinnant if (__comp(*__j, *__m)) 51773e519524SHoward Hinnant // not yet sorted, so sort 51783e519524SHoward Hinnant goto not_sorted; 51793e519524SHoward Hinnant __m = __j; 51803e519524SHoward Hinnant } 51813e519524SHoward Hinnant // [__first, __i) sorted 51823e519524SHoward Hinnant return; 51833e519524SHoward Hinnant } 51843e519524SHoward Hinnant else 51853e519524SHoward Hinnant { 51863e519524SHoward Hinnant // Check for [__i, __last) already sorted 51873e519524SHoward Hinnant __j = __m = __i; 51883e519524SHoward Hinnant while (++__j != __last) 51893e519524SHoward Hinnant { 51903e519524SHoward Hinnant if (__comp(*__j, *__m)) 51913e519524SHoward Hinnant // not yet sorted, so sort 51923e519524SHoward Hinnant goto not_sorted; 51933e519524SHoward Hinnant __m = __j; 51943e519524SHoward Hinnant } 51953e519524SHoward Hinnant // [__i, __last) sorted 51963e519524SHoward Hinnant return; 51973e519524SHoward Hinnant } 51983e519524SHoward Hinnant } 51993e519524SHoward Hinnantnot_sorted: 52003e519524SHoward Hinnant // __nth_element on range containing __nth 52013e519524SHoward Hinnant if (__nth < __i) 52023e519524SHoward Hinnant { 52033e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 52043e519524SHoward Hinnant __last = __i; 52053e519524SHoward Hinnant } 52063e519524SHoward Hinnant else 52073e519524SHoward Hinnant { 52083e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 52093e519524SHoward Hinnant __first = ++__i; 52103e519524SHoward Hinnant } 52113e519524SHoward Hinnant } 52123e519524SHoward Hinnant} 52133e519524SHoward Hinnant 52143e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 52153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52163e519524SHoward Hinnantvoid 52173e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 52183e519524SHoward Hinnant{ 5219145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 52203e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52213e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52223e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5223145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 52243e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52253e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5226145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 52273e519524SHoward Hinnant} 52283e519524SHoward Hinnant 52293e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 52303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52313e519524SHoward Hinnantvoid 52323e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 52333e519524SHoward Hinnant{ 5234ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52353e519524SHoward Hinnant} 52363e519524SHoward Hinnant 52373e519524SHoward Hinnant// includes 52383e519524SHoward Hinnant 52393e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 52403e519524SHoward Hinnantbool 52413e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 52423e519524SHoward Hinnant _Compare __comp) 52433e519524SHoward Hinnant{ 52443e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 52453e519524SHoward Hinnant { 52463e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 52473e519524SHoward Hinnant return false; 52483e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 52493e519524SHoward Hinnant ++__first2; 52503e519524SHoward Hinnant } 52513e519524SHoward Hinnant return true; 52523e519524SHoward Hinnant} 52533e519524SHoward Hinnant 52543e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 52553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52563e519524SHoward Hinnantbool 52573e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 52583e519524SHoward Hinnant _Compare __comp) 52593e519524SHoward Hinnant{ 5260145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 52613e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52623e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52633e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5264145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 52653e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52663e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5267145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 52683e519524SHoward Hinnant} 52693e519524SHoward Hinnant 52703e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 52713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52723e519524SHoward Hinnantbool 52733e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 52743e519524SHoward Hinnant{ 5275ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 52763e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 52773e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 52783e519524SHoward Hinnant} 52793e519524SHoward Hinnant 52803e519524SHoward Hinnant// set_union 52813e519524SHoward Hinnant 52823e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 52833e519524SHoward Hinnant_OutputIterator 52843e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 52853e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 52863e519524SHoward Hinnant{ 52873e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 52883e519524SHoward Hinnant { 52893e519524SHoward Hinnant if (__first2 == __last2) 5290ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 52913e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 52923e519524SHoward Hinnant { 52933e519524SHoward Hinnant *__result = *__first2; 52943e519524SHoward Hinnant ++__first2; 52953e519524SHoward Hinnant } 52963e519524SHoward Hinnant else 52973e519524SHoward Hinnant { 52983e519524SHoward Hinnant *__result = *__first1; 52993e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53003e519524SHoward Hinnant ++__first2; 53013e519524SHoward Hinnant ++__first1; 53023e519524SHoward Hinnant } 53033e519524SHoward Hinnant } 5304ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 53053e519524SHoward Hinnant} 53063e519524SHoward Hinnant 53073e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 53083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53093e519524SHoward Hinnant_OutputIterator 53103e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53113e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53123e519524SHoward Hinnant{ 5313145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53143e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53153e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53163e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5317145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53183e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53193e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5320145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53213e519524SHoward Hinnant} 53223e519524SHoward Hinnant 53233e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 53243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53253e519524SHoward Hinnant_OutputIterator 53263e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53273e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 53283e519524SHoward Hinnant{ 5329ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 53303e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53313e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53323e519524SHoward Hinnant} 53333e519524SHoward Hinnant 53343e519524SHoward Hinnant// set_intersection 53353e519524SHoward Hinnant 53363e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53373e519524SHoward Hinnant_OutputIterator 53383e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 53393e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53403e519524SHoward Hinnant{ 53413e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 53423e519524SHoward Hinnant { 53433e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 53443e519524SHoward Hinnant ++__first1; 53453e519524SHoward Hinnant else 53463e519524SHoward Hinnant { 53473e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 53483e519524SHoward Hinnant { 53493e519524SHoward Hinnant *__result = *__first1; 53503e519524SHoward Hinnant ++__result; 53513e519524SHoward Hinnant ++__first1; 53523e519524SHoward Hinnant } 53533e519524SHoward Hinnant ++__first2; 53543e519524SHoward Hinnant } 53553e519524SHoward Hinnant } 53563e519524SHoward Hinnant return __result; 53573e519524SHoward Hinnant} 53583e519524SHoward Hinnant 53593e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 53603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53613e519524SHoward Hinnant_OutputIterator 53623e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 53633e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53643e519524SHoward Hinnant{ 5365145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53663e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53673e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53683e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5369145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53703e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53713e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5372145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53733e519524SHoward Hinnant} 53743e519524SHoward Hinnant 53753e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 53763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53773e519524SHoward Hinnant_OutputIterator 53783e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 53793e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 53803e519524SHoward Hinnant{ 5381ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 53823e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53833e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53843e519524SHoward Hinnant} 53853e519524SHoward Hinnant 53863e519524SHoward Hinnant// set_difference 53873e519524SHoward Hinnant 53883e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53893e519524SHoward Hinnant_OutputIterator 53903e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 53913e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53923e519524SHoward Hinnant{ 53933e519524SHoward Hinnant while (__first1 != __last1) 53943e519524SHoward Hinnant { 53953e519524SHoward Hinnant if (__first2 == __last2) 5396ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 53973e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 53983e519524SHoward Hinnant { 53993e519524SHoward Hinnant *__result = *__first1; 54003e519524SHoward Hinnant ++__result; 54013e519524SHoward Hinnant ++__first1; 54023e519524SHoward Hinnant } 54033e519524SHoward Hinnant else 54043e519524SHoward Hinnant { 54053e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54063e519524SHoward Hinnant ++__first1; 54073e519524SHoward Hinnant ++__first2; 54083e519524SHoward Hinnant } 54093e519524SHoward Hinnant } 54103e519524SHoward Hinnant return __result; 54113e519524SHoward Hinnant} 54123e519524SHoward Hinnant 54133e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54153e519524SHoward Hinnant_OutputIterator 54163e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54173e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54183e519524SHoward Hinnant{ 5419145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54203e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54213e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54223e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5423145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54243e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54253e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5426145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54273e519524SHoward Hinnant} 54283e519524SHoward Hinnant 54293e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54313e519524SHoward Hinnant_OutputIterator 54323e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54333e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54343e519524SHoward Hinnant{ 5435ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 54363e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54373e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54383e519524SHoward Hinnant} 54393e519524SHoward Hinnant 54403e519524SHoward Hinnant// set_symmetric_difference 54413e519524SHoward Hinnant 54423e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54433e519524SHoward Hinnant_OutputIterator 54443e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54453e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54463e519524SHoward Hinnant{ 54473e519524SHoward Hinnant while (__first1 != __last1) 54483e519524SHoward Hinnant { 54493e519524SHoward Hinnant if (__first2 == __last2) 5450ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54513e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54523e519524SHoward Hinnant { 54533e519524SHoward Hinnant *__result = *__first1; 54543e519524SHoward Hinnant ++__result; 54553e519524SHoward Hinnant ++__first1; 54563e519524SHoward Hinnant } 54573e519524SHoward Hinnant else 54583e519524SHoward Hinnant { 54593e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 54603e519524SHoward Hinnant { 54613e519524SHoward Hinnant *__result = *__first2; 54623e519524SHoward Hinnant ++__result; 54633e519524SHoward Hinnant } 54643e519524SHoward Hinnant else 54653e519524SHoward Hinnant ++__first1; 54663e519524SHoward Hinnant ++__first2; 54673e519524SHoward Hinnant } 54683e519524SHoward Hinnant } 5469ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 54703e519524SHoward Hinnant} 54713e519524SHoward Hinnant 54723e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54743e519524SHoward Hinnant_OutputIterator 54753e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54763e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54773e519524SHoward Hinnant{ 5478145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54793e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54803e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54813e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5482145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54833e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54843e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5485145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54863e519524SHoward Hinnant} 54873e519524SHoward Hinnant 54883e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54903e519524SHoward Hinnant_OutputIterator 54913e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54923e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54933e519524SHoward Hinnant{ 5494ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 54953e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54963e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54973e519524SHoward Hinnant} 54983e519524SHoward Hinnant 54993e519524SHoward Hinnant// lexicographical_compare 55003e519524SHoward Hinnant 55013e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 55023e519524SHoward Hinnantbool 55033e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55043e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55053e519524SHoward Hinnant{ 55063e519524SHoward Hinnant for (; __first2 != __last2; ++__first1, ++__first2) 55073e519524SHoward Hinnant { 55083e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 55093e519524SHoward Hinnant return true; 55103e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55113e519524SHoward Hinnant return false; 55123e519524SHoward Hinnant } 55133e519524SHoward Hinnant return false; 55143e519524SHoward Hinnant} 55153e519524SHoward Hinnant 55163e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 55173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55183e519524SHoward Hinnantbool 55193e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55203e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55213e519524SHoward Hinnant{ 5522145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55233e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55243e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55253e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5526145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55273e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55283e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5529145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55303e519524SHoward Hinnant} 55313e519524SHoward Hinnant 55323e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 55333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55343e519524SHoward Hinnantbool 55353e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55363e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 55373e519524SHoward Hinnant{ 5538ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 55393e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55403e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55413e519524SHoward Hinnant} 55423e519524SHoward Hinnant 55433e519524SHoward Hinnant// next_permutation 55443e519524SHoward Hinnant 55453e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 55463e519524SHoward Hinnantbool 55473e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 55483e519524SHoward Hinnant{ 55493e519524SHoward Hinnant _BidirectionalIterator __i = __last; 55503e519524SHoward Hinnant if (__first == __last || __first == --__i) 55513e519524SHoward Hinnant return false; 55523e519524SHoward Hinnant while (true) 55533e519524SHoward Hinnant { 55543e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 55553e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 55563e519524SHoward Hinnant { 55573e519524SHoward Hinnant _BidirectionalIterator __j = __last; 55583e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 55593e519524SHoward Hinnant ; 55603e519524SHoward Hinnant swap(*__i, *__j); 5561ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 55623e519524SHoward Hinnant return true; 55633e519524SHoward Hinnant } 55643e519524SHoward Hinnant if (__i == __first) 55653e519524SHoward Hinnant { 5566ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 55673e519524SHoward Hinnant return false; 55683e519524SHoward Hinnant } 55693e519524SHoward Hinnant } 55703e519524SHoward Hinnant} 55713e519524SHoward Hinnant 55723e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 55733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55743e519524SHoward Hinnantbool 55753e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 55763e519524SHoward Hinnant{ 5577145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55783e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55793e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55803e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5581145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55823e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55833e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5584145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55853e519524SHoward Hinnant} 55863e519524SHoward Hinnant 55873e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 55883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55893e519524SHoward Hinnantbool 55903e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 55913e519524SHoward Hinnant{ 5592ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 55933e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 55943e519524SHoward Hinnant} 55953e519524SHoward Hinnant 55963e519524SHoward Hinnant// prev_permutation 55973e519524SHoward Hinnant 55983e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 55993e519524SHoward Hinnantbool 56003e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56013e519524SHoward Hinnant{ 56023e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56033e519524SHoward Hinnant if (__first == __last || __first == --__i) 56043e519524SHoward Hinnant return false; 56053e519524SHoward Hinnant while (true) 56063e519524SHoward Hinnant { 56073e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56083e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 56093e519524SHoward Hinnant { 56103e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56113e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 56123e519524SHoward Hinnant ; 56133e519524SHoward Hinnant swap(*__i, *__j); 5614ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56153e519524SHoward Hinnant return true; 56163e519524SHoward Hinnant } 56173e519524SHoward Hinnant if (__i == __first) 56183e519524SHoward Hinnant { 5619ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56203e519524SHoward Hinnant return false; 56213e519524SHoward Hinnant } 56223e519524SHoward Hinnant } 56233e519524SHoward Hinnant} 56243e519524SHoward Hinnant 56253e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56273e519524SHoward Hinnantbool 56283e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56293e519524SHoward Hinnant{ 5630145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56313e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56323e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56333e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5634145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56353e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56363e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5637145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56383e519524SHoward Hinnant} 56393e519524SHoward Hinnant 56403e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 56413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56423e519524SHoward Hinnantbool 56433e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 56443e519524SHoward Hinnant{ 5645ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 56463e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 56473e519524SHoward Hinnant} 56483e519524SHoward Hinnant 56493e519524SHoward Hinnanttemplate <class _Tp> 56503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56513e519524SHoward Hinnanttypename enable_if 56523e519524SHoward Hinnant< 56533e519524SHoward Hinnant is_integral<_Tp>::value, 56543e519524SHoward Hinnant _Tp 56553e519524SHoward Hinnant>::type 56563e519524SHoward Hinnant__rotate_left(_Tp __t, _Tp __n = 1) 56573e519524SHoward Hinnant{ 56583e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 56593e519524SHoward Hinnant __n &= __bits; 56603e519524SHoward Hinnant return static_cast<_Tp>((__t << __n) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> (__bits - __n))); 56613e519524SHoward Hinnant} 56623e519524SHoward Hinnant 56633e519524SHoward Hinnanttemplate <class _Tp> 56643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56653e519524SHoward Hinnanttypename enable_if 56663e519524SHoward Hinnant< 56673e519524SHoward Hinnant is_integral<_Tp>::value, 56683e519524SHoward Hinnant _Tp 56693e519524SHoward Hinnant>::type 56703e519524SHoward Hinnant__rotate_right(_Tp __t, _Tp __n = 1) 56713e519524SHoward Hinnant{ 56723e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 56733e519524SHoward Hinnant __n &= __bits; 56743e519524SHoward Hinnant return static_cast<_Tp>((__t << (__bits - __n)) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> __n)); 56753e519524SHoward Hinnant} 56763e519524SHoward Hinnant 56773e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 56783e519524SHoward Hinnant 56793e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5680