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 6345d1a701dSHoward Hinnant 635ab4f4382SHoward Hinnant#include <__undef_min_max> 636ab4f4382SHoward Hinnant 637073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6383e519524SHoward Hinnant#pragma GCC system_header 639073458b1SHoward Hinnant#endif 6403e519524SHoward Hinnant 6413e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6423e519524SHoward Hinnant 6433e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6443e519524SHoward Hinnantstruct __equal_to 6453e519524SHoward Hinnant{ 6463e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6473e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 6483e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 6493e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6503e519524SHoward Hinnant}; 6513e519524SHoward Hinnant 6523e519524SHoward Hinnanttemplate <class _T1> 6533e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6543e519524SHoward Hinnant{ 6553e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6563e519524SHoward Hinnant}; 6573e519524SHoward Hinnant 6583e519524SHoward Hinnanttemplate <class _T1> 6593e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6603e519524SHoward Hinnant{ 6613e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6623e519524SHoward Hinnant}; 6633e519524SHoward Hinnant 6643e519524SHoward Hinnanttemplate <class _T1> 6653e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6663e519524SHoward Hinnant{ 6673e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6683e519524SHoward Hinnant}; 6693e519524SHoward Hinnant 6703e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6713e519524SHoward Hinnantstruct __less 6723e519524SHoward Hinnant{ 6733e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6743e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 6753e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 6763e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 6773e519524SHoward Hinnant}; 6783e519524SHoward Hinnant 6793e519524SHoward Hinnanttemplate <class _T1> 6803e519524SHoward Hinnantstruct __less<_T1, _T1> 6813e519524SHoward Hinnant{ 6823e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6833e519524SHoward Hinnant}; 6843e519524SHoward Hinnant 6853e519524SHoward Hinnanttemplate <class _T1> 6863e519524SHoward Hinnantstruct __less<const _T1, _T1> 6873e519524SHoward Hinnant{ 6883e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6893e519524SHoward Hinnant}; 6903e519524SHoward Hinnant 6913e519524SHoward Hinnanttemplate <class _T1> 6923e519524SHoward Hinnantstruct __less<_T1, const _T1> 6933e519524SHoward Hinnant{ 6943e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6953e519524SHoward Hinnant}; 6963e519524SHoward Hinnant 6973e519524SHoward Hinnanttemplate <class _Predicate> 6983e519524SHoward Hinnantclass __negate 6993e519524SHoward Hinnant{ 7003e519524SHoward Hinnantprivate: 7013e519524SHoward Hinnant _Predicate __p_; 7023e519524SHoward Hinnantpublic: 7033e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY __negate() {} 7043e519524SHoward Hinnant 7053e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7063e519524SHoward Hinnant explicit __negate(_Predicate __p) : __p_(__p) {} 7073e519524SHoward Hinnant 7083e519524SHoward Hinnant template <class _T1> 7093e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7103e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 7113e519524SHoward Hinnant 7123e519524SHoward Hinnant template <class _T1, class _T2> 7133e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7143e519524SHoward Hinnant bool operator()(const _T1& __x, const _T2& __y) {return !__p_(__x, __y);} 7153e519524SHoward Hinnant}; 7163e519524SHoward Hinnant 717f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 7183e519524SHoward Hinnant 7193e519524SHoward Hinnanttemplate <class _Compare> 7203e519524SHoward Hinnantstruct __debug_less 7213e519524SHoward Hinnant{ 7223e519524SHoward Hinnant _Compare __comp_; 7233e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 7243e519524SHoward Hinnant template <class _Tp, class _Up> 7253e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 7263e519524SHoward Hinnant { 7273e519524SHoward Hinnant bool __r = __comp_(__x, __y); 7283e519524SHoward Hinnant if (__r) 729f554add5SHoward Hinnant _LIBCPP_ASSERT(!__comp_(__y, __x), "Comparator does not induce a strict weak ordering"); 7303e519524SHoward Hinnant return __r; 7313e519524SHoward Hinnant } 7323e519524SHoward Hinnant}; 7333e519524SHoward Hinnant 734f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 7353e519524SHoward Hinnant 736c8edcb36SHoward Hinnant// Precondition: __x != 0 737c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 738c206366fSHoward Hinnantunsigned 739c206366fSHoward Hinnant__ctz(unsigned __x) 740c206366fSHoward Hinnant{ 741c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_ctz(__x)); 742c206366fSHoward Hinnant} 743c206366fSHoward Hinnant 744c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 745c206366fSHoward Hinnantunsigned long 746c206366fSHoward Hinnant__ctz(unsigned long __x) 747c206366fSHoward Hinnant{ 748c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_ctzl(__x)); 749c206366fSHoward Hinnant} 750c206366fSHoward Hinnant 751c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 752c206366fSHoward Hinnantunsigned long long 753c206366fSHoward Hinnant__ctz(unsigned long long __x) 754c206366fSHoward Hinnant{ 755c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_ctzll(__x)); 756c206366fSHoward Hinnant} 757c8edcb36SHoward Hinnant 758c8edcb36SHoward Hinnant// Precondition: __x != 0 759c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 760c206366fSHoward Hinnantunsigned 761c206366fSHoward Hinnant__clz(unsigned __x) 762c206366fSHoward Hinnant{ 763c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_clz(__x)); 764c206366fSHoward Hinnant} 765c206366fSHoward Hinnant 766c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 767c206366fSHoward Hinnantunsigned long 768c206366fSHoward Hinnant__clz(unsigned long __x) 769c206366fSHoward Hinnant{ 770c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_clzl (__x)); 771c206366fSHoward Hinnant} 772c206366fSHoward Hinnant 773c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 774c206366fSHoward Hinnantunsigned long long 775c206366fSHoward Hinnant__clz(unsigned long long __x) 776c206366fSHoward Hinnant{ 777c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_clzll(__x)); 778c206366fSHoward Hinnant} 779c8edcb36SHoward Hinnant 780c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) {return __builtin_popcount (__x);} 781c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) {return __builtin_popcountl (__x);} 782c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) {return __builtin_popcountll(__x);} 783c8edcb36SHoward Hinnant 7843e519524SHoward Hinnant// all_of 7853e519524SHoward Hinnant 7863e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 7873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7883e519524SHoward Hinnantbool 7893e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7903e519524SHoward Hinnant{ 7913e519524SHoward Hinnant for (; __first != __last; ++__first) 7923e519524SHoward Hinnant if (!__pred(*__first)) 7933e519524SHoward Hinnant return false; 7943e519524SHoward Hinnant return true; 7953e519524SHoward Hinnant} 7963e519524SHoward Hinnant 7973e519524SHoward Hinnant// any_of 7983e519524SHoward Hinnant 7993e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8013e519524SHoward Hinnantbool 8023e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8033e519524SHoward Hinnant{ 8043e519524SHoward Hinnant for (; __first != __last; ++__first) 8053e519524SHoward Hinnant if (__pred(*__first)) 8063e519524SHoward Hinnant return true; 8073e519524SHoward Hinnant return false; 8083e519524SHoward Hinnant} 8093e519524SHoward Hinnant 8103e519524SHoward Hinnant// none_of 8113e519524SHoward Hinnant 8123e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8143e519524SHoward Hinnantbool 8153e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8163e519524SHoward Hinnant{ 8173e519524SHoward Hinnant for (; __first != __last; ++__first) 8183e519524SHoward Hinnant if (__pred(*__first)) 8193e519524SHoward Hinnant return false; 8203e519524SHoward Hinnant return true; 8213e519524SHoward Hinnant} 8223e519524SHoward Hinnant 8233e519524SHoward Hinnant// for_each 8243e519524SHoward Hinnant 8253e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 8263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8273e519524SHoward Hinnant_Function 8283e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 8293e519524SHoward Hinnant{ 8303e519524SHoward Hinnant for (; __first != __last; ++__first) 8313e519524SHoward Hinnant __f(*__first); 832179b1f8cSHoward Hinnant return _VSTD::move(__f); // explicitly moved for (emulated) C++03 8333e519524SHoward Hinnant} 8343e519524SHoward Hinnant 8353e519524SHoward Hinnant// find 8363e519524SHoward Hinnant 8373e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 8383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8393e519524SHoward Hinnant_InputIterator 840e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 8413e519524SHoward Hinnant{ 8423e519524SHoward Hinnant for (; __first != __last; ++__first) 843e4383379SHoward Hinnant if (*__first == __value_) 8443e519524SHoward Hinnant break; 8453e519524SHoward Hinnant return __first; 8463e519524SHoward Hinnant} 8473e519524SHoward Hinnant 8483e519524SHoward Hinnant// find_if 8493e519524SHoward Hinnant 8503e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8523e519524SHoward Hinnant_InputIterator 8533e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8543e519524SHoward Hinnant{ 8553e519524SHoward Hinnant for (; __first != __last; ++__first) 8563e519524SHoward Hinnant if (__pred(*__first)) 8573e519524SHoward Hinnant break; 8583e519524SHoward Hinnant return __first; 8593e519524SHoward Hinnant} 8603e519524SHoward Hinnant 8613e519524SHoward Hinnant// find_if_not 8623e519524SHoward Hinnant 8633e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 8643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8653e519524SHoward Hinnant_InputIterator 8663e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8673e519524SHoward Hinnant{ 8683e519524SHoward Hinnant for (; __first != __last; ++__first) 8693e519524SHoward Hinnant if (!__pred(*__first)) 8703e519524SHoward Hinnant break; 8713e519524SHoward Hinnant return __first; 8723e519524SHoward Hinnant} 8733e519524SHoward Hinnant 8743e519524SHoward Hinnant// find_end 8753e519524SHoward Hinnant 8763e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 8773e519524SHoward Hinnant_ForwardIterator1 8783e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 8793e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 8803e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 8813e519524SHoward Hinnant{ 8823e519524SHoward Hinnant // modeled after search algorithm 8833e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 8843e519524SHoward Hinnant if (__first2 == __last2) 8853e519524SHoward Hinnant return __r; 8863e519524SHoward Hinnant while (true) 8873e519524SHoward Hinnant { 8883e519524SHoward Hinnant while (true) 8893e519524SHoward Hinnant { 8903e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 8913e519524SHoward Hinnant return __r; // (or __last1 if never found) 8923e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 8933e519524SHoward Hinnant break; 8943e519524SHoward Hinnant ++__first1; 8953e519524SHoward Hinnant } 8963e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 8973e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 8983e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 8993e519524SHoward Hinnant while (true) 9003e519524SHoward Hinnant { 9013e519524SHoward Hinnant if (++__m2 == __last2) 9023e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 9033e519524SHoward Hinnant __r = __first1; 9043e519524SHoward Hinnant ++__first1; 9053e519524SHoward Hinnant break; 9063e519524SHoward Hinnant } 9073e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 9083e519524SHoward Hinnant return __r; 9093e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 9103e519524SHoward Hinnant { 9113e519524SHoward Hinnant ++__first1; 9123e519524SHoward Hinnant break; 9133e519524SHoward Hinnant } // else there is a match, check next elements 9143e519524SHoward Hinnant } 9153e519524SHoward Hinnant } 9163e519524SHoward Hinnant} 9173e519524SHoward Hinnant 9183e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 9193e519524SHoward Hinnant_BidirectionalIterator1 9203e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 9213e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 9223e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 9233e519524SHoward Hinnant{ 9243e519524SHoward Hinnant // modeled after search algorithm (in reverse) 9253e519524SHoward Hinnant if (__first2 == __last2) 9263e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 9273e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 9283e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 9293e519524SHoward Hinnant --__l2; 9303e519524SHoward Hinnant while (true) 9313e519524SHoward Hinnant { 9323e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 9333e519524SHoward Hinnant while (true) 9343e519524SHoward Hinnant { 9353e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 9363e519524SHoward Hinnant return __last1; 9373e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9383e519524SHoward Hinnant break; 9393e519524SHoward Hinnant } 9403e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 9413e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 9423e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 9433e519524SHoward Hinnant while (true) 9443e519524SHoward Hinnant { 9453e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 9463e519524SHoward Hinnant return __m1; 9473e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 9483e519524SHoward Hinnant return __last1; 9493e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 9503e519524SHoward Hinnant { 9513e519524SHoward Hinnant break; 9523e519524SHoward Hinnant } // else there is a match, check next elements 9533e519524SHoward Hinnant } 9543e519524SHoward Hinnant } 9553e519524SHoward Hinnant} 9563e519524SHoward Hinnant 9573e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 9583e519524SHoward Hinnant_RandomAccessIterator1 9593e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 9603e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 9613e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 9623e519524SHoward Hinnant{ 9633e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 9643e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 9653e519524SHoward Hinnant if (__len2 == 0) 9663e519524SHoward Hinnant return __last1; 9673e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 9683e519524SHoward Hinnant if (__len1 < __len2) 9693e519524SHoward Hinnant return __last1; 9703e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 9713e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 9723e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 9733e519524SHoward Hinnant --__l2; 9743e519524SHoward Hinnant while (true) 9753e519524SHoward Hinnant { 9763e519524SHoward Hinnant while (true) 9773e519524SHoward Hinnant { 9783e519524SHoward Hinnant if (__s == __l1) 9793e519524SHoward Hinnant return __last1; 9803e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9813e519524SHoward Hinnant break; 9823e519524SHoward Hinnant } 9833e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 9843e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 9853e519524SHoward Hinnant while (true) 9863e519524SHoward Hinnant { 9873e519524SHoward Hinnant if (__m2 == __first2) 9883e519524SHoward Hinnant return __m1; 9893e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 9903e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 9913e519524SHoward Hinnant { 9923e519524SHoward Hinnant break; 9933e519524SHoward Hinnant } 9943e519524SHoward Hinnant } 9953e519524SHoward Hinnant } 9963e519524SHoward Hinnant} 9973e519524SHoward Hinnant 9983e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 9993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10003e519524SHoward Hinnant_ForwardIterator1 10013e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10023e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10033e519524SHoward Hinnant{ 1004ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 10053e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 10063e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 10073e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 10083e519524SHoward Hinnant} 10093e519524SHoward Hinnant 10103e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10123e519524SHoward Hinnant_ForwardIterator1 10133e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10143e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10153e519524SHoward Hinnant{ 10163e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10173e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1018ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10193e519524SHoward Hinnant} 10203e519524SHoward Hinnant 10213e519524SHoward Hinnant// find_first_of 10223e519524SHoward Hinnant 10233e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10243e519524SHoward Hinnant_ForwardIterator1 10253e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10263e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10273e519524SHoward Hinnant{ 10283e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 10293e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 10303e519524SHoward Hinnant if (__pred(*__first1, *__j)) 10313e519524SHoward Hinnant return __first1; 10323e519524SHoward Hinnant return __last1; 10333e519524SHoward Hinnant} 10343e519524SHoward Hinnant 10353e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10373e519524SHoward Hinnant_ForwardIterator1 10383e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10393e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10403e519524SHoward Hinnant{ 10413e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10423e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1043ce48a113SHoward Hinnant return _VSTD::find_first_of(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10443e519524SHoward Hinnant} 10453e519524SHoward Hinnant 10463e519524SHoward Hinnant// adjacent_find 10473e519524SHoward Hinnant 10483e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 10493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10503e519524SHoward Hinnant_ForwardIterator 10513e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 10523e519524SHoward Hinnant{ 10533e519524SHoward Hinnant if (__first != __last) 10543e519524SHoward Hinnant { 10553e519524SHoward Hinnant _ForwardIterator __i = __first; 10563e519524SHoward Hinnant while (++__i != __last) 10573e519524SHoward Hinnant { 10583e519524SHoward Hinnant if (__pred(*__first, *__i)) 10593e519524SHoward Hinnant return __first; 10603e519524SHoward Hinnant __first = __i; 10613e519524SHoward Hinnant } 10623e519524SHoward Hinnant } 10633e519524SHoward Hinnant return __last; 10643e519524SHoward Hinnant} 10653e519524SHoward Hinnant 10663e519524SHoward Hinnanttemplate <class _ForwardIterator> 10673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10683e519524SHoward Hinnant_ForwardIterator 10693e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 10703e519524SHoward Hinnant{ 10713e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1072ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 10733e519524SHoward Hinnant} 10743e519524SHoward Hinnant 10753e519524SHoward Hinnant// count 10763e519524SHoward Hinnant 10773e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 10783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10793e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1080e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 10813e519524SHoward Hinnant{ 10823e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 10833e519524SHoward Hinnant for (; __first != __last; ++__first) 1084e4383379SHoward Hinnant if (*__first == __value_) 10853e519524SHoward Hinnant ++__r; 10863e519524SHoward Hinnant return __r; 10873e519524SHoward Hinnant} 10883e519524SHoward Hinnant 10893e519524SHoward Hinnant// count_if 10903e519524SHoward Hinnant 10913e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 10923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10933e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 10943e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 10953e519524SHoward Hinnant{ 10963e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 10973e519524SHoward Hinnant for (; __first != __last; ++__first) 10983e519524SHoward Hinnant if (__pred(*__first)) 10993e519524SHoward Hinnant ++__r; 11003e519524SHoward Hinnant return __r; 11013e519524SHoward Hinnant} 11023e519524SHoward Hinnant 11033e519524SHoward Hinnant// mismatch 11043e519524SHoward Hinnant 11053e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11073e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11083e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11093e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 11103e519524SHoward Hinnant{ 11113e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 11123e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11133e519524SHoward Hinnant break; 11143e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11153e519524SHoward Hinnant} 11163e519524SHoward Hinnant 11173e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11193e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11203e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11213e519524SHoward Hinnant{ 11223e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11233e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1124ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11253e519524SHoward Hinnant} 11263e519524SHoward Hinnant 11270b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 11280b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11290b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11300b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11310b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11320b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 11330b0bbd2fSMarshall Clow _BinaryPredicate __pred) 11340b0bbd2fSMarshall Clow{ 11350b0bbd2fSMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2) 11360b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 11370b0bbd2fSMarshall Clow break; 11380b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11390b0bbd2fSMarshall Clow} 11400b0bbd2fSMarshall Clow 11410b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 11420b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11430b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11440b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11450b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 11460b0bbd2fSMarshall Clow{ 11470b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11480b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 11490b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11500b0bbd2fSMarshall Clow} 11510b0bbd2fSMarshall Clow#endif 11520b0bbd2fSMarshall Clow 11533e519524SHoward Hinnant// equal 11543e519524SHoward Hinnant 11553e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11573e519524SHoward Hinnantbool 11583e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 11593e519524SHoward Hinnant{ 11603e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 11613e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11623e519524SHoward Hinnant return false; 11633e519524SHoward Hinnant return true; 11643e519524SHoward Hinnant} 11653e519524SHoward Hinnant 11663e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11683e519524SHoward Hinnantbool 11693e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11703e519524SHoward Hinnant{ 11713e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11723e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1173ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11743e519524SHoward Hinnant} 11753e519524SHoward Hinnant 11760b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 11770b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 11780b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11790b0bbd2fSMarshall Clowbool 11800b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 11810b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 11820b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 11830b0bbd2fSMarshall Clow{ 11840b0bbd2fSMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2) 11850b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 11860b0bbd2fSMarshall Clow return false; 11870b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 11880b0bbd2fSMarshall Clow} 11890b0bbd2fSMarshall Clow 11900b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 11910b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11920b0bbd2fSMarshall Clowbool 11930b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 11940b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 11950b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 11960b0bbd2fSMarshall Clow{ 11970b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 11980b0bbd2fSMarshall Clow return false; 11990b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 12000b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 12010b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 12020b0bbd2fSMarshall Clow} 12030b0bbd2fSMarshall Clow 12040b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12050b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12060b0bbd2fSMarshall Clowbool 12070b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12080b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 12090b0bbd2fSMarshall Clow{ 12100b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 12110b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 12120b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12130b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12140b0bbd2fSMarshall Clow} 12150b0bbd2fSMarshall Clow 12160b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 12170b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12180b0bbd2fSMarshall Clowbool 12190b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12200b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12210b0bbd2fSMarshall Clow{ 12220b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12230b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12240b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 12250b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12260b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12270b0bbd2fSMarshall Clow} 12280b0bbd2fSMarshall Clow#endif 12290b0bbd2fSMarshall Clow 12303e519524SHoward Hinnant// is_permutation 12313e519524SHoward Hinnant 12323e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 12333e519524SHoward Hinnantbool 12343e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12353e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 12363e519524SHoward Hinnant{ 12373e519524SHoward Hinnant // shorten sequences as much as possible by lopping of any equal parts 12383e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 12393e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12403e519524SHoward Hinnant goto __not_done; 12413e519524SHoward Hinnant return true; 12423e519524SHoward Hinnant__not_done: 12433e519524SHoward Hinnant // __first1 != __last1 && *__first1 != *__first2 12443e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1245ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 12463e519524SHoward Hinnant if (__l1 == _D1(1)) 12473e519524SHoward Hinnant return false; 1248ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 12493e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 12503e519524SHoward Hinnant // equal elements in [f2, l2) 12513e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 12523e519524SHoward Hinnant { 12533e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 12543e519524SHoward Hinnant for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 12553e519524SHoward Hinnant if (__pred(*__j, *__i)) 12563e519524SHoward Hinnant goto __next_iter; 12573e519524SHoward Hinnant { 12583e519524SHoward Hinnant // Count number of *__i in [f2, l2) 12593e519524SHoward Hinnant _D1 __c2 = 0; 12603e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 12613e519524SHoward Hinnant if (__pred(*__i, *__j)) 12623e519524SHoward Hinnant ++__c2; 12633e519524SHoward Hinnant if (__c2 == 0) 12643e519524SHoward Hinnant return false; 12653e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 12663e519524SHoward Hinnant _D1 __c1 = 1; 1267ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 12683e519524SHoward Hinnant if (__pred(*__i, *__j)) 12693e519524SHoward Hinnant ++__c1; 12703e519524SHoward Hinnant if (__c1 != __c2) 12713e519524SHoward Hinnant return false; 12723e519524SHoward Hinnant } 12733e519524SHoward Hinnant__next_iter:; 12743e519524SHoward Hinnant } 12753e519524SHoward Hinnant return true; 12763e519524SHoward Hinnant} 12773e519524SHoward Hinnant 12783e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 12793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12803e519524SHoward Hinnantbool 12813e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12823e519524SHoward Hinnant _ForwardIterator2 __first2) 12833e519524SHoward Hinnant{ 12843e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 12853e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1286ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12873e519524SHoward Hinnant} 12883e519524SHoward Hinnant 12890b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12900b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 12910b0bbd2fSMarshall Clowbool 12920b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12930b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 12940b0bbd2fSMarshall Clow _BinaryPredicate __pred, 12950b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 12960b0bbd2fSMarshall Clow{ 12970b0bbd2fSMarshall Clow // shorten sequences as much as possible by lopping of any equal parts 12980b0bbd2fSMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2) 12990b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 13000b0bbd2fSMarshall Clow goto __not_done; 13010b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 13020b0bbd2fSMarshall Clow__not_done: 13030b0bbd2fSMarshall Clow // __first1 != __last1 && __first2 != __last2 && *__first1 != *__first2 13040b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 13050b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 13060b0bbd2fSMarshall Clow 13070b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1308fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 13090b0bbd2fSMarshall Clow if (__l1 != __l2) 13100b0bbd2fSMarshall Clow return false; 13110b0bbd2fSMarshall Clow 13120b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 13130b0bbd2fSMarshall Clow // equal elements in [f2, l2) 13140b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13150b0bbd2fSMarshall Clow { 13160b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 13170b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 13180b0bbd2fSMarshall Clow if (__pred(*__j, *__i)) 13190b0bbd2fSMarshall Clow goto __next_iter; 13200b0bbd2fSMarshall Clow { 13210b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 13220b0bbd2fSMarshall Clow _D1 __c2 = 0; 13230b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13240b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13250b0bbd2fSMarshall Clow ++__c2; 13260b0bbd2fSMarshall Clow if (__c2 == 0) 13270b0bbd2fSMarshall Clow return false; 13280b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 13290b0bbd2fSMarshall Clow _D1 __c1 = 1; 13300b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13310b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13320b0bbd2fSMarshall Clow ++__c1; 13330b0bbd2fSMarshall Clow if (__c1 != __c2) 13340b0bbd2fSMarshall Clow return false; 13350b0bbd2fSMarshall Clow } 13360b0bbd2fSMarshall Clow__next_iter:; 13370b0bbd2fSMarshall Clow } 13380b0bbd2fSMarshall Clow return true; 13390b0bbd2fSMarshall Clow} 13400b0bbd2fSMarshall Clow 13410b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 13420b0bbd2fSMarshall Clowbool 13430b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 13440b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 13450b0bbd2fSMarshall Clow _BinaryPredicate __pred, 13460b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 13470b0bbd2fSMarshall Clow{ 13480b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 13490b0bbd2fSMarshall Clow return false; 13500b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 13510b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 13520b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 13530b0bbd2fSMarshall Clow} 13540b0bbd2fSMarshall Clow 13550b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 13560b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13570b0bbd2fSMarshall Clowbool 13580b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13590b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 13600b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 13610b0bbd2fSMarshall Clow{ 13620b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 13630b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 13640b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 13650b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 13660b0bbd2fSMarshall Clow} 13670b0bbd2fSMarshall Clow 13680b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 13690b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13700b0bbd2fSMarshall Clowbool 13710b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13720b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 13730b0bbd2fSMarshall Clow{ 13740b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 13750b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 13760b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 13770b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 13780b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 13790b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 13800b0bbd2fSMarshall Clow} 13810b0bbd2fSMarshall Clow#endif 13820b0bbd2fSMarshall Clow 13833e519524SHoward Hinnant// search 13843e519524SHoward Hinnant 13853e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 13863e519524SHoward Hinnant_ForwardIterator1 13873e519524SHoward Hinnant__search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13883e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 13893e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 13903e519524SHoward Hinnant{ 13913e519524SHoward Hinnant if (__first2 == __last2) 13923e519524SHoward Hinnant return __first1; // Everything matches an empty sequence 13933e519524SHoward Hinnant while (true) 13943e519524SHoward Hinnant { 13953e519524SHoward Hinnant // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks 13963e519524SHoward Hinnant while (true) 13973e519524SHoward Hinnant { 13983e519524SHoward Hinnant if (__first1 == __last1) // return __last1 if no element matches *__first2 13993e519524SHoward Hinnant return __last1; 14003e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14013e519524SHoward Hinnant break; 14023e519524SHoward Hinnant ++__first1; 14033e519524SHoward Hinnant } 14043e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 14053e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 14063e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 14073e519524SHoward Hinnant while (true) 14083e519524SHoward Hinnant { 14093e519524SHoward Hinnant if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern) 14103e519524SHoward Hinnant return __first1; 14113e519524SHoward Hinnant if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found 14123e519524SHoward Hinnant return __last1; 14133e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1 14143e519524SHoward Hinnant { 14153e519524SHoward Hinnant ++__first1; 14163e519524SHoward Hinnant break; 14173e519524SHoward Hinnant } // else there is a match, check next elements 14183e519524SHoward Hinnant } 14193e519524SHoward Hinnant } 14203e519524SHoward Hinnant} 14213e519524SHoward Hinnant 14223e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 14233e519524SHoward Hinnant_RandomAccessIterator1 14243e519524SHoward Hinnant__search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 14253e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 14263e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 14273e519524SHoward Hinnant{ 14283e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type _D1; 14293e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator2>::difference_type _D2; 14303e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 14313e519524SHoward Hinnant _D2 __len2 = __last2 - __first2; 14323e519524SHoward Hinnant if (__len2 == 0) 14333e519524SHoward Hinnant return __first1; 14343e519524SHoward Hinnant _D1 __len1 = __last1 - __first1; 14353e519524SHoward Hinnant if (__len1 < __len2) 14363e519524SHoward Hinnant return __last1; 14373e519524SHoward Hinnant const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here 14383e519524SHoward Hinnant while (true) 14393e519524SHoward Hinnant { 14403e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 14413e519524SHoward Hinnant while (true) 14423e519524SHoward Hinnant { 14433e519524SHoward Hinnant if (__first1 == __s) 14443e519524SHoward Hinnant return __last1; 14453e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14463e519524SHoward Hinnant break; 14473e519524SHoward Hinnant ++__first1; 14483e519524SHoward Hinnant } 1449b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 14503e519524SHoward Hinnant for (_D1 __loop_unroll = (__s - __first1) / 4; __loop_unroll > 0; --__loop_unroll) 14513e519524SHoward Hinnant { 14523e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14533e519524SHoward Hinnant goto __phase2; 14543e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14553e519524SHoward Hinnant goto __phase2; 14563e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14573e519524SHoward Hinnant goto __phase2; 14583e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14593e519524SHoward Hinnant goto __phase2; 14603e519524SHoward Hinnant ++__first1; 14613e519524SHoward Hinnant } 14623e519524SHoward Hinnant switch (__s - __first1) 14633e519524SHoward Hinnant { 14643e519524SHoward Hinnant case 3: 14653e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14663e519524SHoward Hinnant break; 14673e519524SHoward Hinnant ++__first1; 14683e519524SHoward Hinnant case 2: 14693e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14703e519524SHoward Hinnant break; 14713e519524SHoward Hinnant ++__first1; 14723e519524SHoward Hinnant case 1: 14733e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14743e519524SHoward Hinnant break; 14753e519524SHoward Hinnant case 0: 14763e519524SHoward Hinnant return __last1; 14773e519524SHoward Hinnant } 14783e519524SHoward Hinnant __phase2: 1479b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 14803e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __first1; 14813e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __first2; 14823e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 14833e519524SHoward Hinnant while (true) 14843e519524SHoward Hinnant { 14853e519524SHoward Hinnant if (++__m2 == __last2) 14863e519524SHoward Hinnant return __first1; 14873e519524SHoward Hinnant ++__m1; // no need to check range on __m1 because __s guarantees we have enough source 14883e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 14893e519524SHoward Hinnant { 14903e519524SHoward Hinnant ++__first1; 14913e519524SHoward Hinnant break; 14923e519524SHoward Hinnant } 14933e519524SHoward Hinnant } 1494b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 14953e519524SHoward Hinnant ++__m2; 14963e519524SHoward Hinnant ++__m1; 14973e519524SHoward Hinnant for (_D2 __loop_unroll = (__last2 - __m2) / 4; __loop_unroll > 0; --__loop_unroll) 14983e519524SHoward Hinnant { 14993e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15003e519524SHoward Hinnant goto __continue; 15013e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15023e519524SHoward Hinnant goto __continue; 15033e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15043e519524SHoward Hinnant goto __continue; 15053e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15063e519524SHoward Hinnant goto __continue; 15073e519524SHoward Hinnant ++__m1; 15083e519524SHoward Hinnant ++__m2; 15093e519524SHoward Hinnant } 15103e519524SHoward Hinnant switch (__last2 - __m2) 15113e519524SHoward Hinnant { 15123e519524SHoward Hinnant case 3: 15133e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15143e519524SHoward Hinnant break; 15153e519524SHoward Hinnant ++__m1; 15163e519524SHoward Hinnant ++__m2; 15173e519524SHoward Hinnant case 2: 15183e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15193e519524SHoward Hinnant break; 15203e519524SHoward Hinnant ++__m1; 15213e519524SHoward Hinnant ++__m2; 15223e519524SHoward Hinnant case 1: 15233e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15243e519524SHoward Hinnant break; 15253e519524SHoward Hinnant case 0: 15263e519524SHoward Hinnant return __first1; 15273e519524SHoward Hinnant } 15283e519524SHoward Hinnant __continue: 15293e519524SHoward Hinnant ++__first1; 1530b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 15313e519524SHoward Hinnant } 15323e519524SHoward Hinnant} 15333e519524SHoward Hinnant 15343e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 15353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15363e519524SHoward Hinnant_ForwardIterator1 15373e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15383e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 15393e519524SHoward Hinnant{ 1540ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 15413e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 15423e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator1>::iterator_category(), 15433e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator2>::iterator_category()); 15443e519524SHoward Hinnant} 15453e519524SHoward Hinnant 15463e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 15473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15483e519524SHoward Hinnant_ForwardIterator1 15493e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15503e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15513e519524SHoward Hinnant{ 15523e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator1>::value_type __v1; 15533e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator2>::value_type __v2; 1554ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 15553e519524SHoward Hinnant} 15563e519524SHoward Hinnant 15573e519524SHoward Hinnant// search_n 15583e519524SHoward Hinnant 15593e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 15603e519524SHoward Hinnant_ForwardIterator 15613e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1562e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 15633e519524SHoward Hinnant{ 15643e519524SHoward Hinnant if (__count <= 0) 15653e519524SHoward Hinnant return __first; 15663e519524SHoward Hinnant while (true) 15673e519524SHoward Hinnant { 1568e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 15693e519524SHoward Hinnant while (true) 15703e519524SHoward Hinnant { 1571e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 15723e519524SHoward Hinnant return __last; 1573e4383379SHoward Hinnant if (__pred(*__first, __value_)) 15743e519524SHoward Hinnant break; 15753e519524SHoward Hinnant ++__first; 15763e519524SHoward Hinnant } 1577e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 15783e519524SHoward Hinnant _ForwardIterator __m = __first; 15793e519524SHoward Hinnant _Size __c(0); 15803e519524SHoward Hinnant while (true) 15813e519524SHoward Hinnant { 15823e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 15833e519524SHoward Hinnant return __first; 15843e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 15853e519524SHoward Hinnant return __last; 1586e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 15873e519524SHoward Hinnant { 15883e519524SHoward Hinnant __first = __m; 15893e519524SHoward Hinnant ++__first; 15903e519524SHoward Hinnant break; 15913e519524SHoward Hinnant } // else there is a match, check next elements 15923e519524SHoward Hinnant } 15933e519524SHoward Hinnant } 15943e519524SHoward Hinnant} 15953e519524SHoward Hinnant 15963e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 15973e519524SHoward Hinnant_RandomAccessIterator 15983e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1599e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 16003e519524SHoward Hinnant{ 16013e519524SHoward Hinnant if (__count <= 0) 16023e519524SHoward Hinnant return __first; 16033e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 16043e519524SHoward Hinnant if (__len < __count) 16053e519524SHoward Hinnant return __last; 16063e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 16073e519524SHoward Hinnant while (true) 16083e519524SHoward Hinnant { 1609e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16103e519524SHoward Hinnant while (true) 16113e519524SHoward Hinnant { 1612b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 16133e519524SHoward Hinnant return __last; 1614e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16153e519524SHoward Hinnant break; 16163e519524SHoward Hinnant ++__first; 16173e519524SHoward Hinnant } 1618e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16193e519524SHoward Hinnant _RandomAccessIterator __m = __first; 16203e519524SHoward Hinnant _Size __c(0); 16213e519524SHoward Hinnant while (true) 16223e519524SHoward Hinnant { 16233e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16243e519524SHoward Hinnant return __first; 16253e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1626e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16273e519524SHoward Hinnant { 16283e519524SHoward Hinnant __first = __m; 16293e519524SHoward Hinnant ++__first; 16303e519524SHoward Hinnant break; 16313e519524SHoward Hinnant } // else there is a match, check next elements 16323e519524SHoward Hinnant } 16333e519524SHoward Hinnant } 16343e519524SHoward Hinnant} 16353e519524SHoward Hinnant 16363e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 16373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16383e519524SHoward Hinnant_ForwardIterator 16393e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1640e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 16413e519524SHoward Hinnant{ 1642ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 1643e4383379SHoward Hinnant (__first, __last, __count, __value_, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 16443e519524SHoward Hinnant} 16453e519524SHoward Hinnant 16463e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 16473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16483e519524SHoward Hinnant_ForwardIterator 1649e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 16503e519524SHoward Hinnant{ 16513e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1652e4383379SHoward Hinnant return _VSTD::search_n(__first, __last, __count, __value_, __equal_to<__v, _Tp>()); 16533e519524SHoward Hinnant} 16543e519524SHoward Hinnant 16553e519524SHoward Hinnant// copy 16563e519524SHoward Hinnant 16573e519524SHoward Hinnanttemplate <class _Iter> 16583e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator 16593e519524SHoward Hinnant{ 16603e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16613e519524SHoward Hinnant}; 16623e519524SHoward Hinnant 16633e519524SHoward Hinnanttemplate <class _Iter> 16643e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<move_iterator<_Iter> > 16653e519524SHoward Hinnant{ 16663e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16673e519524SHoward Hinnant}; 16683e519524SHoward Hinnant 16693e519524SHoward Hinnanttemplate <class _Iter> 16703e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<__wrap_iter<_Iter> > 16713e519524SHoward Hinnant{ 16723e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16733e519524SHoward Hinnant}; 16743e519524SHoward Hinnant 16753e519524SHoward Hinnanttemplate <class _Iter> 16763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16773e519524SHoward Hinnant_Iter 16783e519524SHoward Hinnant__unwrap_iter(_Iter __i) 16793e519524SHoward Hinnant{ 16803e519524SHoward Hinnant return __i; 16813e519524SHoward Hinnant} 16823e519524SHoward Hinnant 16833e519524SHoward Hinnanttemplate <class _Tp> 16843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16853e519524SHoward Hinnanttypename enable_if 16863e519524SHoward Hinnant< 1687ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 16883e519524SHoward Hinnant _Tp* 16893e519524SHoward Hinnant>::type 16903e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 16913e519524SHoward Hinnant{ 16923e519524SHoward Hinnant return __i.base(); 16933e519524SHoward Hinnant} 16943e519524SHoward Hinnant 1695*fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1696*fc88dbd2SHoward Hinnant 16973e519524SHoward Hinnanttemplate <class _Tp> 16983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16993e519524SHoward Hinnanttypename enable_if 17003e519524SHoward Hinnant< 1701ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17023e519524SHoward Hinnant _Tp* 17033e519524SHoward Hinnant>::type 17043e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 17053e519524SHoward Hinnant{ 17063e519524SHoward Hinnant return __i.base(); 17073e519524SHoward Hinnant} 17083e519524SHoward Hinnant 1709*fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1710*fc88dbd2SHoward Hinnant 17113e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17133e519524SHoward Hinnant_OutputIterator 17143e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17153e519524SHoward Hinnant{ 17163e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 17173e519524SHoward Hinnant *__result = *__first; 17183e519524SHoward Hinnant return __result; 17193e519524SHoward Hinnant} 17203e519524SHoward Hinnant 17213e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17233e519524SHoward Hinnanttypename enable_if 17243e519524SHoward Hinnant< 17253e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1726ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17273e519524SHoward Hinnant _Up* 17283e519524SHoward Hinnant>::type 17293e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 17303e519524SHoward Hinnant{ 17313e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 1732ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17333e519524SHoward Hinnant return __result + __n; 17343e519524SHoward Hinnant} 17353e519524SHoward Hinnant 17363e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17383e519524SHoward Hinnant_OutputIterator 17393e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17403e519524SHoward Hinnant{ 1741ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17423e519524SHoward Hinnant} 17433e519524SHoward Hinnant 17443e519524SHoward Hinnant// copy_backward 17453e519524SHoward Hinnant 1746d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 17473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17483e519524SHoward Hinnant_OutputIterator 1749d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 17503e519524SHoward Hinnant{ 17513e519524SHoward Hinnant while (__first != __last) 17523e519524SHoward Hinnant *--__result = *--__last; 17533e519524SHoward Hinnant return __result; 17543e519524SHoward Hinnant} 17553e519524SHoward Hinnant 17563e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17583e519524SHoward Hinnanttypename enable_if 17593e519524SHoward Hinnant< 17603e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1761ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17623e519524SHoward Hinnant _Up* 17633e519524SHoward Hinnant>::type 17643e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 17653e519524SHoward Hinnant{ 17663e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17673e519524SHoward Hinnant __result -= __n; 1768ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17693e519524SHoward Hinnant return __result; 17703e519524SHoward Hinnant} 17713e519524SHoward Hinnant 17723e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 17733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17743e519524SHoward Hinnant_BidirectionalIterator2 17753e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 17763e519524SHoward Hinnant _BidirectionalIterator2 __result) 17773e519524SHoward Hinnant{ 1778ce48a113SHoward Hinnant return _VSTD::__copy_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17793e519524SHoward Hinnant} 17803e519524SHoward Hinnant 17813e519524SHoward Hinnant// copy_if 17823e519524SHoward Hinnant 17833e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 17843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17853e519524SHoward Hinnant_OutputIterator 17863e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 17873e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 17883e519524SHoward Hinnant{ 17893e519524SHoward Hinnant for (; __first != __last; ++__first) 17903e519524SHoward Hinnant { 17913e519524SHoward Hinnant if (__pred(*__first)) 17923e519524SHoward Hinnant { 17933e519524SHoward Hinnant *__result = *__first; 17943e519524SHoward Hinnant ++__result; 17953e519524SHoward Hinnant } 17963e519524SHoward Hinnant } 17973e519524SHoward Hinnant return __result; 17983e519524SHoward Hinnant} 17993e519524SHoward Hinnant 18003e519524SHoward Hinnant// copy_n 18013e519524SHoward Hinnant 18023e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18043e519524SHoward Hinnanttypename enable_if 18053e519524SHoward Hinnant< 18063e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 18073e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 18083e519524SHoward Hinnant _OutputIterator 18093e519524SHoward Hinnant>::type 18103e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 18113e519524SHoward Hinnant{ 181299847d2bSHoward Hinnant if (__n > 0) 181399847d2bSHoward Hinnant { 18143e519524SHoward Hinnant *__result = *__first; 181599847d2bSHoward Hinnant ++__result; 181699847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 181799847d2bSHoward Hinnant { 181899847d2bSHoward Hinnant ++__first; 181999847d2bSHoward Hinnant *__result = *__first; 182099847d2bSHoward Hinnant ++__result; 182199847d2bSHoward Hinnant } 182299847d2bSHoward Hinnant } 18233e519524SHoward Hinnant return __result; 18243e519524SHoward Hinnant} 18253e519524SHoward Hinnant 18263e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18283e519524SHoward Hinnanttypename enable_if 18293e519524SHoward Hinnant< 18303e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 18313e519524SHoward Hinnant _OutputIterator 18323e519524SHoward Hinnant>::type 18333e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 18343e519524SHoward Hinnant{ 1835ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 18363e519524SHoward Hinnant} 18373e519524SHoward Hinnant 18383e519524SHoward Hinnant// move 18393e519524SHoward Hinnant 18403e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18423e519524SHoward Hinnant_OutputIterator 18433e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18443e519524SHoward Hinnant{ 18453e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 1846ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 18473e519524SHoward Hinnant return __result; 18483e519524SHoward Hinnant} 18493e519524SHoward Hinnant 18503e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18523e519524SHoward Hinnanttypename enable_if 18533e519524SHoward Hinnant< 18543e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1855ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18563e519524SHoward Hinnant _Up* 18573e519524SHoward Hinnant>::type 18583e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 18593e519524SHoward Hinnant{ 18603e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 1861ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18623e519524SHoward Hinnant return __result + __n; 18633e519524SHoward Hinnant} 18643e519524SHoward Hinnant 18653e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18673e519524SHoward Hinnant_OutputIterator 18683e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18693e519524SHoward Hinnant{ 1870ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18713e519524SHoward Hinnant} 18723e519524SHoward Hinnant 18733e519524SHoward Hinnant// move_backward 18743e519524SHoward Hinnant 18753e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18773e519524SHoward Hinnant_OutputIterator 18783e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18793e519524SHoward Hinnant{ 18803e519524SHoward Hinnant while (__first != __last) 1881ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 18823e519524SHoward Hinnant return __result; 18833e519524SHoward Hinnant} 18843e519524SHoward Hinnant 18853e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18873e519524SHoward Hinnanttypename enable_if 18883e519524SHoward Hinnant< 18893e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1890ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18913e519524SHoward Hinnant _Up* 18923e519524SHoward Hinnant>::type 18933e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 18943e519524SHoward Hinnant{ 18953e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18963e519524SHoward Hinnant __result -= __n; 1897ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18983e519524SHoward Hinnant return __result; 18993e519524SHoward Hinnant} 19003e519524SHoward Hinnant 19013e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 19023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19033e519524SHoward Hinnant_BidirectionalIterator2 19043e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 19053e519524SHoward Hinnant _BidirectionalIterator2 __result) 19063e519524SHoward Hinnant{ 1907ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19083e519524SHoward Hinnant} 19093e519524SHoward Hinnant 19103e519524SHoward Hinnant// iter_swap 19113e519524SHoward Hinnant 1912a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 19133e519524SHoward Hinnant 19143e519524SHoward Hinnant// transform 19153e519524SHoward Hinnant 19163e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 19173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19183e519524SHoward Hinnant_OutputIterator 19193e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 19203e519524SHoward Hinnant{ 19213e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 19223e519524SHoward Hinnant *__result = __op(*__first); 19233e519524SHoward Hinnant return __result; 19243e519524SHoward Hinnant} 19253e519524SHoward Hinnant 19263e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 19273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19283e519524SHoward Hinnant_OutputIterator 19293e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 19303e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 19313e519524SHoward Hinnant{ 19323e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2, ++__result) 19333e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 19343e519524SHoward Hinnant return __result; 19353e519524SHoward Hinnant} 19363e519524SHoward Hinnant 19373e519524SHoward Hinnant// replace 19383e519524SHoward Hinnant 19393e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19413e519524SHoward Hinnantvoid 19423e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 19433e519524SHoward Hinnant{ 19443e519524SHoward Hinnant for (; __first != __last; ++__first) 19453e519524SHoward Hinnant if (*__first == __old_value) 19463e519524SHoward Hinnant *__first = __new_value; 19473e519524SHoward Hinnant} 19483e519524SHoward Hinnant 19493e519524SHoward Hinnant// replace_if 19503e519524SHoward Hinnant 19513e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 19523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19533e519524SHoward Hinnantvoid 19543e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 19553e519524SHoward Hinnant{ 19563e519524SHoward Hinnant for (; __first != __last; ++__first) 19573e519524SHoward Hinnant if (__pred(*__first)) 19583e519524SHoward Hinnant *__first = __new_value; 19593e519524SHoward Hinnant} 19603e519524SHoward Hinnant 19613e519524SHoward Hinnant// replace_copy 19623e519524SHoward Hinnant 19633e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 19643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19653e519524SHoward Hinnant_OutputIterator 19663e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19673e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 19683e519524SHoward Hinnant{ 19693e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 19703e519524SHoward Hinnant if (*__first == __old_value) 19713e519524SHoward Hinnant *__result = __new_value; 19723e519524SHoward Hinnant else 19733e519524SHoward Hinnant *__result = *__first; 19743e519524SHoward Hinnant return __result; 19753e519524SHoward Hinnant} 19763e519524SHoward Hinnant 19773e519524SHoward Hinnant// replace_copy_if 19783e519524SHoward Hinnant 19793e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 19803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19813e519524SHoward Hinnant_OutputIterator 19823e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19833e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 19843e519524SHoward Hinnant{ 19853e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 19863e519524SHoward Hinnant if (__pred(*__first)) 19873e519524SHoward Hinnant *__result = __new_value; 19883e519524SHoward Hinnant else 19893e519524SHoward Hinnant *__result = *__first; 19903e519524SHoward Hinnant return __result; 19913e519524SHoward Hinnant} 19923e519524SHoward Hinnant 19933e519524SHoward Hinnant// fill_n 19943e519524SHoward Hinnant 19953e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 19963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19973e519524SHoward Hinnant_OutputIterator 19980f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 19993e519524SHoward Hinnant{ 20003e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 2001e4383379SHoward Hinnant *__first = __value_; 20023e519524SHoward Hinnant return __first; 20033e519524SHoward Hinnant} 20043e519524SHoward Hinnant 20050f242beaSHoward Hinnanttemplate <class _Tp, class _Size, class _Up> 20063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20070f242beaSHoward Hinnanttypename enable_if 20080f242beaSHoward Hinnant< 20090f242beaSHoward Hinnant is_integral<_Tp>::value && sizeof(_Tp) == 1 && 20100f242beaSHoward Hinnant !is_same<_Tp, bool>::value && 20110f242beaSHoward Hinnant is_integral<_Up>::value && sizeof(_Up) == 1, 20120f242beaSHoward Hinnant _Tp* 20130f242beaSHoward Hinnant>::type 20140f242beaSHoward Hinnant__fill_n(_Tp* __first, _Size __n,_Up __value_) 20153e519524SHoward Hinnant{ 20163e519524SHoward Hinnant if (__n > 0) 2017e4383379SHoward Hinnant _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n)); 20183e519524SHoward Hinnant return __first + __n; 20193e519524SHoward Hinnant} 20203e519524SHoward Hinnant 20213e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20233e519524SHoward Hinnant_OutputIterator 2024e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20253e519524SHoward Hinnant{ 20260f242beaSHoward Hinnant return _VSTD::__fill_n(__first, __n, __value_); 20273e519524SHoward Hinnant} 20283e519524SHoward Hinnant 20293e519524SHoward Hinnant// fill 20303e519524SHoward Hinnant 20313e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20333e519524SHoward Hinnantvoid 2034e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 20353e519524SHoward Hinnant{ 20363e519524SHoward Hinnant for (; __first != __last; ++__first) 2037e4383379SHoward Hinnant *__first = __value_; 20383e519524SHoward Hinnant} 20393e519524SHoward Hinnant 20403e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 20413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20423e519524SHoward Hinnantvoid 2043e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 20443e519524SHoward Hinnant{ 2045e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 20463e519524SHoward Hinnant} 20473e519524SHoward Hinnant 20483e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20503e519524SHoward Hinnantvoid 2051e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20523e519524SHoward Hinnant{ 2053e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 20543e519524SHoward Hinnant} 20553e519524SHoward Hinnant 20563e519524SHoward Hinnant// generate 20573e519524SHoward Hinnant 20583e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 20593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20603e519524SHoward Hinnantvoid 20613e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 20623e519524SHoward Hinnant{ 20633e519524SHoward Hinnant for (; __first != __last; ++__first) 20643e519524SHoward Hinnant *__first = __gen(); 20653e519524SHoward Hinnant} 20663e519524SHoward Hinnant 20673e519524SHoward Hinnant// generate_n 20683e519524SHoward Hinnant 20693e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 20703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20713e519524SHoward Hinnant_OutputIterator 20723e519524SHoward Hinnantgenerate_n(_OutputIterator __first, _Size __n, _Generator __gen) 20733e519524SHoward Hinnant{ 20743e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 20753e519524SHoward Hinnant *__first = __gen(); 20763e519524SHoward Hinnant return __first; 20773e519524SHoward Hinnant} 20783e519524SHoward Hinnant 20793e519524SHoward Hinnant// remove 20803e519524SHoward Hinnant 20813e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20823e519524SHoward Hinnant_ForwardIterator 2083e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20843e519524SHoward Hinnant{ 2085e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 20863e519524SHoward Hinnant if (__first != __last) 20873e519524SHoward Hinnant { 20883e519524SHoward Hinnant _ForwardIterator __i = __first; 20893e519524SHoward Hinnant while (++__i != __last) 20903e519524SHoward Hinnant { 2091e4383379SHoward Hinnant if (!(*__i == __value_)) 20923e519524SHoward Hinnant { 2093ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 20943e519524SHoward Hinnant ++__first; 20953e519524SHoward Hinnant } 20963e519524SHoward Hinnant } 20973e519524SHoward Hinnant } 20983e519524SHoward Hinnant return __first; 20993e519524SHoward Hinnant} 21003e519524SHoward Hinnant 21013e519524SHoward Hinnant// remove_if 21023e519524SHoward Hinnant 21033e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 21043e519524SHoward Hinnant_ForwardIterator 21053e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 21063e519524SHoward Hinnant{ 2107ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 21083e519524SHoward Hinnant (__first, __last, __pred); 21093e519524SHoward Hinnant if (__first != __last) 21103e519524SHoward Hinnant { 21113e519524SHoward Hinnant _ForwardIterator __i = __first; 21123e519524SHoward Hinnant while (++__i != __last) 21133e519524SHoward Hinnant { 21143e519524SHoward Hinnant if (!__pred(*__i)) 21153e519524SHoward Hinnant { 2116ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21173e519524SHoward Hinnant ++__first; 21183e519524SHoward Hinnant } 21193e519524SHoward Hinnant } 21203e519524SHoward Hinnant } 21213e519524SHoward Hinnant return __first; 21223e519524SHoward Hinnant} 21233e519524SHoward Hinnant 21243e519524SHoward Hinnant// remove_copy 21253e519524SHoward Hinnant 21263e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 21273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21283e519524SHoward Hinnant_OutputIterator 2129e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 21303e519524SHoward Hinnant{ 21313e519524SHoward Hinnant for (; __first != __last; ++__first) 21323e519524SHoward Hinnant { 2133e4383379SHoward Hinnant if (!(*__first == __value_)) 21343e519524SHoward Hinnant { 21353e519524SHoward Hinnant *__result = *__first; 21363e519524SHoward Hinnant ++__result; 21373e519524SHoward Hinnant } 21383e519524SHoward Hinnant } 21393e519524SHoward Hinnant return __result; 21403e519524SHoward Hinnant} 21413e519524SHoward Hinnant 21423e519524SHoward Hinnant// remove_copy_if 21433e519524SHoward Hinnant 21443e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 21453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21463e519524SHoward Hinnant_OutputIterator 21473e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 21483e519524SHoward Hinnant{ 21493e519524SHoward Hinnant for (; __first != __last; ++__first) 21503e519524SHoward Hinnant { 21513e519524SHoward Hinnant if (!__pred(*__first)) 21523e519524SHoward Hinnant { 21533e519524SHoward Hinnant *__result = *__first; 21543e519524SHoward Hinnant ++__result; 21553e519524SHoward Hinnant } 21563e519524SHoward Hinnant } 21573e519524SHoward Hinnant return __result; 21583e519524SHoward Hinnant} 21593e519524SHoward Hinnant 21603e519524SHoward Hinnant// unique 21613e519524SHoward Hinnant 21623e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 21633e519524SHoward Hinnant_ForwardIterator 21643e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 21653e519524SHoward Hinnant{ 2166ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 21673e519524SHoward Hinnant (__first, __last, __pred); 21683e519524SHoward Hinnant if (__first != __last) 21693e519524SHoward Hinnant { 21703e519524SHoward Hinnant // ... a a ? ... 21713e519524SHoward Hinnant // f i 21723e519524SHoward Hinnant _ForwardIterator __i = __first; 21733e519524SHoward Hinnant for (++__i; ++__i != __last;) 21743e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2175ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 21763e519524SHoward Hinnant ++__first; 21773e519524SHoward Hinnant } 21783e519524SHoward Hinnant return __first; 21793e519524SHoward Hinnant} 21803e519524SHoward Hinnant 21813e519524SHoward Hinnanttemplate <class _ForwardIterator> 21823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21833e519524SHoward Hinnant_ForwardIterator 21843e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 21853e519524SHoward Hinnant{ 21863e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2187ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 21883e519524SHoward Hinnant} 21893e519524SHoward Hinnant 21903e519524SHoward Hinnant// unique_copy 21913e519524SHoward Hinnant 21923e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 21933e519524SHoward Hinnant_OutputIterator 21943e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 21953e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 21963e519524SHoward Hinnant{ 21973e519524SHoward Hinnant if (__first != __last) 21983e519524SHoward Hinnant { 21993e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 22003e519524SHoward Hinnant *__result = __t; 22013e519524SHoward Hinnant ++__result; 22023e519524SHoward Hinnant while (++__first != __last) 22033e519524SHoward Hinnant { 22043e519524SHoward Hinnant if (!__pred(__t, *__first)) 22053e519524SHoward Hinnant { 22063e519524SHoward Hinnant __t = *__first; 22073e519524SHoward Hinnant *__result = __t; 22083e519524SHoward Hinnant ++__result; 22093e519524SHoward Hinnant } 22103e519524SHoward Hinnant } 22113e519524SHoward Hinnant } 22123e519524SHoward Hinnant return __result; 22133e519524SHoward Hinnant} 22143e519524SHoward Hinnant 22153e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 22163e519524SHoward Hinnant_OutputIterator 22173e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22183e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 22193e519524SHoward Hinnant{ 22203e519524SHoward Hinnant if (__first != __last) 22213e519524SHoward Hinnant { 22223e519524SHoward Hinnant _ForwardIterator __i = __first; 22233e519524SHoward Hinnant *__result = *__i; 22243e519524SHoward Hinnant ++__result; 22253e519524SHoward Hinnant while (++__first != __last) 22263e519524SHoward Hinnant { 22273e519524SHoward Hinnant if (!__pred(*__i, *__first)) 22283e519524SHoward Hinnant { 22293e519524SHoward Hinnant *__result = *__first; 22303e519524SHoward Hinnant ++__result; 22313e519524SHoward Hinnant __i = __first; 22323e519524SHoward Hinnant } 22333e519524SHoward Hinnant } 22343e519524SHoward Hinnant } 22353e519524SHoward Hinnant return __result; 22363e519524SHoward Hinnant} 22373e519524SHoward Hinnant 22383e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 22393e519524SHoward Hinnant_ForwardIterator 22403e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 22413e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 22423e519524SHoward Hinnant{ 22433e519524SHoward Hinnant if (__first != __last) 22443e519524SHoward Hinnant { 22453e519524SHoward Hinnant *__result = *__first; 22463e519524SHoward Hinnant while (++__first != __last) 22473e519524SHoward Hinnant if (!__pred(*__result, *__first)) 22483e519524SHoward Hinnant *++__result = *__first; 22493e519524SHoward Hinnant ++__result; 22503e519524SHoward Hinnant } 22513e519524SHoward Hinnant return __result; 22523e519524SHoward Hinnant} 22533e519524SHoward Hinnant 22543e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 22553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22563e519524SHoward Hinnant_OutputIterator 22573e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 22583e519524SHoward Hinnant{ 2259ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 22603e519524SHoward Hinnant (__first, __last, __result, __pred, 22613e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 22623e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 22633e519524SHoward Hinnant} 22643e519524SHoward Hinnant 22653e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 22663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22673e519524SHoward Hinnant_OutputIterator 22683e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 22693e519524SHoward Hinnant{ 22703e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2271ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 22723e519524SHoward Hinnant} 22733e519524SHoward Hinnant 22743e519524SHoward Hinnant// reverse 22753e519524SHoward Hinnant 22763e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 22773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22783e519524SHoward Hinnantvoid 22793e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 22803e519524SHoward Hinnant{ 22813e519524SHoward Hinnant while (__first != __last) 22823e519524SHoward Hinnant { 22833e519524SHoward Hinnant if (__first == --__last) 22843e519524SHoward Hinnant break; 22853e519524SHoward Hinnant swap(*__first, *__last); 22863e519524SHoward Hinnant ++__first; 22873e519524SHoward Hinnant } 22883e519524SHoward Hinnant} 22893e519524SHoward Hinnant 22903e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 22913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22923e519524SHoward Hinnantvoid 22933e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 22943e519524SHoward Hinnant{ 22953e519524SHoward Hinnant if (__first != __last) 22963e519524SHoward Hinnant for (; __first < --__last; ++__first) 22973e519524SHoward Hinnant swap(*__first, *__last); 22983e519524SHoward Hinnant} 22993e519524SHoward Hinnant 23003e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23023e519524SHoward Hinnantvoid 23033e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 23043e519524SHoward Hinnant{ 2305ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 23063e519524SHoward Hinnant} 23073e519524SHoward Hinnant 23083e519524SHoward Hinnant// reverse_copy 23093e519524SHoward Hinnant 23103e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 23113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23123e519524SHoward Hinnant_OutputIterator 23133e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 23143e519524SHoward Hinnant{ 23153e519524SHoward Hinnant for (; __first != __last; ++__result) 23163e519524SHoward Hinnant *__result = *--__last; 23173e519524SHoward Hinnant return __result; 23183e519524SHoward Hinnant} 23193e519524SHoward Hinnant 23203e519524SHoward Hinnant// rotate 23213e519524SHoward Hinnant 23223e519524SHoward Hinnanttemplate <class _ForwardIterator> 23233e519524SHoward Hinnant_ForwardIterator 2324aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 23253e519524SHoward Hinnant{ 2326aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2327aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2328aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2329aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2330aca09de3SHoward Hinnant return __lm1; 2331aca09de3SHoward Hinnant} 2332aca09de3SHoward Hinnant 2333aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2334aca09de3SHoward Hinnant_BidirectionalIterator 2335aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2336aca09de3SHoward Hinnant{ 2337aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2338aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2339aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2340aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2341aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2342aca09de3SHoward Hinnant return __fp1; 2343aca09de3SHoward Hinnant} 2344aca09de3SHoward Hinnant 2345aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2346aca09de3SHoward Hinnant_ForwardIterator 2347aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2348aca09de3SHoward Hinnant{ 23493e519524SHoward Hinnant _ForwardIterator __i = __middle; 23503e519524SHoward Hinnant while (true) 23513e519524SHoward Hinnant { 23523e519524SHoward Hinnant swap(*__first, *__i); 23533e519524SHoward Hinnant ++__first; 23543e519524SHoward Hinnant if (++__i == __last) 23553e519524SHoward Hinnant break; 23563e519524SHoward Hinnant if (__first == __middle) 23573e519524SHoward Hinnant __middle = __i; 23583e519524SHoward Hinnant } 23593e519524SHoward Hinnant _ForwardIterator __r = __first; 23603e519524SHoward Hinnant if (__first != __middle) 23613e519524SHoward Hinnant { 23623e519524SHoward Hinnant __i = __middle; 23633e519524SHoward Hinnant while (true) 23643e519524SHoward Hinnant { 23653e519524SHoward Hinnant swap(*__first, *__i); 23663e519524SHoward Hinnant ++__first; 23673e519524SHoward Hinnant if (++__i == __last) 23683e519524SHoward Hinnant { 23693e519524SHoward Hinnant if (__first == __middle) 23703e519524SHoward Hinnant break; 23713e519524SHoward Hinnant __i = __middle; 23723e519524SHoward Hinnant } 23733e519524SHoward Hinnant else if (__first == __middle) 23743e519524SHoward Hinnant __middle = __i; 23753e519524SHoward Hinnant } 23763e519524SHoward Hinnant } 23773e519524SHoward Hinnant return __r; 23783e519524SHoward Hinnant} 23793e519524SHoward Hinnant 23803e519524SHoward Hinnanttemplate<typename _Integral> 23813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23823e519524SHoward Hinnant_Integral 23833e519524SHoward Hinnant__gcd(_Integral __x, _Integral __y) 23843e519524SHoward Hinnant{ 23853e519524SHoward Hinnant do 23863e519524SHoward Hinnant { 23873e519524SHoward Hinnant _Integral __t = __x % __y; 23883e519524SHoward Hinnant __x = __y; 23893e519524SHoward Hinnant __y = __t; 23903e519524SHoward Hinnant } while (__y); 23913e519524SHoward Hinnant return __x; 23923e519524SHoward Hinnant} 23933e519524SHoward Hinnant 23943e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 23953e519524SHoward Hinnant_RandomAccessIterator 2396aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 23973e519524SHoward Hinnant{ 23983e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 23993e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 24003e519524SHoward Hinnant 24013e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 24023e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 24033e519524SHoward Hinnant if (__m1 == __m2) 24043e519524SHoward Hinnant { 2405ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 24063e519524SHoward Hinnant return __middle; 24073e519524SHoward Hinnant } 2408aca09de3SHoward Hinnant const difference_type __g = _VSTD::__gcd(__m1, __m2); 24093e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 24103e519524SHoward Hinnant { 2411aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 24123e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 24133e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 24143e519524SHoward Hinnant do 24153e519524SHoward Hinnant { 2416aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 24173e519524SHoward Hinnant __p1 = __p2; 24183e519524SHoward Hinnant const difference_type __d = __last - __p2; 24193e519524SHoward Hinnant if (__m1 < __d) 24203e519524SHoward Hinnant __p2 += __m1; 24213e519524SHoward Hinnant else 24223e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 24233e519524SHoward Hinnant } while (__p2 != __p); 2424aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 24253e519524SHoward Hinnant } 24263e519524SHoward Hinnant return __first + __m2; 24273e519524SHoward Hinnant} 24283e519524SHoward Hinnant 24293e519524SHoward Hinnanttemplate <class _ForwardIterator> 24303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24313e519524SHoward Hinnant_ForwardIterator 2432aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2433aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2434aca09de3SHoward Hinnant{ 2435aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2436aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2437aca09de3SHoward Hinnant { 2438aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2439aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2440aca09de3SHoward Hinnant } 2441aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2442aca09de3SHoward Hinnant} 2443aca09de3SHoward Hinnant 2444aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2445aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2446aca09de3SHoward Hinnant_BidirectionalIterator 2447aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2448aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2449aca09de3SHoward Hinnant{ 2450aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2451aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2452aca09de3SHoward Hinnant { 2453aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2454aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2455aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2456aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2457aca09de3SHoward Hinnant } 2458aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2459aca09de3SHoward Hinnant} 2460aca09de3SHoward Hinnant 2461aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2462aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2463aca09de3SHoward Hinnant_RandomAccessIterator 2464aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2465aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2466aca09de3SHoward Hinnant{ 2467aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2468aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2469aca09de3SHoward Hinnant { 2470aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2471aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2472aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2473aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2474aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2475aca09de3SHoward Hinnant } 2476aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2477aca09de3SHoward Hinnant} 2478aca09de3SHoward Hinnant 2479aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2480aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2481aca09de3SHoward Hinnant_ForwardIterator 24823e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 24833e519524SHoward Hinnant{ 2484aca09de3SHoward Hinnant if (__first == __middle) 2485aca09de3SHoward Hinnant return __last; 2486aca09de3SHoward Hinnant if (__middle == __last) 2487aca09de3SHoward Hinnant return __first; 2488ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2489aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 24903e519524SHoward Hinnant} 24913e519524SHoward Hinnant 24923e519524SHoward Hinnant// rotate_copy 24933e519524SHoward Hinnant 24943e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 24953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24963e519524SHoward Hinnant_OutputIterator 24973e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 24983e519524SHoward Hinnant{ 2499ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 25003e519524SHoward Hinnant} 25013e519524SHoward Hinnant 25023e519524SHoward Hinnant// min_element 25033e519524SHoward Hinnant 25043e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25063e519524SHoward Hinnant_ForwardIterator 25073e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25083e519524SHoward Hinnant{ 25093e519524SHoward Hinnant if (__first != __last) 25103e519524SHoward Hinnant { 25113e519524SHoward Hinnant _ForwardIterator __i = __first; 25123e519524SHoward Hinnant while (++__i != __last) 25133e519524SHoward Hinnant if (__comp(*__i, *__first)) 25143e519524SHoward Hinnant __first = __i; 25153e519524SHoward Hinnant } 25163e519524SHoward Hinnant return __first; 25173e519524SHoward Hinnant} 25183e519524SHoward Hinnant 25193e519524SHoward Hinnanttemplate <class _ForwardIterator> 25203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25213e519524SHoward Hinnant_ForwardIterator 25223e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 25233e519524SHoward Hinnant{ 2524ce48a113SHoward Hinnant return _VSTD::min_element(__first, __last, 25254eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25264eb27b79SHoward Hinnant} 25274eb27b79SHoward Hinnant 25284eb27b79SHoward Hinnant// min 25294eb27b79SHoward Hinnant 25304eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25314eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25324eb27b79SHoward Hinnantconst _Tp& 25334eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 25344eb27b79SHoward Hinnant{ 25354eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 25364eb27b79SHoward Hinnant} 25374eb27b79SHoward Hinnant 25384eb27b79SHoward Hinnanttemplate <class _Tp> 25394eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25404eb27b79SHoward Hinnantconst _Tp& 25414eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 25424eb27b79SHoward Hinnant{ 2543ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 25444eb27b79SHoward Hinnant} 25454eb27b79SHoward Hinnant 254654976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 254754976f26SHoward Hinnant 25484eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 25494eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25504eb27b79SHoward Hinnant_Tp 25514eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 25524eb27b79SHoward Hinnant{ 2553ce48a113SHoward Hinnant return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 25544eb27b79SHoward Hinnant} 25554eb27b79SHoward Hinnant 25564eb27b79SHoward Hinnanttemplate<class _Tp> 25574eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25584eb27b79SHoward Hinnant_Tp 25594eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 25604eb27b79SHoward Hinnant{ 2561ce48a113SHoward Hinnant return *_VSTD::min_element(__t.begin(), __t.end()); 25623e519524SHoward Hinnant} 25633e519524SHoward Hinnant 256454976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 256554976f26SHoward Hinnant 25663e519524SHoward Hinnant// max_element 25673e519524SHoward Hinnant 25683e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25703e519524SHoward Hinnant_ForwardIterator 25713e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25723e519524SHoward Hinnant{ 25733e519524SHoward Hinnant if (__first != __last) 25743e519524SHoward Hinnant { 25753e519524SHoward Hinnant _ForwardIterator __i = __first; 25763e519524SHoward Hinnant while (++__i != __last) 25773e519524SHoward Hinnant if (__comp(*__first, *__i)) 25783e519524SHoward Hinnant __first = __i; 25793e519524SHoward Hinnant } 25803e519524SHoward Hinnant return __first; 25813e519524SHoward Hinnant} 25823e519524SHoward Hinnant 25833e519524SHoward Hinnanttemplate <class _ForwardIterator> 25843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25853e519524SHoward Hinnant_ForwardIterator 25863e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 25873e519524SHoward Hinnant{ 2588ce48a113SHoward Hinnant return _VSTD::max_element(__first, __last, 25894eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25904eb27b79SHoward Hinnant} 25914eb27b79SHoward Hinnant 25924eb27b79SHoward Hinnant// max 25934eb27b79SHoward Hinnant 25944eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25954eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25964eb27b79SHoward Hinnantconst _Tp& 25974eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 25984eb27b79SHoward Hinnant{ 25994eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 26004eb27b79SHoward Hinnant} 26014eb27b79SHoward Hinnant 26024eb27b79SHoward Hinnanttemplate <class _Tp> 26034eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26044eb27b79SHoward Hinnantconst _Tp& 26054eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 26064eb27b79SHoward Hinnant{ 2607ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 26084eb27b79SHoward Hinnant} 26094eb27b79SHoward Hinnant 261054976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 261154976f26SHoward Hinnant 26124eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26134eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26144eb27b79SHoward Hinnant_Tp 26154eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 26164eb27b79SHoward Hinnant{ 2617ce48a113SHoward Hinnant return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 26184eb27b79SHoward Hinnant} 26194eb27b79SHoward Hinnant 26204eb27b79SHoward Hinnanttemplate<class _Tp> 26214eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26224eb27b79SHoward Hinnant_Tp 26234eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 26244eb27b79SHoward Hinnant{ 2625ce48a113SHoward Hinnant return *_VSTD::max_element(__t.begin(), __t.end()); 26263e519524SHoward Hinnant} 26273e519524SHoward Hinnant 262854976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 262954976f26SHoward Hinnant 26303e519524SHoward Hinnant// minmax_element 26313e519524SHoward Hinnant 26323e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26333e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26343e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26353e519524SHoward Hinnant{ 26363e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 26373e519524SHoward Hinnant if (__first != __last) 26383e519524SHoward Hinnant { 26393e519524SHoward Hinnant if (++__first != __last) 26403e519524SHoward Hinnant { 26413e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26423e519524SHoward Hinnant __result.first = __first; 26433e519524SHoward Hinnant else 26443e519524SHoward Hinnant __result.second = __first; 26453e519524SHoward Hinnant while (++__first != __last) 26463e519524SHoward Hinnant { 26473e519524SHoward Hinnant _ForwardIterator __i = __first; 26483e519524SHoward Hinnant if (++__first == __last) 26493e519524SHoward Hinnant { 26503e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 26513e519524SHoward Hinnant __result.first = __i; 26523e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 26533e519524SHoward Hinnant __result.second = __i; 26543e519524SHoward Hinnant break; 26553e519524SHoward Hinnant } 26563e519524SHoward Hinnant else 26573e519524SHoward Hinnant { 26583e519524SHoward Hinnant if (__comp(*__first, *__i)) 26593e519524SHoward Hinnant { 26603e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26613e519524SHoward Hinnant __result.first = __first; 26623e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 26633e519524SHoward Hinnant __result.second = __i; 26643e519524SHoward Hinnant } 26653e519524SHoward Hinnant else 26663e519524SHoward Hinnant { 26673e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 26683e519524SHoward Hinnant __result.first = __i; 26693e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 26703e519524SHoward Hinnant __result.second = __first; 26713e519524SHoward Hinnant } 26723e519524SHoward Hinnant } 26733e519524SHoward Hinnant } 26743e519524SHoward Hinnant } 26753e519524SHoward Hinnant } 26763e519524SHoward Hinnant return __result; 26773e519524SHoward Hinnant} 26783e519524SHoward Hinnant 26793e519524SHoward Hinnanttemplate <class _ForwardIterator> 26803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26813e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26823e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 26833e519524SHoward Hinnant{ 2684ce48a113SHoward Hinnant return _VSTD::minmax_element(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26853e519524SHoward Hinnant} 26863e519524SHoward Hinnant 26874eb27b79SHoward Hinnant// minmax 26884eb27b79SHoward Hinnant 26894eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26904eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26914eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 26924eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26934eb27b79SHoward Hinnant{ 26944eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 26954eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 26964eb27b79SHoward Hinnant} 26974eb27b79SHoward Hinnant 26984eb27b79SHoward Hinnanttemplate<class _Tp> 26994eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 27004eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27014eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 27024eb27b79SHoward Hinnant{ 2703ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 27044eb27b79SHoward Hinnant} 27054eb27b79SHoward Hinnant 270654976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 270754976f26SHoward Hinnant 27084eb27b79SHoward Hinnanttemplate<class _Tp> 27094eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 27104eb27b79SHoward Hinnantpair<_Tp, _Tp> 27114eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t) 27124eb27b79SHoward Hinnant{ 27134eb27b79SHoward Hinnant pair<const _Tp*, const _Tp*> __p = 2714ce48a113SHoward Hinnant _VSTD::minmax_element(__t.begin(), __t.end()); 27154eb27b79SHoward Hinnant return pair<_Tp, _Tp>(*__p.first, *__p.second); 27164eb27b79SHoward Hinnant} 27174eb27b79SHoward Hinnant 27184eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27194eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 27204eb27b79SHoward Hinnantpair<_Tp, _Tp> 27214eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 27224eb27b79SHoward Hinnant{ 27234eb27b79SHoward Hinnant pair<const _Tp*, const _Tp*> __p = 2724ce48a113SHoward Hinnant _VSTD::minmax_element(__t.begin(), __t.end(), __comp); 27254eb27b79SHoward Hinnant return pair<_Tp, _Tp>(*__p.first, *__p.second); 27264eb27b79SHoward Hinnant} 27274eb27b79SHoward Hinnant 272854976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 272954976f26SHoward Hinnant 27303e519524SHoward Hinnant// random_shuffle 27313e519524SHoward Hinnant 2732f9d540b0SHoward Hinnant// __independent_bits_engine 2733f9d540b0SHoward Hinnant 2734c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2735f9d540b0SHoward Hinnantstruct __log2_imp 27363e519524SHoward Hinnant{ 2737c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2738c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 27393e519524SHoward Hinnant}; 27403e519524SHoward Hinnant 2741c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2742c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 27433e519524SHoward Hinnant{ 2744f9d540b0SHoward Hinnant static const size_t value = 0; 27453e519524SHoward Hinnant}; 27463e519524SHoward Hinnant 2747c003db1fSHoward Hinnanttemplate <size_t _Rp> 2748c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 27493e519524SHoward Hinnant{ 2750c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 27513e519524SHoward Hinnant}; 27523e519524SHoward Hinnant 2753c003db1fSHoward Hinnanttemplate <class _UI, _UI _Xp> 2754f9d540b0SHoward Hinnantstruct __log2 27553e519524SHoward Hinnant{ 2756c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 2757f9d540b0SHoward Hinnant sizeof(_UI) * __CHAR_BIT__ - 1>::value; 27583e519524SHoward Hinnant}; 27593e519524SHoward Hinnant 2760f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2761f9d540b0SHoward Hinnantclass __independent_bits_engine 27623e519524SHoward Hinnant{ 2763f9d540b0SHoward Hinnantpublic: 2764f9d540b0SHoward Hinnant // types 2765f9d540b0SHoward Hinnant typedef _UIntType result_type; 2766f9d540b0SHoward Hinnant 2767f9d540b0SHoward Hinnantprivate: 2768f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2769f9d540b0SHoward Hinnant typedef typename conditional 2770f9d540b0SHoward Hinnant < 2771f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2772f9d540b0SHoward Hinnant result_type, 2773f9d540b0SHoward Hinnant _Engine_result_type 2774f9d540b0SHoward Hinnant >::type _Working_result_type; 2775f9d540b0SHoward Hinnant 2776f9d540b0SHoward Hinnant _Engine& __e_; 2777f9d540b0SHoward Hinnant size_t __w_; 2778f9d540b0SHoward Hinnant size_t __w0_; 2779f9d540b0SHoward Hinnant size_t __n_; 2780f9d540b0SHoward Hinnant size_t __n0_; 2781f9d540b0SHoward Hinnant _Working_result_type __y0_; 2782f9d540b0SHoward Hinnant _Working_result_type __y1_; 2783f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2784f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2785f9d540b0SHoward Hinnant 2786e386b7b3SHoward Hinnant#ifdef _LIBCPP_HAS_NO_CONSTEXPR 2787c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2788f9d540b0SHoward Hinnant + _Working_result_type(1); 2789e386b7b3SHoward Hinnant#else 2790e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2791e386b7b3SHoward Hinnant + _Working_result_type(1); 2792e386b7b3SHoward Hinnant#endif 2793e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2794e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2795e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2796f9d540b0SHoward Hinnant 2797f9d540b0SHoward Hinnantpublic: 2798f9d540b0SHoward Hinnant // constructors and seeding functions 2799f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2800f9d540b0SHoward Hinnant 2801f9d540b0SHoward Hinnant // generating functions 2802c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2803f9d540b0SHoward Hinnant 2804f9d540b0SHoward Hinnantprivate: 2805f9d540b0SHoward Hinnant result_type __eval(false_type); 2806f9d540b0SHoward Hinnant result_type __eval(true_type); 2807f9d540b0SHoward Hinnant}; 2808f9d540b0SHoward Hinnant 2809f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2810f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2811f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2812f9d540b0SHoward Hinnant : __e_(__e), 2813f9d540b0SHoward Hinnant __w_(__w) 2814f9d540b0SHoward Hinnant{ 2815f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2816f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2817c003db1fSHoward Hinnant if (_Rp == 0) 2818c003db1fSHoward Hinnant __y0_ = _Rp; 2819f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2820c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2821f9d540b0SHoward Hinnant else 2822f9d540b0SHoward Hinnant __y0_ = 0; 2823c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2824f9d540b0SHoward Hinnant { 2825f9d540b0SHoward Hinnant ++__n_; 2826f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2827f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2828c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2829f9d540b0SHoward Hinnant else 2830f9d540b0SHoward Hinnant __y0_ = 0; 2831f9d540b0SHoward Hinnant } 2832f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2833f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2834c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2835f9d540b0SHoward Hinnant else 2836f9d540b0SHoward Hinnant __y1_ = 0; 2837f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2838f9d540b0SHoward Hinnant _Engine_result_type(0); 2839f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2840f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2841f9d540b0SHoward Hinnant _Engine_result_type(~0); 28423e519524SHoward Hinnant} 28433e519524SHoward Hinnant 2844f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2845f9d540b0SHoward Hinnantinline 2846f9d540b0SHoward Hinnant_UIntType 2847f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 28483e519524SHoward Hinnant{ 2849f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 28503e519524SHoward Hinnant} 28513e519524SHoward Hinnant 2852f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2853f9d540b0SHoward Hinnant_UIntType 2854f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 28553e519524SHoward Hinnant{ 2856c003db1fSHoward Hinnant result_type _Sp = 0; 2857f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2858f9d540b0SHoward Hinnant { 2859f9d540b0SHoward Hinnant _Engine_result_type __u; 28603e519524SHoward Hinnant do 2861f9d540b0SHoward Hinnant { 2862f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2863f9d540b0SHoward Hinnant } while (__u >= __y0_); 28640176bc6cSHoward Hinnant if (__w0_ < _WDt) 2865c003db1fSHoward Hinnant _Sp <<= __w0_; 2866f9d540b0SHoward Hinnant else 2867c003db1fSHoward Hinnant _Sp = 0; 2868c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2869f9d540b0SHoward Hinnant } 2870f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2871f9d540b0SHoward Hinnant { 2872f9d540b0SHoward Hinnant _Engine_result_type __u; 2873f9d540b0SHoward Hinnant do 2874f9d540b0SHoward Hinnant { 2875f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2876f9d540b0SHoward Hinnant } while (__u >= __y1_); 28770176bc6cSHoward Hinnant if (__w0_ < _WDt - 1) 2878c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2879f9d540b0SHoward Hinnant else 2880c003db1fSHoward Hinnant _Sp = 0; 2881c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2882f9d540b0SHoward Hinnant } 2883c003db1fSHoward Hinnant return _Sp; 28843e519524SHoward Hinnant} 28853e519524SHoward Hinnant 2886f9d540b0SHoward Hinnant// uniform_int_distribution 28873e519524SHoward Hinnant 2888f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2889f9d540b0SHoward Hinnantclass uniform_int_distribution 28903e519524SHoward Hinnant{ 2891f9d540b0SHoward Hinnantpublic: 2892f9d540b0SHoward Hinnant // types 2893f9d540b0SHoward Hinnant typedef _IntType result_type; 2894f9d540b0SHoward Hinnant 2895f9d540b0SHoward Hinnant class param_type 2896f9d540b0SHoward Hinnant { 2897f9d540b0SHoward Hinnant result_type __a_; 2898f9d540b0SHoward Hinnant result_type __b_; 2899f9d540b0SHoward Hinnant public: 2900f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2901f9d540b0SHoward Hinnant 2902f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2903f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2904f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2905f9d540b0SHoward Hinnant 2906f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2907f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2908f9d540b0SHoward Hinnant 2909f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2910f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2911f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2912f9d540b0SHoward Hinnant {return !(__x == __y);} 29133e519524SHoward Hinnant }; 29143e519524SHoward Hinnant 2915f9d540b0SHoward Hinnantprivate: 2916f9d540b0SHoward Hinnant param_type __p_; 29173e519524SHoward Hinnant 2918f9d540b0SHoward Hinnantpublic: 2919f9d540b0SHoward Hinnant // constructors and reset functions 2920f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 2921f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2922f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 2923f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 2924f9d540b0SHoward Hinnant void reset() {} 2925f9d540b0SHoward Hinnant 2926f9d540b0SHoward Hinnant // generating functions 2927f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 2928f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 2929f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 2930f9d540b0SHoward Hinnant 2931f9d540b0SHoward Hinnant // property functions 2932f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 2933f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 2934f9d540b0SHoward Hinnant 2935f9d540b0SHoward Hinnant param_type param() const {return __p_;} 2936f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 2937f9d540b0SHoward Hinnant 2938f9d540b0SHoward Hinnant result_type min() const {return a();} 2939f9d540b0SHoward Hinnant result_type max() const {return b();} 2940f9d540b0SHoward Hinnant 2941f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 2942f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2943f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 2944f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 2945f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2946f9d540b0SHoward Hinnant {return !(__x == __y);} 29473e519524SHoward Hinnant}; 29483e519524SHoward Hinnant 2949f9d540b0SHoward Hinnanttemplate<class _IntType> 2950f9d540b0SHoward Hinnanttemplate<class _URNG> 2951f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 2952f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 29533e519524SHoward Hinnant{ 2954f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 2955f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 2956c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 2957c003db1fSHoward Hinnant if (_Rp == 1) 2958f9d540b0SHoward Hinnant return __p.a(); 2959f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 2960f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 2961c003db1fSHoward Hinnant if (_Rp == 0) 2962f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 2963c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 2964c003db1fSHoward Hinnant if ((_Rp & (_UIntType(~0) >> (_Dt - __w))) != 0) 2965f9d540b0SHoward Hinnant ++__w; 2966f9d540b0SHoward Hinnant _Eng __e(__g, __w); 2967f9d540b0SHoward Hinnant _UIntType __u; 2968f9d540b0SHoward Hinnant do 29693e519524SHoward Hinnant { 2970f9d540b0SHoward Hinnant __u = __e(); 2971c003db1fSHoward Hinnant } while (__u >= _Rp); 2972f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 29733e519524SHoward Hinnant} 2974f9d540b0SHoward Hinnant 2975f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 2976f9d540b0SHoward Hinnant 2977f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 2978f9d540b0SHoward Hinnant 2979f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 29803e519524SHoward Hinnant{ 2981f9d540b0SHoward Hinnant static unsigned __c_; 2982f9d540b0SHoward Hinnant 2983f9d540b0SHoward Hinnant __rs_default(); 2984f9d540b0SHoward Hinnantpublic: 2985b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 2986f9d540b0SHoward Hinnant 2987f9d540b0SHoward Hinnant static const result_type _Min = 0; 2988f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 2989f9d540b0SHoward Hinnant 2990f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 2991f9d540b0SHoward Hinnant ~__rs_default(); 2992f9d540b0SHoward Hinnant 2993f9d540b0SHoward Hinnant result_type operator()(); 2994f9d540b0SHoward Hinnant 2995788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 2996788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 2997f9d540b0SHoward Hinnant 2998f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 2999f9d540b0SHoward Hinnant}; 3000f9d540b0SHoward Hinnant 3001f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 30023e519524SHoward Hinnant 30033e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 30043e519524SHoward Hinnantvoid 30053e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 30063e519524SHoward Hinnant{ 30073e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3008c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3009c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 30103e519524SHoward Hinnant difference_type __d = __last - __first; 30113e519524SHoward Hinnant if (__d > 1) 30123e519524SHoward Hinnant { 3013c003db1fSHoward Hinnant _Dp __uid; 3014f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 3015f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3016007b26beSHoward Hinnant { 3017c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3018007b26beSHoward Hinnant if (__i != difference_type(0)) 3019007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3020007b26beSHoward Hinnant } 30213e519524SHoward Hinnant } 30223e519524SHoward Hinnant} 30233e519524SHoward Hinnant 30243e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 30253e519524SHoward Hinnantvoid 30263e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 30277609c9b6SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 30283e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 30293e519524SHoward Hinnant#else 30303e519524SHoward Hinnant _RandomNumberGenerator& __rand) 30313e519524SHoward Hinnant#endif 30323e519524SHoward Hinnant{ 30333e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 30343e519524SHoward Hinnant difference_type __d = __last - __first; 30353e519524SHoward Hinnant if (__d > 1) 30363e519524SHoward Hinnant { 30373e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3038007b26beSHoward Hinnant { 3039007b26beSHoward Hinnant difference_type __i = __rand(__d); 3040007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3041007b26beSHoward Hinnant } 30423e519524SHoward Hinnant } 30433e519524SHoward Hinnant} 30443e519524SHoward Hinnant 3045f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3046f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3047fb340102SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 3048fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3049fb340102SHoward Hinnant#else 3050f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3051fb340102SHoward Hinnant#endif 3052f9d540b0SHoward Hinnant{ 3053f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3054c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3055c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3056f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3057f9d540b0SHoward Hinnant if (__d > 1) 3058f9d540b0SHoward Hinnant { 3059c003db1fSHoward Hinnant _Dp __uid; 3060f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3061007b26beSHoward Hinnant { 3062c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3063007b26beSHoward Hinnant if (__i != difference_type(0)) 3064007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3065007b26beSHoward Hinnant } 3066f9d540b0SHoward Hinnant } 3067f9d540b0SHoward Hinnant} 3068f9d540b0SHoward Hinnant 30693e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 30703e519524SHoward Hinnantbool 30713e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 30723e519524SHoward Hinnant{ 30733e519524SHoward Hinnant for (; __first != __last; ++__first) 30743e519524SHoward Hinnant if (!__pred(*__first)) 30753e519524SHoward Hinnant break; 30763e519524SHoward Hinnant for (; __first != __last; ++__first) 30773e519524SHoward Hinnant if (__pred(*__first)) 30783e519524SHoward Hinnant return false; 30793e519524SHoward Hinnant return true; 30803e519524SHoward Hinnant} 30813e519524SHoward Hinnant 30823e519524SHoward Hinnant// partition 30833e519524SHoward Hinnant 30843e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 30853e519524SHoward Hinnant_ForwardIterator 30863e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 30873e519524SHoward Hinnant{ 30883e519524SHoward Hinnant while (true) 30893e519524SHoward Hinnant { 30903e519524SHoward Hinnant if (__first == __last) 30913e519524SHoward Hinnant return __first; 30923e519524SHoward Hinnant if (!__pred(*__first)) 30933e519524SHoward Hinnant break; 30943e519524SHoward Hinnant ++__first; 30953e519524SHoward Hinnant } 30963e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 30973e519524SHoward Hinnant { 30983e519524SHoward Hinnant if (__pred(*__p)) 30993e519524SHoward Hinnant { 31003e519524SHoward Hinnant swap(*__first, *__p); 31013e519524SHoward Hinnant ++__first; 31023e519524SHoward Hinnant } 31033e519524SHoward Hinnant } 31043e519524SHoward Hinnant return __first; 31053e519524SHoward Hinnant} 31063e519524SHoward Hinnant 31073e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 31083e519524SHoward Hinnant_BidirectionalIterator 31093e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 31103e519524SHoward Hinnant bidirectional_iterator_tag) 31113e519524SHoward Hinnant{ 31123e519524SHoward Hinnant while (true) 31133e519524SHoward Hinnant { 31143e519524SHoward Hinnant while (true) 31153e519524SHoward Hinnant { 31163e519524SHoward Hinnant if (__first == __last) 31173e519524SHoward Hinnant return __first; 31183e519524SHoward Hinnant if (!__pred(*__first)) 31193e519524SHoward Hinnant break; 31203e519524SHoward Hinnant ++__first; 31213e519524SHoward Hinnant } 31223e519524SHoward Hinnant do 31233e519524SHoward Hinnant { 31243e519524SHoward Hinnant if (__first == --__last) 31253e519524SHoward Hinnant return __first; 31263e519524SHoward Hinnant } while (!__pred(*__last)); 31273e519524SHoward Hinnant swap(*__first, *__last); 31283e519524SHoward Hinnant ++__first; 31293e519524SHoward Hinnant } 31303e519524SHoward Hinnant} 31313e519524SHoward Hinnant 31323e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 31333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 31343e519524SHoward Hinnant_ForwardIterator 31353e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 31363e519524SHoward Hinnant{ 3137ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 31383e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 31393e519524SHoward Hinnant} 31403e519524SHoward Hinnant 31413e519524SHoward Hinnant// partition_copy 31423e519524SHoward Hinnant 31433e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 31443e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 31453e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 31463e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 31473e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 31483e519524SHoward Hinnant _Predicate __pred) 31493e519524SHoward Hinnant{ 31503e519524SHoward Hinnant for (; __first != __last; ++__first) 31513e519524SHoward Hinnant { 31523e519524SHoward Hinnant if (__pred(*__first)) 31533e519524SHoward Hinnant { 31543e519524SHoward Hinnant *__out_true = *__first; 31553e519524SHoward Hinnant ++__out_true; 31563e519524SHoward Hinnant } 31573e519524SHoward Hinnant else 31583e519524SHoward Hinnant { 31593e519524SHoward Hinnant *__out_false = *__first; 31603e519524SHoward Hinnant ++__out_false; 31613e519524SHoward Hinnant } 31623e519524SHoward Hinnant } 31633e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 31643e519524SHoward Hinnant} 31653e519524SHoward Hinnant 31663e519524SHoward Hinnant// partition_point 31673e519524SHoward Hinnant 31683e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 31693e519524SHoward Hinnant_ForwardIterator 31703e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 31713e519524SHoward Hinnant{ 31723e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3173ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 31743e519524SHoward Hinnant while (__len != 0) 31753e519524SHoward Hinnant { 31763e519524SHoward Hinnant difference_type __l2 = __len / 2; 31773e519524SHoward Hinnant _ForwardIterator __m = __first; 3178ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 31793e519524SHoward Hinnant if (__pred(*__m)) 31803e519524SHoward Hinnant { 31813e519524SHoward Hinnant __first = ++__m; 31823e519524SHoward Hinnant __len -= __l2 + 1; 31833e519524SHoward Hinnant } 31843e519524SHoward Hinnant else 31853e519524SHoward Hinnant __len = __l2; 31863e519524SHoward Hinnant } 31873e519524SHoward Hinnant return __first; 31883e519524SHoward Hinnant} 31893e519524SHoward Hinnant 31903e519524SHoward Hinnant// stable_partition 31913e519524SHoward Hinnant 31923e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 31933e519524SHoward Hinnant_ForwardIterator 31943e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 31953e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 31963e519524SHoward Hinnant{ 31973e519524SHoward Hinnant // *__first is known to be false 31983e519524SHoward Hinnant // __len >= 1 31993e519524SHoward Hinnant if (__len == 1) 32003e519524SHoward Hinnant return __first; 32013e519524SHoward Hinnant if (__len == 2) 32023e519524SHoward Hinnant { 32033e519524SHoward Hinnant _ForwardIterator __m = __first; 32043e519524SHoward Hinnant if (__pred(*++__m)) 32053e519524SHoward Hinnant { 32063e519524SHoward Hinnant swap(*__first, *__m); 32073e519524SHoward Hinnant return __m; 32083e519524SHoward Hinnant } 32093e519524SHoward Hinnant return __first; 32103e519524SHoward Hinnant } 32113e519524SHoward Hinnant if (__len <= __p.second) 32123e519524SHoward Hinnant { // The buffer is big enough to use 32133e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 32143e519524SHoward Hinnant __destruct_n __d(0); 32153e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 32163e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 32173e519524SHoward Hinnant // Update __first to always point to the end of the trues 32183e519524SHoward Hinnant value_type* __t = __p.first; 3219ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 32203e519524SHoward Hinnant __d.__incr((value_type*)0); 32213e519524SHoward Hinnant ++__t; 32223e519524SHoward Hinnant _ForwardIterator __i = __first; 32233e519524SHoward Hinnant while (++__i != __last) 32243e519524SHoward Hinnant { 32253e519524SHoward Hinnant if (__pred(*__i)) 32263e519524SHoward Hinnant { 3227ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 32283e519524SHoward Hinnant ++__first; 32293e519524SHoward Hinnant } 32303e519524SHoward Hinnant else 32313e519524SHoward Hinnant { 3232ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 32333e519524SHoward Hinnant __d.__incr((value_type*)0); 32343e519524SHoward Hinnant ++__t; 32353e519524SHoward Hinnant } 32363e519524SHoward Hinnant } 32373e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 32383e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 32393e519524SHoward Hinnant __i = __first; 32403e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3241ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 32423e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 32433e519524SHoward Hinnant return __first; 32443e519524SHoward Hinnant } 32453e519524SHoward Hinnant // Else not enough buffer, do in place 32463e519524SHoward Hinnant // __len >= 3 32473e519524SHoward Hinnant _ForwardIterator __m = __first; 32483e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3249ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 32503e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 32513e519524SHoward Hinnant // F????????????????? 32523e519524SHoward Hinnant // f m l 32533e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 32543e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 32553e519524SHoward Hinnant // TTTFFFFF?????????? 32563e519524SHoward Hinnant // f ff m l 32573e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 32583e519524SHoward Hinnant _ForwardIterator __m1 = __m; 32593e519524SHoward Hinnant _ForwardIterator __second_false = __last; 32603e519524SHoward Hinnant _Distance __len_half = __len - __len2; 32613e519524SHoward Hinnant while (__pred(*__m1)) 32623e519524SHoward Hinnant { 32633e519524SHoward Hinnant if (++__m1 == __last) 32643e519524SHoward Hinnant goto __second_half_done; 32653e519524SHoward Hinnant --__len_half; 32663e519524SHoward Hinnant } 32673e519524SHoward Hinnant // TTTFFFFFTTTF?????? 32683e519524SHoward Hinnant // f ff m m1 l 32693e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 32703e519524SHoward Hinnant__second_half_done: 32713e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 32723e519524SHoward Hinnant // f ff m sf l 3273ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 32743e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 32753e519524SHoward Hinnant // | 32763e519524SHoward Hinnant} 32773e519524SHoward Hinnant 32783e519524SHoward Hinnantstruct __return_temporary_buffer 32793e519524SHoward Hinnant{ 32803e519524SHoward Hinnant template <class _Tp> 3281ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 32823e519524SHoward Hinnant}; 32833e519524SHoward Hinnant 32843e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 32853e519524SHoward Hinnant_ForwardIterator 32863e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 32873e519524SHoward Hinnant forward_iterator_tag) 32883e519524SHoward Hinnant{ 32893e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 32903e519524SHoward Hinnant // Either prove all true and return __first or point to first false 32913e519524SHoward Hinnant while (true) 32923e519524SHoward Hinnant { 32933e519524SHoward Hinnant if (__first == __last) 32943e519524SHoward Hinnant return __first; 32953e519524SHoward Hinnant if (!__pred(*__first)) 32963e519524SHoward Hinnant break; 32973e519524SHoward Hinnant ++__first; 32983e519524SHoward Hinnant } 32993e519524SHoward Hinnant // We now have a reduced range [__first, __last) 33003e519524SHoward Hinnant // *__first is known to be false 33013e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 33023e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3303ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 33043e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 33053e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 33063e519524SHoward Hinnant if (__len >= __alloc_limit) 33073e519524SHoward Hinnant { 3308ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 33093e519524SHoward Hinnant __h.reset(__p.first); 33103e519524SHoward Hinnant } 33113e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 33123e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 33133e519524SHoward Hinnant} 33143e519524SHoward Hinnant 33153e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 33163e519524SHoward Hinnant_BidirectionalIterator 33173e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 33183e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 33193e519524SHoward Hinnant{ 33203e519524SHoward Hinnant // *__first is known to be false 33213e519524SHoward Hinnant // *__last is known to be true 33223e519524SHoward Hinnant // __len >= 2 33233e519524SHoward Hinnant if (__len == 2) 33243e519524SHoward Hinnant { 33253e519524SHoward Hinnant swap(*__first, *__last); 33263e519524SHoward Hinnant return __last; 33273e519524SHoward Hinnant } 33283e519524SHoward Hinnant if (__len == 3) 33293e519524SHoward Hinnant { 33303e519524SHoward Hinnant _BidirectionalIterator __m = __first; 33313e519524SHoward Hinnant if (__pred(*++__m)) 33323e519524SHoward Hinnant { 33333e519524SHoward Hinnant swap(*__first, *__m); 33343e519524SHoward Hinnant swap(*__m, *__last); 33353e519524SHoward Hinnant return __last; 33363e519524SHoward Hinnant } 33373e519524SHoward Hinnant swap(*__m, *__last); 33383e519524SHoward Hinnant swap(*__first, *__m); 33393e519524SHoward Hinnant return __m; 33403e519524SHoward Hinnant } 33413e519524SHoward Hinnant if (__len <= __p.second) 33423e519524SHoward Hinnant { // The buffer is big enough to use 33433e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 33443e519524SHoward Hinnant __destruct_n __d(0); 33453e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 33463e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 33473e519524SHoward Hinnant // Update __first to always point to the end of the trues 33483e519524SHoward Hinnant value_type* __t = __p.first; 3349ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 33503e519524SHoward Hinnant __d.__incr((value_type*)0); 33513e519524SHoward Hinnant ++__t; 33523e519524SHoward Hinnant _BidirectionalIterator __i = __first; 33533e519524SHoward Hinnant while (++__i != __last) 33543e519524SHoward Hinnant { 33553e519524SHoward Hinnant if (__pred(*__i)) 33563e519524SHoward Hinnant { 3357ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 33583e519524SHoward Hinnant ++__first; 33593e519524SHoward Hinnant } 33603e519524SHoward Hinnant else 33613e519524SHoward Hinnant { 3362ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 33633e519524SHoward Hinnant __d.__incr((value_type*)0); 33643e519524SHoward Hinnant ++__t; 33653e519524SHoward Hinnant } 33663e519524SHoward Hinnant } 33673e519524SHoward Hinnant // move *__last, known to be true 3368ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 33693e519524SHoward Hinnant __i = ++__first; 33703e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 33713e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 33723e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3373ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 33743e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 33753e519524SHoward Hinnant return __first; 33763e519524SHoward Hinnant } 33773e519524SHoward Hinnant // Else not enough buffer, do in place 33783e519524SHoward Hinnant // __len >= 4 33793e519524SHoward Hinnant _BidirectionalIterator __m = __first; 33803e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3381ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 33823e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 33833e519524SHoward Hinnant // F????????????????T 33843e519524SHoward Hinnant // f m l 33853e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 33863e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 33873e519524SHoward Hinnant _Distance __len_half = __len2; 33883e519524SHoward Hinnant while (!__pred(*--__m1)) 33893e519524SHoward Hinnant { 33903e519524SHoward Hinnant if (__m1 == __first) 33913e519524SHoward Hinnant goto __first_half_done; 33923e519524SHoward Hinnant --__len_half; 33933e519524SHoward Hinnant } 33943e519524SHoward Hinnant // F???TFFF?????????T 33953e519524SHoward Hinnant // f m1 m l 33963e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 33973e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 33983e519524SHoward Hinnant__first_half_done: 33993e519524SHoward Hinnant // TTTFFFFF?????????T 34003e519524SHoward Hinnant // f ff m l 34013e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 34023e519524SHoward Hinnant __m1 = __m; 34033e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 34043e519524SHoward Hinnant ++__second_false; 34053e519524SHoward Hinnant __len_half = __len - __len2; 34063e519524SHoward Hinnant while (__pred(*__m1)) 34073e519524SHoward Hinnant { 34083e519524SHoward Hinnant if (++__m1 == __last) 34093e519524SHoward Hinnant goto __second_half_done; 34103e519524SHoward Hinnant --__len_half; 34113e519524SHoward Hinnant } 34123e519524SHoward Hinnant // TTTFFFFFTTTF?????T 34133e519524SHoward Hinnant // f ff m m1 l 34143e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 34153e519524SHoward Hinnant__second_half_done: 34163e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 34173e519524SHoward Hinnant // f ff m sf l 3418ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 34193e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 34203e519524SHoward Hinnant // | 34213e519524SHoward Hinnant} 34223e519524SHoward Hinnant 34233e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 34243e519524SHoward Hinnant_BidirectionalIterator 34253e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34263e519524SHoward Hinnant bidirectional_iterator_tag) 34273e519524SHoward Hinnant{ 34283e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 34293e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 34303e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 34313e519524SHoward Hinnant // Either prove all true and return __first or point to first false 34323e519524SHoward Hinnant while (true) 34333e519524SHoward Hinnant { 34343e519524SHoward Hinnant if (__first == __last) 34353e519524SHoward Hinnant return __first; 34363e519524SHoward Hinnant if (!__pred(*__first)) 34373e519524SHoward Hinnant break; 34383e519524SHoward Hinnant ++__first; 34393e519524SHoward Hinnant } 34403e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 34413e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 34423e519524SHoward Hinnant do 34433e519524SHoward Hinnant { 34443e519524SHoward Hinnant if (__first == --__last) 34453e519524SHoward Hinnant return __first; 34463e519524SHoward Hinnant } while (!__pred(*__last)); 34473e519524SHoward Hinnant // We now have a reduced range [__first, __last] 34483e519524SHoward Hinnant // *__first is known to be false 34493e519524SHoward Hinnant // *__last is known to be true 34503e519524SHoward Hinnant // __len >= 2 3451ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 34523e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 34533e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 34543e519524SHoward Hinnant if (__len >= __alloc_limit) 34553e519524SHoward Hinnant { 3456ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 34573e519524SHoward Hinnant __h.reset(__p.first); 34583e519524SHoward Hinnant } 34593e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 34603e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 34613e519524SHoward Hinnant} 34623e519524SHoward Hinnant 34633e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 34643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 34653e519524SHoward Hinnant_ForwardIterator 34663e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 34673e519524SHoward Hinnant{ 34683e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 34693e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 34703e519524SHoward Hinnant} 34713e519524SHoward Hinnant 34723e519524SHoward Hinnant// is_sorted_until 34733e519524SHoward Hinnant 34743e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 34753e519524SHoward Hinnant_ForwardIterator 34763e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 34773e519524SHoward Hinnant{ 34783e519524SHoward Hinnant if (__first != __last) 34793e519524SHoward Hinnant { 34803e519524SHoward Hinnant _ForwardIterator __i = __first; 34813e519524SHoward Hinnant while (++__i != __last) 34823e519524SHoward Hinnant { 34833e519524SHoward Hinnant if (__comp(*__i, *__first)) 34843e519524SHoward Hinnant return __i; 34853e519524SHoward Hinnant __first = __i; 34863e519524SHoward Hinnant } 34873e519524SHoward Hinnant } 34883e519524SHoward Hinnant return __last; 34893e519524SHoward Hinnant} 34903e519524SHoward Hinnant 34913e519524SHoward Hinnanttemplate<class _ForwardIterator> 34923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 34933e519524SHoward Hinnant_ForwardIterator 34943e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 34953e519524SHoward Hinnant{ 3496ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 34973e519524SHoward Hinnant} 34983e519524SHoward Hinnant 34993e519524SHoward Hinnant// is_sorted 35003e519524SHoward Hinnant 35013e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 35023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35033e519524SHoward Hinnantbool 35043e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35053e519524SHoward Hinnant{ 3506ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 35073e519524SHoward Hinnant} 35083e519524SHoward Hinnant 35093e519524SHoward Hinnanttemplate<class _ForwardIterator> 35103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35113e519524SHoward Hinnantbool 35123e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 35133e519524SHoward Hinnant{ 3514ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35153e519524SHoward Hinnant} 35163e519524SHoward Hinnant 35173e519524SHoward Hinnant// sort 35183e519524SHoward Hinnant 35193e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 35203e519524SHoward Hinnant 35213e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 35223e519524SHoward Hinnantunsigned 35233e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 35243e519524SHoward Hinnant{ 35253e519524SHoward Hinnant unsigned __r = 0; 35263e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 35273e519524SHoward Hinnant { 35283e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 35293e519524SHoward Hinnant return __r; // x <= y && y <= z 35303e519524SHoward Hinnant // x <= y && y > z 35313e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 35323e519524SHoward Hinnant __r = 1; 35333e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 35343e519524SHoward Hinnant { 35353e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 35363e519524SHoward Hinnant __r = 2; 35373e519524SHoward Hinnant } 35383e519524SHoward Hinnant return __r; // x <= y && y < z 35393e519524SHoward Hinnant } 35403e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 35413e519524SHoward Hinnant { 35423e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 35433e519524SHoward Hinnant __r = 1; 35443e519524SHoward Hinnant return __r; 35453e519524SHoward Hinnant } 35463e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 35473e519524SHoward Hinnant __r = 1; // x < y && x <= z 35483e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 35493e519524SHoward Hinnant { 35503e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 35513e519524SHoward Hinnant __r = 2; 35523e519524SHoward Hinnant } 35533e519524SHoward Hinnant return __r; 35543e519524SHoward Hinnant} // x <= y && y <= z 35553e519524SHoward Hinnant 35563e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 35573e519524SHoward Hinnant 35583e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 35593e519524SHoward Hinnantunsigned 35603e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 35613e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 35623e519524SHoward Hinnant{ 35633e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 35643e519524SHoward Hinnant if (__c(*__x4, *__x3)) 35653e519524SHoward Hinnant { 35663e519524SHoward Hinnant swap(*__x3, *__x4); 35673e519524SHoward Hinnant ++__r; 35683e519524SHoward Hinnant if (__c(*__x3, *__x2)) 35693e519524SHoward Hinnant { 35703e519524SHoward Hinnant swap(*__x2, *__x3); 35713e519524SHoward Hinnant ++__r; 35723e519524SHoward Hinnant if (__c(*__x2, *__x1)) 35733e519524SHoward Hinnant { 35743e519524SHoward Hinnant swap(*__x1, *__x2); 35753e519524SHoward Hinnant ++__r; 35763e519524SHoward Hinnant } 35773e519524SHoward Hinnant } 35783e519524SHoward Hinnant } 35793e519524SHoward Hinnant return __r; 35803e519524SHoward Hinnant} 35813e519524SHoward Hinnant 35823e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 35833e519524SHoward Hinnant 35843e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 35853e519524SHoward Hinnantunsigned 35863e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 35873e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 35883e519524SHoward Hinnant{ 35893e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 35903e519524SHoward Hinnant if (__c(*__x5, *__x4)) 35913e519524SHoward Hinnant { 35923e519524SHoward Hinnant swap(*__x4, *__x5); 35933e519524SHoward Hinnant ++__r; 35943e519524SHoward Hinnant if (__c(*__x4, *__x3)) 35953e519524SHoward Hinnant { 35963e519524SHoward Hinnant swap(*__x3, *__x4); 35973e519524SHoward Hinnant ++__r; 35983e519524SHoward Hinnant if (__c(*__x3, *__x2)) 35993e519524SHoward Hinnant { 36003e519524SHoward Hinnant swap(*__x2, *__x3); 36013e519524SHoward Hinnant ++__r; 36023e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36033e519524SHoward Hinnant { 36043e519524SHoward Hinnant swap(*__x1, *__x2); 36053e519524SHoward Hinnant ++__r; 36063e519524SHoward Hinnant } 36073e519524SHoward Hinnant } 36083e519524SHoward Hinnant } 36093e519524SHoward Hinnant } 36103e519524SHoward Hinnant return __r; 36113e519524SHoward Hinnant} 36123e519524SHoward Hinnant 36133e519524SHoward Hinnant// Assumes size > 0 36143e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36153e519524SHoward Hinnantvoid 36163e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36173e519524SHoward Hinnant{ 36183e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 36193e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 36203e519524SHoward Hinnant { 3621ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 36223e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 36233e519524SHoward Hinnant (__first, __last, __comp); 36243e519524SHoward Hinnant if (__i != __first) 36253e519524SHoward Hinnant swap(*__first, *__i); 36263e519524SHoward Hinnant } 36273e519524SHoward Hinnant} 36283e519524SHoward Hinnant 36293e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36303e519524SHoward Hinnantvoid 36313e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36323e519524SHoward Hinnant{ 36333e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 36343e519524SHoward Hinnant if (__first != __last) 36353e519524SHoward Hinnant { 36363e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 36373e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 36383e519524SHoward Hinnant { 36393e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3640ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 36413e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3642ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3643ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 36443e519524SHoward Hinnant } 36453e519524SHoward Hinnant } 36463e519524SHoward Hinnant} 36473e519524SHoward Hinnant 36483e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 36493e519524SHoward Hinnantvoid 36503e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 36513e519524SHoward Hinnant{ 36523e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 36533e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 36543e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 36553e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 36563e519524SHoward Hinnant { 36573e519524SHoward Hinnant if (__comp(*__i, *__j)) 36583e519524SHoward Hinnant { 3659ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 36603e519524SHoward Hinnant _RandomAccessIterator __k = __j; 36613e519524SHoward Hinnant __j = __i; 36623e519524SHoward Hinnant do 36633e519524SHoward Hinnant { 3664ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 36653e519524SHoward Hinnant __j = __k; 36663e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3667ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 36683e519524SHoward Hinnant } 36693e519524SHoward Hinnant __j = __i; 36703e519524SHoward Hinnant } 36713e519524SHoward Hinnant} 36723e519524SHoward Hinnant 36733e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 36743e519524SHoward Hinnantbool 36753e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 36763e519524SHoward Hinnant{ 36773e519524SHoward Hinnant switch (__last - __first) 36783e519524SHoward Hinnant { 36793e519524SHoward Hinnant case 0: 36803e519524SHoward Hinnant case 1: 36813e519524SHoward Hinnant return true; 36823e519524SHoward Hinnant case 2: 36833e519524SHoward Hinnant if (__comp(*--__last, *__first)) 36843e519524SHoward Hinnant swap(*__first, *__last); 36853e519524SHoward Hinnant return true; 36863e519524SHoward Hinnant case 3: 3687ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 36883e519524SHoward Hinnant return true; 36893e519524SHoward Hinnant case 4: 3690ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 36913e519524SHoward Hinnant return true; 36923e519524SHoward Hinnant case 5: 3693ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 36943e519524SHoward Hinnant return true; 36953e519524SHoward Hinnant } 36963e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 36973e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 36983e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 36993e519524SHoward Hinnant const unsigned __limit = 8; 37003e519524SHoward Hinnant unsigned __count = 0; 37013e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37023e519524SHoward Hinnant { 37033e519524SHoward Hinnant if (__comp(*__i, *__j)) 37043e519524SHoward Hinnant { 3705ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37063e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37073e519524SHoward Hinnant __j = __i; 37083e519524SHoward Hinnant do 37093e519524SHoward Hinnant { 3710ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37113e519524SHoward Hinnant __j = __k; 37123e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3713ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37143e519524SHoward Hinnant if (++__count == __limit) 37153e519524SHoward Hinnant return ++__i == __last; 37163e519524SHoward Hinnant } 37173e519524SHoward Hinnant __j = __i; 37183e519524SHoward Hinnant } 37193e519524SHoward Hinnant return true; 37203e519524SHoward Hinnant} 37213e519524SHoward Hinnant 37223e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37233e519524SHoward Hinnantvoid 37243e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 37253e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 37263e519524SHoward Hinnant{ 37273e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 37283e519524SHoward Hinnant if (__first1 != __last1) 37293e519524SHoward Hinnant { 37303e519524SHoward Hinnant __destruct_n __d(0); 37313e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 37323e519524SHoward Hinnant value_type* __last2 = __first2; 3733ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 37343e519524SHoward Hinnant __d.__incr((value_type*)0); 37353e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 37363e519524SHoward Hinnant { 37373e519524SHoward Hinnant value_type* __j2 = __last2; 37383e519524SHoward Hinnant value_type* __i2 = __j2; 37393e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 37403e519524SHoward Hinnant { 3741ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 37423e519524SHoward Hinnant __d.__incr((value_type*)0); 37433e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3744ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3745ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 37463e519524SHoward Hinnant } 37473e519524SHoward Hinnant else 37483e519524SHoward Hinnant { 3749ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 37503e519524SHoward Hinnant __d.__incr((value_type*)0); 37513e519524SHoward Hinnant } 37523e519524SHoward Hinnant } 37533e519524SHoward Hinnant __h.release(); 37543e519524SHoward Hinnant } 37553e519524SHoward Hinnant} 37563e519524SHoward Hinnant 37573e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37583e519524SHoward Hinnantvoid 37593e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37603e519524SHoward Hinnant{ 37613e519524SHoward Hinnant // _Compare is known to be a reference type 37623e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 37633e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3764ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3765ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 37663e519524SHoward Hinnant while (true) 37673e519524SHoward Hinnant { 37683e519524SHoward Hinnant __restart: 37693e519524SHoward Hinnant difference_type __len = __last - __first; 37703e519524SHoward Hinnant switch (__len) 37713e519524SHoward Hinnant { 37723e519524SHoward Hinnant case 0: 37733e519524SHoward Hinnant case 1: 37743e519524SHoward Hinnant return; 37753e519524SHoward Hinnant case 2: 37763e519524SHoward Hinnant if (__comp(*--__last, *__first)) 37773e519524SHoward Hinnant swap(*__first, *__last); 37783e519524SHoward Hinnant return; 37793e519524SHoward Hinnant case 3: 3780ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 37813e519524SHoward Hinnant return; 37823e519524SHoward Hinnant case 4: 3783ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 37843e519524SHoward Hinnant return; 37853e519524SHoward Hinnant case 5: 3786ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 37873e519524SHoward Hinnant return; 37883e519524SHoward Hinnant } 37893e519524SHoward Hinnant if (__len <= __limit) 37903e519524SHoward Hinnant { 3791ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 37923e519524SHoward Hinnant return; 37933e519524SHoward Hinnant } 37943e519524SHoward Hinnant // __len > 5 37953e519524SHoward Hinnant _RandomAccessIterator __m = __first; 37963e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 37973e519524SHoward Hinnant --__lm1; 37983e519524SHoward Hinnant unsigned __n_swaps; 37993e519524SHoward Hinnant { 38003e519524SHoward Hinnant difference_type __delta; 38013e519524SHoward Hinnant if (__len >= 1000) 38023e519524SHoward Hinnant { 38033e519524SHoward Hinnant __delta = __len/2; 38043e519524SHoward Hinnant __m += __delta; 38053e519524SHoward Hinnant __delta /= 2; 3806ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 38073e519524SHoward Hinnant } 38083e519524SHoward Hinnant else 38093e519524SHoward Hinnant { 38103e519524SHoward Hinnant __delta = __len/2; 38113e519524SHoward Hinnant __m += __delta; 3812ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 38133e519524SHoward Hinnant } 38143e519524SHoward Hinnant } 38153e519524SHoward Hinnant // *__m is median 38163e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 38173e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 38183e519524SHoward Hinnant _RandomAccessIterator __i = __first; 38193e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 38203e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 38213e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 38223e519524SHoward Hinnant // Prime the downward search with a guard. 38233e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 38243e519524SHoward Hinnant { 38253e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 38263e519524SHoward Hinnant // manually guard downward moving __j against __i 38273e519524SHoward Hinnant while (true) 38283e519524SHoward Hinnant { 38293e519524SHoward Hinnant if (__i == --__j) 38303e519524SHoward Hinnant { 38313e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 38323e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 38333e519524SHoward Hinnant ++__i; // __first + 1 38343e519524SHoward Hinnant __j = __last; 38353e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 38363e519524SHoward Hinnant { 38373e519524SHoward Hinnant while (true) 38383e519524SHoward Hinnant { 38393e519524SHoward Hinnant if (__i == __j) 38403e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 38413e519524SHoward Hinnant if (__comp(*__first, *__i)) 38423e519524SHoward Hinnant { 38433e519524SHoward Hinnant swap(*__i, *__j); 38443e519524SHoward Hinnant ++__n_swaps; 38453e519524SHoward Hinnant ++__i; 38463e519524SHoward Hinnant break; 38473e519524SHoward Hinnant } 38483e519524SHoward Hinnant ++__i; 38493e519524SHoward Hinnant } 38503e519524SHoward Hinnant } 38513e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 38523e519524SHoward Hinnant if (__i == __j) 38533e519524SHoward Hinnant return; 38543e519524SHoward Hinnant while (true) 38553e519524SHoward Hinnant { 38563e519524SHoward Hinnant while (!__comp(*__first, *__i)) 38573e519524SHoward Hinnant ++__i; 38583e519524SHoward Hinnant while (__comp(*__first, *--__j)) 38593e519524SHoward Hinnant ; 38603e519524SHoward Hinnant if (__i >= __j) 38613e519524SHoward Hinnant break; 38623e519524SHoward Hinnant swap(*__i, *__j); 38633e519524SHoward Hinnant ++__n_swaps; 38643e519524SHoward Hinnant ++__i; 38653e519524SHoward Hinnant } 38663e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 38673e519524SHoward Hinnant // The first part is sorted, sort the secod part 3868ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 38693e519524SHoward Hinnant __first = __i; 38703e519524SHoward Hinnant goto __restart; 38713e519524SHoward Hinnant } 38723e519524SHoward Hinnant if (__comp(*__j, *__m)) 38733e519524SHoward Hinnant { 38743e519524SHoward Hinnant swap(*__i, *__j); 38753e519524SHoward Hinnant ++__n_swaps; 38763e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 38773e519524SHoward Hinnant } 38783e519524SHoward Hinnant } 38793e519524SHoward Hinnant } 38803e519524SHoward Hinnant // It is known that *__i < *__m 38813e519524SHoward Hinnant ++__i; 38823e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 38833e519524SHoward Hinnant // if not yet partitioned... 38843e519524SHoward Hinnant if (__i < __j) 38853e519524SHoward Hinnant { 38863e519524SHoward Hinnant // known that *(__i - 1) < *__m 38873e519524SHoward Hinnant // known that __i <= __m 38883e519524SHoward Hinnant while (true) 38893e519524SHoward Hinnant { 38903e519524SHoward Hinnant // __m still guards upward moving __i 38913e519524SHoward Hinnant while (__comp(*__i, *__m)) 38923e519524SHoward Hinnant ++__i; 38933e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 38943e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 38953e519524SHoward Hinnant ; 38963e519524SHoward Hinnant if (__i > __j) 38973e519524SHoward Hinnant break; 38983e519524SHoward Hinnant swap(*__i, *__j); 38993e519524SHoward Hinnant ++__n_swaps; 39003e519524SHoward Hinnant // It is known that __m != __j 39013e519524SHoward Hinnant // If __m just moved, follow it 39023e519524SHoward Hinnant if (__m == __i) 39033e519524SHoward Hinnant __m = __j; 39043e519524SHoward Hinnant ++__i; 39053e519524SHoward Hinnant } 39063e519524SHoward Hinnant } 39073e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 39083e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 39093e519524SHoward Hinnant { 39103e519524SHoward Hinnant swap(*__i, *__m); 39113e519524SHoward Hinnant ++__n_swaps; 39123e519524SHoward Hinnant } 39133e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 39143e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 39153e519524SHoward Hinnant if (__n_swaps == 0) 39163e519524SHoward Hinnant { 3917ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 3918ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 39193e519524SHoward Hinnant { 39203e519524SHoward Hinnant if (__fs) 39213e519524SHoward Hinnant return; 39223e519524SHoward Hinnant __last = __i; 39233e519524SHoward Hinnant continue; 39243e519524SHoward Hinnant } 39253e519524SHoward Hinnant else 39263e519524SHoward Hinnant { 39273e519524SHoward Hinnant if (__fs) 39283e519524SHoward Hinnant { 39293e519524SHoward Hinnant __first = ++__i; 39303e519524SHoward Hinnant continue; 39313e519524SHoward Hinnant } 39323e519524SHoward Hinnant } 39333e519524SHoward Hinnant } 39343e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 39353e519524SHoward Hinnant if (__i - __first < __last - __i) 39363e519524SHoward Hinnant { 3937ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 3938ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 39393e519524SHoward Hinnant __first = ++__i; 39403e519524SHoward Hinnant } 39413e519524SHoward Hinnant else 39423e519524SHoward Hinnant { 3943ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 3944ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 39453e519524SHoward Hinnant __last = __i; 39463e519524SHoward Hinnant } 39473e519524SHoward Hinnant } 39483e519524SHoward Hinnant} 39493e519524SHoward Hinnant 39503e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 39513e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 39523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39533e519524SHoward Hinnantvoid 39543e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39553e519524SHoward Hinnant{ 3956f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 39573e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 39583e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 39593e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 3960f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 39613e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 39623e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 3963f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 39643e519524SHoward Hinnant} 39653e519524SHoward Hinnant 39663e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 39673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39683e519524SHoward Hinnantvoid 39693e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 39703e519524SHoward Hinnant{ 3971ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 39723e519524SHoward Hinnant} 39733e519524SHoward Hinnant 39743e519524SHoward Hinnanttemplate <class _Tp> 39753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39763e519524SHoward Hinnantvoid 39773e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 39783e519524SHoward Hinnant{ 3979ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 39803e519524SHoward Hinnant} 39813e519524SHoward Hinnant 39823e519524SHoward Hinnanttemplate <class _Tp> 39833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39843e519524SHoward Hinnantvoid 39853e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 39863e519524SHoward Hinnant{ 3987ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 39883e519524SHoward Hinnant} 39893e519524SHoward Hinnant 3990f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 3991f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 3992f554add5SHoward Hinnantvoid 3993f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 3994f554add5SHoward Hinnant{ 3995f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 3996f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 3997f554add5SHoward Hinnant} 3998f554add5SHoward Hinnant 39990be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4000e4383379SHoward Hinnant#pragma warning( push ) 4001e4383379SHoward Hinnant#pragma warning( disable: 4231) 40020be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 4003f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4004f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4005f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4006f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4007f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4008f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4009f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4010f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4011f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4012f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4013f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4014f0544c20SHoward 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>&)) 4015f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4016f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4017f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40183e519524SHoward Hinnant 4019f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4020f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4021f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4022f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4023f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4024f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4025f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4026f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4027f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4028f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4029f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4030f0544c20SHoward 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>&)) 4031f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4032f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4033f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40343e519524SHoward Hinnant 4035f0544c20SHoward 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>&)) 40360be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4037e4383379SHoward Hinnant#pragma warning( pop ) 40380be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 40393e519524SHoward Hinnant 40403e519524SHoward Hinnant// lower_bound 40413e519524SHoward Hinnant 40423e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 40433e519524SHoward Hinnant_ForwardIterator 4044e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 40453e519524SHoward Hinnant{ 40463e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4047ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 40483e519524SHoward Hinnant while (__len != 0) 40493e519524SHoward Hinnant { 40503e519524SHoward Hinnant difference_type __l2 = __len / 2; 40513e519524SHoward Hinnant _ForwardIterator __m = __first; 4052ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4053e4383379SHoward Hinnant if (__comp(*__m, __value_)) 40543e519524SHoward Hinnant { 40553e519524SHoward Hinnant __first = ++__m; 40563e519524SHoward Hinnant __len -= __l2 + 1; 40573e519524SHoward Hinnant } 40583e519524SHoward Hinnant else 40593e519524SHoward Hinnant __len = __l2; 40603e519524SHoward Hinnant } 40613e519524SHoward Hinnant return __first; 40623e519524SHoward Hinnant} 40633e519524SHoward Hinnant 40643e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 40653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40663e519524SHoward Hinnant_ForwardIterator 4067e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 40683e519524SHoward Hinnant{ 4069f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 40703e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 40713e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4072e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 4073f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 40743e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4075e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4076f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 40773e519524SHoward Hinnant} 40783e519524SHoward Hinnant 40793e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 40803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40813e519524SHoward Hinnant_ForwardIterator 4082e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 40833e519524SHoward Hinnant{ 4084e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 40853e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 40863e519524SHoward Hinnant} 40873e519524SHoward Hinnant 40883e519524SHoward Hinnant// upper_bound 40893e519524SHoward Hinnant 40903e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 40913e519524SHoward Hinnant_ForwardIterator 4092e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 40933e519524SHoward Hinnant{ 40943e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4095ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 40963e519524SHoward Hinnant while (__len != 0) 40973e519524SHoward Hinnant { 40983e519524SHoward Hinnant difference_type __l2 = __len / 2; 40993e519524SHoward Hinnant _ForwardIterator __m = __first; 4100ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4101e4383379SHoward Hinnant if (__comp(__value_, *__m)) 41023e519524SHoward Hinnant __len = __l2; 41033e519524SHoward Hinnant else 41043e519524SHoward Hinnant { 41053e519524SHoward Hinnant __first = ++__m; 41063e519524SHoward Hinnant __len -= __l2 + 1; 41073e519524SHoward Hinnant } 41083e519524SHoward Hinnant } 41093e519524SHoward Hinnant return __first; 41103e519524SHoward Hinnant} 41113e519524SHoward Hinnant 41123e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41143e519524SHoward Hinnant_ForwardIterator 4115e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41163e519524SHoward Hinnant{ 4117f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 41183e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41193e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4120e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 4121f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 41223e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4123e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4124f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 41253e519524SHoward Hinnant} 41263e519524SHoward Hinnant 41273e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 41283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41293e519524SHoward Hinnant_ForwardIterator 4130e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41313e519524SHoward Hinnant{ 4132e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 41333e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 41343e519524SHoward Hinnant} 41353e519524SHoward Hinnant 41363e519524SHoward Hinnant// equal_range 41373e519524SHoward Hinnant 41383e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41393e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4140e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41413e519524SHoward Hinnant{ 41423e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4143ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41443e519524SHoward Hinnant while (__len != 0) 41453e519524SHoward Hinnant { 41463e519524SHoward Hinnant difference_type __l2 = __len / 2; 41473e519524SHoward Hinnant _ForwardIterator __m = __first; 4148ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4149e4383379SHoward Hinnant if (__comp(*__m, __value_)) 41503e519524SHoward Hinnant { 41513e519524SHoward Hinnant __first = ++__m; 41523e519524SHoward Hinnant __len -= __l2 + 1; 41533e519524SHoward Hinnant } 4154e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 41553e519524SHoward Hinnant { 41563e519524SHoward Hinnant __last = __m; 41573e519524SHoward Hinnant __len = __l2; 41583e519524SHoward Hinnant } 41593e519524SHoward Hinnant else 41603e519524SHoward Hinnant { 41613e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 41623e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 41633e519524SHoward Hinnant ( 4164e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4165e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 41663e519524SHoward Hinnant ); 41673e519524SHoward Hinnant } 41683e519524SHoward Hinnant } 41693e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 41703e519524SHoward Hinnant} 41713e519524SHoward Hinnant 41723e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41743e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4175e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41763e519524SHoward Hinnant{ 4177f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 41783e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41793e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4180e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4181f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 41823e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4183e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4184f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 41853e519524SHoward Hinnant} 41863e519524SHoward Hinnant 41873e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 41883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41893e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4190e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41913e519524SHoward Hinnant{ 4192e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 41933e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 41943e519524SHoward Hinnant} 41953e519524SHoward Hinnant 41963e519524SHoward Hinnant// binary_search 41973e519524SHoward Hinnant 41983e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42003e519524SHoward Hinnantbool 4201e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42023e519524SHoward Hinnant{ 4203e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4204e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 42053e519524SHoward Hinnant} 42063e519524SHoward Hinnant 42073e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42093e519524SHoward Hinnantbool 4210e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42113e519524SHoward Hinnant{ 4212f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 42133e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42143e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4215e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4216f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 42173e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4218e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4219f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 42203e519524SHoward Hinnant} 42213e519524SHoward Hinnant 42223e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42243e519524SHoward Hinnantbool 4225e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42263e519524SHoward Hinnant{ 4227e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 42283e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42293e519524SHoward Hinnant} 42303e519524SHoward Hinnant 42313e519524SHoward Hinnant// merge 42323e519524SHoward Hinnant 42333e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 42343e519524SHoward Hinnant_OutputIterator 42353e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 42363e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 42373e519524SHoward Hinnant{ 42383e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 42393e519524SHoward Hinnant { 42403e519524SHoward Hinnant if (__first2 == __last2) 4241ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 42423e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 42433e519524SHoward Hinnant { 42443e519524SHoward Hinnant *__result = *__first2; 42453e519524SHoward Hinnant ++__first2; 42463e519524SHoward Hinnant } 42473e519524SHoward Hinnant else 42483e519524SHoward Hinnant { 42493e519524SHoward Hinnant *__result = *__first1; 42503e519524SHoward Hinnant ++__first1; 42513e519524SHoward Hinnant } 42523e519524SHoward Hinnant } 4253ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 42543e519524SHoward Hinnant} 42553e519524SHoward Hinnant 42563e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 42573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42583e519524SHoward Hinnant_OutputIterator 42593e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 42603e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 42613e519524SHoward Hinnant{ 4262f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 42633e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42643e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4265ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4266f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 42673e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4268ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4269f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 42703e519524SHoward Hinnant} 42713e519524SHoward Hinnant 42723e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 42733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42743e519524SHoward Hinnant_OutputIterator 42753e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 42763e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 42773e519524SHoward Hinnant{ 42783e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 42793e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 42803e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 42813e519524SHoward Hinnant} 42823e519524SHoward Hinnant 42833e519524SHoward Hinnant// inplace_merge 42843e519524SHoward Hinnant 42853e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 42863e519524SHoward Hinnantvoid 42873e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 42883e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 42893e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 42903e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 42913e519524SHoward Hinnant{ 42923e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 42933e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 42943e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::pointer pointer; 42953e519524SHoward Hinnant __destruct_n __d(0); 42963e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 42973e519524SHoward Hinnant if (__len1 <= __len2) 42983e519524SHoward Hinnant { 42993e519524SHoward Hinnant value_type* __p = __buff; 43003e519524SHoward Hinnant for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), ++__i, ++__p) 4301ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 43023e519524SHoward Hinnant __merge<_Compare>(move_iterator<value_type*>(__buff), 43033e519524SHoward Hinnant move_iterator<value_type*>(__p), 43043e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__middle), 43053e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__last), 43063e519524SHoward Hinnant __first, __comp); 43073e519524SHoward Hinnant } 43083e519524SHoward Hinnant else 43093e519524SHoward Hinnant { 43103e519524SHoward Hinnant value_type* __p = __buff; 43113e519524SHoward Hinnant for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), ++__i, ++__p) 4312ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 43133e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 43143e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 43153e519524SHoward Hinnant __merge(move_iterator<_RBi>(_RBi(__middle)), move_iterator<_RBi>(_RBi(__first)), 43163e519524SHoward Hinnant move_iterator<_Rv>(_Rv(__p)), move_iterator<_Rv>(_Rv(__buff)), 43173e519524SHoward Hinnant _RBi(__last), __negate<_Compare>(__comp)); 43183e519524SHoward Hinnant } 43193e519524SHoward Hinnant} 43203e519524SHoward Hinnant 43213e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 43223e519524SHoward Hinnantvoid 43233e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 43243e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 43253e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 43263e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 43273e519524SHoward Hinnant{ 43283e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 43293e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 43303e519524SHoward Hinnant while (true) 43313e519524SHoward Hinnant { 43323e519524SHoward Hinnant // if __middle == __last, we're done 43333e519524SHoward Hinnant if (__len2 == 0) 43343e519524SHoward Hinnant return; 43353e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 43363e519524SHoward Hinnant for (; true; ++__first, --__len1) 43373e519524SHoward Hinnant { 43383e519524SHoward Hinnant if (__len1 == 0) 43393e519524SHoward Hinnant return; 43403e519524SHoward Hinnant if (__comp(*__middle, *__first)) 43413e519524SHoward Hinnant break; 43423e519524SHoward Hinnant } 43433e519524SHoward Hinnant if (__len1 <= __buff_size || __len2 <= __buff_size) 43443e519524SHoward Hinnant { 43453e519524SHoward Hinnant __buffered_inplace_merge<_Compare>(__first, __middle, __last, __comp, __len1, __len2, __buff); 43463e519524SHoward Hinnant return; 43473e519524SHoward Hinnant } 43483e519524SHoward Hinnant // __first < __middle < __last 43493e519524SHoward Hinnant // *__first > *__middle 43503e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 43513e519524SHoward Hinnant // all elements in: 43523e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 43533e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 43543e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 43553e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 43563e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 43573e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 43583e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 43593e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 43603e519524SHoward Hinnant // binary search smaller range 43613e519524SHoward Hinnant if (__len1 < __len2) 43623e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 43633e519524SHoward Hinnant __len21 = __len2 / 2; 43643e519524SHoward Hinnant __m2 = __middle; 4365ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 43663e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4367ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 43683e519524SHoward Hinnant } 43693e519524SHoward Hinnant else 43703e519524SHoward Hinnant { 43713e519524SHoward Hinnant if (__len1 == 1) 43723e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 43733e519524SHoward Hinnant // It is known *__first > *__middle 43743e519524SHoward Hinnant swap(*__first, *__middle); 43753e519524SHoward Hinnant return; 43763e519524SHoward Hinnant } 43773e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 43783e519524SHoward Hinnant __len11 = __len1 / 2; 43793e519524SHoward Hinnant __m1 = __first; 4380ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 43813e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4382ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 43833e519524SHoward Hinnant } 43843e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 43853e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 43863e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 43873e519524SHoward Hinnant // swap middle two partitions 4388ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 43893e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 43903e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 43913e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 43923e519524SHoward Hinnant { 43933e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 43943e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 43953e519524SHoward Hinnant __first = __middle; 43963e519524SHoward Hinnant __middle = __m2; 43973e519524SHoward Hinnant __len1 = __len12; 43983e519524SHoward Hinnant __len2 = __len22; 43993e519524SHoward Hinnant } 44003e519524SHoward Hinnant else 44013e519524SHoward Hinnant { 44023e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 44033e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 44043e519524SHoward Hinnant __last = __middle; 44053e519524SHoward Hinnant __middle = __m1; 44063e519524SHoward Hinnant __len1 = __len11; 44073e519524SHoward Hinnant __len2 = __len21; 44083e519524SHoward Hinnant } 44093e519524SHoward Hinnant } 44103e519524SHoward Hinnant} 44113e519524SHoward Hinnant 44123e519524SHoward Hinnanttemplate <class _Tp> 44133e519524SHoward Hinnantstruct __inplace_merge_switch 44143e519524SHoward Hinnant{ 4415ca740483SHoward Hinnant static const unsigned value = is_trivially_copy_assignable<_Tp>::value; 44163e519524SHoward Hinnant}; 44173e519524SHoward Hinnant 44183e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 44193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44203e519524SHoward Hinnantvoid 44213e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44223e519524SHoward Hinnant _Compare __comp) 44233e519524SHoward Hinnant{ 44243e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 44253e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4426ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4427ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4428ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 44293e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 44303e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 44313e519524SHoward Hinnant if (__inplace_merge_switch<value_type>::value && __buf_size > 8) 44323e519524SHoward Hinnant { 4433ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 44343e519524SHoward Hinnant __h.reset(__buf.first); 44353e519524SHoward Hinnant } 4436f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 44373e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44383e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4439ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 44403e519524SHoward Hinnant __buf.first, __buf.second); 4441f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 44423e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4443ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 44443e519524SHoward Hinnant __buf.first, __buf.second); 4445f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 44463e519524SHoward Hinnant} 44473e519524SHoward Hinnant 44483e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 44493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44503e519524SHoward Hinnantvoid 44513e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 44523e519524SHoward Hinnant{ 4453ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 44543e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 44553e519524SHoward Hinnant} 44563e519524SHoward Hinnant 44573e519524SHoward Hinnant// stable_sort 44583e519524SHoward Hinnant 44593e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 44603e519524SHoward Hinnantvoid 44613e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 44623e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 44633e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 44643e519524SHoward Hinnant{ 44653e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 44663e519524SHoward Hinnant __destruct_n __d(0); 44673e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 44683e519524SHoward Hinnant for (; true; ++__result) 44693e519524SHoward Hinnant { 44703e519524SHoward Hinnant if (__first1 == __last1) 44713e519524SHoward Hinnant { 44723e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4473ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 44743e519524SHoward Hinnant __h.release(); 44753e519524SHoward Hinnant return; 44763e519524SHoward Hinnant } 44773e519524SHoward Hinnant if (__first2 == __last2) 44783e519524SHoward Hinnant { 44793e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4480ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 44813e519524SHoward Hinnant __h.release(); 44823e519524SHoward Hinnant return; 44833e519524SHoward Hinnant } 44843e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 44853e519524SHoward Hinnant { 4486ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 44873e519524SHoward Hinnant __d.__incr((value_type*)0); 44883e519524SHoward Hinnant ++__first2; 44893e519524SHoward Hinnant } 44903e519524SHoward Hinnant else 44913e519524SHoward Hinnant { 4492ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 44933e519524SHoward Hinnant __d.__incr((value_type*)0); 44943e519524SHoward Hinnant ++__first1; 44953e519524SHoward Hinnant } 44963e519524SHoward Hinnant } 44973e519524SHoward Hinnant} 44983e519524SHoward Hinnant 44993e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 45003e519524SHoward Hinnantvoid 45013e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 45023e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45033e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 45043e519524SHoward Hinnant{ 45053e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 45063e519524SHoward Hinnant { 45073e519524SHoward Hinnant if (__first2 == __last2) 45083e519524SHoward Hinnant { 45093e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4510ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45113e519524SHoward Hinnant return; 45123e519524SHoward Hinnant } 45133e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45143e519524SHoward Hinnant { 4515ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45163e519524SHoward Hinnant ++__first2; 45173e519524SHoward Hinnant } 45183e519524SHoward Hinnant else 45193e519524SHoward Hinnant { 4520ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45213e519524SHoward Hinnant ++__first1; 45223e519524SHoward Hinnant } 45233e519524SHoward Hinnant } 45243e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4525ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45263e519524SHoward Hinnant} 45273e519524SHoward Hinnant 45283e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45293e519524SHoward Hinnantvoid 45303e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 45313e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45323e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 45333e519524SHoward Hinnant 45343e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45353e519524SHoward Hinnantvoid 45363e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 45373e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45383e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 45393e519524SHoward Hinnant{ 45403e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 45413e519524SHoward Hinnant switch (__len) 45423e519524SHoward Hinnant { 45433e519524SHoward Hinnant case 0: 45443e519524SHoward Hinnant return; 45453e519524SHoward Hinnant case 1: 4546ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 45473e519524SHoward Hinnant return; 45483e519524SHoward Hinnant case 2: 45493e519524SHoward Hinnant __destruct_n __d(0); 45503e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 45513e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 45523e519524SHoward Hinnant { 4553ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 45543e519524SHoward Hinnant __d.__incr((value_type*)0); 45553e519524SHoward Hinnant ++__first2; 4556ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 45573e519524SHoward Hinnant } 45583e519524SHoward Hinnant else 45593e519524SHoward Hinnant { 4560ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 45613e519524SHoward Hinnant __d.__incr((value_type*)0); 45623e519524SHoward Hinnant ++__first2; 4563ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 45643e519524SHoward Hinnant } 45653e519524SHoward Hinnant __h2.release(); 45663e519524SHoward Hinnant return; 45673e519524SHoward Hinnant } 45683e519524SHoward Hinnant if (__len <= 8) 45693e519524SHoward Hinnant { 45703e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 45713e519524SHoward Hinnant return; 45723e519524SHoward Hinnant } 45733e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 45743e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 45753e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 45763e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 45773e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 45783e519524SHoward Hinnant} 45793e519524SHoward Hinnant 45803e519524SHoward Hinnanttemplate <class _Tp> 45813e519524SHoward Hinnantstruct __stable_sort_switch 45823e519524SHoward Hinnant{ 4583ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 45843e519524SHoward Hinnant}; 45853e519524SHoward Hinnant 45863e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45873e519524SHoward Hinnantvoid 45883e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 45893e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45903e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 45913e519524SHoward Hinnant{ 45923e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 45933e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 45943e519524SHoward Hinnant switch (__len) 45953e519524SHoward Hinnant { 45963e519524SHoward Hinnant case 0: 45973e519524SHoward Hinnant case 1: 45983e519524SHoward Hinnant return; 45993e519524SHoward Hinnant case 2: 46003e519524SHoward Hinnant if (__comp(*--__last, *__first)) 46013e519524SHoward Hinnant swap(*__first, *__last); 46023e519524SHoward Hinnant return; 46033e519524SHoward Hinnant } 46043e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 46053e519524SHoward Hinnant { 46063e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 46073e519524SHoward Hinnant return; 46083e519524SHoward Hinnant } 46093e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46103e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 46113e519524SHoward Hinnant if (__len <= __buff_size) 46123e519524SHoward Hinnant { 46133e519524SHoward Hinnant __destruct_n __d(0); 46143e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 46153e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 46163e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 46173e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 46183e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 46193e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 46203e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 46213e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 46223e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 46233e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 46243e519524SHoward Hinnant// __first, __comp); 46253e519524SHoward Hinnant return; 46263e519524SHoward Hinnant } 46273e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 46283e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 46293e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 46303e519524SHoward Hinnant} 46313e519524SHoward Hinnant 46323e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 46333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46343e519524SHoward Hinnantvoid 46353e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 46363e519524SHoward Hinnant{ 46373e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46383e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46393e519524SHoward Hinnant difference_type __len = __last - __first; 46403e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 46413e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 46423e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 46433e519524SHoward Hinnant { 4644ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 46453e519524SHoward Hinnant __h.reset(__buf.first); 46463e519524SHoward Hinnant } 4647f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 46483e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46493e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 46503e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4651f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 46523e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 46533e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4654f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 46553e519524SHoward Hinnant} 46563e519524SHoward Hinnant 46573e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 46583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46593e519524SHoward Hinnantvoid 46603e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 46613e519524SHoward Hinnant{ 4662ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 46633e519524SHoward Hinnant} 46643e519524SHoward Hinnant 46653e519524SHoward Hinnant// is_heap_until 46663e519524SHoward Hinnant 46673e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 46683e519524SHoward Hinnant_RandomAccessIterator 46693e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 46703e519524SHoward Hinnant{ 4671ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46723e519524SHoward Hinnant difference_type __len = __last - __first; 46733e519524SHoward Hinnant difference_type __p = 0; 46743e519524SHoward Hinnant difference_type __c = 1; 46753e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 46763e519524SHoward Hinnant while (__c < __len) 46773e519524SHoward Hinnant { 46783e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 46793e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 46803e519524SHoward Hinnant return __cp; 46813e519524SHoward Hinnant ++__c; 46823e519524SHoward Hinnant ++__cp; 46833e519524SHoward Hinnant if (__c == __len) 46843e519524SHoward Hinnant return __last; 46853e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 46863e519524SHoward Hinnant return __cp; 46873e519524SHoward Hinnant ++__p; 46883e519524SHoward Hinnant ++__pp; 46893e519524SHoward Hinnant __c = 2 * __p + 1; 46903e519524SHoward Hinnant } 46913e519524SHoward Hinnant return __last; 46923e519524SHoward Hinnant} 46933e519524SHoward Hinnant 46943e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 46953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46963e519524SHoward Hinnant_RandomAccessIterator 46973e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 46983e519524SHoward Hinnant{ 4699ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47003e519524SHoward Hinnant} 47013e519524SHoward Hinnant 47023e519524SHoward Hinnant// is_heap 47033e519524SHoward Hinnant 47043e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47063e519524SHoward Hinnantbool 47073e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47083e519524SHoward Hinnant{ 4709ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 47103e519524SHoward Hinnant} 47113e519524SHoward Hinnant 47123e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 47133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47143e519524SHoward Hinnantbool 47153e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 47163e519524SHoward Hinnant{ 4717ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47183e519524SHoward Hinnant} 47193e519524SHoward Hinnant 47203e519524SHoward Hinnant// push_heap 47213e519524SHoward Hinnant 47223e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47233e519524SHoward Hinnantvoid 47243e519524SHoward Hinnant__push_heap_front(_RandomAccessIterator __first, _RandomAccessIterator, _Compare __comp, 47253e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 47263e519524SHoward Hinnant{ 47273e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47283e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47293e519524SHoward Hinnant if (__len > 1) 47303e519524SHoward Hinnant { 47313e519524SHoward Hinnant difference_type __p = 0; 47323e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 47333e519524SHoward Hinnant difference_type __c = 2; 47343e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 47353e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 47363e519524SHoward Hinnant { 47373e519524SHoward Hinnant --__c; 47383e519524SHoward Hinnant --__cp; 47393e519524SHoward Hinnant } 47403e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47413e519524SHoward Hinnant { 4742ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__pp)); 47433e519524SHoward Hinnant do 47443e519524SHoward Hinnant { 4745ce48a113SHoward Hinnant *__pp = _VSTD::move(*__cp); 47463e519524SHoward Hinnant __pp = __cp; 47473e519524SHoward Hinnant __p = __c; 47483e519524SHoward Hinnant __c = (__p + 1) * 2; 47493e519524SHoward Hinnant if (__c > __len) 47503e519524SHoward Hinnant break; 47513e519524SHoward Hinnant __cp = __first + __c; 47523e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 47533e519524SHoward Hinnant { 47543e519524SHoward Hinnant --__c; 47553e519524SHoward Hinnant --__cp; 47563e519524SHoward Hinnant } 47573e519524SHoward Hinnant } while (__comp(__t, *__cp)); 4758ce48a113SHoward Hinnant *__pp = _VSTD::move(__t); 47593e519524SHoward Hinnant } 47603e519524SHoward Hinnant } 47613e519524SHoward Hinnant} 47623e519524SHoward Hinnant 47633e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47643e519524SHoward Hinnantvoid 47653e519524SHoward Hinnant__push_heap_back(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47663e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 47673e519524SHoward Hinnant{ 47683e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47693e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47703e519524SHoward Hinnant if (__len > 1) 47713e519524SHoward Hinnant { 47723e519524SHoward Hinnant __len = (__len - 2) / 2; 47733e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 47743e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 47753e519524SHoward Hinnant { 4776ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 47773e519524SHoward Hinnant do 47783e519524SHoward Hinnant { 4779ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 47803e519524SHoward Hinnant __last = __ptr; 47813e519524SHoward Hinnant if (__len == 0) 47823e519524SHoward Hinnant break; 47833e519524SHoward Hinnant __len = (__len - 1) / 2; 47843e519524SHoward Hinnant __ptr = __first + __len; 47853e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4786ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 47873e519524SHoward Hinnant } 47883e519524SHoward Hinnant } 47893e519524SHoward Hinnant} 47903e519524SHoward Hinnant 47913e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47933e519524SHoward Hinnantvoid 47943e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47953e519524SHoward Hinnant{ 4796f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 47973e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 47983e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 47993e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __c, __last - __first); 4800f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 48013e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48023e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __comp, __last - __first); 4803f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 48043e519524SHoward Hinnant} 48053e519524SHoward Hinnant 48063e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48083e519524SHoward Hinnantvoid 48093e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48103e519524SHoward Hinnant{ 4811ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48123e519524SHoward Hinnant} 48133e519524SHoward Hinnant 48143e519524SHoward Hinnant// pop_heap 48153e519524SHoward Hinnant 48163e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48183e519524SHoward Hinnantvoid 48193e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48203e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48213e519524SHoward Hinnant{ 48223e519524SHoward Hinnant if (__len > 1) 48233e519524SHoward Hinnant { 48243e519524SHoward Hinnant swap(*__first, *--__last); 48253e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __last, __comp, __len-1); 48263e519524SHoward Hinnant } 48273e519524SHoward Hinnant} 48283e519524SHoward Hinnant 48293e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48313e519524SHoward Hinnantvoid 48323e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48333e519524SHoward Hinnant{ 4834f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 48353e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48363e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48373e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 4838f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 48393e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48403e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 4841f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 48423e519524SHoward Hinnant} 48433e519524SHoward Hinnant 48443e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48463e519524SHoward Hinnantvoid 48473e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48483e519524SHoward Hinnant{ 4849ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48503e519524SHoward Hinnant} 48513e519524SHoward Hinnant 48523e519524SHoward Hinnant// make_heap 48533e519524SHoward Hinnant 48543e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48553e519524SHoward Hinnantvoid 48563e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48573e519524SHoward Hinnant{ 48583e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48593e519524SHoward Hinnant difference_type __n = __last - __first; 48603e519524SHoward Hinnant if (__n > 1) 48613e519524SHoward Hinnant { 48623e519524SHoward Hinnant __last = __first; 48633e519524SHoward Hinnant ++__last; 48643e519524SHoward Hinnant for (difference_type __i = 1; __i < __n;) 48653e519524SHoward Hinnant __push_heap_back<_Compare>(__first, ++__last, __comp, ++__i); 48663e519524SHoward Hinnant } 48673e519524SHoward Hinnant} 48683e519524SHoward Hinnant 48693e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48713e519524SHoward Hinnantvoid 48723e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48733e519524SHoward Hinnant{ 4874f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 48753e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48763e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48773e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 4878f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 48793e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48803e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 4881f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 48823e519524SHoward Hinnant} 48833e519524SHoward Hinnant 48843e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48863e519524SHoward Hinnantvoid 48873e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48883e519524SHoward Hinnant{ 4889ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48903e519524SHoward Hinnant} 48913e519524SHoward Hinnant 48923e519524SHoward Hinnant// sort_heap 48933e519524SHoward Hinnant 48943e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48953e519524SHoward Hinnantvoid 48963e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48973e519524SHoward Hinnant{ 48983e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48993e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 49003e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 49013e519524SHoward Hinnant} 49023e519524SHoward Hinnant 49033e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49053e519524SHoward Hinnantvoid 49063e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49073e519524SHoward Hinnant{ 4908f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 49093e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49103e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49113e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 4912f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 49133e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49143e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 4915f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 49163e519524SHoward Hinnant} 49173e519524SHoward Hinnant 49183e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49203e519524SHoward Hinnantvoid 49213e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49223e519524SHoward Hinnant{ 4923ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49243e519524SHoward Hinnant} 49253e519524SHoward Hinnant 49263e519524SHoward Hinnant// partial_sort 49273e519524SHoward Hinnant 49283e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49293e519524SHoward Hinnantvoid 49303e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 49313e519524SHoward Hinnant _Compare __comp) 49323e519524SHoward Hinnant{ 49333e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 49343e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 49353e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 49363e519524SHoward Hinnant { 49373e519524SHoward Hinnant if (__comp(*__i, *__first)) 49383e519524SHoward Hinnant { 49393e519524SHoward Hinnant swap(*__i, *__first); 49403e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __middle, __comp, __len); 49413e519524SHoward Hinnant } 49423e519524SHoward Hinnant } 49433e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 49443e519524SHoward Hinnant} 49453e519524SHoward Hinnant 49463e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49483e519524SHoward Hinnantvoid 49493e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 49503e519524SHoward Hinnant _Compare __comp) 49513e519524SHoward Hinnant{ 4952f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 49533e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49543e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49553e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 4956f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 49573e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49583e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 4959f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 49603e519524SHoward Hinnant} 49613e519524SHoward Hinnant 49623e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49643e519524SHoward Hinnantvoid 49653e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 49663e519524SHoward Hinnant{ 4967ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 49683e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49693e519524SHoward Hinnant} 49703e519524SHoward Hinnant 49713e519524SHoward Hinnant// partial_sort_copy 49723e519524SHoward Hinnant 49733e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 49743e519524SHoward Hinnant_RandomAccessIterator 49753e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 49763e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 49773e519524SHoward Hinnant{ 49783e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 49793e519524SHoward Hinnant if (__r != __result_last) 49803e519524SHoward Hinnant { 49813e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = 0; 49823e519524SHoward Hinnant for (; __first != __last && __r != __result_last; ++__first, ++__r, ++__len) 49833e519524SHoward Hinnant *__r = *__first; 49843e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 49853e519524SHoward Hinnant for (; __first != __last; ++__first) 49863e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 49873e519524SHoward Hinnant { 49883e519524SHoward Hinnant *__result_first = *__first; 49893e519524SHoward Hinnant __push_heap_front<_Compare>(__result_first, __r, __comp, __len); 49903e519524SHoward Hinnant } 49913e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 49923e519524SHoward Hinnant } 49933e519524SHoward Hinnant return __r; 49943e519524SHoward Hinnant} 49953e519524SHoward Hinnant 49963e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 49973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49983e519524SHoward Hinnant_RandomAccessIterator 49993e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 50003e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50013e519524SHoward Hinnant{ 5002f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 50033e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50043e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50053e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5006f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 50073e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50083e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5009f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 50103e519524SHoward Hinnant} 50113e519524SHoward Hinnant 50123e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 50133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50143e519524SHoward Hinnant_RandomAccessIterator 50153e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 50163e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 50173e519524SHoward Hinnant{ 5018ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 50193e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50203e519524SHoward Hinnant} 50213e519524SHoward Hinnant 50223e519524SHoward Hinnant// nth_element 50233e519524SHoward Hinnant 50243e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50253e519524SHoward Hinnantvoid 50263e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 50273e519524SHoward Hinnant{ 50283e519524SHoward Hinnant // _Compare is known to be a reference type 50293e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50303e519524SHoward Hinnant const difference_type __limit = 7; 50313e519524SHoward Hinnant while (true) 50323e519524SHoward Hinnant { 50333e519524SHoward Hinnant __restart: 5034b34b4819SHoward Hinnant if (__nth == __last) 5035b34b4819SHoward Hinnant return; 50363e519524SHoward Hinnant difference_type __len = __last - __first; 50373e519524SHoward Hinnant switch (__len) 50383e519524SHoward Hinnant { 50393e519524SHoward Hinnant case 0: 50403e519524SHoward Hinnant case 1: 50413e519524SHoward Hinnant return; 50423e519524SHoward Hinnant case 2: 50433e519524SHoward Hinnant if (__comp(*--__last, *__first)) 50443e519524SHoward Hinnant swap(*__first, *__last); 50453e519524SHoward Hinnant return; 50463e519524SHoward Hinnant case 3: 50473e519524SHoward Hinnant { 50483e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5049ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 50503e519524SHoward Hinnant return; 50513e519524SHoward Hinnant } 50523e519524SHoward Hinnant } 50533e519524SHoward Hinnant if (__len <= __limit) 50543e519524SHoward Hinnant { 50553e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 50563e519524SHoward Hinnant return; 50573e519524SHoward Hinnant } 50583e519524SHoward Hinnant // __len > __limit >= 3 50593e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 50603e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5061ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 50623e519524SHoward Hinnant // *__m is median 50633e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 50643e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 50653e519524SHoward Hinnant _RandomAccessIterator __i = __first; 50663e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 50673e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 50683e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 50693e519524SHoward Hinnant // Prime the downward search with a guard. 50703e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 50713e519524SHoward Hinnant { 50723e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 50733e519524SHoward Hinnant // manually guard downward moving __j against __i 50743e519524SHoward Hinnant while (true) 50753e519524SHoward Hinnant { 50763e519524SHoward Hinnant if (__i == --__j) 50773e519524SHoward Hinnant { 50783e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 50793e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 50803e519524SHoward Hinnant ++__i; // __first + 1 50813e519524SHoward Hinnant __j = __last; 50823e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 50833e519524SHoward Hinnant { 50843e519524SHoward Hinnant while (true) 50853e519524SHoward Hinnant { 50863e519524SHoward Hinnant if (__i == __j) 50873e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 50883e519524SHoward Hinnant if (__comp(*__first, *__i)) 50893e519524SHoward Hinnant { 50903e519524SHoward Hinnant swap(*__i, *__j); 50913e519524SHoward Hinnant ++__n_swaps; 50923e519524SHoward Hinnant ++__i; 50933e519524SHoward Hinnant break; 50943e519524SHoward Hinnant } 50953e519524SHoward Hinnant ++__i; 50963e519524SHoward Hinnant } 50973e519524SHoward Hinnant } 50983e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 50993e519524SHoward Hinnant if (__i == __j) 51003e519524SHoward Hinnant return; 51013e519524SHoward Hinnant while (true) 51023e519524SHoward Hinnant { 51033e519524SHoward Hinnant while (!__comp(*__first, *__i)) 51043e519524SHoward Hinnant ++__i; 51053e519524SHoward Hinnant while (__comp(*__first, *--__j)) 51063e519524SHoward Hinnant ; 51073e519524SHoward Hinnant if (__i >= __j) 51083e519524SHoward Hinnant break; 51093e519524SHoward Hinnant swap(*__i, *__j); 51103e519524SHoward Hinnant ++__n_swaps; 51113e519524SHoward Hinnant ++__i; 51123e519524SHoward Hinnant } 51133e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 51143e519524SHoward Hinnant // The first part is sorted, 51153e519524SHoward Hinnant if (__nth < __i) 51163e519524SHoward Hinnant return; 51173e519524SHoward Hinnant // __nth_element the secod part 51183e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 51193e519524SHoward Hinnant __first = __i; 51203e519524SHoward Hinnant goto __restart; 51213e519524SHoward Hinnant } 51223e519524SHoward Hinnant if (__comp(*__j, *__m)) 51233e519524SHoward Hinnant { 51243e519524SHoward Hinnant swap(*__i, *__j); 51253e519524SHoward Hinnant ++__n_swaps; 51263e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 51273e519524SHoward Hinnant } 51283e519524SHoward Hinnant } 51293e519524SHoward Hinnant } 51303e519524SHoward Hinnant ++__i; 51313e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51323e519524SHoward Hinnant // if not yet partitioned... 51333e519524SHoward Hinnant if (__i < __j) 51343e519524SHoward Hinnant { 51353e519524SHoward Hinnant // known that *(__i - 1) < *__m 51363e519524SHoward Hinnant while (true) 51373e519524SHoward Hinnant { 51383e519524SHoward Hinnant // __m still guards upward moving __i 51393e519524SHoward Hinnant while (__comp(*__i, *__m)) 51403e519524SHoward Hinnant ++__i; 51413e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 51423e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 51433e519524SHoward Hinnant ; 51443e519524SHoward Hinnant if (__i >= __j) 51453e519524SHoward Hinnant break; 51463e519524SHoward Hinnant swap(*__i, *__j); 51473e519524SHoward Hinnant ++__n_swaps; 51483e519524SHoward Hinnant // It is known that __m != __j 51493e519524SHoward Hinnant // If __m just moved, follow it 51503e519524SHoward Hinnant if (__m == __i) 51513e519524SHoward Hinnant __m = __j; 51523e519524SHoward Hinnant ++__i; 51533e519524SHoward Hinnant } 51543e519524SHoward Hinnant } 51553e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 51563e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 51573e519524SHoward Hinnant { 51583e519524SHoward Hinnant swap(*__i, *__m); 51593e519524SHoward Hinnant ++__n_swaps; 51603e519524SHoward Hinnant } 51613e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 51623e519524SHoward Hinnant if (__nth == __i) 51633e519524SHoward Hinnant return; 51643e519524SHoward Hinnant if (__n_swaps == 0) 51653e519524SHoward Hinnant { 51663e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 51673e519524SHoward Hinnant if (__nth < __i) 51683e519524SHoward Hinnant { 51693e519524SHoward Hinnant // Check for [__first, __i) already sorted 51703e519524SHoward Hinnant __j = __m = __first; 51713e519524SHoward Hinnant while (++__j != __i) 51723e519524SHoward Hinnant { 51733e519524SHoward Hinnant if (__comp(*__j, *__m)) 51743e519524SHoward Hinnant // not yet sorted, so sort 51753e519524SHoward Hinnant goto not_sorted; 51763e519524SHoward Hinnant __m = __j; 51773e519524SHoward Hinnant } 51783e519524SHoward Hinnant // [__first, __i) sorted 51793e519524SHoward Hinnant return; 51803e519524SHoward Hinnant } 51813e519524SHoward Hinnant else 51823e519524SHoward Hinnant { 51833e519524SHoward Hinnant // Check for [__i, __last) already sorted 51843e519524SHoward Hinnant __j = __m = __i; 51853e519524SHoward Hinnant while (++__j != __last) 51863e519524SHoward Hinnant { 51873e519524SHoward Hinnant if (__comp(*__j, *__m)) 51883e519524SHoward Hinnant // not yet sorted, so sort 51893e519524SHoward Hinnant goto not_sorted; 51903e519524SHoward Hinnant __m = __j; 51913e519524SHoward Hinnant } 51923e519524SHoward Hinnant // [__i, __last) sorted 51933e519524SHoward Hinnant return; 51943e519524SHoward Hinnant } 51953e519524SHoward Hinnant } 51963e519524SHoward Hinnantnot_sorted: 51973e519524SHoward Hinnant // __nth_element on range containing __nth 51983e519524SHoward Hinnant if (__nth < __i) 51993e519524SHoward Hinnant { 52003e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 52013e519524SHoward Hinnant __last = __i; 52023e519524SHoward Hinnant } 52033e519524SHoward Hinnant else 52043e519524SHoward Hinnant { 52053e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 52063e519524SHoward Hinnant __first = ++__i; 52073e519524SHoward Hinnant } 52083e519524SHoward Hinnant } 52093e519524SHoward Hinnant} 52103e519524SHoward Hinnant 52113e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 52123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52133e519524SHoward Hinnantvoid 52143e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 52153e519524SHoward Hinnant{ 5216f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 52173e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52183e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52193e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5220f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 52213e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52223e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5223f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 52243e519524SHoward Hinnant} 52253e519524SHoward Hinnant 52263e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 52273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52283e519524SHoward Hinnantvoid 52293e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 52303e519524SHoward Hinnant{ 5231ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52323e519524SHoward Hinnant} 52333e519524SHoward Hinnant 52343e519524SHoward Hinnant// includes 52353e519524SHoward Hinnant 52363e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 52373e519524SHoward Hinnantbool 52383e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 52393e519524SHoward Hinnant _Compare __comp) 52403e519524SHoward Hinnant{ 52413e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 52423e519524SHoward Hinnant { 52433e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 52443e519524SHoward Hinnant return false; 52453e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 52463e519524SHoward Hinnant ++__first2; 52473e519524SHoward Hinnant } 52483e519524SHoward Hinnant return true; 52493e519524SHoward Hinnant} 52503e519524SHoward Hinnant 52513e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 52523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52533e519524SHoward Hinnantbool 52543e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 52553e519524SHoward Hinnant _Compare __comp) 52563e519524SHoward Hinnant{ 5257f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 52583e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52593e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52603e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5261f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 52623e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52633e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5264f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 52653e519524SHoward Hinnant} 52663e519524SHoward Hinnant 52673e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 52683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52693e519524SHoward Hinnantbool 52703e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 52713e519524SHoward Hinnant{ 5272ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 52733e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 52743e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 52753e519524SHoward Hinnant} 52763e519524SHoward Hinnant 52773e519524SHoward Hinnant// set_union 52783e519524SHoward Hinnant 52793e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 52803e519524SHoward Hinnant_OutputIterator 52813e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 52823e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 52833e519524SHoward Hinnant{ 52843e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 52853e519524SHoward Hinnant { 52863e519524SHoward Hinnant if (__first2 == __last2) 5287ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 52883e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 52893e519524SHoward Hinnant { 52903e519524SHoward Hinnant *__result = *__first2; 52913e519524SHoward Hinnant ++__first2; 52923e519524SHoward Hinnant } 52933e519524SHoward Hinnant else 52943e519524SHoward Hinnant { 52953e519524SHoward Hinnant *__result = *__first1; 52963e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 52973e519524SHoward Hinnant ++__first2; 52983e519524SHoward Hinnant ++__first1; 52993e519524SHoward Hinnant } 53003e519524SHoward Hinnant } 5301ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 53023e519524SHoward Hinnant} 53033e519524SHoward Hinnant 53043e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 53053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53063e519524SHoward Hinnant_OutputIterator 53073e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53083e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53093e519524SHoward Hinnant{ 5310f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 53113e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53123e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53133e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5314f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 53153e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53163e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5317f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 53183e519524SHoward Hinnant} 53193e519524SHoward Hinnant 53203e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 53213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53223e519524SHoward Hinnant_OutputIterator 53233e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53243e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 53253e519524SHoward Hinnant{ 5326ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 53273e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53283e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53293e519524SHoward Hinnant} 53303e519524SHoward Hinnant 53313e519524SHoward Hinnant// set_intersection 53323e519524SHoward Hinnant 53333e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53343e519524SHoward Hinnant_OutputIterator 53353e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 53363e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53373e519524SHoward Hinnant{ 53383e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 53393e519524SHoward Hinnant { 53403e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 53413e519524SHoward Hinnant ++__first1; 53423e519524SHoward Hinnant else 53433e519524SHoward Hinnant { 53443e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 53453e519524SHoward Hinnant { 53463e519524SHoward Hinnant *__result = *__first1; 53473e519524SHoward Hinnant ++__result; 53483e519524SHoward Hinnant ++__first1; 53493e519524SHoward Hinnant } 53503e519524SHoward Hinnant ++__first2; 53513e519524SHoward Hinnant } 53523e519524SHoward Hinnant } 53533e519524SHoward Hinnant return __result; 53543e519524SHoward Hinnant} 53553e519524SHoward Hinnant 53563e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 53573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53583e519524SHoward Hinnant_OutputIterator 53593e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 53603e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53613e519524SHoward Hinnant{ 5362f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 53633e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53643e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53653e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5366f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 53673e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53683e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5369f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 53703e519524SHoward Hinnant} 53713e519524SHoward Hinnant 53723e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 53733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53743e519524SHoward Hinnant_OutputIterator 53753e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 53763e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 53773e519524SHoward Hinnant{ 5378ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 53793e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53803e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53813e519524SHoward Hinnant} 53823e519524SHoward Hinnant 53833e519524SHoward Hinnant// set_difference 53843e519524SHoward Hinnant 53853e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53863e519524SHoward Hinnant_OutputIterator 53873e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 53883e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53893e519524SHoward Hinnant{ 53903e519524SHoward Hinnant while (__first1 != __last1) 53913e519524SHoward Hinnant { 53923e519524SHoward Hinnant if (__first2 == __last2) 5393ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 53943e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 53953e519524SHoward Hinnant { 53963e519524SHoward Hinnant *__result = *__first1; 53973e519524SHoward Hinnant ++__result; 53983e519524SHoward Hinnant ++__first1; 53993e519524SHoward Hinnant } 54003e519524SHoward Hinnant else 54013e519524SHoward Hinnant { 54023e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54033e519524SHoward Hinnant ++__first1; 54043e519524SHoward Hinnant ++__first2; 54053e519524SHoward Hinnant } 54063e519524SHoward Hinnant } 54073e519524SHoward Hinnant return __result; 54083e519524SHoward Hinnant} 54093e519524SHoward Hinnant 54103e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54123e519524SHoward Hinnant_OutputIterator 54133e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54143e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54153e519524SHoward Hinnant{ 5416f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 54173e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54183e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54193e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5420f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 54213e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54223e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5423f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 54243e519524SHoward Hinnant} 54253e519524SHoward Hinnant 54263e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54283e519524SHoward Hinnant_OutputIterator 54293e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54303e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54313e519524SHoward Hinnant{ 5432ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 54333e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54343e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54353e519524SHoward Hinnant} 54363e519524SHoward Hinnant 54373e519524SHoward Hinnant// set_symmetric_difference 54383e519524SHoward Hinnant 54393e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54403e519524SHoward Hinnant_OutputIterator 54413e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54423e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54433e519524SHoward Hinnant{ 54443e519524SHoward Hinnant while (__first1 != __last1) 54453e519524SHoward Hinnant { 54463e519524SHoward Hinnant if (__first2 == __last2) 5447ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54483e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54493e519524SHoward Hinnant { 54503e519524SHoward Hinnant *__result = *__first1; 54513e519524SHoward Hinnant ++__result; 54523e519524SHoward Hinnant ++__first1; 54533e519524SHoward Hinnant } 54543e519524SHoward Hinnant else 54553e519524SHoward Hinnant { 54563e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 54573e519524SHoward Hinnant { 54583e519524SHoward Hinnant *__result = *__first2; 54593e519524SHoward Hinnant ++__result; 54603e519524SHoward Hinnant } 54613e519524SHoward Hinnant else 54623e519524SHoward Hinnant ++__first1; 54633e519524SHoward Hinnant ++__first2; 54643e519524SHoward Hinnant } 54653e519524SHoward Hinnant } 5466ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 54673e519524SHoward Hinnant} 54683e519524SHoward Hinnant 54693e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54713e519524SHoward Hinnant_OutputIterator 54723e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54733e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54743e519524SHoward Hinnant{ 5475f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 54763e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54773e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54783e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5479f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 54803e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54813e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5482f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 54833e519524SHoward Hinnant} 54843e519524SHoward Hinnant 54853e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54873e519524SHoward Hinnant_OutputIterator 54883e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54893e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54903e519524SHoward Hinnant{ 5491ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 54923e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54933e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54943e519524SHoward Hinnant} 54953e519524SHoward Hinnant 54963e519524SHoward Hinnant// lexicographical_compare 54973e519524SHoward Hinnant 54983e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 54993e519524SHoward Hinnantbool 55003e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55013e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55023e519524SHoward Hinnant{ 55033e519524SHoward Hinnant for (; __first2 != __last2; ++__first1, ++__first2) 55043e519524SHoward Hinnant { 55053e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 55063e519524SHoward Hinnant return true; 55073e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55083e519524SHoward Hinnant return false; 55093e519524SHoward Hinnant } 55103e519524SHoward Hinnant return false; 55113e519524SHoward Hinnant} 55123e519524SHoward Hinnant 55133e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 55143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55153e519524SHoward Hinnantbool 55163e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55173e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55183e519524SHoward Hinnant{ 5519f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 55203e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55213e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55223e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5523f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 55243e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55253e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5526f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 55273e519524SHoward Hinnant} 55283e519524SHoward Hinnant 55293e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 55303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55313e519524SHoward Hinnantbool 55323e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55333e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 55343e519524SHoward Hinnant{ 5535ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 55363e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55373e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55383e519524SHoward Hinnant} 55393e519524SHoward Hinnant 55403e519524SHoward Hinnant// next_permutation 55413e519524SHoward Hinnant 55423e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 55433e519524SHoward Hinnantbool 55443e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 55453e519524SHoward Hinnant{ 55463e519524SHoward Hinnant _BidirectionalIterator __i = __last; 55473e519524SHoward Hinnant if (__first == __last || __first == --__i) 55483e519524SHoward Hinnant return false; 55493e519524SHoward Hinnant while (true) 55503e519524SHoward Hinnant { 55513e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 55523e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 55533e519524SHoward Hinnant { 55543e519524SHoward Hinnant _BidirectionalIterator __j = __last; 55553e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 55563e519524SHoward Hinnant ; 55573e519524SHoward Hinnant swap(*__i, *__j); 5558ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 55593e519524SHoward Hinnant return true; 55603e519524SHoward Hinnant } 55613e519524SHoward Hinnant if (__i == __first) 55623e519524SHoward Hinnant { 5563ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 55643e519524SHoward Hinnant return false; 55653e519524SHoward Hinnant } 55663e519524SHoward Hinnant } 55673e519524SHoward Hinnant} 55683e519524SHoward Hinnant 55693e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 55703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55713e519524SHoward Hinnantbool 55723e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 55733e519524SHoward Hinnant{ 5574f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 55753e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55763e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55773e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5578f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 55793e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55803e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5581f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 55823e519524SHoward Hinnant} 55833e519524SHoward Hinnant 55843e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 55853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55863e519524SHoward Hinnantbool 55873e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 55883e519524SHoward Hinnant{ 5589ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 55903e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 55913e519524SHoward Hinnant} 55923e519524SHoward Hinnant 55933e519524SHoward Hinnant// prev_permutation 55943e519524SHoward Hinnant 55953e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 55963e519524SHoward Hinnantbool 55973e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 55983e519524SHoward Hinnant{ 55993e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56003e519524SHoward Hinnant if (__first == __last || __first == --__i) 56013e519524SHoward Hinnant return false; 56023e519524SHoward Hinnant while (true) 56033e519524SHoward Hinnant { 56043e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56053e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 56063e519524SHoward Hinnant { 56073e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56083e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 56093e519524SHoward Hinnant ; 56103e519524SHoward Hinnant swap(*__i, *__j); 5611ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56123e519524SHoward Hinnant return true; 56133e519524SHoward Hinnant } 56143e519524SHoward Hinnant if (__i == __first) 56153e519524SHoward Hinnant { 5616ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56173e519524SHoward Hinnant return false; 56183e519524SHoward Hinnant } 56193e519524SHoward Hinnant } 56203e519524SHoward Hinnant} 56213e519524SHoward Hinnant 56223e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56243e519524SHoward Hinnantbool 56253e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56263e519524SHoward Hinnant{ 5627f554add5SHoward Hinnant#ifdef _LIBCPP_DEBUG2 56283e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56293e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56303e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5631f554add5SHoward Hinnant#else // _LIBCPP_DEBUG2 56323e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56333e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5634f554add5SHoward Hinnant#endif // _LIBCPP_DEBUG2 56353e519524SHoward Hinnant} 56363e519524SHoward Hinnant 56373e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 56383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56393e519524SHoward Hinnantbool 56403e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 56413e519524SHoward Hinnant{ 5642ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 56433e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 56443e519524SHoward Hinnant} 56453e519524SHoward Hinnant 56463e519524SHoward Hinnanttemplate <class _Tp> 56473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56483e519524SHoward Hinnanttypename enable_if 56493e519524SHoward Hinnant< 56503e519524SHoward Hinnant is_integral<_Tp>::value, 56513e519524SHoward Hinnant _Tp 56523e519524SHoward Hinnant>::type 56533e519524SHoward Hinnant__rotate_left(_Tp __t, _Tp __n = 1) 56543e519524SHoward Hinnant{ 56553e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 56563e519524SHoward Hinnant __n &= __bits; 56573e519524SHoward Hinnant return static_cast<_Tp>((__t << __n) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> (__bits - __n))); 56583e519524SHoward Hinnant} 56593e519524SHoward Hinnant 56603e519524SHoward Hinnanttemplate <class _Tp> 56613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56623e519524SHoward Hinnanttypename enable_if 56633e519524SHoward Hinnant< 56643e519524SHoward Hinnant is_integral<_Tp>::value, 56653e519524SHoward Hinnant _Tp 56663e519524SHoward Hinnant>::type 56673e519524SHoward Hinnant__rotate_right(_Tp __t, _Tp __n = 1) 56683e519524SHoward Hinnant{ 56693e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 56703e519524SHoward Hinnant __n &= __bits; 56713e519524SHoward Hinnant return static_cast<_Tp>((__t << (__bits - __n)) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> __n)); 56723e519524SHoward Hinnant} 56733e519524SHoward Hinnant 56743e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 56753e519524SHoward Hinnant 56763e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5677