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 903e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 913e519524SHoward Hinnant pair<InputIterator1, InputIterator2> 923e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, 933e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 943e519524SHoward Hinnant 953e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 963e519524SHoward Hinnant bool 973e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 983e519524SHoward Hinnant 993e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1003e519524SHoward Hinnant bool 1013e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, 1023e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 1033e519524SHoward Hinnant 1043e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2> 1053e519524SHoward Hinnant bool 1063e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1073e519524SHoward Hinnant ForwardIterator2 first2); 1083e519524SHoward Hinnant 1093e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1103e519524SHoward Hinnant bool 1113e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1123e519524SHoward Hinnant ForwardIterator2 first2, BinaryPredicate pred); 1133e519524SHoward Hinnant 1143e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1153e519524SHoward Hinnant ForwardIterator1 1163e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1173e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 1183e519524SHoward Hinnant 1193e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1203e519524SHoward Hinnant ForwardIterator1 1213e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1223e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 1233e519524SHoward Hinnant 1243e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T> 1253e519524SHoward Hinnant ForwardIterator 1263e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 1273e519524SHoward Hinnant 1283e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T, class BinaryPredicate> 1293e519524SHoward Hinnant ForwardIterator 1303e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, 1313e519524SHoward Hinnant Size count, const T& value, BinaryPredicate pred); 1323e519524SHoward Hinnant 1333e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 1343e519524SHoward Hinnant OutputIterator 1353e519524SHoward Hinnant copy(InputIterator first, InputIterator last, OutputIterator result); 1363e519524SHoward Hinnant 1373e519524SHoward Hinnanttemplate<class InputIterator, class OutputIterator, class Predicate> 1383e519524SHoward Hinnant OutputIterator 1393e519524SHoward Hinnant copy_if(InputIterator first, InputIterator last, 1403e519524SHoward Hinnant OutputIterator result, Predicate pred); 1413e519524SHoward Hinnant 1423e519524SHoward Hinnanttemplate<class InputIterator, class Size, class OutputIterator> 1433e519524SHoward Hinnant OutputIterator 1443e519524SHoward Hinnant copy_n(InputIterator first, Size n, OutputIterator result); 1453e519524SHoward Hinnant 1463e519524SHoward Hinnanttemplate <class BidirectionalIterator1, class BidirectionalIterator2> 1473e519524SHoward Hinnant BidirectionalIterator2 1483e519524SHoward Hinnant copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 1493e519524SHoward Hinnant BidirectionalIterator2 result); 1503e519524SHoward Hinnant 1513e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1523e519524SHoward Hinnant ForwardIterator2 1533e519524SHoward Hinnant swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 1543e519524SHoward Hinnant 1553e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1563e519524SHoward Hinnant void 1573e519524SHoward Hinnant iter_swap(ForwardIterator1 a, ForwardIterator2 b); 1583e519524SHoward Hinnant 1593e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class UnaryOperation> 1603e519524SHoward Hinnant OutputIterator 1613e519524SHoward Hinnant transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 1623e519524SHoward Hinnant 1633e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 1643e519524SHoward Hinnant OutputIterator 1653e519524SHoward Hinnant transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 1663e519524SHoward Hinnant OutputIterator result, BinaryOperation binary_op); 1673e519524SHoward Hinnant 1683e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 1693e519524SHoward Hinnant void 1703e519524SHoward Hinnant replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 1713e519524SHoward Hinnant 1723e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate, class T> 1733e519524SHoward Hinnant void 1743e519524SHoward Hinnant replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 1753e519524SHoward Hinnant 1763e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 1773e519524SHoward Hinnant OutputIterator 1783e519524SHoward Hinnant replace_copy(InputIterator first, InputIterator last, OutputIterator result, 1793e519524SHoward Hinnant const T& old_value, const T& new_value); 1803e519524SHoward Hinnant 1813e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate, class T> 1823e519524SHoward Hinnant OutputIterator 1833e519524SHoward Hinnant replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 1843e519524SHoward Hinnant 1853e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 1863e519524SHoward Hinnant void 1873e519524SHoward Hinnant fill(ForwardIterator first, ForwardIterator last, const T& value); 1883e519524SHoward Hinnant 1893e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class T> 1903e519524SHoward Hinnant OutputIterator 1913e519524SHoward Hinnant fill_n(OutputIterator first, Size n, const T& value); 1923e519524SHoward Hinnant 1933e519524SHoward Hinnanttemplate <class ForwardIterator, class Generator> 1943e519524SHoward Hinnant void 1953e519524SHoward Hinnant generate(ForwardIterator first, ForwardIterator last, Generator gen); 1963e519524SHoward Hinnant 1973e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class Generator> 1983e519524SHoward Hinnant OutputIterator 1993e519524SHoward Hinnant generate_n(OutputIterator first, Size n, Generator gen); 2003e519524SHoward Hinnant 2013e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2023e519524SHoward Hinnant ForwardIterator 2033e519524SHoward Hinnant remove(ForwardIterator first, ForwardIterator last, const T& value); 2043e519524SHoward Hinnant 2053e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 2063e519524SHoward Hinnant ForwardIterator 2073e519524SHoward Hinnant remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 2083e519524SHoward Hinnant 2093e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 2103e519524SHoward Hinnant OutputIterator 2113e519524SHoward Hinnant remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 2123e519524SHoward Hinnant 2133e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate> 2143e519524SHoward Hinnant OutputIterator 2153e519524SHoward Hinnant remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 2163e519524SHoward Hinnant 2173e519524SHoward Hinnanttemplate <class ForwardIterator> 2183e519524SHoward Hinnant ForwardIterator 2193e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last); 2203e519524SHoward Hinnant 2213e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 2223e519524SHoward Hinnant ForwardIterator 2233e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 2243e519524SHoward Hinnant 2253e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 2263e519524SHoward Hinnant OutputIterator 2273e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result); 2283e519524SHoward Hinnant 2293e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class BinaryPredicate> 2303e519524SHoward Hinnant OutputIterator 2313e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 2323e519524SHoward Hinnant 2333e519524SHoward Hinnanttemplate <class BidirectionalIterator> 2343e519524SHoward Hinnant void 2353e519524SHoward Hinnant reverse(BidirectionalIterator first, BidirectionalIterator last); 2363e519524SHoward Hinnant 2373e519524SHoward Hinnanttemplate <class BidirectionalIterator, class OutputIterator> 2383e519524SHoward Hinnant OutputIterator 2393e519524SHoward Hinnant reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 2403e519524SHoward Hinnant 2413e519524SHoward Hinnanttemplate <class ForwardIterator> 2423e519524SHoward Hinnant ForwardIterator 2433e519524SHoward Hinnant rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 2443e519524SHoward Hinnant 2453e519524SHoward Hinnanttemplate <class ForwardIterator, class OutputIterator> 2463e519524SHoward Hinnant OutputIterator 2473e519524SHoward Hinnant rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 2483e519524SHoward Hinnant 2493e519524SHoward Hinnanttemplate <class RandomAccessIterator> 2503e519524SHoward Hinnant void 2513e519524SHoward Hinnant random_shuffle(RandomAccessIterator first, RandomAccessIterator last); 2523e519524SHoward Hinnant 2533e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 2543e519524SHoward Hinnant void 2553e519524SHoward Hinnant random_shuffle(RandomAccessIterator first, RandomAccessIterator last, RandomNumberGenerator& rand); 2563e519524SHoward Hinnant 257f9d540b0SHoward Hinnanttemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 258f9d540b0SHoward Hinnant void shuffle(RandomAccessIterator first, RandomAccessIterator last, 259fb340102SHoward Hinnant UniformRandomNumberGenerator&& g); 260f9d540b0SHoward Hinnant 2613e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 2623e519524SHoward Hinnant bool 2633e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 2643e519524SHoward Hinnant 2653e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 2663e519524SHoward Hinnant ForwardIterator 2673e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 2683e519524SHoward Hinnant 2693e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 2703e519524SHoward Hinnant class OutputIterator2, class Predicate> 2713e519524SHoward Hinnant pair<OutputIterator1, OutputIterator2> 2723e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 2733e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 2743e519524SHoward Hinnant Predicate pred); 2753e519524SHoward Hinnant 2763e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 2773e519524SHoward Hinnant ForwardIterator 2783e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 2793e519524SHoward Hinnant 2803e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 2813e519524SHoward Hinnant ForwardIterator 2823e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 2833e519524SHoward Hinnant 2843e519524SHoward Hinnanttemplate <class ForwardIterator> 2853e519524SHoward Hinnant bool 2863e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 2873e519524SHoward Hinnant 2883e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 2893e519524SHoward Hinnant bool 2903e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 2913e519524SHoward Hinnant 2923e519524SHoward Hinnanttemplate<class ForwardIterator> 2933e519524SHoward Hinnant ForwardIterator 2943e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 2953e519524SHoward Hinnant 2963e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 2973e519524SHoward Hinnant ForwardIterator 2983e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 2993e519524SHoward Hinnant 3003e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3013e519524SHoward Hinnant void 3023e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 3033e519524SHoward Hinnant 3043e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3053e519524SHoward Hinnant void 3063e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3073e519524SHoward Hinnant 3083e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3093e519524SHoward Hinnant void 3103e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 3113e519524SHoward Hinnant 3123e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3133e519524SHoward Hinnant void 3143e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3153e519524SHoward Hinnant 3163e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3173e519524SHoward Hinnant void 3183e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 3193e519524SHoward Hinnant 3203e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3213e519524SHoward Hinnant void 3223e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 3233e519524SHoward Hinnant 3243e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 3253e519524SHoward Hinnant RandomAccessIterator 3263e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3273e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 3283e519524SHoward Hinnant 3293e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 3303e519524SHoward Hinnant RandomAccessIterator 3313e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3323e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 3333e519524SHoward Hinnant 3343e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3353e519524SHoward Hinnant void 3363e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 3373e519524SHoward Hinnant 3383e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3393e519524SHoward Hinnant void 3403e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 3413e519524SHoward Hinnant 3423e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3433e519524SHoward Hinnant ForwardIterator 3443e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 3453e519524SHoward Hinnant 3463e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3473e519524SHoward Hinnant ForwardIterator 3483e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3493e519524SHoward Hinnant 3503e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3513e519524SHoward Hinnant ForwardIterator 3523e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 3533e519524SHoward Hinnant 3543e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3553e519524SHoward Hinnant ForwardIterator 3563e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3573e519524SHoward Hinnant 3583e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3593e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3603e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 3613e519524SHoward Hinnant 3623e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3633e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3643e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3653e519524SHoward Hinnant 3663e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3673e519524SHoward Hinnant bool 3683e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 3693e519524SHoward Hinnant 3703e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3713e519524SHoward Hinnant bool 3723e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3733e519524SHoward Hinnant 3743e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 3753e519524SHoward Hinnant OutputIterator 3763e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 3773e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 3783e519524SHoward Hinnant 3793e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 3803e519524SHoward Hinnant OutputIterator 3813e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 3823e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 3833e519524SHoward Hinnant 3843e519524SHoward Hinnanttemplate <class BidirectionalIterator> 3853e519524SHoward Hinnant void 3863e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 3873e519524SHoward Hinnant 3883e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 3893e519524SHoward Hinnant void 3903e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 3913e519524SHoward Hinnant 3923e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 3933e519524SHoward Hinnant bool 3943e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 3953e519524SHoward Hinnant 3963e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 3973e519524SHoward Hinnant bool 3983e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 3993e519524SHoward Hinnant 4003e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4013e519524SHoward Hinnant OutputIterator 4023e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4033e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4043e519524SHoward Hinnant 4053e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4063e519524SHoward Hinnant OutputIterator 4073e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4083e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4093e519524SHoward Hinnant 4103e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4113e519524SHoward Hinnant OutputIterator 4123e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4133e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4143e519524SHoward Hinnant 4153e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4163e519524SHoward Hinnant OutputIterator 4173e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4183e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4193e519524SHoward Hinnant 4203e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4213e519524SHoward Hinnant OutputIterator 4223e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4233e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4243e519524SHoward Hinnant 4253e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4263e519524SHoward Hinnant OutputIterator 4273e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4283e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4293e519524SHoward Hinnant 4303e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4313e519524SHoward Hinnant OutputIterator 4323e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4333e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4343e519524SHoward Hinnant 4353e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4363e519524SHoward Hinnant OutputIterator 4373e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4383e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4393e519524SHoward Hinnant 4403e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4413e519524SHoward Hinnant void 4423e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 4433e519524SHoward Hinnant 4443e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4453e519524SHoward Hinnant void 4463e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4473e519524SHoward Hinnant 4483e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4493e519524SHoward Hinnant void 4503e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 4513e519524SHoward Hinnant 4523e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4533e519524SHoward Hinnant void 4543e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4553e519524SHoward Hinnant 4563e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4573e519524SHoward Hinnant void 4583e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 4593e519524SHoward Hinnant 4603e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4613e519524SHoward Hinnant void 4623e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4633e519524SHoward Hinnant 4643e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4653e519524SHoward Hinnant void 4663e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 4673e519524SHoward Hinnant 4683e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4693e519524SHoward Hinnant void 4703e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4713e519524SHoward Hinnant 4723e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4733e519524SHoward Hinnant bool 4743e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 4753e519524SHoward Hinnant 4763e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4773e519524SHoward Hinnant bool 4783e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 4793e519524SHoward Hinnant 4803e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4813e519524SHoward Hinnant RandomAccessIterator 4823e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 4833e519524SHoward Hinnant 4843e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4853e519524SHoward Hinnant RandomAccessIterator 4863e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 4873e519524SHoward Hinnant 4884eb27b79SHoward Hinnanttemplate <class ForwardIterator> 4894eb27b79SHoward Hinnant ForwardIterator 4904eb27b79SHoward Hinnant min_element(ForwardIterator first, ForwardIterator last); 4914eb27b79SHoward Hinnant 4924eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 4934eb27b79SHoward Hinnant ForwardIterator 4944eb27b79SHoward Hinnant min_element(ForwardIterator first, ForwardIterator last, Compare comp); 4954eb27b79SHoward Hinnant 4963e519524SHoward Hinnanttemplate <class T> 4973e519524SHoward Hinnant const T& 4983e519524SHoward Hinnant min(const T& a, const T& b); 4993e519524SHoward Hinnant 5003e519524SHoward Hinnanttemplate <class T, class Compare> 5013e519524SHoward Hinnant const T& 5023e519524SHoward Hinnant min(const T& a, const T& b, Compare comp); 5033e519524SHoward Hinnant 5043e519524SHoward Hinnanttemplate<class T> 5054eb27b79SHoward Hinnant T 5064eb27b79SHoward Hinnant min(initializer_list<T> t); 5073e519524SHoward Hinnant 5083e519524SHoward Hinnanttemplate<class T, class Compare> 5094eb27b79SHoward Hinnant T 5104eb27b79SHoward Hinnant min(initializer_list<T> t, Compare comp); 5113e519524SHoward Hinnant 5123e519524SHoward Hinnanttemplate <class ForwardIterator> 5133e519524SHoward Hinnant ForwardIterator 5143e519524SHoward Hinnant max_element(ForwardIterator first, ForwardIterator last); 5153e519524SHoward Hinnant 5163e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5173e519524SHoward Hinnant ForwardIterator 5183e519524SHoward Hinnant max_element(ForwardIterator first, ForwardIterator last, Compare comp); 5193e519524SHoward Hinnant 5204eb27b79SHoward Hinnanttemplate <class T> 5214eb27b79SHoward Hinnant const T& 5224eb27b79SHoward Hinnant max(const T& a, const T& b); 5234eb27b79SHoward Hinnant 5244eb27b79SHoward Hinnanttemplate <class T, class Compare> 5254eb27b79SHoward Hinnant const T& 5264eb27b79SHoward Hinnant max(const T& a, const T& b, Compare comp); 5274eb27b79SHoward Hinnant 5284eb27b79SHoward Hinnanttemplate<class T> 5294eb27b79SHoward Hinnant T 5304eb27b79SHoward Hinnant max(initializer_list<T> t); 5314eb27b79SHoward Hinnant 5324eb27b79SHoward Hinnanttemplate<class T, class Compare> 5334eb27b79SHoward Hinnant T 5344eb27b79SHoward Hinnant max(initializer_list<T> t, Compare comp); 5354eb27b79SHoward Hinnant 5364eb27b79SHoward Hinnanttemplate<class ForwardIterator> 5374eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5384eb27b79SHoward Hinnant minmax_element(ForwardIterator first, ForwardIterator last); 5394eb27b79SHoward Hinnant 5404eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 5414eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5424eb27b79SHoward Hinnant minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); 5434eb27b79SHoward Hinnant 5444eb27b79SHoward Hinnanttemplate<class T> 5454eb27b79SHoward Hinnant pair<const T&, const T&> 5464eb27b79SHoward Hinnant minmax(const T& a, const T& b); 5474eb27b79SHoward Hinnant 5484eb27b79SHoward Hinnanttemplate<class T, class Compare> 5494eb27b79SHoward Hinnant pair<const T&, const T&> 5504eb27b79SHoward Hinnant minmax(const T& a, const T& b, Compare comp); 5514eb27b79SHoward Hinnant 5524eb27b79SHoward Hinnanttemplate<class T> 5534eb27b79SHoward Hinnant pair<T, T> 5544eb27b79SHoward Hinnant minmax(initializer_list<T> t); 5554eb27b79SHoward Hinnant 5564eb27b79SHoward Hinnanttemplate<class T, class Compare> 5574eb27b79SHoward Hinnant pair<T, T> 5584eb27b79SHoward Hinnant minmax(initializer_list<T> t, Compare comp); 5594eb27b79SHoward Hinnant 5603e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 5613e519524SHoward Hinnant bool 5623e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 5633e519524SHoward Hinnant 5643e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 5653e519524SHoward Hinnant bool 5663e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 5673e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 5683e519524SHoward Hinnant 5693e519524SHoward Hinnanttemplate <class BidirectionalIterator> 5703e519524SHoward Hinnant bool 5713e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 5723e519524SHoward Hinnant 5733e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 5743e519524SHoward Hinnant bool 5753e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 5763e519524SHoward Hinnant 5773e519524SHoward Hinnanttemplate <class BidirectionalIterator> 5783e519524SHoward Hinnant bool 5793e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 5803e519524SHoward Hinnant 5813e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 5823e519524SHoward Hinnant bool 5833e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 5843e519524SHoward Hinnant 5853e519524SHoward Hinnant} // std 5863e519524SHoward Hinnant 5873e519524SHoward Hinnant*/ 5883e519524SHoward Hinnant 5893e519524SHoward Hinnant#include <__config> 5903e519524SHoward Hinnant#include <initializer_list> 5913e519524SHoward Hinnant#include <type_traits> 5923e519524SHoward Hinnant#include <cstring> 5933e519524SHoward Hinnant#include <utility> 5943e519524SHoward Hinnant#include <memory> 5953e519524SHoward Hinnant#include <iterator> 5963e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 5973e519524SHoward Hinnant#include <cassert> 5983e519524SHoward Hinnant#endif 599128ba719SHoward Hinnant#include <cstdlib> 6003e519524SHoward Hinnant 6013e519524SHoward Hinnant#pragma GCC system_header 6023e519524SHoward Hinnant 6033e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6043e519524SHoward Hinnant 6053e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6063e519524SHoward Hinnantstruct __equal_to 6073e519524SHoward Hinnant{ 6083e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6093e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 6103e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 6113e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6123e519524SHoward Hinnant}; 6133e519524SHoward Hinnant 6143e519524SHoward Hinnanttemplate <class _T1> 6153e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6163e519524SHoward Hinnant{ 6173e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6183e519524SHoward Hinnant}; 6193e519524SHoward Hinnant 6203e519524SHoward Hinnanttemplate <class _T1> 6213e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6223e519524SHoward Hinnant{ 6233e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6243e519524SHoward Hinnant}; 6253e519524SHoward Hinnant 6263e519524SHoward Hinnanttemplate <class _T1> 6273e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6283e519524SHoward Hinnant{ 6293e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6303e519524SHoward Hinnant}; 6313e519524SHoward Hinnant 6323e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6333e519524SHoward Hinnantstruct __less 6343e519524SHoward Hinnant{ 6353e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6363e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 6373e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 6383e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 6393e519524SHoward Hinnant}; 6403e519524SHoward Hinnant 6413e519524SHoward Hinnanttemplate <class _T1> 6423e519524SHoward Hinnantstruct __less<_T1, _T1> 6433e519524SHoward Hinnant{ 6443e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6453e519524SHoward Hinnant}; 6463e519524SHoward Hinnant 6473e519524SHoward Hinnanttemplate <class _T1> 6483e519524SHoward Hinnantstruct __less<const _T1, _T1> 6493e519524SHoward Hinnant{ 6503e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6513e519524SHoward Hinnant}; 6523e519524SHoward Hinnant 6533e519524SHoward Hinnanttemplate <class _T1> 6543e519524SHoward Hinnantstruct __less<_T1, const _T1> 6553e519524SHoward Hinnant{ 6563e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6573e519524SHoward Hinnant}; 6583e519524SHoward Hinnant 6593e519524SHoward Hinnanttemplate <class _Predicate> 6603e519524SHoward Hinnantclass __negate 6613e519524SHoward Hinnant{ 6623e519524SHoward Hinnantprivate: 6633e519524SHoward Hinnant _Predicate __p_; 6643e519524SHoward Hinnantpublic: 6653e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY __negate() {} 6663e519524SHoward Hinnant 6673e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 6683e519524SHoward Hinnant explicit __negate(_Predicate __p) : __p_(__p) {} 6693e519524SHoward Hinnant 6703e519524SHoward Hinnant template <class _T1> 6713e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 6723e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 6733e519524SHoward Hinnant 6743e519524SHoward Hinnant template <class _T1, class _T2> 6753e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 6763e519524SHoward Hinnant bool operator()(const _T1& __x, const _T2& __y) {return !__p_(__x, __y);} 6773e519524SHoward Hinnant}; 6783e519524SHoward Hinnant 6793e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 6803e519524SHoward Hinnant 6813e519524SHoward Hinnanttemplate <class _Compare> 6823e519524SHoward Hinnantstruct __debug_less 6833e519524SHoward Hinnant{ 6843e519524SHoward Hinnant _Compare __comp_; 6853e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 6863e519524SHoward Hinnant template <class _Tp, class _Up> 6873e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 6883e519524SHoward Hinnant { 6893e519524SHoward Hinnant bool __r = __comp_(__x, __y); 6903e519524SHoward Hinnant if (__r) 6913e519524SHoward Hinnant assert(!__comp_(__y, __x)); 6923e519524SHoward Hinnant return __r; 6933e519524SHoward Hinnant } 6943e519524SHoward Hinnant}; 6953e519524SHoward Hinnant 6963e519524SHoward Hinnant#endif // _LIBCPP_DEBUG 6973e519524SHoward Hinnant 698c8edcb36SHoward Hinnant// Precondition: __x != 0 699c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned __ctz(unsigned __x) {return __builtin_ctz (__x);} 700c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned long __ctz(unsigned long __x) {return __builtin_ctzl (__x);} 701c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned long long __ctz(unsigned long long __x) {return __builtin_ctzll(__x);} 702c8edcb36SHoward Hinnant 703c8edcb36SHoward Hinnant// Precondition: __x != 0 704c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned __clz(unsigned __x) {return __builtin_clz (__x);} 705c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned long __clz(unsigned long __x) {return __builtin_clzl (__x);} 706c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned long long __clz(unsigned long long __x) {return __builtin_clzll(__x);} 707c8edcb36SHoward Hinnant 708c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) {return __builtin_popcount (__x);} 709c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) {return __builtin_popcountl (__x);} 710c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) {return __builtin_popcountll(__x);} 711c8edcb36SHoward Hinnant 7123e519524SHoward Hinnant// all_of 7133e519524SHoward Hinnant 7143e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 7153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7163e519524SHoward Hinnantbool 7173e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7183e519524SHoward Hinnant{ 7193e519524SHoward Hinnant for (; __first != __last; ++__first) 7203e519524SHoward Hinnant if (!__pred(*__first)) 7213e519524SHoward Hinnant return false; 7223e519524SHoward Hinnant return true; 7233e519524SHoward Hinnant} 7243e519524SHoward Hinnant 7253e519524SHoward Hinnant// any_of 7263e519524SHoward Hinnant 7273e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 7283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7293e519524SHoward Hinnantbool 7303e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7313e519524SHoward Hinnant{ 7323e519524SHoward Hinnant for (; __first != __last; ++__first) 7333e519524SHoward Hinnant if (__pred(*__first)) 7343e519524SHoward Hinnant return true; 7353e519524SHoward Hinnant return false; 7363e519524SHoward Hinnant} 7373e519524SHoward Hinnant 7383e519524SHoward Hinnant// none_of 7393e519524SHoward Hinnant 7403e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 7413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7423e519524SHoward Hinnantbool 7433e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7443e519524SHoward Hinnant{ 7453e519524SHoward Hinnant for (; __first != __last; ++__first) 7463e519524SHoward Hinnant if (__pred(*__first)) 7473e519524SHoward Hinnant return false; 7483e519524SHoward Hinnant return true; 7493e519524SHoward Hinnant} 7503e519524SHoward Hinnant 7513e519524SHoward Hinnant// for_each 7523e519524SHoward Hinnant 7533e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 7543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7553e519524SHoward Hinnant_Function 7563e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 7573e519524SHoward Hinnant{ 7583e519524SHoward Hinnant for (; __first != __last; ++__first) 7593e519524SHoward Hinnant __f(*__first); 7603e519524SHoward Hinnant return _STD::move(__f); 7613e519524SHoward Hinnant} 7623e519524SHoward Hinnant 7633e519524SHoward Hinnant// find 7643e519524SHoward Hinnant 7653e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 7663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7673e519524SHoward Hinnant_InputIterator 7683e519524SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value) 7693e519524SHoward Hinnant{ 7703e519524SHoward Hinnant for (; __first != __last; ++__first) 7713e519524SHoward Hinnant if (*__first == __value) 7723e519524SHoward Hinnant break; 7733e519524SHoward Hinnant return __first; 7743e519524SHoward Hinnant} 7753e519524SHoward Hinnant 7763e519524SHoward Hinnant// find_if 7773e519524SHoward Hinnant 7783e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 7793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7803e519524SHoward Hinnant_InputIterator 7813e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7823e519524SHoward Hinnant{ 7833e519524SHoward Hinnant for (; __first != __last; ++__first) 7843e519524SHoward Hinnant if (__pred(*__first)) 7853e519524SHoward Hinnant break; 7863e519524SHoward Hinnant return __first; 7873e519524SHoward Hinnant} 7883e519524SHoward Hinnant 7893e519524SHoward Hinnant// find_if_not 7903e519524SHoward Hinnant 7913e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 7923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7933e519524SHoward Hinnant_InputIterator 7943e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7953e519524SHoward Hinnant{ 7963e519524SHoward Hinnant for (; __first != __last; ++__first) 7973e519524SHoward Hinnant if (!__pred(*__first)) 7983e519524SHoward Hinnant break; 7993e519524SHoward Hinnant return __first; 8003e519524SHoward Hinnant} 8013e519524SHoward Hinnant 8023e519524SHoward Hinnant// find_end 8033e519524SHoward Hinnant 8043e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 8053e519524SHoward Hinnant_ForwardIterator1 8063e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 8073e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 8083e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 8093e519524SHoward Hinnant{ 8103e519524SHoward Hinnant // modeled after search algorithm 8113e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 8123e519524SHoward Hinnant if (__first2 == __last2) 8133e519524SHoward Hinnant return __r; 8143e519524SHoward Hinnant while (true) 8153e519524SHoward Hinnant { 8163e519524SHoward Hinnant while (true) 8173e519524SHoward Hinnant { 8183e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 8193e519524SHoward Hinnant return __r; // (or __last1 if never found) 8203e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 8213e519524SHoward Hinnant break; 8223e519524SHoward Hinnant ++__first1; 8233e519524SHoward Hinnant } 8243e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 8253e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 8263e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 8273e519524SHoward Hinnant while (true) 8283e519524SHoward Hinnant { 8293e519524SHoward Hinnant if (++__m2 == __last2) 8303e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 8313e519524SHoward Hinnant __r = __first1; 8323e519524SHoward Hinnant ++__first1; 8333e519524SHoward Hinnant break; 8343e519524SHoward Hinnant } 8353e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 8363e519524SHoward Hinnant return __r; 8373e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 8383e519524SHoward Hinnant { 8393e519524SHoward Hinnant ++__first1; 8403e519524SHoward Hinnant break; 8413e519524SHoward Hinnant } // else there is a match, check next elements 8423e519524SHoward Hinnant } 8433e519524SHoward Hinnant } 8443e519524SHoward Hinnant} 8453e519524SHoward Hinnant 8463e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 8473e519524SHoward Hinnant_BidirectionalIterator1 8483e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 8493e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 8503e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 8513e519524SHoward Hinnant{ 8523e519524SHoward Hinnant // modeled after search algorithm (in reverse) 8533e519524SHoward Hinnant if (__first2 == __last2) 8543e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 8553e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 8563e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 8573e519524SHoward Hinnant --__l2; 8583e519524SHoward Hinnant while (true) 8593e519524SHoward Hinnant { 8603e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 8613e519524SHoward Hinnant while (true) 8623e519524SHoward Hinnant { 8633e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 8643e519524SHoward Hinnant return __last1; 8653e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 8663e519524SHoward Hinnant break; 8673e519524SHoward Hinnant } 8683e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 8693e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 8703e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 8713e519524SHoward Hinnant while (true) 8723e519524SHoward Hinnant { 8733e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 8743e519524SHoward Hinnant return __m1; 8753e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 8763e519524SHoward Hinnant return __last1; 8773e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 8783e519524SHoward Hinnant { 8793e519524SHoward Hinnant break; 8803e519524SHoward Hinnant } // else there is a match, check next elements 8813e519524SHoward Hinnant } 8823e519524SHoward Hinnant } 8833e519524SHoward Hinnant} 8843e519524SHoward Hinnant 8853e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 8863e519524SHoward Hinnant_RandomAccessIterator1 8873e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 8883e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 8893e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 8903e519524SHoward Hinnant{ 8913e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 8923e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 8933e519524SHoward Hinnant if (__len2 == 0) 8943e519524SHoward Hinnant return __last1; 8953e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 8963e519524SHoward Hinnant if (__len1 < __len2) 8973e519524SHoward Hinnant return __last1; 8983e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 8993e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 9003e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 9013e519524SHoward Hinnant --__l2; 9023e519524SHoward Hinnant while (true) 9033e519524SHoward Hinnant { 9043e519524SHoward Hinnant while (true) 9053e519524SHoward Hinnant { 9063e519524SHoward Hinnant if (__s == __l1) 9073e519524SHoward Hinnant return __last1; 9083e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9093e519524SHoward Hinnant break; 9103e519524SHoward Hinnant } 9113e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 9123e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 9133e519524SHoward Hinnant while (true) 9143e519524SHoward Hinnant { 9153e519524SHoward Hinnant if (__m2 == __first2) 9163e519524SHoward Hinnant return __m1; 9173e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 9183e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 9193e519524SHoward Hinnant { 9203e519524SHoward Hinnant break; 9213e519524SHoward Hinnant } 9223e519524SHoward Hinnant } 9233e519524SHoward Hinnant } 9243e519524SHoward Hinnant} 9253e519524SHoward Hinnant 9263e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 9273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9283e519524SHoward Hinnant_ForwardIterator1 9293e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9303e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 9313e519524SHoward Hinnant{ 9323e519524SHoward Hinnant return _STD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 9333e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 9343e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 9353e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 9363e519524SHoward Hinnant} 9373e519524SHoward Hinnant 9383e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 9393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9403e519524SHoward Hinnant_ForwardIterator1 9413e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9423e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 9433e519524SHoward Hinnant{ 9443e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 9453e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 9463e519524SHoward Hinnant return _STD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 9473e519524SHoward Hinnant} 9483e519524SHoward Hinnant 9493e519524SHoward Hinnant// find_first_of 9503e519524SHoward Hinnant 9513e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 9523e519524SHoward Hinnant_ForwardIterator1 9533e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9543e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 9553e519524SHoward Hinnant{ 9563e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 9573e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 9583e519524SHoward Hinnant if (__pred(*__first1, *__j)) 9593e519524SHoward Hinnant return __first1; 9603e519524SHoward Hinnant return __last1; 9613e519524SHoward Hinnant} 9623e519524SHoward Hinnant 9633e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 9643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9653e519524SHoward Hinnant_ForwardIterator1 9663e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9673e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 9683e519524SHoward Hinnant{ 9693e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 9703e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 9713e519524SHoward Hinnant return _STD::find_first_of(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 9723e519524SHoward Hinnant} 9733e519524SHoward Hinnant 9743e519524SHoward Hinnant// adjacent_find 9753e519524SHoward Hinnant 9763e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 9773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9783e519524SHoward Hinnant_ForwardIterator 9793e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 9803e519524SHoward Hinnant{ 9813e519524SHoward Hinnant if (__first != __last) 9823e519524SHoward Hinnant { 9833e519524SHoward Hinnant _ForwardIterator __i = __first; 9843e519524SHoward Hinnant while (++__i != __last) 9853e519524SHoward Hinnant { 9863e519524SHoward Hinnant if (__pred(*__first, *__i)) 9873e519524SHoward Hinnant return __first; 9883e519524SHoward Hinnant __first = __i; 9893e519524SHoward Hinnant } 9903e519524SHoward Hinnant } 9913e519524SHoward Hinnant return __last; 9923e519524SHoward Hinnant} 9933e519524SHoward Hinnant 9943e519524SHoward Hinnanttemplate <class _ForwardIterator> 9953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9963e519524SHoward Hinnant_ForwardIterator 9973e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 9983e519524SHoward Hinnant{ 9993e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 10003e519524SHoward Hinnant return _STD::adjacent_find(__first, __last, __equal_to<__v>()); 10013e519524SHoward Hinnant} 10023e519524SHoward Hinnant 10033e519524SHoward Hinnant// count 10043e519524SHoward Hinnant 10053e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 10063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10073e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 10083e519524SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value) 10093e519524SHoward Hinnant{ 10103e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 10113e519524SHoward Hinnant for (; __first != __last; ++__first) 10123e519524SHoward Hinnant if (*__first == __value) 10133e519524SHoward Hinnant ++__r; 10143e519524SHoward Hinnant return __r; 10153e519524SHoward Hinnant} 10163e519524SHoward Hinnant 10173e519524SHoward Hinnant// count_if 10183e519524SHoward Hinnant 10193e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 10203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10213e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 10223e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 10233e519524SHoward Hinnant{ 10243e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 10253e519524SHoward Hinnant for (; __first != __last; ++__first) 10263e519524SHoward Hinnant if (__pred(*__first)) 10273e519524SHoward Hinnant ++__r; 10283e519524SHoward Hinnant return __r; 10293e519524SHoward Hinnant} 10303e519524SHoward Hinnant 10313e519524SHoward Hinnant// mismatch 10323e519524SHoward Hinnant 10333e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 10343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10353e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 10363e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 10373e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 10383e519524SHoward Hinnant{ 10393e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 10403e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 10413e519524SHoward Hinnant break; 10423e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 10433e519524SHoward Hinnant} 10443e519524SHoward Hinnant 10453e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 10463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10473e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 10483e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 10493e519524SHoward Hinnant{ 10503e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 10513e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 10523e519524SHoward Hinnant return _STD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 10533e519524SHoward Hinnant} 10543e519524SHoward Hinnant 10553e519524SHoward Hinnant// equal 10563e519524SHoward Hinnant 10573e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 10583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10593e519524SHoward Hinnantbool 10603e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 10613e519524SHoward Hinnant{ 10623e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 10633e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 10643e519524SHoward Hinnant return false; 10653e519524SHoward Hinnant return true; 10663e519524SHoward Hinnant} 10673e519524SHoward Hinnant 10683e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 10693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10703e519524SHoward Hinnantbool 10713e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 10723e519524SHoward Hinnant{ 10733e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 10743e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 10753e519524SHoward Hinnant return _STD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 10763e519524SHoward Hinnant} 10773e519524SHoward Hinnant 10783e519524SHoward Hinnant// is_permutation 10793e519524SHoward Hinnant 10803e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10813e519524SHoward Hinnantbool 10823e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10833e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 10843e519524SHoward Hinnant{ 10853e519524SHoward Hinnant // shorten sequences as much as possible by lopping of any equal parts 10863e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 10873e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 10883e519524SHoward Hinnant goto __not_done; 10893e519524SHoward Hinnant return true; 10903e519524SHoward Hinnant__not_done: 10913e519524SHoward Hinnant // __first1 != __last1 && *__first1 != *__first2 10923e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 10933e519524SHoward Hinnant _D1 __l1 = _STD::distance(__first1, __last1); 10943e519524SHoward Hinnant if (__l1 == _D1(1)) 10953e519524SHoward Hinnant return false; 10963e519524SHoward Hinnant _ForwardIterator2 __last2 = _STD::next(__first2, __l1); 10973e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 10983e519524SHoward Hinnant // equal elements in [f2, l2) 10993e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 11003e519524SHoward Hinnant { 11013e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 11023e519524SHoward Hinnant for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 11033e519524SHoward Hinnant if (__pred(*__j, *__i)) 11043e519524SHoward Hinnant goto __next_iter; 11053e519524SHoward Hinnant { 11063e519524SHoward Hinnant // Count number of *__i in [f2, l2) 11073e519524SHoward Hinnant _D1 __c2 = 0; 11083e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 11093e519524SHoward Hinnant if (__pred(*__i, *__j)) 11103e519524SHoward Hinnant ++__c2; 11113e519524SHoward Hinnant if (__c2 == 0) 11123e519524SHoward Hinnant return false; 11133e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 11143e519524SHoward Hinnant _D1 __c1 = 1; 11153e519524SHoward Hinnant for (_ForwardIterator1 __j = _STD::next(__i); __j != __last1; ++__j) 11163e519524SHoward Hinnant if (__pred(*__i, *__j)) 11173e519524SHoward Hinnant ++__c1; 11183e519524SHoward Hinnant if (__c1 != __c2) 11193e519524SHoward Hinnant return false; 11203e519524SHoward Hinnant } 11213e519524SHoward Hinnant__next_iter:; 11223e519524SHoward Hinnant } 11233e519524SHoward Hinnant return true; 11243e519524SHoward Hinnant} 11253e519524SHoward Hinnant 11263e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 11273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11283e519524SHoward Hinnantbool 11293e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11303e519524SHoward Hinnant _ForwardIterator2 __first2) 11313e519524SHoward Hinnant{ 11323e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 11333e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 11343e519524SHoward Hinnant return _STD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11353e519524SHoward Hinnant} 11363e519524SHoward Hinnant 11373e519524SHoward Hinnant// search 11383e519524SHoward Hinnant 11393e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 11403e519524SHoward Hinnant_ForwardIterator1 11413e519524SHoward Hinnant__search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11423e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 11433e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 11443e519524SHoward Hinnant{ 11453e519524SHoward Hinnant if (__first2 == __last2) 11463e519524SHoward Hinnant return __first1; // Everything matches an empty sequence 11473e519524SHoward Hinnant while (true) 11483e519524SHoward Hinnant { 11493e519524SHoward Hinnant // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks 11503e519524SHoward Hinnant while (true) 11513e519524SHoward Hinnant { 11523e519524SHoward Hinnant if (__first1 == __last1) // return __last1 if no element matches *__first2 11533e519524SHoward Hinnant return __last1; 11543e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 11553e519524SHoward Hinnant break; 11563e519524SHoward Hinnant ++__first1; 11573e519524SHoward Hinnant } 11583e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 11593e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 11603e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 11613e519524SHoward Hinnant while (true) 11623e519524SHoward Hinnant { 11633e519524SHoward Hinnant if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern) 11643e519524SHoward Hinnant return __first1; 11653e519524SHoward Hinnant if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found 11663e519524SHoward Hinnant return __last1; 11673e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1 11683e519524SHoward Hinnant { 11693e519524SHoward Hinnant ++__first1; 11703e519524SHoward Hinnant break; 11713e519524SHoward Hinnant } // else there is a match, check next elements 11723e519524SHoward Hinnant } 11733e519524SHoward Hinnant } 11743e519524SHoward Hinnant} 11753e519524SHoward Hinnant 11763e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 11773e519524SHoward Hinnant_RandomAccessIterator1 11783e519524SHoward Hinnant__search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 11793e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 11803e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 11813e519524SHoward Hinnant{ 11823e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type _D1; 11833e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator2>::difference_type _D2; 11843e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 11853e519524SHoward Hinnant _D2 __len2 = __last2 - __first2; 11863e519524SHoward Hinnant if (__len2 == 0) 11873e519524SHoward Hinnant return __first1; 11883e519524SHoward Hinnant _D1 __len1 = __last1 - __first1; 11893e519524SHoward Hinnant if (__len1 < __len2) 11903e519524SHoward Hinnant return __last1; 11913e519524SHoward Hinnant const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here 11923e519524SHoward Hinnant while (true) 11933e519524SHoward Hinnant { 11943e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 11953e519524SHoward Hinnant while (true) 11963e519524SHoward Hinnant { 11973e519524SHoward Hinnant if (__first1 == __s) 11983e519524SHoward Hinnant return __last1; 11993e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 12003e519524SHoward Hinnant break; 12013e519524SHoward Hinnant ++__first1; 12023e519524SHoward Hinnant } 1203b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 12043e519524SHoward Hinnant for (_D1 __loop_unroll = (__s - __first1) / 4; __loop_unroll > 0; --__loop_unroll) 12053e519524SHoward Hinnant { 12063e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 12073e519524SHoward Hinnant goto __phase2; 12083e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 12093e519524SHoward Hinnant goto __phase2; 12103e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 12113e519524SHoward Hinnant goto __phase2; 12123e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 12133e519524SHoward Hinnant goto __phase2; 12143e519524SHoward Hinnant ++__first1; 12153e519524SHoward Hinnant } 12163e519524SHoward Hinnant switch (__s - __first1) 12173e519524SHoward Hinnant { 12183e519524SHoward Hinnant case 3: 12193e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 12203e519524SHoward Hinnant break; 12213e519524SHoward Hinnant ++__first1; 12223e519524SHoward Hinnant case 2: 12233e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 12243e519524SHoward Hinnant break; 12253e519524SHoward Hinnant ++__first1; 12263e519524SHoward Hinnant case 1: 12273e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 12283e519524SHoward Hinnant break; 12293e519524SHoward Hinnant case 0: 12303e519524SHoward Hinnant return __last1; 12313e519524SHoward Hinnant } 12323e519524SHoward Hinnant __phase2: 1233b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 12343e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __first1; 12353e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __first2; 12363e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 12373e519524SHoward Hinnant while (true) 12383e519524SHoward Hinnant { 12393e519524SHoward Hinnant if (++__m2 == __last2) 12403e519524SHoward Hinnant return __first1; 12413e519524SHoward Hinnant ++__m1; // no need to check range on __m1 because __s guarantees we have enough source 12423e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12433e519524SHoward Hinnant { 12443e519524SHoward Hinnant ++__first1; 12453e519524SHoward Hinnant break; 12463e519524SHoward Hinnant } 12473e519524SHoward Hinnant } 1248b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 12493e519524SHoward Hinnant ++__m2; 12503e519524SHoward Hinnant ++__m1; 12513e519524SHoward Hinnant for (_D2 __loop_unroll = (__last2 - __m2) / 4; __loop_unroll > 0; --__loop_unroll) 12523e519524SHoward Hinnant { 12533e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12543e519524SHoward Hinnant goto __continue; 12553e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 12563e519524SHoward Hinnant goto __continue; 12573e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 12583e519524SHoward Hinnant goto __continue; 12593e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 12603e519524SHoward Hinnant goto __continue; 12613e519524SHoward Hinnant ++__m1; 12623e519524SHoward Hinnant ++__m2; 12633e519524SHoward Hinnant } 12643e519524SHoward Hinnant switch (__last2 - __m2) 12653e519524SHoward Hinnant { 12663e519524SHoward Hinnant case 3: 12673e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12683e519524SHoward Hinnant break; 12693e519524SHoward Hinnant ++__m1; 12703e519524SHoward Hinnant ++__m2; 12713e519524SHoward Hinnant case 2: 12723e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12733e519524SHoward Hinnant break; 12743e519524SHoward Hinnant ++__m1; 12753e519524SHoward Hinnant ++__m2; 12763e519524SHoward Hinnant case 1: 12773e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12783e519524SHoward Hinnant break; 12793e519524SHoward Hinnant case 0: 12803e519524SHoward Hinnant return __first1; 12813e519524SHoward Hinnant } 12823e519524SHoward Hinnant __continue: 12833e519524SHoward Hinnant ++__first1; 1284b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 12853e519524SHoward Hinnant } 12863e519524SHoward Hinnant} 12873e519524SHoward Hinnant 12883e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 12893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12903e519524SHoward Hinnant_ForwardIterator1 12913e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12923e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 12933e519524SHoward Hinnant{ 12943e519524SHoward Hinnant return _STD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 12953e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 12963e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator1>::iterator_category(), 12973e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator2>::iterator_category()); 12983e519524SHoward Hinnant} 12993e519524SHoward Hinnant 13003e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 13013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13023e519524SHoward Hinnant_ForwardIterator1 13033e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13043e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 13053e519524SHoward Hinnant{ 13063e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator1>::value_type __v1; 13073e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator2>::value_type __v2; 13083e519524SHoward Hinnant return _STD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 13093e519524SHoward Hinnant} 13103e519524SHoward Hinnant 13113e519524SHoward Hinnant// search_n 13123e519524SHoward Hinnant 13133e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 13143e519524SHoward Hinnant_ForwardIterator 13153e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 13163e519524SHoward Hinnant _Size __count, const _Tp& __value, _BinaryPredicate __pred, forward_iterator_tag) 13173e519524SHoward Hinnant{ 13183e519524SHoward Hinnant if (__count <= 0) 13193e519524SHoward Hinnant return __first; 13203e519524SHoward Hinnant while (true) 13213e519524SHoward Hinnant { 13223e519524SHoward Hinnant // Find first element in sequence that matchs __value, with a mininum of loop checks 13233e519524SHoward Hinnant while (true) 13243e519524SHoward Hinnant { 13253e519524SHoward Hinnant if (__first == __last) // return __last if no element matches __value 13263e519524SHoward Hinnant return __last; 13273e519524SHoward Hinnant if (__pred(*__first, __value)) 13283e519524SHoward Hinnant break; 13293e519524SHoward Hinnant ++__first; 13303e519524SHoward Hinnant } 13313e519524SHoward Hinnant // *__first matches __value, now match elements after here 13323e519524SHoward Hinnant _ForwardIterator __m = __first; 13333e519524SHoward Hinnant _Size __c(0); 13343e519524SHoward Hinnant while (true) 13353e519524SHoward Hinnant { 13363e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 13373e519524SHoward Hinnant return __first; 13383e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 13393e519524SHoward Hinnant return __last; 13403e519524SHoward Hinnant if (!__pred(*__m, __value)) // if there is a mismatch, restart with a new __first 13413e519524SHoward Hinnant { 13423e519524SHoward Hinnant __first = __m; 13433e519524SHoward Hinnant ++__first; 13443e519524SHoward Hinnant break; 13453e519524SHoward Hinnant } // else there is a match, check next elements 13463e519524SHoward Hinnant } 13473e519524SHoward Hinnant } 13483e519524SHoward Hinnant} 13493e519524SHoward Hinnant 13503e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 13513e519524SHoward Hinnant_RandomAccessIterator 13523e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 13533e519524SHoward Hinnant _Size __count, const _Tp& __value, _BinaryPredicate __pred, random_access_iterator_tag) 13543e519524SHoward Hinnant{ 13553e519524SHoward Hinnant if (__count <= 0) 13563e519524SHoward Hinnant return __first; 13573e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 13583e519524SHoward Hinnant if (__len < __count) 13593e519524SHoward Hinnant return __last; 13603e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 13613e519524SHoward Hinnant while (true) 13623e519524SHoward Hinnant { 13633e519524SHoward Hinnant // Find first element in sequence that matchs __value, with a mininum of loop checks 13643e519524SHoward Hinnant while (true) 13653e519524SHoward Hinnant { 13663e519524SHoward Hinnant if (__first == __s) // return __last if no element matches __value 13673e519524SHoward Hinnant return __last; 13683e519524SHoward Hinnant if (__pred(*__first, __value)) 13693e519524SHoward Hinnant break; 13703e519524SHoward Hinnant ++__first; 13713e519524SHoward Hinnant } 13723e519524SHoward Hinnant // *__first matches __value, now match elements after here 13733e519524SHoward Hinnant _RandomAccessIterator __m = __first; 13743e519524SHoward Hinnant _Size __c(0); 13753e519524SHoward Hinnant while (true) 13763e519524SHoward Hinnant { 13773e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 13783e519524SHoward Hinnant return __first; 13793e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 13803e519524SHoward Hinnant if (!__pred(*__m, __value)) // if there is a mismatch, restart with a new __first 13813e519524SHoward Hinnant { 13823e519524SHoward Hinnant __first = __m; 13833e519524SHoward Hinnant ++__first; 13843e519524SHoward Hinnant break; 13853e519524SHoward Hinnant } // else there is a match, check next elements 13863e519524SHoward Hinnant } 13873e519524SHoward Hinnant } 13883e519524SHoward Hinnant} 13893e519524SHoward Hinnant 13903e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 13913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13923e519524SHoward Hinnant_ForwardIterator 13933e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 13943e519524SHoward Hinnant _Size __count, const _Tp& __value, _BinaryPredicate __pred) 13953e519524SHoward Hinnant{ 13963e519524SHoward Hinnant return _STD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 13973e519524SHoward Hinnant (__first, __last, __count, __value, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 13983e519524SHoward Hinnant} 13993e519524SHoward Hinnant 14003e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 14013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14023e519524SHoward Hinnant_ForwardIterator 14033e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value) 14043e519524SHoward Hinnant{ 14053e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 14063e519524SHoward Hinnant return _STD::search_n(__first, __last, __count, __value, __equal_to<__v, _Tp>()); 14073e519524SHoward Hinnant} 14083e519524SHoward Hinnant 14093e519524SHoward Hinnant// copy 14103e519524SHoward Hinnant 14113e519524SHoward Hinnanttemplate <class _Iter> 14123e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator 14133e519524SHoward Hinnant{ 14143e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 14153e519524SHoward Hinnant}; 14163e519524SHoward Hinnant 14173e519524SHoward Hinnanttemplate <class _Iter> 14183e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<move_iterator<_Iter> > 14193e519524SHoward Hinnant{ 14203e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 14213e519524SHoward Hinnant}; 14223e519524SHoward Hinnant 14233e519524SHoward Hinnanttemplate <class _Iter> 14243e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<__wrap_iter<_Iter> > 14253e519524SHoward Hinnant{ 14263e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 14273e519524SHoward Hinnant}; 14283e519524SHoward Hinnant 14293e519524SHoward Hinnanttemplate <class _Iter> 14303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14313e519524SHoward Hinnant_Iter 14323e519524SHoward Hinnant__unwrap_iter(_Iter __i) 14333e519524SHoward Hinnant{ 14343e519524SHoward Hinnant return __i; 14353e519524SHoward Hinnant} 14363e519524SHoward Hinnant 14373e519524SHoward Hinnanttemplate <class _Tp> 14383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14393e519524SHoward Hinnanttypename enable_if 14403e519524SHoward Hinnant< 1441ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 14423e519524SHoward Hinnant _Tp* 14433e519524SHoward Hinnant>::type 14443e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 14453e519524SHoward Hinnant{ 14463e519524SHoward Hinnant return __i.base(); 14473e519524SHoward Hinnant} 14483e519524SHoward Hinnant 14493e519524SHoward Hinnanttemplate <class _Tp> 14503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14513e519524SHoward Hinnanttypename enable_if 14523e519524SHoward Hinnant< 1453ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 14543e519524SHoward Hinnant _Tp* 14553e519524SHoward Hinnant>::type 14563e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 14573e519524SHoward Hinnant{ 14583e519524SHoward Hinnant return __i.base(); 14593e519524SHoward Hinnant} 14603e519524SHoward Hinnant 14613e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 14623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14633e519524SHoward Hinnant_OutputIterator 14643e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 14653e519524SHoward Hinnant{ 14663e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 14673e519524SHoward Hinnant *__result = *__first; 14683e519524SHoward Hinnant return __result; 14693e519524SHoward Hinnant} 14703e519524SHoward Hinnant 14713e519524SHoward Hinnanttemplate <class _Tp, class _Up> 14723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14733e519524SHoward Hinnanttypename enable_if 14743e519524SHoward Hinnant< 14753e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1476ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 14773e519524SHoward Hinnant _Up* 14783e519524SHoward Hinnant>::type 14793e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 14803e519524SHoward Hinnant{ 14813e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 14823e519524SHoward Hinnant _STD::memmove(__result, __first, __n * sizeof(_Up)); 14833e519524SHoward Hinnant return __result + __n; 14843e519524SHoward Hinnant} 14853e519524SHoward Hinnant 14863e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 14873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14883e519524SHoward Hinnant_OutputIterator 14893e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 14903e519524SHoward Hinnant{ 14913e519524SHoward Hinnant return _STD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 14923e519524SHoward Hinnant} 14933e519524SHoward Hinnant 14943e519524SHoward Hinnant// copy_backward 14953e519524SHoward Hinnant 14963e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 14973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14983e519524SHoward Hinnant_OutputIterator 14993e519524SHoward Hinnant__copy_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 15003e519524SHoward Hinnant{ 15013e519524SHoward Hinnant while (__first != __last) 15023e519524SHoward Hinnant *--__result = *--__last; 15033e519524SHoward Hinnant return __result; 15043e519524SHoward Hinnant} 15053e519524SHoward Hinnant 15063e519524SHoward Hinnanttemplate <class _Tp, class _Up> 15073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15083e519524SHoward Hinnanttypename enable_if 15093e519524SHoward Hinnant< 15103e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1511ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 15123e519524SHoward Hinnant _Up* 15133e519524SHoward Hinnant>::type 15143e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 15153e519524SHoward Hinnant{ 15163e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 15173e519524SHoward Hinnant __result -= __n; 15183e519524SHoward Hinnant _STD::memmove(__result, __first, __n * sizeof(_Up)); 15193e519524SHoward Hinnant return __result; 15203e519524SHoward Hinnant} 15213e519524SHoward Hinnant 15223e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 15233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15243e519524SHoward Hinnant_BidirectionalIterator2 15253e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 15263e519524SHoward Hinnant _BidirectionalIterator2 __result) 15273e519524SHoward Hinnant{ 15283e519524SHoward Hinnant return _STD::__copy_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 15293e519524SHoward Hinnant} 15303e519524SHoward Hinnant 15313e519524SHoward Hinnant// copy_if 15323e519524SHoward Hinnant 15333e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 15343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15353e519524SHoward Hinnant_OutputIterator 15363e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 15373e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 15383e519524SHoward Hinnant{ 15393e519524SHoward Hinnant for (; __first != __last; ++__first) 15403e519524SHoward Hinnant { 15413e519524SHoward Hinnant if (__pred(*__first)) 15423e519524SHoward Hinnant { 15433e519524SHoward Hinnant *__result = *__first; 15443e519524SHoward Hinnant ++__result; 15453e519524SHoward Hinnant } 15463e519524SHoward Hinnant } 15473e519524SHoward Hinnant return __result; 15483e519524SHoward Hinnant} 15493e519524SHoward Hinnant 15503e519524SHoward Hinnant// copy_n 15513e519524SHoward Hinnant 15523e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 15533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15543e519524SHoward Hinnanttypename enable_if 15553e519524SHoward Hinnant< 15563e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 15573e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 15583e519524SHoward Hinnant _OutputIterator 15593e519524SHoward Hinnant>::type 15603e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 15613e519524SHoward Hinnant{ 156299847d2bSHoward Hinnant if (__n > 0) 156399847d2bSHoward Hinnant { 15643e519524SHoward Hinnant *__result = *__first; 156599847d2bSHoward Hinnant ++__result; 156699847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 156799847d2bSHoward Hinnant { 156899847d2bSHoward Hinnant ++__first; 156999847d2bSHoward Hinnant *__result = *__first; 157099847d2bSHoward Hinnant ++__result; 157199847d2bSHoward Hinnant } 157299847d2bSHoward Hinnant } 15733e519524SHoward Hinnant return __result; 15743e519524SHoward Hinnant} 15753e519524SHoward Hinnant 15763e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 15773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15783e519524SHoward Hinnanttypename enable_if 15793e519524SHoward Hinnant< 15803e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 15813e519524SHoward Hinnant _OutputIterator 15823e519524SHoward Hinnant>::type 15833e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 15843e519524SHoward Hinnant{ 1585a0fe8c43SHoward Hinnant return _STD::copy(__first, __first + __n, __result); 15863e519524SHoward Hinnant} 15873e519524SHoward Hinnant 15883e519524SHoward Hinnant// move 15893e519524SHoward Hinnant 15903e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 15913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15923e519524SHoward Hinnant_OutputIterator 15933e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 15943e519524SHoward Hinnant{ 15953e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 15963e519524SHoward Hinnant *__result = _STD::move(*__first); 15973e519524SHoward Hinnant return __result; 15983e519524SHoward Hinnant} 15993e519524SHoward Hinnant 16003e519524SHoward Hinnanttemplate <class _Tp, class _Up> 16013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16023e519524SHoward Hinnanttypename enable_if 16033e519524SHoward Hinnant< 16043e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1605ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 16063e519524SHoward Hinnant _Up* 16073e519524SHoward Hinnant>::type 16083e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 16093e519524SHoward Hinnant{ 16103e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 16113e519524SHoward Hinnant _STD::memmove(__result, __first, __n * sizeof(_Up)); 16123e519524SHoward Hinnant return __result + __n; 16133e519524SHoward Hinnant} 16143e519524SHoward Hinnant 16153e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 16163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16173e519524SHoward Hinnant_OutputIterator 16183e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 16193e519524SHoward Hinnant{ 16203e519524SHoward Hinnant return _STD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 16213e519524SHoward Hinnant} 16223e519524SHoward Hinnant 16233e519524SHoward Hinnant// move_backward 16243e519524SHoward Hinnant 16253e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 16263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16273e519524SHoward Hinnant_OutputIterator 16283e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 16293e519524SHoward Hinnant{ 16303e519524SHoward Hinnant while (__first != __last) 16313e519524SHoward Hinnant *--__result = _STD::move(*--__last); 16323e519524SHoward Hinnant return __result; 16333e519524SHoward Hinnant} 16343e519524SHoward Hinnant 16353e519524SHoward Hinnanttemplate <class _Tp, class _Up> 16363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16373e519524SHoward Hinnanttypename enable_if 16383e519524SHoward Hinnant< 16393e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1640ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 16413e519524SHoward Hinnant _Up* 16423e519524SHoward Hinnant>::type 16433e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 16443e519524SHoward Hinnant{ 16453e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 16463e519524SHoward Hinnant __result -= __n; 16473e519524SHoward Hinnant _STD::memmove(__result, __first, __n * sizeof(_Up)); 16483e519524SHoward Hinnant return __result; 16493e519524SHoward Hinnant} 16503e519524SHoward Hinnant 16513e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 16523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16533e519524SHoward Hinnant_BidirectionalIterator2 16543e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 16553e519524SHoward Hinnant _BidirectionalIterator2 __result) 16563e519524SHoward Hinnant{ 16573e519524SHoward Hinnant return _STD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 16583e519524SHoward Hinnant} 16593e519524SHoward Hinnant 16603e519524SHoward Hinnant// iter_swap 16613e519524SHoward Hinnant 1662*a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 16633e519524SHoward Hinnant 16643e519524SHoward Hinnant// transform 16653e519524SHoward Hinnant 16663e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 16673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16683e519524SHoward Hinnant_OutputIterator 16693e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 16703e519524SHoward Hinnant{ 16713e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 16723e519524SHoward Hinnant *__result = __op(*__first); 16733e519524SHoward Hinnant return __result; 16743e519524SHoward Hinnant} 16753e519524SHoward Hinnant 16763e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 16773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16783e519524SHoward Hinnant_OutputIterator 16793e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 16803e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 16813e519524SHoward Hinnant{ 16823e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2, ++__result) 16833e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 16843e519524SHoward Hinnant return __result; 16853e519524SHoward Hinnant} 16863e519524SHoward Hinnant 16873e519524SHoward Hinnant// replace 16883e519524SHoward Hinnant 16893e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 16903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16913e519524SHoward Hinnantvoid 16923e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 16933e519524SHoward Hinnant{ 16943e519524SHoward Hinnant for (; __first != __last; ++__first) 16953e519524SHoward Hinnant if (*__first == __old_value) 16963e519524SHoward Hinnant *__first = __new_value; 16973e519524SHoward Hinnant} 16983e519524SHoward Hinnant 16993e519524SHoward Hinnant// replace_if 17003e519524SHoward Hinnant 17013e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 17023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17033e519524SHoward Hinnantvoid 17043e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 17053e519524SHoward Hinnant{ 17063e519524SHoward Hinnant for (; __first != __last; ++__first) 17073e519524SHoward Hinnant if (__pred(*__first)) 17083e519524SHoward Hinnant *__first = __new_value; 17093e519524SHoward Hinnant} 17103e519524SHoward Hinnant 17113e519524SHoward Hinnant// replace_copy 17123e519524SHoward Hinnant 17133e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 17143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17153e519524SHoward Hinnant_OutputIterator 17163e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 17173e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 17183e519524SHoward Hinnant{ 17193e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 17203e519524SHoward Hinnant if (*__first == __old_value) 17213e519524SHoward Hinnant *__result = __new_value; 17223e519524SHoward Hinnant else 17233e519524SHoward Hinnant *__result = *__first; 17243e519524SHoward Hinnant return __result; 17253e519524SHoward Hinnant} 17263e519524SHoward Hinnant 17273e519524SHoward Hinnant// replace_copy_if 17283e519524SHoward Hinnant 17293e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 17303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17313e519524SHoward Hinnant_OutputIterator 17323e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 17333e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 17343e519524SHoward Hinnant{ 17353e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 17363e519524SHoward Hinnant if (__pred(*__first)) 17373e519524SHoward Hinnant *__result = __new_value; 17383e519524SHoward Hinnant else 17393e519524SHoward Hinnant *__result = *__first; 17403e519524SHoward Hinnant return __result; 17413e519524SHoward Hinnant} 17423e519524SHoward Hinnant 17433e519524SHoward Hinnant// fill_n 17443e519524SHoward Hinnant 17453e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 17463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17473e519524SHoward Hinnant_OutputIterator 17483e519524SHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value, false_type) 17493e519524SHoward Hinnant{ 17503e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 17513e519524SHoward Hinnant *__first = __value; 17523e519524SHoward Hinnant return __first; 17533e519524SHoward Hinnant} 17543e519524SHoward Hinnant 17553e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 17563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17573e519524SHoward Hinnant_OutputIterator 17583e519524SHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value, true_type) 17593e519524SHoward Hinnant{ 17603e519524SHoward Hinnant if (__n > 0) 17613e519524SHoward Hinnant _STD::memset(__first, (unsigned char)__value, (size_t)(__n)); 17623e519524SHoward Hinnant return __first + __n; 17633e519524SHoward Hinnant} 17643e519524SHoward Hinnant 17653e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 17663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17673e519524SHoward Hinnant_OutputIterator 17683e519524SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value) 17693e519524SHoward Hinnant{ 17703e519524SHoward Hinnant return _STD::__fill_n(__first, __n, __value, integral_constant<bool, 17713e519524SHoward Hinnant is_pointer<_OutputIterator>::value && 1772ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value && 17733e519524SHoward Hinnant sizeof(_Tp) == 1>()); 17743e519524SHoward Hinnant} 17753e519524SHoward Hinnant 17763e519524SHoward Hinnant// fill 17773e519524SHoward Hinnant 17783e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 17793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17803e519524SHoward Hinnantvoid 17813e519524SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, forward_iterator_tag) 17823e519524SHoward Hinnant{ 17833e519524SHoward Hinnant for (; __first != __last; ++__first) 17843e519524SHoward Hinnant *__first = __value; 17853e519524SHoward Hinnant} 17863e519524SHoward Hinnant 17873e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 17883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17893e519524SHoward Hinnantvoid 17903e519524SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value, random_access_iterator_tag) 17913e519524SHoward Hinnant{ 17923e519524SHoward Hinnant _STD::fill_n(__first, __last - __first, __value); 17933e519524SHoward Hinnant} 17943e519524SHoward Hinnant 17953e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 17963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17973e519524SHoward Hinnantvoid 17983e519524SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) 17993e519524SHoward Hinnant{ 18003e519524SHoward Hinnant _STD::__fill(__first, __last, __value, typename iterator_traits<_ForwardIterator>::iterator_category()); 18013e519524SHoward Hinnant} 18023e519524SHoward Hinnant 18033e519524SHoward Hinnant// generate 18043e519524SHoward Hinnant 18053e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 18063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18073e519524SHoward Hinnantvoid 18083e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 18093e519524SHoward Hinnant{ 18103e519524SHoward Hinnant for (; __first != __last; ++__first) 18113e519524SHoward Hinnant *__first = __gen(); 18123e519524SHoward Hinnant} 18133e519524SHoward Hinnant 18143e519524SHoward Hinnant// generate_n 18153e519524SHoward Hinnant 18163e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 18173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18183e519524SHoward Hinnant_OutputIterator 18193e519524SHoward Hinnantgenerate_n(_OutputIterator __first, _Size __n, _Generator __gen) 18203e519524SHoward Hinnant{ 18213e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 18223e519524SHoward Hinnant *__first = __gen(); 18233e519524SHoward Hinnant return __first; 18243e519524SHoward Hinnant} 18253e519524SHoward Hinnant 18263e519524SHoward Hinnant// remove 18273e519524SHoward Hinnant 18283e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 18293e519524SHoward Hinnant_ForwardIterator 18303e519524SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) 18313e519524SHoward Hinnant{ 18323e519524SHoward Hinnant __first = _STD::find(__first, __last, __value); 18333e519524SHoward Hinnant if (__first != __last) 18343e519524SHoward Hinnant { 18353e519524SHoward Hinnant _ForwardIterator __i = __first; 18363e519524SHoward Hinnant while (++__i != __last) 18373e519524SHoward Hinnant { 18383e519524SHoward Hinnant if (!(*__i == __value)) 18393e519524SHoward Hinnant { 18403e519524SHoward Hinnant *__first = _STD::move(*__i); 18413e519524SHoward Hinnant ++__first; 18423e519524SHoward Hinnant } 18433e519524SHoward Hinnant } 18443e519524SHoward Hinnant } 18453e519524SHoward Hinnant return __first; 18463e519524SHoward Hinnant} 18473e519524SHoward Hinnant 18483e519524SHoward Hinnant// remove_if 18493e519524SHoward Hinnant 18503e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 18513e519524SHoward Hinnant_ForwardIterator 18523e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 18533e519524SHoward Hinnant{ 18543e519524SHoward Hinnant __first = _STD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 18553e519524SHoward Hinnant (__first, __last, __pred); 18563e519524SHoward Hinnant if (__first != __last) 18573e519524SHoward Hinnant { 18583e519524SHoward Hinnant _ForwardIterator __i = __first; 18593e519524SHoward Hinnant while (++__i != __last) 18603e519524SHoward Hinnant { 18613e519524SHoward Hinnant if (!__pred(*__i)) 18623e519524SHoward Hinnant { 18633e519524SHoward Hinnant *__first = _STD::move(*__i); 18643e519524SHoward Hinnant ++__first; 18653e519524SHoward Hinnant } 18663e519524SHoward Hinnant } 18673e519524SHoward Hinnant } 18683e519524SHoward Hinnant return __first; 18693e519524SHoward Hinnant} 18703e519524SHoward Hinnant 18713e519524SHoward Hinnant// remove_copy 18723e519524SHoward Hinnant 18733e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 18743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18753e519524SHoward Hinnant_OutputIterator 18763e519524SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value) 18773e519524SHoward Hinnant{ 18783e519524SHoward Hinnant for (; __first != __last; ++__first) 18793e519524SHoward Hinnant { 18803e519524SHoward Hinnant if (!(*__first == __value)) 18813e519524SHoward Hinnant { 18823e519524SHoward Hinnant *__result = *__first; 18833e519524SHoward Hinnant ++__result; 18843e519524SHoward Hinnant } 18853e519524SHoward Hinnant } 18863e519524SHoward Hinnant return __result; 18873e519524SHoward Hinnant} 18883e519524SHoward Hinnant 18893e519524SHoward Hinnant// remove_copy_if 18903e519524SHoward Hinnant 18913e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 18923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18933e519524SHoward Hinnant_OutputIterator 18943e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 18953e519524SHoward Hinnant{ 18963e519524SHoward Hinnant for (; __first != __last; ++__first) 18973e519524SHoward Hinnant { 18983e519524SHoward Hinnant if (!__pred(*__first)) 18993e519524SHoward Hinnant { 19003e519524SHoward Hinnant *__result = *__first; 19013e519524SHoward Hinnant ++__result; 19023e519524SHoward Hinnant } 19033e519524SHoward Hinnant } 19043e519524SHoward Hinnant return __result; 19053e519524SHoward Hinnant} 19063e519524SHoward Hinnant 19073e519524SHoward Hinnant// unique 19083e519524SHoward Hinnant 19093e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 19103e519524SHoward Hinnant_ForwardIterator 19113e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 19123e519524SHoward Hinnant{ 19133e519524SHoward Hinnant __first = _STD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 19143e519524SHoward Hinnant (__first, __last, __pred); 19153e519524SHoward Hinnant if (__first != __last) 19163e519524SHoward Hinnant { 19173e519524SHoward Hinnant // ... a a ? ... 19183e519524SHoward Hinnant // f i 19193e519524SHoward Hinnant _ForwardIterator __i = __first; 19203e519524SHoward Hinnant for (++__i; ++__i != __last;) 19213e519524SHoward Hinnant if (!__pred(*__first, *__i)) 19223e519524SHoward Hinnant *++__first = _STD::move(*__i); 19233e519524SHoward Hinnant ++__first; 19243e519524SHoward Hinnant } 19253e519524SHoward Hinnant return __first; 19263e519524SHoward Hinnant} 19273e519524SHoward Hinnant 19283e519524SHoward Hinnanttemplate <class _ForwardIterator> 19293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19303e519524SHoward Hinnant_ForwardIterator 19313e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 19323e519524SHoward Hinnant{ 19333e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 19343e519524SHoward Hinnant return _STD::unique(__first, __last, __equal_to<__v>()); 19353e519524SHoward Hinnant} 19363e519524SHoward Hinnant 19373e519524SHoward Hinnant// unique_copy 19383e519524SHoward Hinnant 19393e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 19403e519524SHoward Hinnant_OutputIterator 19413e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 19423e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 19433e519524SHoward Hinnant{ 19443e519524SHoward Hinnant if (__first != __last) 19453e519524SHoward Hinnant { 19463e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 19473e519524SHoward Hinnant *__result = __t; 19483e519524SHoward Hinnant ++__result; 19493e519524SHoward Hinnant while (++__first != __last) 19503e519524SHoward Hinnant { 19513e519524SHoward Hinnant if (!__pred(__t, *__first)) 19523e519524SHoward Hinnant { 19533e519524SHoward Hinnant __t = *__first; 19543e519524SHoward Hinnant *__result = __t; 19553e519524SHoward Hinnant ++__result; 19563e519524SHoward Hinnant } 19573e519524SHoward Hinnant } 19583e519524SHoward Hinnant } 19593e519524SHoward Hinnant return __result; 19603e519524SHoward Hinnant} 19613e519524SHoward Hinnant 19623e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 19633e519524SHoward Hinnant_OutputIterator 19643e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 19653e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 19663e519524SHoward Hinnant{ 19673e519524SHoward Hinnant if (__first != __last) 19683e519524SHoward Hinnant { 19693e519524SHoward Hinnant _ForwardIterator __i = __first; 19703e519524SHoward Hinnant *__result = *__i; 19713e519524SHoward Hinnant ++__result; 19723e519524SHoward Hinnant while (++__first != __last) 19733e519524SHoward Hinnant { 19743e519524SHoward Hinnant if (!__pred(*__i, *__first)) 19753e519524SHoward Hinnant { 19763e519524SHoward Hinnant *__result = *__first; 19773e519524SHoward Hinnant ++__result; 19783e519524SHoward Hinnant __i = __first; 19793e519524SHoward Hinnant } 19803e519524SHoward Hinnant } 19813e519524SHoward Hinnant } 19823e519524SHoward Hinnant return __result; 19833e519524SHoward Hinnant} 19843e519524SHoward Hinnant 19853e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 19863e519524SHoward Hinnant_ForwardIterator 19873e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 19883e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 19893e519524SHoward Hinnant{ 19903e519524SHoward Hinnant if (__first != __last) 19913e519524SHoward Hinnant { 19923e519524SHoward Hinnant *__result = *__first; 19933e519524SHoward Hinnant while (++__first != __last) 19943e519524SHoward Hinnant if (!__pred(*__result, *__first)) 19953e519524SHoward Hinnant *++__result = *__first; 19963e519524SHoward Hinnant ++__result; 19973e519524SHoward Hinnant } 19983e519524SHoward Hinnant return __result; 19993e519524SHoward Hinnant} 20003e519524SHoward Hinnant 20013e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 20023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20033e519524SHoward Hinnant_OutputIterator 20043e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 20053e519524SHoward Hinnant{ 20063e519524SHoward Hinnant return _STD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 20073e519524SHoward Hinnant (__first, __last, __result, __pred, 20083e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 20093e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 20103e519524SHoward Hinnant} 20113e519524SHoward Hinnant 20123e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 20133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20143e519524SHoward Hinnant_OutputIterator 20153e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 20163e519524SHoward Hinnant{ 20173e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 20183e519524SHoward Hinnant return _STD::unique_copy(__first, __last, __result, __equal_to<__v>()); 20193e519524SHoward Hinnant} 20203e519524SHoward Hinnant 20213e519524SHoward Hinnant// reverse 20223e519524SHoward Hinnant 20233e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 20243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20253e519524SHoward Hinnantvoid 20263e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 20273e519524SHoward Hinnant{ 20283e519524SHoward Hinnant while (__first != __last) 20293e519524SHoward Hinnant { 20303e519524SHoward Hinnant if (__first == --__last) 20313e519524SHoward Hinnant break; 20323e519524SHoward Hinnant swap(*__first, *__last); 20333e519524SHoward Hinnant ++__first; 20343e519524SHoward Hinnant } 20353e519524SHoward Hinnant} 20363e519524SHoward Hinnant 20373e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 20383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20393e519524SHoward Hinnantvoid 20403e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 20413e519524SHoward Hinnant{ 20423e519524SHoward Hinnant if (__first != __last) 20433e519524SHoward Hinnant for (; __first < --__last; ++__first) 20443e519524SHoward Hinnant swap(*__first, *__last); 20453e519524SHoward Hinnant} 20463e519524SHoward Hinnant 20473e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 20483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20493e519524SHoward Hinnantvoid 20503e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 20513e519524SHoward Hinnant{ 20523e519524SHoward Hinnant _STD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 20533e519524SHoward Hinnant} 20543e519524SHoward Hinnant 20553e519524SHoward Hinnant// reverse_copy 20563e519524SHoward Hinnant 20573e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 20583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20593e519524SHoward Hinnant_OutputIterator 20603e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 20613e519524SHoward Hinnant{ 20623e519524SHoward Hinnant for (; __first != __last; ++__result) 20633e519524SHoward Hinnant *__result = *--__last; 20643e519524SHoward Hinnant return __result; 20653e519524SHoward Hinnant} 20663e519524SHoward Hinnant 20673e519524SHoward Hinnant// rotate 20683e519524SHoward Hinnant 20693e519524SHoward Hinnanttemplate <class _ForwardIterator> 20703e519524SHoward Hinnant_ForwardIterator 20713e519524SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, false_type) 20723e519524SHoward Hinnant{ 20733e519524SHoward Hinnant if (__first == __middle) 20743e519524SHoward Hinnant return __last; 20753e519524SHoward Hinnant if (__middle == __last) 20763e519524SHoward Hinnant return __first; 20773e519524SHoward Hinnant _ForwardIterator __i = __middle; 20783e519524SHoward Hinnant while (true) 20793e519524SHoward Hinnant { 20803e519524SHoward Hinnant swap(*__first, *__i); 20813e519524SHoward Hinnant ++__first; 20823e519524SHoward Hinnant if (++__i == __last) 20833e519524SHoward Hinnant break; 20843e519524SHoward Hinnant if (__first == __middle) 20853e519524SHoward Hinnant __middle = __i; 20863e519524SHoward Hinnant } 20873e519524SHoward Hinnant _ForwardIterator __r = __first; 20883e519524SHoward Hinnant if (__first != __middle) 20893e519524SHoward Hinnant { 20903e519524SHoward Hinnant __i = __middle; 20913e519524SHoward Hinnant while (true) 20923e519524SHoward Hinnant { 20933e519524SHoward Hinnant swap(*__first, *__i); 20943e519524SHoward Hinnant ++__first; 20953e519524SHoward Hinnant if (++__i == __last) 20963e519524SHoward Hinnant { 20973e519524SHoward Hinnant if (__first == __middle) 20983e519524SHoward Hinnant break; 20993e519524SHoward Hinnant __i = __middle; 21003e519524SHoward Hinnant } 21013e519524SHoward Hinnant else if (__first == __middle) 21023e519524SHoward Hinnant __middle = __i; 21033e519524SHoward Hinnant } 21043e519524SHoward Hinnant } 21053e519524SHoward Hinnant return __r; 21063e519524SHoward Hinnant} 21073e519524SHoward Hinnant 21083e519524SHoward Hinnanttemplate<typename _Integral> 21093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21103e519524SHoward Hinnant_Integral 21113e519524SHoward Hinnant__gcd(_Integral __x, _Integral __y) 21123e519524SHoward Hinnant{ 21133e519524SHoward Hinnant do 21143e519524SHoward Hinnant { 21153e519524SHoward Hinnant _Integral __t = __x % __y; 21163e519524SHoward Hinnant __x = __y; 21173e519524SHoward Hinnant __y = __t; 21183e519524SHoward Hinnant } while (__y); 21193e519524SHoward Hinnant return __x; 21203e519524SHoward Hinnant} 21213e519524SHoward Hinnant 21223e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 21233e519524SHoward Hinnant_RandomAccessIterator 21243e519524SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, true_type) 21253e519524SHoward Hinnant{ 21263e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 21273e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 21283e519524SHoward Hinnant 21293e519524SHoward Hinnant if (__first == __middle) 21303e519524SHoward Hinnant return __last; 21313e519524SHoward Hinnant if (__middle == __last) 21323e519524SHoward Hinnant return __first; 21333e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 21343e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 21353e519524SHoward Hinnant if (__m1 == __m2) 21363e519524SHoward Hinnant { 21373e519524SHoward Hinnant _STD::swap_ranges(__first, __middle, __middle); 21383e519524SHoward Hinnant return __middle; 21393e519524SHoward Hinnant } 21403e519524SHoward Hinnant const difference_type __g = __gcd(__m1, __m2); 21413e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 21423e519524SHoward Hinnant { 21433e519524SHoward Hinnant value_type __t(*--__p); 21443e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 21453e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 21463e519524SHoward Hinnant do 21473e519524SHoward Hinnant { 21483e519524SHoward Hinnant *__p1 = *__p2; 21493e519524SHoward Hinnant __p1 = __p2; 21503e519524SHoward Hinnant const difference_type __d = __last - __p2; 21513e519524SHoward Hinnant if (__m1 < __d) 21523e519524SHoward Hinnant __p2 += __m1; 21533e519524SHoward Hinnant else 21543e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 21553e519524SHoward Hinnant } while (__p2 != __p); 21563e519524SHoward Hinnant *__p1 = __t; 21573e519524SHoward Hinnant } 21583e519524SHoward Hinnant return __first + __m2; 21593e519524SHoward Hinnant} 21603e519524SHoward Hinnant 21613e519524SHoward Hinnanttemplate <class _ForwardIterator> 21623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21633e519524SHoward Hinnant_ForwardIterator 21643e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 21653e519524SHoward Hinnant{ 21663e519524SHoward Hinnant return _STD::__rotate(__first, __middle, __last, 21673e519524SHoward Hinnant integral_constant 21683e519524SHoward Hinnant < 21693e519524SHoward Hinnant bool, 21703e519524SHoward Hinnant is_convertible 21713e519524SHoward Hinnant < 21723e519524SHoward Hinnant typename iterator_traits<_ForwardIterator>::iterator_category, 21733e519524SHoward Hinnant random_access_iterator_tag 21743e519524SHoward Hinnant >::value && 2175ca740483SHoward Hinnant is_trivially_copy_assignable 21763e519524SHoward Hinnant < 21773e519524SHoward Hinnant typename iterator_traits<_ForwardIterator>::value_type 21783e519524SHoward Hinnant >::value 21793e519524SHoward Hinnant >()); 21803e519524SHoward Hinnant} 21813e519524SHoward Hinnant 21823e519524SHoward Hinnant// rotate_copy 21833e519524SHoward Hinnant 21843e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 21853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21863e519524SHoward Hinnant_OutputIterator 21873e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 21883e519524SHoward Hinnant{ 21893e519524SHoward Hinnant return _STD::copy(__first, __middle, _STD::copy(__middle, __last, __result)); 21903e519524SHoward Hinnant} 21913e519524SHoward Hinnant 21923e519524SHoward Hinnant// min_element 21933e519524SHoward Hinnant 21943e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 21953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21963e519524SHoward Hinnant_ForwardIterator 21973e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 21983e519524SHoward Hinnant{ 21993e519524SHoward Hinnant if (__first != __last) 22003e519524SHoward Hinnant { 22013e519524SHoward Hinnant _ForwardIterator __i = __first; 22023e519524SHoward Hinnant while (++__i != __last) 22033e519524SHoward Hinnant if (__comp(*__i, *__first)) 22043e519524SHoward Hinnant __first = __i; 22053e519524SHoward Hinnant } 22063e519524SHoward Hinnant return __first; 22073e519524SHoward Hinnant} 22083e519524SHoward Hinnant 22093e519524SHoward Hinnanttemplate <class _ForwardIterator> 22103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22113e519524SHoward Hinnant_ForwardIterator 22123e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 22133e519524SHoward Hinnant{ 22144eb27b79SHoward Hinnant return _STD::min_element(__first, __last, 22154eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 22164eb27b79SHoward Hinnant} 22174eb27b79SHoward Hinnant 22184eb27b79SHoward Hinnant// min 22194eb27b79SHoward Hinnant 22204eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 22214eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22224eb27b79SHoward Hinnantconst _Tp& 22234eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 22244eb27b79SHoward Hinnant{ 22254eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 22264eb27b79SHoward Hinnant} 22274eb27b79SHoward Hinnant 22284eb27b79SHoward Hinnanttemplate <class _Tp> 22294eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22304eb27b79SHoward Hinnantconst _Tp& 22314eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 22324eb27b79SHoward Hinnant{ 22334eb27b79SHoward Hinnant return _STD::min(__a, __b, __less<_Tp>()); 22344eb27b79SHoward Hinnant} 22354eb27b79SHoward Hinnant 22364eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 22374eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22384eb27b79SHoward Hinnant_Tp 22394eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 22404eb27b79SHoward Hinnant{ 22414eb27b79SHoward Hinnant return *_STD::min_element(__t.begin(), __t.end(), __comp); 22424eb27b79SHoward Hinnant} 22434eb27b79SHoward Hinnant 22444eb27b79SHoward Hinnanttemplate<class _Tp> 22454eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22464eb27b79SHoward Hinnant_Tp 22474eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 22484eb27b79SHoward Hinnant{ 22494eb27b79SHoward Hinnant return *_STD::min_element(__t.begin(), __t.end()); 22503e519524SHoward Hinnant} 22513e519524SHoward Hinnant 22523e519524SHoward Hinnant// max_element 22533e519524SHoward Hinnant 22543e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 22553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22563e519524SHoward Hinnant_ForwardIterator 22573e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 22583e519524SHoward Hinnant{ 22593e519524SHoward Hinnant if (__first != __last) 22603e519524SHoward Hinnant { 22613e519524SHoward Hinnant _ForwardIterator __i = __first; 22623e519524SHoward Hinnant while (++__i != __last) 22633e519524SHoward Hinnant if (__comp(*__first, *__i)) 22643e519524SHoward Hinnant __first = __i; 22653e519524SHoward Hinnant } 22663e519524SHoward Hinnant return __first; 22673e519524SHoward Hinnant} 22683e519524SHoward Hinnant 22693e519524SHoward Hinnanttemplate <class _ForwardIterator> 22703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22713e519524SHoward Hinnant_ForwardIterator 22723e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 22733e519524SHoward Hinnant{ 22744eb27b79SHoward Hinnant return _STD::max_element(__first, __last, 22754eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 22764eb27b79SHoward Hinnant} 22774eb27b79SHoward Hinnant 22784eb27b79SHoward Hinnant// max 22794eb27b79SHoward Hinnant 22804eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 22814eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22824eb27b79SHoward Hinnantconst _Tp& 22834eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 22844eb27b79SHoward Hinnant{ 22854eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 22864eb27b79SHoward Hinnant} 22874eb27b79SHoward Hinnant 22884eb27b79SHoward Hinnanttemplate <class _Tp> 22894eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22904eb27b79SHoward Hinnantconst _Tp& 22914eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 22924eb27b79SHoward Hinnant{ 22934eb27b79SHoward Hinnant return _STD::max(__a, __b, __less<_Tp>()); 22944eb27b79SHoward Hinnant} 22954eb27b79SHoward Hinnant 22964eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 22974eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22984eb27b79SHoward Hinnant_Tp 22994eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 23004eb27b79SHoward Hinnant{ 23014eb27b79SHoward Hinnant return *_STD::max_element(__t.begin(), __t.end(), __comp); 23024eb27b79SHoward Hinnant} 23034eb27b79SHoward Hinnant 23044eb27b79SHoward Hinnanttemplate<class _Tp> 23054eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23064eb27b79SHoward Hinnant_Tp 23074eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 23084eb27b79SHoward Hinnant{ 23094eb27b79SHoward Hinnant return *_STD::max_element(__t.begin(), __t.end()); 23103e519524SHoward Hinnant} 23113e519524SHoward Hinnant 23123e519524SHoward Hinnant// minmax_element 23133e519524SHoward Hinnant 23143e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 23153e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 23163e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 23173e519524SHoward Hinnant{ 23183e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 23193e519524SHoward Hinnant if (__first != __last) 23203e519524SHoward Hinnant { 23213e519524SHoward Hinnant if (++__first != __last) 23223e519524SHoward Hinnant { 23233e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 23243e519524SHoward Hinnant { 23253e519524SHoward Hinnant __result.second = __result.first; 23263e519524SHoward Hinnant __result.first = __first; 23273e519524SHoward Hinnant } 23283e519524SHoward Hinnant else 23293e519524SHoward Hinnant __result.second = __first; 23303e519524SHoward Hinnant while (++__first != __last) 23313e519524SHoward Hinnant { 23323e519524SHoward Hinnant _ForwardIterator __i = __first; 23333e519524SHoward Hinnant if (++__first == __last) 23343e519524SHoward Hinnant { 23353e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 23363e519524SHoward Hinnant __result.first = __i; 23373e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 23383e519524SHoward Hinnant __result.second = __i; 23393e519524SHoward Hinnant break; 23403e519524SHoward Hinnant } 23413e519524SHoward Hinnant else 23423e519524SHoward Hinnant { 23433e519524SHoward Hinnant if (__comp(*__first, *__i)) 23443e519524SHoward Hinnant { 23453e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 23463e519524SHoward Hinnant __result.first = __first; 23473e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 23483e519524SHoward Hinnant __result.second = __i; 23493e519524SHoward Hinnant } 23503e519524SHoward Hinnant else 23513e519524SHoward Hinnant { 23523e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 23533e519524SHoward Hinnant __result.first = __i; 23543e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 23553e519524SHoward Hinnant __result.second = __first; 23563e519524SHoward Hinnant } 23573e519524SHoward Hinnant } 23583e519524SHoward Hinnant } 23593e519524SHoward Hinnant } 23603e519524SHoward Hinnant } 23613e519524SHoward Hinnant return __result; 23623e519524SHoward Hinnant} 23633e519524SHoward Hinnant 23643e519524SHoward Hinnanttemplate <class _ForwardIterator> 23653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23663e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 23673e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 23683e519524SHoward Hinnant{ 23693e519524SHoward Hinnant return _STD::minmax_element(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 23703e519524SHoward Hinnant} 23713e519524SHoward Hinnant 23724eb27b79SHoward Hinnant// minmax 23734eb27b79SHoward Hinnant 23744eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 23754eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23764eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 23774eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 23784eb27b79SHoward Hinnant{ 23794eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 23804eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 23814eb27b79SHoward Hinnant} 23824eb27b79SHoward Hinnant 23834eb27b79SHoward Hinnanttemplate<class _Tp> 23844eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23854eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 23864eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 23874eb27b79SHoward Hinnant{ 23884eb27b79SHoward Hinnant return _STD::minmax(__a, __b, __less<_Tp>()); 23894eb27b79SHoward Hinnant} 23904eb27b79SHoward Hinnant 23914eb27b79SHoward Hinnanttemplate<class _Tp> 23924eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23934eb27b79SHoward Hinnantpair<_Tp, _Tp> 23944eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t) 23954eb27b79SHoward Hinnant{ 23964eb27b79SHoward Hinnant pair<const _Tp*, const _Tp*> __p = 23974eb27b79SHoward Hinnant _STD::minmax_element(__t.begin(), __t.end()); 23984eb27b79SHoward Hinnant return pair<_Tp, _Tp>(*__p.first, *__p.second); 23994eb27b79SHoward Hinnant} 24004eb27b79SHoward Hinnant 24014eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 24024eb27b79SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24034eb27b79SHoward Hinnantpair<_Tp, _Tp> 24044eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 24054eb27b79SHoward Hinnant{ 24064eb27b79SHoward Hinnant pair<const _Tp*, const _Tp*> __p = 24074eb27b79SHoward Hinnant _STD::minmax_element(__t.begin(), __t.end(), __comp); 24084eb27b79SHoward Hinnant return pair<_Tp, _Tp>(*__p.first, *__p.second); 24094eb27b79SHoward Hinnant} 24104eb27b79SHoward Hinnant 24113e519524SHoward Hinnant// random_shuffle 24123e519524SHoward Hinnant 2413f9d540b0SHoward Hinnant// __independent_bits_engine 2414f9d540b0SHoward Hinnant 2415f9d540b0SHoward Hinnanttemplate <unsigned long long _X, size_t _R> 2416f9d540b0SHoward Hinnantstruct __log2_imp 24173e519524SHoward Hinnant{ 2418f9d540b0SHoward Hinnant static const size_t value = _X & ((unsigned long long)(1) << _R) ? _R 2419f9d540b0SHoward Hinnant : __log2_imp<_X, _R - 1>::value; 24203e519524SHoward Hinnant}; 24213e519524SHoward Hinnant 2422f9d540b0SHoward Hinnanttemplate <unsigned long long _X> 2423f9d540b0SHoward Hinnantstruct __log2_imp<_X, 0> 24243e519524SHoward Hinnant{ 2425f9d540b0SHoward Hinnant static const size_t value = 0; 24263e519524SHoward Hinnant}; 24273e519524SHoward Hinnant 2428f9d540b0SHoward Hinnanttemplate <size_t _R> 2429f9d540b0SHoward Hinnantstruct __log2_imp<0, _R> 24303e519524SHoward Hinnant{ 2431f9d540b0SHoward Hinnant static const size_t value = _R + 1; 24323e519524SHoward Hinnant}; 24333e519524SHoward Hinnant 2434f9d540b0SHoward Hinnanttemplate <class _UI, _UI _X> 2435f9d540b0SHoward Hinnantstruct __log2 24363e519524SHoward Hinnant{ 2437f9d540b0SHoward Hinnant static const size_t value = __log2_imp<_X, 2438f9d540b0SHoward Hinnant sizeof(_UI) * __CHAR_BIT__ - 1>::value; 24393e519524SHoward Hinnant}; 24403e519524SHoward Hinnant 2441f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2442f9d540b0SHoward Hinnantclass __independent_bits_engine 24433e519524SHoward Hinnant{ 2444f9d540b0SHoward Hinnantpublic: 2445f9d540b0SHoward Hinnant // types 2446f9d540b0SHoward Hinnant typedef _UIntType result_type; 2447f9d540b0SHoward Hinnant 2448f9d540b0SHoward Hinnantprivate: 2449f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2450f9d540b0SHoward Hinnant typedef typename conditional 2451f9d540b0SHoward Hinnant < 2452f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2453f9d540b0SHoward Hinnant result_type, 2454f9d540b0SHoward Hinnant _Engine_result_type 2455f9d540b0SHoward Hinnant >::type _Working_result_type; 2456f9d540b0SHoward Hinnant 2457f9d540b0SHoward Hinnant _Engine& __e_; 2458f9d540b0SHoward Hinnant size_t __w_; 2459f9d540b0SHoward Hinnant size_t __w0_; 2460f9d540b0SHoward Hinnant size_t __n_; 2461f9d540b0SHoward Hinnant size_t __n0_; 2462f9d540b0SHoward Hinnant _Working_result_type __y0_; 2463f9d540b0SHoward Hinnant _Working_result_type __y1_; 2464f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2465f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2466f9d540b0SHoward Hinnant 2467f9d540b0SHoward Hinnant static const _Working_result_type _R = _Engine::_Max - _Engine::_Min 2468f9d540b0SHoward Hinnant + _Working_result_type(1); 2469f9d540b0SHoward Hinnant static const size_t __m = __log2<_Working_result_type, _R>::value; 2470f9d540b0SHoward Hinnant static const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2471f9d540b0SHoward Hinnant static const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2472f9d540b0SHoward Hinnant 2473f9d540b0SHoward Hinnantpublic: 2474f9d540b0SHoward Hinnant // constructors and seeding functions 2475f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2476f9d540b0SHoward Hinnant 2477f9d540b0SHoward Hinnant // generating functions 2478f9d540b0SHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _R != 0>());} 2479f9d540b0SHoward Hinnant 2480f9d540b0SHoward Hinnantprivate: 2481f9d540b0SHoward Hinnant result_type __eval(false_type); 2482f9d540b0SHoward Hinnant result_type __eval(true_type); 2483f9d540b0SHoward Hinnant}; 2484f9d540b0SHoward Hinnant 2485f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2486f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2487f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2488f9d540b0SHoward Hinnant : __e_(__e), 2489f9d540b0SHoward Hinnant __w_(__w) 2490f9d540b0SHoward Hinnant{ 2491f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2492f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2493f9d540b0SHoward Hinnant if (_R == 0) 2494f9d540b0SHoward Hinnant __y0_ = _R; 2495f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2496f9d540b0SHoward Hinnant __y0_ = (_R >> __w0_) << __w0_; 2497f9d540b0SHoward Hinnant else 2498f9d540b0SHoward Hinnant __y0_ = 0; 2499f9d540b0SHoward Hinnant if (_R - __y0_ > __y0_ / __n_) 2500f9d540b0SHoward Hinnant { 2501f9d540b0SHoward Hinnant ++__n_; 2502f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2503f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2504f9d540b0SHoward Hinnant __y0_ = (_R >> __w0_) << __w0_; 2505f9d540b0SHoward Hinnant else 2506f9d540b0SHoward Hinnant __y0_ = 0; 2507f9d540b0SHoward Hinnant } 2508f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2509f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2510f9d540b0SHoward Hinnant __y1_ = (_R >> (__w0_ + 1)) << (__w0_ + 1); 2511f9d540b0SHoward Hinnant else 2512f9d540b0SHoward Hinnant __y1_ = 0; 2513f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2514f9d540b0SHoward Hinnant _Engine_result_type(0); 2515f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2516f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2517f9d540b0SHoward Hinnant _Engine_result_type(~0); 25183e519524SHoward Hinnant} 25193e519524SHoward Hinnant 2520f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2521f9d540b0SHoward Hinnantinline 2522f9d540b0SHoward Hinnant_UIntType 2523f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 25243e519524SHoward Hinnant{ 2525f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 25263e519524SHoward Hinnant} 25273e519524SHoward Hinnant 2528f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2529f9d540b0SHoward Hinnant_UIntType 2530f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 25313e519524SHoward Hinnant{ 2532f9d540b0SHoward Hinnant result_type _S = 0; 2533f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2534f9d540b0SHoward Hinnant { 2535f9d540b0SHoward Hinnant _Engine_result_type __u; 25363e519524SHoward Hinnant do 2537f9d540b0SHoward Hinnant { 2538f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2539f9d540b0SHoward Hinnant } while (__u >= __y0_); 2540f9d540b0SHoward Hinnant if (__w0_ < _EDt) 2541f9d540b0SHoward Hinnant _S <<= __w0_; 2542f9d540b0SHoward Hinnant else 2543f9d540b0SHoward Hinnant _S = 0; 2544f9d540b0SHoward Hinnant _S += __u & __mask0_; 2545f9d540b0SHoward Hinnant } 2546f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2547f9d540b0SHoward Hinnant { 2548f9d540b0SHoward Hinnant _Engine_result_type __u; 2549f9d540b0SHoward Hinnant do 2550f9d540b0SHoward Hinnant { 2551f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2552f9d540b0SHoward Hinnant } while (__u >= __y1_); 2553f9d540b0SHoward Hinnant if (__w0_ < _EDt - 1) 2554f9d540b0SHoward Hinnant _S <<= __w0_ + 1; 2555f9d540b0SHoward Hinnant else 2556f9d540b0SHoward Hinnant _S = 0; 2557f9d540b0SHoward Hinnant _S += __u & __mask1_; 2558f9d540b0SHoward Hinnant } 2559f9d540b0SHoward Hinnant return _S; 25603e519524SHoward Hinnant} 25613e519524SHoward Hinnant 2562f9d540b0SHoward Hinnant// uniform_int_distribution 25633e519524SHoward Hinnant 2564f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2565f9d540b0SHoward Hinnantclass uniform_int_distribution 25663e519524SHoward Hinnant{ 2567f9d540b0SHoward Hinnantpublic: 2568f9d540b0SHoward Hinnant // types 2569f9d540b0SHoward Hinnant typedef _IntType result_type; 2570f9d540b0SHoward Hinnant 2571f9d540b0SHoward Hinnant class param_type 2572f9d540b0SHoward Hinnant { 2573f9d540b0SHoward Hinnant result_type __a_; 2574f9d540b0SHoward Hinnant result_type __b_; 2575f9d540b0SHoward Hinnant public: 2576f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2577f9d540b0SHoward Hinnant 2578f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2579f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2580f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2581f9d540b0SHoward Hinnant 2582f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2583f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2584f9d540b0SHoward Hinnant 2585f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2586f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2587f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2588f9d540b0SHoward Hinnant {return !(__x == __y);} 25893e519524SHoward Hinnant }; 25903e519524SHoward Hinnant 2591f9d540b0SHoward Hinnantprivate: 2592f9d540b0SHoward Hinnant param_type __p_; 25933e519524SHoward Hinnant 2594f9d540b0SHoward Hinnantpublic: 2595f9d540b0SHoward Hinnant // constructors and reset functions 2596f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 2597f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2598f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 2599f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 2600f9d540b0SHoward Hinnant void reset() {} 2601f9d540b0SHoward Hinnant 2602f9d540b0SHoward Hinnant // generating functions 2603f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 2604f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 2605f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 2606f9d540b0SHoward Hinnant 2607f9d540b0SHoward Hinnant // property functions 2608f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 2609f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 2610f9d540b0SHoward Hinnant 2611f9d540b0SHoward Hinnant param_type param() const {return __p_;} 2612f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 2613f9d540b0SHoward Hinnant 2614f9d540b0SHoward Hinnant result_type min() const {return a();} 2615f9d540b0SHoward Hinnant result_type max() const {return b();} 2616f9d540b0SHoward Hinnant 2617f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 2618f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2619f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 2620f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 2621f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2622f9d540b0SHoward Hinnant {return !(__x == __y);} 26233e519524SHoward Hinnant}; 26243e519524SHoward Hinnant 2625f9d540b0SHoward Hinnanttemplate<class _IntType> 2626f9d540b0SHoward Hinnanttemplate<class _URNG> 2627f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 2628f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 26293e519524SHoward Hinnant{ 2630f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 2631f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 2632f9d540b0SHoward Hinnant const _UIntType _R = __p.b() - __p.a() + _UIntType(1); 2633f9d540b0SHoward Hinnant if (_R == 1) 2634f9d540b0SHoward Hinnant return __p.a(); 2635f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 2636f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 2637f9d540b0SHoward Hinnant if (_R == 0) 2638f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 2639f9d540b0SHoward Hinnant size_t __w = _Dt - __clz(_R) - 1; 2640f9d540b0SHoward Hinnant if ((_R & (_UIntType(~0) >> (_Dt - __w))) != 0) 2641f9d540b0SHoward Hinnant ++__w; 2642f9d540b0SHoward Hinnant _Eng __e(__g, __w); 2643f9d540b0SHoward Hinnant _UIntType __u; 2644f9d540b0SHoward Hinnant do 26453e519524SHoward Hinnant { 2646f9d540b0SHoward Hinnant __u = __e(); 2647f9d540b0SHoward Hinnant } while (__u >= _R); 2648f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 26493e519524SHoward Hinnant} 2650f9d540b0SHoward Hinnant 2651f9d540b0SHoward Hinnantclass __rs_default; 2652f9d540b0SHoward Hinnant 2653f9d540b0SHoward Hinnant__rs_default __rs_get(); 2654f9d540b0SHoward Hinnant 2655f9d540b0SHoward Hinnantclass __rs_default 26563e519524SHoward Hinnant{ 2657f9d540b0SHoward Hinnant static unsigned __c_; 2658f9d540b0SHoward Hinnant 2659f9d540b0SHoward Hinnant __rs_default(); 2660f9d540b0SHoward Hinnantpublic: 2661f9d540b0SHoward Hinnant typedef unsigned result_type; 2662f9d540b0SHoward Hinnant 2663f9d540b0SHoward Hinnant static const result_type _Min = 0; 2664f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 2665f9d540b0SHoward Hinnant 2666f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 2667f9d540b0SHoward Hinnant ~__rs_default(); 2668f9d540b0SHoward Hinnant 2669f9d540b0SHoward Hinnant result_type operator()(); 2670f9d540b0SHoward Hinnant 2671f9d540b0SHoward Hinnant static const/*expr*/ result_type min() {return _Min;} 2672f9d540b0SHoward Hinnant static const/*expr*/ result_type max() {return _Max;} 2673f9d540b0SHoward Hinnant 2674f9d540b0SHoward Hinnant friend __rs_default __rs_get(); 2675f9d540b0SHoward Hinnant}; 2676f9d540b0SHoward Hinnant 2677f9d540b0SHoward Hinnant__rs_default __rs_get(); 26783e519524SHoward Hinnant 26793e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 26803e519524SHoward Hinnantvoid 26813e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 26823e519524SHoward Hinnant{ 26833e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 2684f9d540b0SHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _D; 2685f9d540b0SHoward Hinnant typedef typename _D::param_type _P; 26863e519524SHoward Hinnant difference_type __d = __last - __first; 26873e519524SHoward Hinnant if (__d > 1) 26883e519524SHoward Hinnant { 2689f9d540b0SHoward Hinnant _D __uid; 2690f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 2691f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 2692007b26beSHoward Hinnant { 2693007b26beSHoward Hinnant difference_type __i = __uid(__g, _P(0, __d)); 2694007b26beSHoward Hinnant if (__i != difference_type(0)) 2695007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 2696007b26beSHoward Hinnant } 26973e519524SHoward Hinnant } 26983e519524SHoward Hinnant} 26993e519524SHoward Hinnant 27003e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 27013e519524SHoward Hinnantvoid 27023e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 27037609c9b6SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 27043e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 27053e519524SHoward Hinnant#else 27063e519524SHoward Hinnant _RandomNumberGenerator& __rand) 27073e519524SHoward Hinnant#endif 27083e519524SHoward Hinnant{ 27093e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 27103e519524SHoward Hinnant difference_type __d = __last - __first; 27113e519524SHoward Hinnant if (__d > 1) 27123e519524SHoward Hinnant { 27133e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 2714007b26beSHoward Hinnant { 2715007b26beSHoward Hinnant difference_type __i = __rand(__d); 2716007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 2717007b26beSHoward Hinnant } 27183e519524SHoward Hinnant } 27193e519524SHoward Hinnant} 27203e519524SHoward Hinnant 2721f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 2722f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 2723fb340102SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 2724fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 2725fb340102SHoward Hinnant#else 2726f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 2727fb340102SHoward Hinnant#endif 2728f9d540b0SHoward Hinnant{ 2729f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 2730f9d540b0SHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _D; 2731f9d540b0SHoward Hinnant typedef typename _D::param_type _P; 2732f9d540b0SHoward Hinnant difference_type __d = __last - __first; 2733f9d540b0SHoward Hinnant if (__d > 1) 2734f9d540b0SHoward Hinnant { 2735f9d540b0SHoward Hinnant _D __uid; 2736f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 2737007b26beSHoward Hinnant { 2738007b26beSHoward Hinnant difference_type __i = __uid(__g, _P(0, __d)); 2739007b26beSHoward Hinnant if (__i != difference_type(0)) 2740007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 2741007b26beSHoward Hinnant } 2742f9d540b0SHoward Hinnant } 2743f9d540b0SHoward Hinnant} 2744f9d540b0SHoward Hinnant 27453e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 27463e519524SHoward Hinnantbool 27473e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 27483e519524SHoward Hinnant{ 27493e519524SHoward Hinnant for (; __first != __last; ++__first) 27503e519524SHoward Hinnant if (!__pred(*__first)) 27513e519524SHoward Hinnant break; 27523e519524SHoward Hinnant for (; __first != __last; ++__first) 27533e519524SHoward Hinnant if (__pred(*__first)) 27543e519524SHoward Hinnant return false; 27553e519524SHoward Hinnant return true; 27563e519524SHoward Hinnant} 27573e519524SHoward Hinnant 27583e519524SHoward Hinnant// partition 27593e519524SHoward Hinnant 27603e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 27613e519524SHoward Hinnant_ForwardIterator 27623e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 27633e519524SHoward Hinnant{ 27643e519524SHoward Hinnant while (true) 27653e519524SHoward Hinnant { 27663e519524SHoward Hinnant if (__first == __last) 27673e519524SHoward Hinnant return __first; 27683e519524SHoward Hinnant if (!__pred(*__first)) 27693e519524SHoward Hinnant break; 27703e519524SHoward Hinnant ++__first; 27713e519524SHoward Hinnant } 27723e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 27733e519524SHoward Hinnant { 27743e519524SHoward Hinnant if (__pred(*__p)) 27753e519524SHoward Hinnant { 27763e519524SHoward Hinnant swap(*__first, *__p); 27773e519524SHoward Hinnant ++__first; 27783e519524SHoward Hinnant } 27793e519524SHoward Hinnant } 27803e519524SHoward Hinnant return __first; 27813e519524SHoward Hinnant} 27823e519524SHoward Hinnant 27833e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 27843e519524SHoward Hinnant_BidirectionalIterator 27853e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 27863e519524SHoward Hinnant bidirectional_iterator_tag) 27873e519524SHoward Hinnant{ 27883e519524SHoward Hinnant while (true) 27893e519524SHoward Hinnant { 27903e519524SHoward Hinnant while (true) 27913e519524SHoward Hinnant { 27923e519524SHoward Hinnant if (__first == __last) 27933e519524SHoward Hinnant return __first; 27943e519524SHoward Hinnant if (!__pred(*__first)) 27953e519524SHoward Hinnant break; 27963e519524SHoward Hinnant ++__first; 27973e519524SHoward Hinnant } 27983e519524SHoward Hinnant do 27993e519524SHoward Hinnant { 28003e519524SHoward Hinnant if (__first == --__last) 28013e519524SHoward Hinnant return __first; 28023e519524SHoward Hinnant } while (!__pred(*__last)); 28033e519524SHoward Hinnant swap(*__first, *__last); 28043e519524SHoward Hinnant ++__first; 28053e519524SHoward Hinnant } 28063e519524SHoward Hinnant} 28073e519524SHoward Hinnant 28083e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 28093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 28103e519524SHoward Hinnant_ForwardIterator 28113e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 28123e519524SHoward Hinnant{ 28133e519524SHoward Hinnant return _STD::__partition<typename add_lvalue_reference<_Predicate>::type> 28143e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 28153e519524SHoward Hinnant} 28163e519524SHoward Hinnant 28173e519524SHoward Hinnant// partition_copy 28183e519524SHoward Hinnant 28193e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 28203e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 28213e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 28223e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 28233e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 28243e519524SHoward Hinnant _Predicate __pred) 28253e519524SHoward Hinnant{ 28263e519524SHoward Hinnant for (; __first != __last; ++__first) 28273e519524SHoward Hinnant { 28283e519524SHoward Hinnant if (__pred(*__first)) 28293e519524SHoward Hinnant { 28303e519524SHoward Hinnant *__out_true = *__first; 28313e519524SHoward Hinnant ++__out_true; 28323e519524SHoward Hinnant } 28333e519524SHoward Hinnant else 28343e519524SHoward Hinnant { 28353e519524SHoward Hinnant *__out_false = *__first; 28363e519524SHoward Hinnant ++__out_false; 28373e519524SHoward Hinnant } 28383e519524SHoward Hinnant } 28393e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 28403e519524SHoward Hinnant} 28413e519524SHoward Hinnant 28423e519524SHoward Hinnant// partition_point 28433e519524SHoward Hinnant 28443e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 28453e519524SHoward Hinnant_ForwardIterator 28463e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 28473e519524SHoward Hinnant{ 28483e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 28493e519524SHoward Hinnant difference_type __len = _STD::distance(__first, __last); 28503e519524SHoward Hinnant while (__len != 0) 28513e519524SHoward Hinnant { 28523e519524SHoward Hinnant difference_type __l2 = __len / 2; 28533e519524SHoward Hinnant _ForwardIterator __m = __first; 28543e519524SHoward Hinnant _STD::advance(__m, __l2); 28553e519524SHoward Hinnant if (__pred(*__m)) 28563e519524SHoward Hinnant { 28573e519524SHoward Hinnant __first = ++__m; 28583e519524SHoward Hinnant __len -= __l2 + 1; 28593e519524SHoward Hinnant } 28603e519524SHoward Hinnant else 28613e519524SHoward Hinnant __len = __l2; 28623e519524SHoward Hinnant } 28633e519524SHoward Hinnant return __first; 28643e519524SHoward Hinnant} 28653e519524SHoward Hinnant 28663e519524SHoward Hinnant// stable_partition 28673e519524SHoward Hinnant 28683e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 28693e519524SHoward Hinnant_ForwardIterator 28703e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 28713e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 28723e519524SHoward Hinnant{ 28733e519524SHoward Hinnant // *__first is known to be false 28743e519524SHoward Hinnant // __len >= 1 28753e519524SHoward Hinnant if (__len == 1) 28763e519524SHoward Hinnant return __first; 28773e519524SHoward Hinnant if (__len == 2) 28783e519524SHoward Hinnant { 28793e519524SHoward Hinnant _ForwardIterator __m = __first; 28803e519524SHoward Hinnant if (__pred(*++__m)) 28813e519524SHoward Hinnant { 28823e519524SHoward Hinnant swap(*__first, *__m); 28833e519524SHoward Hinnant return __m; 28843e519524SHoward Hinnant } 28853e519524SHoward Hinnant return __first; 28863e519524SHoward Hinnant } 28873e519524SHoward Hinnant if (__len <= __p.second) 28883e519524SHoward Hinnant { // The buffer is big enough to use 28893e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 28903e519524SHoward Hinnant __destruct_n __d(0); 28913e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 28923e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 28933e519524SHoward Hinnant // Update __first to always point to the end of the trues 28943e519524SHoward Hinnant value_type* __t = __p.first; 28953e519524SHoward Hinnant ::new(__t) value_type(_STD::move(*__first)); 28963e519524SHoward Hinnant __d.__incr((value_type*)0); 28973e519524SHoward Hinnant ++__t; 28983e519524SHoward Hinnant _ForwardIterator __i = __first; 28993e519524SHoward Hinnant while (++__i != __last) 29003e519524SHoward Hinnant { 29013e519524SHoward Hinnant if (__pred(*__i)) 29023e519524SHoward Hinnant { 29033e519524SHoward Hinnant *__first = _STD::move(*__i); 29043e519524SHoward Hinnant ++__first; 29053e519524SHoward Hinnant } 29063e519524SHoward Hinnant else 29073e519524SHoward Hinnant { 29083e519524SHoward Hinnant ::new(__t) value_type(_STD::move(*__i)); 29093e519524SHoward Hinnant __d.__incr((value_type*)0); 29103e519524SHoward Hinnant ++__t; 29113e519524SHoward Hinnant } 29123e519524SHoward Hinnant } 29133e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 29143e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 29153e519524SHoward Hinnant __i = __first; 29163e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 29173e519524SHoward Hinnant *__i = _STD::move(*__t2); 29183e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 29193e519524SHoward Hinnant return __first; 29203e519524SHoward Hinnant } 29213e519524SHoward Hinnant // Else not enough buffer, do in place 29223e519524SHoward Hinnant // __len >= 3 29233e519524SHoward Hinnant _ForwardIterator __m = __first; 29243e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 29253e519524SHoward Hinnant _STD::advance(__m, __len2); 29263e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 29273e519524SHoward Hinnant // F????????????????? 29283e519524SHoward Hinnant // f m l 29293e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 29303e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 29313e519524SHoward Hinnant // TTTFFFFF?????????? 29323e519524SHoward Hinnant // f ff m l 29333e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 29343e519524SHoward Hinnant _ForwardIterator __m1 = __m; 29353e519524SHoward Hinnant _ForwardIterator __second_false = __last; 29363e519524SHoward Hinnant _Distance __len_half = __len - __len2; 29373e519524SHoward Hinnant while (__pred(*__m1)) 29383e519524SHoward Hinnant { 29393e519524SHoward Hinnant if (++__m1 == __last) 29403e519524SHoward Hinnant goto __second_half_done; 29413e519524SHoward Hinnant --__len_half; 29423e519524SHoward Hinnant } 29433e519524SHoward Hinnant // TTTFFFFFTTTF?????? 29443e519524SHoward Hinnant // f ff m m1 l 29453e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 29463e519524SHoward Hinnant__second_half_done: 29473e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 29483e519524SHoward Hinnant // f ff m sf l 29493e519524SHoward Hinnant return _STD::rotate(__first_false, __m, __second_false); 29503e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 29513e519524SHoward Hinnant // | 29523e519524SHoward Hinnant} 29533e519524SHoward Hinnant 29543e519524SHoward Hinnantstruct __return_temporary_buffer 29553e519524SHoward Hinnant{ 29563e519524SHoward Hinnant template <class _Tp> 29573e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_STD::return_temporary_buffer(__p);} 29583e519524SHoward Hinnant}; 29593e519524SHoward Hinnant 29603e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 29613e519524SHoward Hinnant_ForwardIterator 29623e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 29633e519524SHoward Hinnant forward_iterator_tag) 29643e519524SHoward Hinnant{ 29653e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 29663e519524SHoward Hinnant // Either prove all true and return __first or point to first false 29673e519524SHoward Hinnant while (true) 29683e519524SHoward Hinnant { 29693e519524SHoward Hinnant if (__first == __last) 29703e519524SHoward Hinnant return __first; 29713e519524SHoward Hinnant if (!__pred(*__first)) 29723e519524SHoward Hinnant break; 29733e519524SHoward Hinnant ++__first; 29743e519524SHoward Hinnant } 29753e519524SHoward Hinnant // We now have a reduced range [__first, __last) 29763e519524SHoward Hinnant // *__first is known to be false 29773e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 29783e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 29793e519524SHoward Hinnant difference_type __len = _STD::distance(__first, __last); 29803e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 29813e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 29823e519524SHoward Hinnant if (__len >= __alloc_limit) 29833e519524SHoward Hinnant { 29843e519524SHoward Hinnant __p = _STD::get_temporary_buffer<value_type>(__len); 29853e519524SHoward Hinnant __h.reset(__p.first); 29863e519524SHoward Hinnant } 29873e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 29883e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 29893e519524SHoward Hinnant} 29903e519524SHoward Hinnant 29913e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 29923e519524SHoward Hinnant_BidirectionalIterator 29933e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 29943e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 29953e519524SHoward Hinnant{ 29963e519524SHoward Hinnant // *__first is known to be false 29973e519524SHoward Hinnant // *__last is known to be true 29983e519524SHoward Hinnant // __len >= 2 29993e519524SHoward Hinnant if (__len == 2) 30003e519524SHoward Hinnant { 30013e519524SHoward Hinnant swap(*__first, *__last); 30023e519524SHoward Hinnant return __last; 30033e519524SHoward Hinnant } 30043e519524SHoward Hinnant if (__len == 3) 30053e519524SHoward Hinnant { 30063e519524SHoward Hinnant _BidirectionalIterator __m = __first; 30073e519524SHoward Hinnant if (__pred(*++__m)) 30083e519524SHoward Hinnant { 30093e519524SHoward Hinnant swap(*__first, *__m); 30103e519524SHoward Hinnant swap(*__m, *__last); 30113e519524SHoward Hinnant return __last; 30123e519524SHoward Hinnant } 30133e519524SHoward Hinnant swap(*__m, *__last); 30143e519524SHoward Hinnant swap(*__first, *__m); 30153e519524SHoward Hinnant return __m; 30163e519524SHoward Hinnant } 30173e519524SHoward Hinnant if (__len <= __p.second) 30183e519524SHoward Hinnant { // The buffer is big enough to use 30193e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 30203e519524SHoward Hinnant __destruct_n __d(0); 30213e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 30223e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 30233e519524SHoward Hinnant // Update __first to always point to the end of the trues 30243e519524SHoward Hinnant value_type* __t = __p.first; 30253e519524SHoward Hinnant ::new(__t) value_type(_STD::move(*__first)); 30263e519524SHoward Hinnant __d.__incr((value_type*)0); 30273e519524SHoward Hinnant ++__t; 30283e519524SHoward Hinnant _BidirectionalIterator __i = __first; 30293e519524SHoward Hinnant while (++__i != __last) 30303e519524SHoward Hinnant { 30313e519524SHoward Hinnant if (__pred(*__i)) 30323e519524SHoward Hinnant { 30333e519524SHoward Hinnant *__first = _STD::move(*__i); 30343e519524SHoward Hinnant ++__first; 30353e519524SHoward Hinnant } 30363e519524SHoward Hinnant else 30373e519524SHoward Hinnant { 30383e519524SHoward Hinnant ::new(__t) value_type(_STD::move(*__i)); 30393e519524SHoward Hinnant __d.__incr((value_type*)0); 30403e519524SHoward Hinnant ++__t; 30413e519524SHoward Hinnant } 30423e519524SHoward Hinnant } 30433e519524SHoward Hinnant // move *__last, known to be true 30443e519524SHoward Hinnant *__first = _STD::move(*__i); 30453e519524SHoward Hinnant __i = ++__first; 30463e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 30473e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 30483e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 30493e519524SHoward Hinnant *__i = _STD::move(*__t2); 30503e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 30513e519524SHoward Hinnant return __first; 30523e519524SHoward Hinnant } 30533e519524SHoward Hinnant // Else not enough buffer, do in place 30543e519524SHoward Hinnant // __len >= 4 30553e519524SHoward Hinnant _BidirectionalIterator __m = __first; 30563e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 30573e519524SHoward Hinnant _STD::advance(__m, __len2); 30583e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 30593e519524SHoward Hinnant // F????????????????T 30603e519524SHoward Hinnant // f m l 30613e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 30623e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 30633e519524SHoward Hinnant _Distance __len_half = __len2; 30643e519524SHoward Hinnant while (!__pred(*--__m1)) 30653e519524SHoward Hinnant { 30663e519524SHoward Hinnant if (__m1 == __first) 30673e519524SHoward Hinnant goto __first_half_done; 30683e519524SHoward Hinnant --__len_half; 30693e519524SHoward Hinnant } 30703e519524SHoward Hinnant // F???TFFF?????????T 30713e519524SHoward Hinnant // f m1 m l 30723e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 30733e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 30743e519524SHoward Hinnant__first_half_done: 30753e519524SHoward Hinnant // TTTFFFFF?????????T 30763e519524SHoward Hinnant // f ff m l 30773e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 30783e519524SHoward Hinnant __m1 = __m; 30793e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 30803e519524SHoward Hinnant ++__second_false; 30813e519524SHoward Hinnant __len_half = __len - __len2; 30823e519524SHoward Hinnant while (__pred(*__m1)) 30833e519524SHoward Hinnant { 30843e519524SHoward Hinnant if (++__m1 == __last) 30853e519524SHoward Hinnant goto __second_half_done; 30863e519524SHoward Hinnant --__len_half; 30873e519524SHoward Hinnant } 30883e519524SHoward Hinnant // TTTFFFFFTTTF?????T 30893e519524SHoward Hinnant // f ff m m1 l 30903e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 30913e519524SHoward Hinnant__second_half_done: 30923e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 30933e519524SHoward Hinnant // f ff m sf l 30943e519524SHoward Hinnant return _STD::rotate(__first_false, __m, __second_false); 30953e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 30963e519524SHoward Hinnant // | 30973e519524SHoward Hinnant} 30983e519524SHoward Hinnant 30993e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 31003e519524SHoward Hinnant_BidirectionalIterator 31013e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 31023e519524SHoward Hinnant bidirectional_iterator_tag) 31033e519524SHoward Hinnant{ 31043e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 31053e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 31063e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 31073e519524SHoward Hinnant // Either prove all true and return __first or point to first false 31083e519524SHoward Hinnant while (true) 31093e519524SHoward Hinnant { 31103e519524SHoward Hinnant if (__first == __last) 31113e519524SHoward Hinnant return __first; 31123e519524SHoward Hinnant if (!__pred(*__first)) 31133e519524SHoward Hinnant break; 31143e519524SHoward Hinnant ++__first; 31153e519524SHoward Hinnant } 31163e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 31173e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 31183e519524SHoward Hinnant do 31193e519524SHoward Hinnant { 31203e519524SHoward Hinnant if (__first == --__last) 31213e519524SHoward Hinnant return __first; 31223e519524SHoward Hinnant } while (!__pred(*__last)); 31233e519524SHoward Hinnant // We now have a reduced range [__first, __last] 31243e519524SHoward Hinnant // *__first is known to be false 31253e519524SHoward Hinnant // *__last is known to be true 31263e519524SHoward Hinnant // __len >= 2 31273e519524SHoward Hinnant difference_type __len = _STD::distance(__first, __last) + 1; 31283e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 31293e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 31303e519524SHoward Hinnant if (__len >= __alloc_limit) 31313e519524SHoward Hinnant { 31323e519524SHoward Hinnant __p = _STD::get_temporary_buffer<value_type>(__len); 31333e519524SHoward Hinnant __h.reset(__p.first); 31343e519524SHoward Hinnant } 31353e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 31363e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 31373e519524SHoward Hinnant} 31383e519524SHoward Hinnant 31393e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 31403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 31413e519524SHoward Hinnant_ForwardIterator 31423e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 31433e519524SHoward Hinnant{ 31443e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 31453e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 31463e519524SHoward Hinnant} 31473e519524SHoward Hinnant 31483e519524SHoward Hinnant// is_sorted_until 31493e519524SHoward Hinnant 31503e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 31513e519524SHoward Hinnant_ForwardIterator 31523e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 31533e519524SHoward Hinnant{ 31543e519524SHoward Hinnant if (__first != __last) 31553e519524SHoward Hinnant { 31563e519524SHoward Hinnant _ForwardIterator __i = __first; 31573e519524SHoward Hinnant while (++__i != __last) 31583e519524SHoward Hinnant { 31593e519524SHoward Hinnant if (__comp(*__i, *__first)) 31603e519524SHoward Hinnant return __i; 31613e519524SHoward Hinnant __first = __i; 31623e519524SHoward Hinnant } 31633e519524SHoward Hinnant } 31643e519524SHoward Hinnant return __last; 31653e519524SHoward Hinnant} 31663e519524SHoward Hinnant 31673e519524SHoward Hinnanttemplate<class _ForwardIterator> 31683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 31693e519524SHoward Hinnant_ForwardIterator 31703e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 31713e519524SHoward Hinnant{ 31723e519524SHoward Hinnant return _STD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 31733e519524SHoward Hinnant} 31743e519524SHoward Hinnant 31753e519524SHoward Hinnant// is_sorted 31763e519524SHoward Hinnant 31773e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 31783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 31793e519524SHoward Hinnantbool 31803e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 31813e519524SHoward Hinnant{ 31823e519524SHoward Hinnant return _STD::is_sorted_until(__first, __last, __comp) == __last; 31833e519524SHoward Hinnant} 31843e519524SHoward Hinnant 31853e519524SHoward Hinnanttemplate<class _ForwardIterator> 31863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 31873e519524SHoward Hinnantbool 31883e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 31893e519524SHoward Hinnant{ 31903e519524SHoward Hinnant return _STD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 31913e519524SHoward Hinnant} 31923e519524SHoward Hinnant 31933e519524SHoward Hinnant// sort 31943e519524SHoward Hinnant 31953e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 31963e519524SHoward Hinnant 31973e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 31983e519524SHoward Hinnantunsigned 31993e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 32003e519524SHoward Hinnant{ 32013e519524SHoward Hinnant unsigned __r = 0; 32023e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 32033e519524SHoward Hinnant { 32043e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 32053e519524SHoward Hinnant return __r; // x <= y && y <= z 32063e519524SHoward Hinnant // x <= y && y > z 32073e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 32083e519524SHoward Hinnant __r = 1; 32093e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 32103e519524SHoward Hinnant { 32113e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 32123e519524SHoward Hinnant __r = 2; 32133e519524SHoward Hinnant } 32143e519524SHoward Hinnant return __r; // x <= y && y < z 32153e519524SHoward Hinnant } 32163e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 32173e519524SHoward Hinnant { 32183e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 32193e519524SHoward Hinnant __r = 1; 32203e519524SHoward Hinnant return __r; 32213e519524SHoward Hinnant } 32223e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 32233e519524SHoward Hinnant __r = 1; // x < y && x <= z 32243e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 32253e519524SHoward Hinnant { 32263e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 32273e519524SHoward Hinnant __r = 2; 32283e519524SHoward Hinnant } 32293e519524SHoward Hinnant return __r; 32303e519524SHoward Hinnant} // x <= y && y <= z 32313e519524SHoward Hinnant 32323e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 32333e519524SHoward Hinnant 32343e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 32353e519524SHoward Hinnantunsigned 32363e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 32373e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 32383e519524SHoward Hinnant{ 32393e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 32403e519524SHoward Hinnant if (__c(*__x4, *__x3)) 32413e519524SHoward Hinnant { 32423e519524SHoward Hinnant swap(*__x3, *__x4); 32433e519524SHoward Hinnant ++__r; 32443e519524SHoward Hinnant if (__c(*__x3, *__x2)) 32453e519524SHoward Hinnant { 32463e519524SHoward Hinnant swap(*__x2, *__x3); 32473e519524SHoward Hinnant ++__r; 32483e519524SHoward Hinnant if (__c(*__x2, *__x1)) 32493e519524SHoward Hinnant { 32503e519524SHoward Hinnant swap(*__x1, *__x2); 32513e519524SHoward Hinnant ++__r; 32523e519524SHoward Hinnant } 32533e519524SHoward Hinnant } 32543e519524SHoward Hinnant } 32553e519524SHoward Hinnant return __r; 32563e519524SHoward Hinnant} 32573e519524SHoward Hinnant 32583e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 32593e519524SHoward Hinnant 32603e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 32613e519524SHoward Hinnantunsigned 32623e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 32633e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 32643e519524SHoward Hinnant{ 32653e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 32663e519524SHoward Hinnant if (__c(*__x5, *__x4)) 32673e519524SHoward Hinnant { 32683e519524SHoward Hinnant swap(*__x4, *__x5); 32693e519524SHoward Hinnant ++__r; 32703e519524SHoward Hinnant if (__c(*__x4, *__x3)) 32713e519524SHoward Hinnant { 32723e519524SHoward Hinnant swap(*__x3, *__x4); 32733e519524SHoward Hinnant ++__r; 32743e519524SHoward Hinnant if (__c(*__x3, *__x2)) 32753e519524SHoward Hinnant { 32763e519524SHoward Hinnant swap(*__x2, *__x3); 32773e519524SHoward Hinnant ++__r; 32783e519524SHoward Hinnant if (__c(*__x2, *__x1)) 32793e519524SHoward Hinnant { 32803e519524SHoward Hinnant swap(*__x1, *__x2); 32813e519524SHoward Hinnant ++__r; 32823e519524SHoward Hinnant } 32833e519524SHoward Hinnant } 32843e519524SHoward Hinnant } 32853e519524SHoward Hinnant } 32863e519524SHoward Hinnant return __r; 32873e519524SHoward Hinnant} 32883e519524SHoward Hinnant 32893e519524SHoward Hinnant// Assumes size > 0 32903e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 32913e519524SHoward Hinnantvoid 32923e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 32933e519524SHoward Hinnant{ 32943e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 32953e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 32963e519524SHoward Hinnant { 32973e519524SHoward Hinnant _BirdirectionalIterator __i = _STD::min_element<_BirdirectionalIterator, 32983e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 32993e519524SHoward Hinnant (__first, __last, __comp); 33003e519524SHoward Hinnant if (__i != __first) 33013e519524SHoward Hinnant swap(*__first, *__i); 33023e519524SHoward Hinnant } 33033e519524SHoward Hinnant} 33043e519524SHoward Hinnant 33053e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 33063e519524SHoward Hinnantvoid 33073e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 33083e519524SHoward Hinnant{ 33093e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 33103e519524SHoward Hinnant if (__first != __last) 33113e519524SHoward Hinnant { 33123e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 33133e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 33143e519524SHoward Hinnant { 33153e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 33163e519524SHoward Hinnant value_type __t(_STD::move(*__j)); 33173e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 33183e519524SHoward Hinnant *__j = _STD::move(*__k); 33193e519524SHoward Hinnant *__j = _STD::move(__t); 33203e519524SHoward Hinnant } 33213e519524SHoward Hinnant } 33223e519524SHoward Hinnant} 33233e519524SHoward Hinnant 33243e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 33253e519524SHoward Hinnantvoid 33263e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 33273e519524SHoward Hinnant{ 33283e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 33293e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 33303e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 33313e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 33323e519524SHoward Hinnant { 33333e519524SHoward Hinnant if (__comp(*__i, *__j)) 33343e519524SHoward Hinnant { 33353e519524SHoward Hinnant value_type __t(_STD::move(*__i)); 33363e519524SHoward Hinnant _RandomAccessIterator __k = __j; 33373e519524SHoward Hinnant __j = __i; 33383e519524SHoward Hinnant do 33393e519524SHoward Hinnant { 33403e519524SHoward Hinnant *__j = _STD::move(*__k); 33413e519524SHoward Hinnant __j = __k; 33423e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 33433e519524SHoward Hinnant *__j = _STD::move(__t); 33443e519524SHoward Hinnant } 33453e519524SHoward Hinnant __j = __i; 33463e519524SHoward Hinnant } 33473e519524SHoward Hinnant} 33483e519524SHoward Hinnant 33493e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 33503e519524SHoward Hinnantbool 33513e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 33523e519524SHoward Hinnant{ 33533e519524SHoward Hinnant switch (__last - __first) 33543e519524SHoward Hinnant { 33553e519524SHoward Hinnant case 0: 33563e519524SHoward Hinnant case 1: 33573e519524SHoward Hinnant return true; 33583e519524SHoward Hinnant case 2: 33593e519524SHoward Hinnant if (__comp(*--__last, *__first)) 33603e519524SHoward Hinnant swap(*__first, *__last); 33613e519524SHoward Hinnant return true; 33623e519524SHoward Hinnant case 3: 33633e519524SHoward Hinnant _STD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 33643e519524SHoward Hinnant return true; 33653e519524SHoward Hinnant case 4: 33663e519524SHoward Hinnant _STD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 33673e519524SHoward Hinnant return true; 33683e519524SHoward Hinnant case 5: 33693e519524SHoward Hinnant _STD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 33703e519524SHoward Hinnant return true; 33713e519524SHoward Hinnant } 33723e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 33733e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 33743e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 33753e519524SHoward Hinnant const unsigned __limit = 8; 33763e519524SHoward Hinnant unsigned __count = 0; 33773e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 33783e519524SHoward Hinnant { 33793e519524SHoward Hinnant if (__comp(*__i, *__j)) 33803e519524SHoward Hinnant { 33813e519524SHoward Hinnant value_type __t(_STD::move(*__i)); 33823e519524SHoward Hinnant _RandomAccessIterator __k = __j; 33833e519524SHoward Hinnant __j = __i; 33843e519524SHoward Hinnant do 33853e519524SHoward Hinnant { 33863e519524SHoward Hinnant *__j = _STD::move(*__k); 33873e519524SHoward Hinnant __j = __k; 33883e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 33893e519524SHoward Hinnant *__j = _STD::move(__t); 33903e519524SHoward Hinnant if (++__count == __limit) 33913e519524SHoward Hinnant return ++__i == __last; 33923e519524SHoward Hinnant } 33933e519524SHoward Hinnant __j = __i; 33943e519524SHoward Hinnant } 33953e519524SHoward Hinnant return true; 33963e519524SHoward Hinnant} 33973e519524SHoward Hinnant 33983e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 33993e519524SHoward Hinnantvoid 34003e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 34013e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 34023e519524SHoward Hinnant{ 34033e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 34043e519524SHoward Hinnant if (__first1 != __last1) 34053e519524SHoward Hinnant { 34063e519524SHoward Hinnant __destruct_n __d(0); 34073e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 34083e519524SHoward Hinnant value_type* __last2 = __first2; 34093e519524SHoward Hinnant ::new(__last2) value_type(_STD::move(*__first1)); 34103e519524SHoward Hinnant __d.__incr((value_type*)0); 34113e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 34123e519524SHoward Hinnant { 34133e519524SHoward Hinnant value_type* __j2 = __last2; 34143e519524SHoward Hinnant value_type* __i2 = __j2; 34153e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 34163e519524SHoward Hinnant { 34173e519524SHoward Hinnant ::new(__j2) value_type(_STD::move(*__i2)); 34183e519524SHoward Hinnant __d.__incr((value_type*)0); 34193e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 34203e519524SHoward Hinnant *__j2 = _STD::move(*__i2); 34213e519524SHoward Hinnant *__j2 = _STD::move(*__first1); 34223e519524SHoward Hinnant } 34233e519524SHoward Hinnant else 34243e519524SHoward Hinnant { 34253e519524SHoward Hinnant ::new(__j2) value_type(_STD::move(*__first1)); 34263e519524SHoward Hinnant __d.__incr((value_type*)0); 34273e519524SHoward Hinnant } 34283e519524SHoward Hinnant } 34293e519524SHoward Hinnant __h.release(); 34303e519524SHoward Hinnant } 34313e519524SHoward Hinnant} 34323e519524SHoward Hinnant 34333e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 34343e519524SHoward Hinnantvoid 34353e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 34363e519524SHoward Hinnant{ 34373e519524SHoward Hinnant // _Compare is known to be a reference type 34383e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 34393e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3440ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3441ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 34423e519524SHoward Hinnant while (true) 34433e519524SHoward Hinnant { 34443e519524SHoward Hinnant __restart: 34453e519524SHoward Hinnant difference_type __len = __last - __first; 34463e519524SHoward Hinnant switch (__len) 34473e519524SHoward Hinnant { 34483e519524SHoward Hinnant case 0: 34493e519524SHoward Hinnant case 1: 34503e519524SHoward Hinnant return; 34513e519524SHoward Hinnant case 2: 34523e519524SHoward Hinnant if (__comp(*--__last, *__first)) 34533e519524SHoward Hinnant swap(*__first, *__last); 34543e519524SHoward Hinnant return; 34553e519524SHoward Hinnant case 3: 34563e519524SHoward Hinnant _STD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 34573e519524SHoward Hinnant return; 34583e519524SHoward Hinnant case 4: 34593e519524SHoward Hinnant _STD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 34603e519524SHoward Hinnant return; 34613e519524SHoward Hinnant case 5: 34623e519524SHoward Hinnant _STD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 34633e519524SHoward Hinnant return; 34643e519524SHoward Hinnant } 34653e519524SHoward Hinnant if (__len <= __limit) 34663e519524SHoward Hinnant { 34673e519524SHoward Hinnant _STD::__insertion_sort_3<_Compare>(__first, __last, __comp); 34683e519524SHoward Hinnant return; 34693e519524SHoward Hinnant } 34703e519524SHoward Hinnant // __len > 5 34713e519524SHoward Hinnant _RandomAccessIterator __m = __first; 34723e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 34733e519524SHoward Hinnant --__lm1; 34743e519524SHoward Hinnant unsigned __n_swaps; 34753e519524SHoward Hinnant { 34763e519524SHoward Hinnant difference_type __delta; 34773e519524SHoward Hinnant if (__len >= 1000) 34783e519524SHoward Hinnant { 34793e519524SHoward Hinnant __delta = __len/2; 34803e519524SHoward Hinnant __m += __delta; 34813e519524SHoward Hinnant __delta /= 2; 34823e519524SHoward Hinnant __n_swaps = _STD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 34833e519524SHoward Hinnant } 34843e519524SHoward Hinnant else 34853e519524SHoward Hinnant { 34863e519524SHoward Hinnant __delta = __len/2; 34873e519524SHoward Hinnant __m += __delta; 34883e519524SHoward Hinnant __n_swaps = _STD::__sort3<_Compare>(__first, __m, __lm1, __comp); 34893e519524SHoward Hinnant } 34903e519524SHoward Hinnant } 34913e519524SHoward Hinnant // *__m is median 34923e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 34933e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 34943e519524SHoward Hinnant _RandomAccessIterator __i = __first; 34953e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 34963e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 34973e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 34983e519524SHoward Hinnant // Prime the downward search with a guard. 34993e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 35003e519524SHoward Hinnant { 35013e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 35023e519524SHoward Hinnant // manually guard downward moving __j against __i 35033e519524SHoward Hinnant while (true) 35043e519524SHoward Hinnant { 35053e519524SHoward Hinnant if (__i == --__j) 35063e519524SHoward Hinnant { 35073e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 35083e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 35093e519524SHoward Hinnant ++__i; // __first + 1 35103e519524SHoward Hinnant __j = __last; 35113e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 35123e519524SHoward Hinnant { 35133e519524SHoward Hinnant while (true) 35143e519524SHoward Hinnant { 35153e519524SHoward Hinnant if (__i == __j) 35163e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 35173e519524SHoward Hinnant if (__comp(*__first, *__i)) 35183e519524SHoward Hinnant { 35193e519524SHoward Hinnant swap(*__i, *__j); 35203e519524SHoward Hinnant ++__n_swaps; 35213e519524SHoward Hinnant ++__i; 35223e519524SHoward Hinnant break; 35233e519524SHoward Hinnant } 35243e519524SHoward Hinnant ++__i; 35253e519524SHoward Hinnant } 35263e519524SHoward Hinnant } 35273e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 35283e519524SHoward Hinnant if (__i == __j) 35293e519524SHoward Hinnant return; 35303e519524SHoward Hinnant while (true) 35313e519524SHoward Hinnant { 35323e519524SHoward Hinnant while (!__comp(*__first, *__i)) 35333e519524SHoward Hinnant ++__i; 35343e519524SHoward Hinnant while (__comp(*__first, *--__j)) 35353e519524SHoward Hinnant ; 35363e519524SHoward Hinnant if (__i >= __j) 35373e519524SHoward Hinnant break; 35383e519524SHoward Hinnant swap(*__i, *__j); 35393e519524SHoward Hinnant ++__n_swaps; 35403e519524SHoward Hinnant ++__i; 35413e519524SHoward Hinnant } 35423e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 35433e519524SHoward Hinnant // The first part is sorted, sort the secod part 35443e519524SHoward Hinnant // _STD::__sort<_Compare>(__i, __last, __comp); 35453e519524SHoward Hinnant __first = __i; 35463e519524SHoward Hinnant goto __restart; 35473e519524SHoward Hinnant } 35483e519524SHoward Hinnant if (__comp(*__j, *__m)) 35493e519524SHoward Hinnant { 35503e519524SHoward Hinnant swap(*__i, *__j); 35513e519524SHoward Hinnant ++__n_swaps; 35523e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 35533e519524SHoward Hinnant } 35543e519524SHoward Hinnant } 35553e519524SHoward Hinnant } 35563e519524SHoward Hinnant // It is known that *__i < *__m 35573e519524SHoward Hinnant ++__i; 35583e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 35593e519524SHoward Hinnant // if not yet partitioned... 35603e519524SHoward Hinnant if (__i < __j) 35613e519524SHoward Hinnant { 35623e519524SHoward Hinnant // known that *(__i - 1) < *__m 35633e519524SHoward Hinnant // known that __i <= __m 35643e519524SHoward Hinnant while (true) 35653e519524SHoward Hinnant { 35663e519524SHoward Hinnant // __m still guards upward moving __i 35673e519524SHoward Hinnant while (__comp(*__i, *__m)) 35683e519524SHoward Hinnant ++__i; 35693e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 35703e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 35713e519524SHoward Hinnant ; 35723e519524SHoward Hinnant if (__i > __j) 35733e519524SHoward Hinnant break; 35743e519524SHoward Hinnant swap(*__i, *__j); 35753e519524SHoward Hinnant ++__n_swaps; 35763e519524SHoward Hinnant // It is known that __m != __j 35773e519524SHoward Hinnant // If __m just moved, follow it 35783e519524SHoward Hinnant if (__m == __i) 35793e519524SHoward Hinnant __m = __j; 35803e519524SHoward Hinnant ++__i; 35813e519524SHoward Hinnant } 35823e519524SHoward Hinnant } 35833e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 35843e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 35853e519524SHoward Hinnant { 35863e519524SHoward Hinnant swap(*__i, *__m); 35873e519524SHoward Hinnant ++__n_swaps; 35883e519524SHoward Hinnant } 35893e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 35903e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 35913e519524SHoward Hinnant if (__n_swaps == 0) 35923e519524SHoward Hinnant { 35933e519524SHoward Hinnant bool __fs = _STD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 35943e519524SHoward Hinnant if (_STD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 35953e519524SHoward Hinnant { 35963e519524SHoward Hinnant if (__fs) 35973e519524SHoward Hinnant return; 35983e519524SHoward Hinnant __last = __i; 35993e519524SHoward Hinnant continue; 36003e519524SHoward Hinnant } 36013e519524SHoward Hinnant else 36023e519524SHoward Hinnant { 36033e519524SHoward Hinnant if (__fs) 36043e519524SHoward Hinnant { 36053e519524SHoward Hinnant __first = ++__i; 36063e519524SHoward Hinnant continue; 36073e519524SHoward Hinnant } 36083e519524SHoward Hinnant } 36093e519524SHoward Hinnant } 36103e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 36113e519524SHoward Hinnant if (__i - __first < __last - __i) 36123e519524SHoward Hinnant { 36133e519524SHoward Hinnant _STD::__sort<_Compare>(__first, __i, __comp); 36143e519524SHoward Hinnant // _STD::__sort<_Compare>(__i+1, __last, __comp); 36153e519524SHoward Hinnant __first = ++__i; 36163e519524SHoward Hinnant } 36173e519524SHoward Hinnant else 36183e519524SHoward Hinnant { 36193e519524SHoward Hinnant _STD::__sort<_Compare>(__i+1, __last, __comp); 36203e519524SHoward Hinnant // _STD::__sort<_Compare>(__first, __i, __comp); 36213e519524SHoward Hinnant __last = __i; 36223e519524SHoward Hinnant } 36233e519524SHoward Hinnant } 36243e519524SHoward Hinnant} 36253e519524SHoward Hinnant 36263e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 36273e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 36283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36293e519524SHoward Hinnantvoid 36303e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 36313e519524SHoward Hinnant{ 36323e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 36333e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 36343e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 36353e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 3636b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 36373e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 36383e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 3639b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 36403e519524SHoward Hinnant} 36413e519524SHoward Hinnant 36423e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 36433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36443e519524SHoward Hinnantvoid 36453e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 36463e519524SHoward Hinnant{ 36473e519524SHoward Hinnant _STD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 36483e519524SHoward Hinnant} 36493e519524SHoward Hinnant 36503e519524SHoward Hinnanttemplate <class _Tp> 36513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36523e519524SHoward Hinnantvoid 36533e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 36543e519524SHoward Hinnant{ 36553e519524SHoward Hinnant _STD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 36563e519524SHoward Hinnant} 36573e519524SHoward Hinnant 36583e519524SHoward Hinnanttemplate <class _Tp> 36593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36603e519524SHoward Hinnantvoid 36613e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 36623e519524SHoward Hinnant{ 36633e519524SHoward Hinnant _STD::sort(__first.base(), __last.base()); 36643e519524SHoward Hinnant} 36653e519524SHoward Hinnant 36663e519524SHoward Hinnantextern template void __sort<__less<char>&, char*>(char*, char*, __less<char>&); 36673e519524SHoward Hinnantextern template void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&); 36683e519524SHoward Hinnantextern template void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&); 36693e519524SHoward Hinnantextern template void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&); 36703e519524SHoward Hinnantextern template void __sort<__less<short>&, short*>(short*, short*, __less<short>&); 36713e519524SHoward Hinnantextern template void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&); 36723e519524SHoward Hinnantextern template void __sort<__less<int>&, int*>(int*, int*, __less<int>&); 36733e519524SHoward Hinnantextern template void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&); 36743e519524SHoward Hinnantextern template void __sort<__less<long>&, long*>(long*, long*, __less<long>&); 36753e519524SHoward Hinnantextern template void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&); 36763e519524SHoward Hinnantextern template void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&); 36773e519524SHoward Hinnantextern template void __sort<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&); 36783e519524SHoward Hinnantextern template void __sort<__less<float>&, float*>(float*, float*, __less<float>&); 36793e519524SHoward Hinnantextern template void __sort<__less<double>&, double*>(double*, double*, __less<double>&); 36803e519524SHoward Hinnantextern template void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&); 36813e519524SHoward Hinnant 36823e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&); 36833e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&); 36843e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&); 36853e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&); 36863e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&); 36873e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&); 36883e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&); 36893e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&); 36903e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&); 36913e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&); 36923e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&); 36933e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&); 36943e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&); 36953e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&); 36963e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&); 36973e519524SHoward Hinnant 36983e519524SHoward Hinnantextern template unsigned __sort5<__less<long double>&, long double*>(long double*, long double*, long double*, long double*, long double*, __less<long double>&); 36993e519524SHoward Hinnant 37003e519524SHoward Hinnant// lower_bound 37013e519524SHoward Hinnant 37023e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 37033e519524SHoward Hinnant_ForwardIterator 37043e519524SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 37053e519524SHoward Hinnant{ 37063e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 37073e519524SHoward Hinnant difference_type __len = _STD::distance(__first, __last); 37083e519524SHoward Hinnant while (__len != 0) 37093e519524SHoward Hinnant { 37103e519524SHoward Hinnant difference_type __l2 = __len / 2; 37113e519524SHoward Hinnant _ForwardIterator __m = __first; 37123e519524SHoward Hinnant _STD::advance(__m, __l2); 37133e519524SHoward Hinnant if (__comp(*__m, __value)) 37143e519524SHoward Hinnant { 37153e519524SHoward Hinnant __first = ++__m; 37163e519524SHoward Hinnant __len -= __l2 + 1; 37173e519524SHoward Hinnant } 37183e519524SHoward Hinnant else 37193e519524SHoward Hinnant __len = __l2; 37203e519524SHoward Hinnant } 37213e519524SHoward Hinnant return __first; 37223e519524SHoward Hinnant} 37233e519524SHoward Hinnant 37243e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 37253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37263e519524SHoward Hinnant_ForwardIterator 37273e519524SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 37283e519524SHoward Hinnant{ 37293e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 37303e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 37313e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 37323e519524SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value, __c); 3733b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 37343e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 37353e519524SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value, __comp); 3736b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 37373e519524SHoward Hinnant} 37383e519524SHoward Hinnant 37393e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 37403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37413e519524SHoward Hinnant_ForwardIterator 37423e519524SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) 37433e519524SHoward Hinnant{ 37443e519524SHoward Hinnant return _STD::lower_bound(__first, __last, __value, 37453e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 37463e519524SHoward Hinnant} 37473e519524SHoward Hinnant 37483e519524SHoward Hinnant// upper_bound 37493e519524SHoward Hinnant 37503e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 37513e519524SHoward Hinnant_ForwardIterator 37523e519524SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 37533e519524SHoward Hinnant{ 37543e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 37553e519524SHoward Hinnant difference_type __len = _STD::distance(__first, __last); 37563e519524SHoward Hinnant while (__len != 0) 37573e519524SHoward Hinnant { 37583e519524SHoward Hinnant difference_type __l2 = __len / 2; 37593e519524SHoward Hinnant _ForwardIterator __m = __first; 37603e519524SHoward Hinnant _STD::advance(__m, __l2); 37613e519524SHoward Hinnant if (__comp(__value, *__m)) 37623e519524SHoward Hinnant __len = __l2; 37633e519524SHoward Hinnant else 37643e519524SHoward Hinnant { 37653e519524SHoward Hinnant __first = ++__m; 37663e519524SHoward Hinnant __len -= __l2 + 1; 37673e519524SHoward Hinnant } 37683e519524SHoward Hinnant } 37693e519524SHoward Hinnant return __first; 37703e519524SHoward Hinnant} 37713e519524SHoward Hinnant 37723e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 37733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37743e519524SHoward Hinnant_ForwardIterator 37753e519524SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 37763e519524SHoward Hinnant{ 37773e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 37783e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 37793e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 37803e519524SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value, __c); 3781b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 37823e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 37833e519524SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value, __comp); 3784b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 37853e519524SHoward Hinnant} 37863e519524SHoward Hinnant 37873e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 37883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37893e519524SHoward Hinnant_ForwardIterator 37903e519524SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) 37913e519524SHoward Hinnant{ 37923e519524SHoward Hinnant return _STD::upper_bound(__first, __last, __value, 37933e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 37943e519524SHoward Hinnant} 37953e519524SHoward Hinnant 37963e519524SHoward Hinnant// equal_range 37973e519524SHoward Hinnant 37983e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 37993e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 38003e519524SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 38013e519524SHoward Hinnant{ 38023e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 38033e519524SHoward Hinnant difference_type __len = _STD::distance(__first, __last); 38043e519524SHoward Hinnant while (__len != 0) 38053e519524SHoward Hinnant { 38063e519524SHoward Hinnant difference_type __l2 = __len / 2; 38073e519524SHoward Hinnant _ForwardIterator __m = __first; 38083e519524SHoward Hinnant _STD::advance(__m, __l2); 38093e519524SHoward Hinnant if (__comp(*__m, __value)) 38103e519524SHoward Hinnant { 38113e519524SHoward Hinnant __first = ++__m; 38123e519524SHoward Hinnant __len -= __l2 + 1; 38133e519524SHoward Hinnant } 38143e519524SHoward Hinnant else if (__comp(__value, *__m)) 38153e519524SHoward Hinnant { 38163e519524SHoward Hinnant __last = __m; 38173e519524SHoward Hinnant __len = __l2; 38183e519524SHoward Hinnant } 38193e519524SHoward Hinnant else 38203e519524SHoward Hinnant { 38213e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 38223e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 38233e519524SHoward Hinnant ( 38243e519524SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value, __comp), 38253e519524SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value, __comp) 38263e519524SHoward Hinnant ); 38273e519524SHoward Hinnant } 38283e519524SHoward Hinnant } 38293e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 38303e519524SHoward Hinnant} 38313e519524SHoward Hinnant 38323e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 38333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 38343e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 38353e519524SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 38363e519524SHoward Hinnant{ 38373e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 38383e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 38393e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 38403e519524SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value, __c); 3841b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 38423e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 38433e519524SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value, __comp); 3844b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 38453e519524SHoward Hinnant} 38463e519524SHoward Hinnant 38473e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 38483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 38493e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 38503e519524SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) 38513e519524SHoward Hinnant{ 38523e519524SHoward Hinnant return _STD::equal_range(__first, __last, __value, 38533e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 38543e519524SHoward Hinnant} 38553e519524SHoward Hinnant 38563e519524SHoward Hinnant// binary_search 38573e519524SHoward Hinnant 38583e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 38593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 38603e519524SHoward Hinnantbool 38613e519524SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 38623e519524SHoward Hinnant{ 38633e519524SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value, __comp); 38643e519524SHoward Hinnant return __first != __last && !__comp(__value, *__first); 38653e519524SHoward Hinnant} 38663e519524SHoward Hinnant 38673e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 38683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 38693e519524SHoward Hinnantbool 38703e519524SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 38713e519524SHoward Hinnant{ 38723e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 38733e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 38743e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 38753e519524SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value, __c); 3876b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 38773e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 38783e519524SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value, __comp); 3879b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 38803e519524SHoward Hinnant} 38813e519524SHoward Hinnant 38823e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 38833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 38843e519524SHoward Hinnantbool 38853e519524SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) 38863e519524SHoward Hinnant{ 38873e519524SHoward Hinnant return _STD::binary_search(__first, __last, __value, 38883e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 38893e519524SHoward Hinnant} 38903e519524SHoward Hinnant 38913e519524SHoward Hinnant// merge 38923e519524SHoward Hinnant 38933e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 38943e519524SHoward Hinnant_OutputIterator 38953e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 38963e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 38973e519524SHoward Hinnant{ 38983e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 38993e519524SHoward Hinnant { 39003e519524SHoward Hinnant if (__first2 == __last2) 39013e519524SHoward Hinnant return _STD::copy(__first1, __last1, __result); 39023e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 39033e519524SHoward Hinnant { 39043e519524SHoward Hinnant *__result = *__first2; 39053e519524SHoward Hinnant ++__first2; 39063e519524SHoward Hinnant } 39073e519524SHoward Hinnant else 39083e519524SHoward Hinnant { 39093e519524SHoward Hinnant *__result = *__first1; 39103e519524SHoward Hinnant ++__first1; 39113e519524SHoward Hinnant } 39123e519524SHoward Hinnant } 39133e519524SHoward Hinnant return _STD::copy(__first2, __last2, __result); 39143e519524SHoward Hinnant} 39153e519524SHoward Hinnant 39163e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 39173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39183e519524SHoward Hinnant_OutputIterator 39193e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 39203e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 39213e519524SHoward Hinnant{ 39223e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 39233e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 39243e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 39253e519524SHoward Hinnant return _STD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 3926b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 39273e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 39283e519524SHoward Hinnant return _STD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 3929b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 39303e519524SHoward Hinnant} 39313e519524SHoward Hinnant 39323e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 39333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39343e519524SHoward Hinnant_OutputIterator 39353e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 39363e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 39373e519524SHoward Hinnant{ 39383e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 39393e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 39403e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 39413e519524SHoward Hinnant} 39423e519524SHoward Hinnant 39433e519524SHoward Hinnant// inplace_merge 39443e519524SHoward Hinnant 39453e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 39463e519524SHoward Hinnantvoid 39473e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 39483e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 39493e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 39503e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 39513e519524SHoward Hinnant{ 39523e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 39533e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 39543e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::pointer pointer; 39553e519524SHoward Hinnant __destruct_n __d(0); 39563e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 39573e519524SHoward Hinnant if (__len1 <= __len2) 39583e519524SHoward Hinnant { 39593e519524SHoward Hinnant value_type* __p = __buff; 39603e519524SHoward Hinnant for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), ++__i, ++__p) 39613e519524SHoward Hinnant ::new(__p) value_type(_STD::move(*__i)); 39623e519524SHoward Hinnant __merge<_Compare>(move_iterator<value_type*>(__buff), 39633e519524SHoward Hinnant move_iterator<value_type*>(__p), 39643e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__middle), 39653e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__last), 39663e519524SHoward Hinnant __first, __comp); 39673e519524SHoward Hinnant } 39683e519524SHoward Hinnant else 39693e519524SHoward Hinnant { 39703e519524SHoward Hinnant value_type* __p = __buff; 39713e519524SHoward Hinnant for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), ++__i, ++__p) 39723e519524SHoward Hinnant ::new(__p) value_type(_STD::move(*__i)); 39733e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 39743e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 39753e519524SHoward Hinnant __merge(move_iterator<_RBi>(_RBi(__middle)), move_iterator<_RBi>(_RBi(__first)), 39763e519524SHoward Hinnant move_iterator<_Rv>(_Rv(__p)), move_iterator<_Rv>(_Rv(__buff)), 39773e519524SHoward Hinnant _RBi(__last), __negate<_Compare>(__comp)); 39783e519524SHoward Hinnant } 39793e519524SHoward Hinnant} 39803e519524SHoward Hinnant 39813e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 39823e519524SHoward Hinnantvoid 39833e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 39843e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 39853e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 39863e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 39873e519524SHoward Hinnant{ 39883e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 39893e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 39903e519524SHoward Hinnant while (true) 39913e519524SHoward Hinnant { 39923e519524SHoward Hinnant // if __middle == __last, we're done 39933e519524SHoward Hinnant if (__len2 == 0) 39943e519524SHoward Hinnant return; 39953e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 39963e519524SHoward Hinnant for (; true; ++__first, --__len1) 39973e519524SHoward Hinnant { 39983e519524SHoward Hinnant if (__len1 == 0) 39993e519524SHoward Hinnant return; 40003e519524SHoward Hinnant if (__comp(*__middle, *__first)) 40013e519524SHoward Hinnant break; 40023e519524SHoward Hinnant } 40033e519524SHoward Hinnant if (__len1 <= __buff_size || __len2 <= __buff_size) 40043e519524SHoward Hinnant { 40053e519524SHoward Hinnant __buffered_inplace_merge<_Compare>(__first, __middle, __last, __comp, __len1, __len2, __buff); 40063e519524SHoward Hinnant return; 40073e519524SHoward Hinnant } 40083e519524SHoward Hinnant // __first < __middle < __last 40093e519524SHoward Hinnant // *__first > *__middle 40103e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 40113e519524SHoward Hinnant // all elements in: 40123e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 40133e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 40143e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 40153e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 40163e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 40173e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 40183e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 40193e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 40203e519524SHoward Hinnant // binary search smaller range 40213e519524SHoward Hinnant if (__len1 < __len2) 40223e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 40233e519524SHoward Hinnant __len21 = __len2 / 2; 40243e519524SHoward Hinnant __m2 = __middle; 40253e519524SHoward Hinnant _STD::advance(__m2, __len21); 40263e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 40273e519524SHoward Hinnant __len11 = _STD::distance(__first, __m1); 40283e519524SHoward Hinnant } 40293e519524SHoward Hinnant else 40303e519524SHoward Hinnant { 40313e519524SHoward Hinnant if (__len1 == 1) 40323e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 40333e519524SHoward Hinnant // It is known *__first > *__middle 40343e519524SHoward Hinnant swap(*__first, *__middle); 40353e519524SHoward Hinnant return; 40363e519524SHoward Hinnant } 40373e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 40383e519524SHoward Hinnant __len11 = __len1 / 2; 40393e519524SHoward Hinnant __m1 = __first; 40403e519524SHoward Hinnant _STD::advance(__m1, __len11); 40413e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 40423e519524SHoward Hinnant __len21 = _STD::distance(__middle, __m2); 40433e519524SHoward Hinnant } 40443e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 40453e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 40463e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 40473e519524SHoward Hinnant // swap middle two partitions 40483e519524SHoward Hinnant __middle = _STD::rotate(__m1, __middle, __m2); 40493e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 40503e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 40513e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 40523e519524SHoward Hinnant { 40533e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 40543e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 40553e519524SHoward Hinnant __first = __middle; 40563e519524SHoward Hinnant __middle = __m2; 40573e519524SHoward Hinnant __len1 = __len12; 40583e519524SHoward Hinnant __len2 = __len22; 40593e519524SHoward Hinnant } 40603e519524SHoward Hinnant else 40613e519524SHoward Hinnant { 40623e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 40633e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 40643e519524SHoward Hinnant __last = __middle; 40653e519524SHoward Hinnant __middle = __m1; 40663e519524SHoward Hinnant __len1 = __len11; 40673e519524SHoward Hinnant __len2 = __len21; 40683e519524SHoward Hinnant } 40693e519524SHoward Hinnant } 40703e519524SHoward Hinnant} 40713e519524SHoward Hinnant 40723e519524SHoward Hinnanttemplate <class _Tp> 40733e519524SHoward Hinnantstruct __inplace_merge_switch 40743e519524SHoward Hinnant{ 4075ca740483SHoward Hinnant static const unsigned value = is_trivially_copy_assignable<_Tp>::value; 40763e519524SHoward Hinnant}; 40773e519524SHoward Hinnant 40783e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 40793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40803e519524SHoward Hinnantvoid 40813e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 40823e519524SHoward Hinnant _Compare __comp) 40833e519524SHoward Hinnant{ 40843e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 40853e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 40863e519524SHoward Hinnant difference_type __len1 = _STD::distance(__first, __middle); 40873e519524SHoward Hinnant difference_type __len2 = _STD::distance(__middle, __last); 40883e519524SHoward Hinnant difference_type __buf_size = _STD::min(__len1, __len2); 40893e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 40903e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 40913e519524SHoward Hinnant if (__inplace_merge_switch<value_type>::value && __buf_size > 8) 40923e519524SHoward Hinnant { 40933e519524SHoward Hinnant __buf = _STD::get_temporary_buffer<value_type>(__buf_size); 40943e519524SHoward Hinnant __h.reset(__buf.first); 40953e519524SHoward Hinnant } 40963e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 40973e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 40983e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 40993e519524SHoward Hinnant return _STD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 41003e519524SHoward Hinnant __buf.first, __buf.second); 4101b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 41023e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 41033e519524SHoward Hinnant return _STD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 41043e519524SHoward Hinnant __buf.first, __buf.second); 4105b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 41063e519524SHoward Hinnant} 41073e519524SHoward Hinnant 41083e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 41093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41103e519524SHoward Hinnantvoid 41113e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 41123e519524SHoward Hinnant{ 41133e519524SHoward Hinnant _STD::inplace_merge(__first, __middle, __last, 41143e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 41153e519524SHoward Hinnant} 41163e519524SHoward Hinnant 41173e519524SHoward Hinnant// stable_sort 41183e519524SHoward Hinnant 41193e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 41203e519524SHoward Hinnantvoid 41213e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 41223e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 41233e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 41243e519524SHoward Hinnant{ 41253e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 41263e519524SHoward Hinnant __destruct_n __d(0); 41273e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 41283e519524SHoward Hinnant for (; true; ++__result) 41293e519524SHoward Hinnant { 41303e519524SHoward Hinnant if (__first1 == __last1) 41313e519524SHoward Hinnant { 41323e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 41333e519524SHoward Hinnant ::new (__result) value_type(_STD::move(*__first2)); 41343e519524SHoward Hinnant __h.release(); 41353e519524SHoward Hinnant return; 41363e519524SHoward Hinnant } 41373e519524SHoward Hinnant if (__first2 == __last2) 41383e519524SHoward Hinnant { 41393e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 41403e519524SHoward Hinnant ::new (__result) value_type(_STD::move(*__first1)); 41413e519524SHoward Hinnant __h.release(); 41423e519524SHoward Hinnant return; 41433e519524SHoward Hinnant } 41443e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 41453e519524SHoward Hinnant { 41463e519524SHoward Hinnant ::new (__result) value_type(_STD::move(*__first2)); 41473e519524SHoward Hinnant __d.__incr((value_type*)0); 41483e519524SHoward Hinnant ++__first2; 41493e519524SHoward Hinnant } 41503e519524SHoward Hinnant else 41513e519524SHoward Hinnant { 41523e519524SHoward Hinnant ::new (__result) value_type(_STD::move(*__first1)); 41533e519524SHoward Hinnant __d.__incr((value_type*)0); 41543e519524SHoward Hinnant ++__first1; 41553e519524SHoward Hinnant } 41563e519524SHoward Hinnant } 41573e519524SHoward Hinnant} 41583e519524SHoward Hinnant 41593e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 41603e519524SHoward Hinnantvoid 41613e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 41623e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 41633e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 41643e519524SHoward Hinnant{ 41653e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 41663e519524SHoward Hinnant { 41673e519524SHoward Hinnant if (__first2 == __last2) 41683e519524SHoward Hinnant { 41693e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 41703e519524SHoward Hinnant *__result = _STD::move(*__first1); 41713e519524SHoward Hinnant return; 41723e519524SHoward Hinnant } 41733e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 41743e519524SHoward Hinnant { 41753e519524SHoward Hinnant *__result = _STD::move(*__first2); 41763e519524SHoward Hinnant ++__first2; 41773e519524SHoward Hinnant } 41783e519524SHoward Hinnant else 41793e519524SHoward Hinnant { 41803e519524SHoward Hinnant *__result = _STD::move(*__first1); 41813e519524SHoward Hinnant ++__first1; 41823e519524SHoward Hinnant } 41833e519524SHoward Hinnant } 41843e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 41853e519524SHoward Hinnant *__result = _STD::move(*__first2); 41863e519524SHoward Hinnant} 41873e519524SHoward Hinnant 41883e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 41893e519524SHoward Hinnantvoid 41903e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 41913e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 41923e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 41933e519524SHoward Hinnant 41943e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 41953e519524SHoward Hinnantvoid 41963e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 41973e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 41983e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 41993e519524SHoward Hinnant{ 42003e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 42013e519524SHoward Hinnant switch (__len) 42023e519524SHoward Hinnant { 42033e519524SHoward Hinnant case 0: 42043e519524SHoward Hinnant return; 42053e519524SHoward Hinnant case 1: 42063e519524SHoward Hinnant ::new(__first2) value_type(_STD::move(*__first1)); 42073e519524SHoward Hinnant return; 42083e519524SHoward Hinnant case 2: 42093e519524SHoward Hinnant __destruct_n __d(0); 42103e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 42113e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 42123e519524SHoward Hinnant { 42133e519524SHoward Hinnant ::new(__first2) value_type(_STD::move(*__last1)); 42143e519524SHoward Hinnant __d.__incr((value_type*)0); 42153e519524SHoward Hinnant ++__first2; 42163e519524SHoward Hinnant ::new(__first2) value_type(_STD::move(*__first1)); 42173e519524SHoward Hinnant } 42183e519524SHoward Hinnant else 42193e519524SHoward Hinnant { 42203e519524SHoward Hinnant ::new(__first2) value_type(_STD::move(*__first1)); 42213e519524SHoward Hinnant __d.__incr((value_type*)0); 42223e519524SHoward Hinnant ++__first2; 42233e519524SHoward Hinnant ::new(__first2) value_type(_STD::move(*__last1)); 42243e519524SHoward Hinnant } 42253e519524SHoward Hinnant __h2.release(); 42263e519524SHoward Hinnant return; 42273e519524SHoward Hinnant } 42283e519524SHoward Hinnant if (__len <= 8) 42293e519524SHoward Hinnant { 42303e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 42313e519524SHoward Hinnant return; 42323e519524SHoward Hinnant } 42333e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 42343e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 42353e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 42363e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 42373e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 42383e519524SHoward Hinnant} 42393e519524SHoward Hinnant 42403e519524SHoward Hinnanttemplate <class _Tp> 42413e519524SHoward Hinnantstruct __stable_sort_switch 42423e519524SHoward Hinnant{ 4243ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 42443e519524SHoward Hinnant}; 42453e519524SHoward Hinnant 42463e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 42473e519524SHoward Hinnantvoid 42483e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 42493e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 42503e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 42513e519524SHoward Hinnant{ 42523e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 42533e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 42543e519524SHoward Hinnant switch (__len) 42553e519524SHoward Hinnant { 42563e519524SHoward Hinnant case 0: 42573e519524SHoward Hinnant case 1: 42583e519524SHoward Hinnant return; 42593e519524SHoward Hinnant case 2: 42603e519524SHoward Hinnant if (__comp(*--__last, *__first)) 42613e519524SHoward Hinnant swap(*__first, *__last); 42623e519524SHoward Hinnant return; 42633e519524SHoward Hinnant } 42643e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 42653e519524SHoward Hinnant { 42663e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 42673e519524SHoward Hinnant return; 42683e519524SHoward Hinnant } 42693e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 42703e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 42713e519524SHoward Hinnant if (__len <= __buff_size) 42723e519524SHoward Hinnant { 42733e519524SHoward Hinnant __destruct_n __d(0); 42743e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 42753e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 42763e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 42773e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 42783e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 42793e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 42803e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 42813e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 42823e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 42833e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 42843e519524SHoward Hinnant// __first, __comp); 42853e519524SHoward Hinnant return; 42863e519524SHoward Hinnant } 42873e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 42883e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 42893e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 42903e519524SHoward Hinnant} 42913e519524SHoward Hinnant 42923e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 42933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42943e519524SHoward Hinnantvoid 42953e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 42963e519524SHoward Hinnant{ 42973e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 42983e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 42993e519524SHoward Hinnant difference_type __len = __last - __first; 43003e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 43013e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 43023e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 43033e519524SHoward Hinnant { 43043e519524SHoward Hinnant __buf = _STD::get_temporary_buffer<value_type>(__len); 43053e519524SHoward Hinnant __h.reset(__buf.first); 43063e519524SHoward Hinnant } 43073e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 43083e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43093e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 43103e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4311b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 43123e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 43133e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4314b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 43153e519524SHoward Hinnant} 43163e519524SHoward Hinnant 43173e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 43183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43193e519524SHoward Hinnantvoid 43203e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 43213e519524SHoward Hinnant{ 43223e519524SHoward Hinnant _STD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 43233e519524SHoward Hinnant} 43243e519524SHoward Hinnant 43253e519524SHoward Hinnant// is_heap_until 43263e519524SHoward Hinnant 43273e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 43283e519524SHoward Hinnant_RandomAccessIterator 43293e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 43303e519524SHoward Hinnant{ 43313e519524SHoward Hinnant typedef typename _STD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 43323e519524SHoward Hinnant difference_type __len = __last - __first; 43333e519524SHoward Hinnant difference_type __p = 0; 43343e519524SHoward Hinnant difference_type __c = 1; 43353e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 43363e519524SHoward Hinnant while (__c < __len) 43373e519524SHoward Hinnant { 43383e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 43393e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 43403e519524SHoward Hinnant return __cp; 43413e519524SHoward Hinnant ++__c; 43423e519524SHoward Hinnant ++__cp; 43433e519524SHoward Hinnant if (__c == __len) 43443e519524SHoward Hinnant return __last; 43453e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 43463e519524SHoward Hinnant return __cp; 43473e519524SHoward Hinnant ++__p; 43483e519524SHoward Hinnant ++__pp; 43493e519524SHoward Hinnant __c = 2 * __p + 1; 43503e519524SHoward Hinnant } 43513e519524SHoward Hinnant return __last; 43523e519524SHoward Hinnant} 43533e519524SHoward Hinnant 43543e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 43553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43563e519524SHoward Hinnant_RandomAccessIterator 43573e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 43583e519524SHoward Hinnant{ 43593e519524SHoward Hinnant return _STD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 43603e519524SHoward Hinnant} 43613e519524SHoward Hinnant 43623e519524SHoward Hinnant// is_heap 43633e519524SHoward Hinnant 43643e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 43653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43663e519524SHoward Hinnantbool 43673e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 43683e519524SHoward Hinnant{ 43693e519524SHoward Hinnant return _STD::is_heap_until(__first, __last, __comp) == __last; 43703e519524SHoward Hinnant} 43713e519524SHoward Hinnant 43723e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 43733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43743e519524SHoward Hinnantbool 43753e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 43763e519524SHoward Hinnant{ 43773e519524SHoward Hinnant return _STD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 43783e519524SHoward Hinnant} 43793e519524SHoward Hinnant 43803e519524SHoward Hinnant// push_heap 43813e519524SHoward Hinnant 43823e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 43833e519524SHoward Hinnantvoid 43843e519524SHoward Hinnant__push_heap_front(_RandomAccessIterator __first, _RandomAccessIterator, _Compare __comp, 43853e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 43863e519524SHoward Hinnant{ 43873e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 43883e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 43893e519524SHoward Hinnant if (__len > 1) 43903e519524SHoward Hinnant { 43913e519524SHoward Hinnant difference_type __p = 0; 43923e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 43933e519524SHoward Hinnant difference_type __c = 2; 43943e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 43953e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 43963e519524SHoward Hinnant { 43973e519524SHoward Hinnant --__c; 43983e519524SHoward Hinnant --__cp; 43993e519524SHoward Hinnant } 44003e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 44013e519524SHoward Hinnant { 44023e519524SHoward Hinnant value_type __t(_STD::move(*__pp)); 44033e519524SHoward Hinnant do 44043e519524SHoward Hinnant { 44053e519524SHoward Hinnant *__pp = _STD::move(*__cp); 44063e519524SHoward Hinnant __pp = __cp; 44073e519524SHoward Hinnant __p = __c; 44083e519524SHoward Hinnant __c = (__p + 1) * 2; 44093e519524SHoward Hinnant if (__c > __len) 44103e519524SHoward Hinnant break; 44113e519524SHoward Hinnant __cp = __first + __c; 44123e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 44133e519524SHoward Hinnant { 44143e519524SHoward Hinnant --__c; 44153e519524SHoward Hinnant --__cp; 44163e519524SHoward Hinnant } 44173e519524SHoward Hinnant } while (__comp(__t, *__cp)); 44183e519524SHoward Hinnant *__pp = _STD::move(__t); 44193e519524SHoward Hinnant } 44203e519524SHoward Hinnant } 44213e519524SHoward Hinnant} 44223e519524SHoward Hinnant 44233e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 44243e519524SHoward Hinnantvoid 44253e519524SHoward Hinnant__push_heap_back(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 44263e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 44273e519524SHoward Hinnant{ 44283e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 44293e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 44303e519524SHoward Hinnant if (__len > 1) 44313e519524SHoward Hinnant { 44323e519524SHoward Hinnant __len = (__len - 2) / 2; 44333e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 44343e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 44353e519524SHoward Hinnant { 44363e519524SHoward Hinnant value_type __t(_STD::move(*__last)); 44373e519524SHoward Hinnant do 44383e519524SHoward Hinnant { 44393e519524SHoward Hinnant *__last = _STD::move(*__ptr); 44403e519524SHoward Hinnant __last = __ptr; 44413e519524SHoward Hinnant if (__len == 0) 44423e519524SHoward Hinnant break; 44433e519524SHoward Hinnant __len = (__len - 1) / 2; 44443e519524SHoward Hinnant __ptr = __first + __len; 44453e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 44463e519524SHoward Hinnant *__last = _STD::move(__t); 44473e519524SHoward Hinnant } 44483e519524SHoward Hinnant } 44493e519524SHoward Hinnant} 44503e519524SHoward Hinnant 44513e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 44523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44533e519524SHoward Hinnantvoid 44543e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 44553e519524SHoward Hinnant{ 44563e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 44573e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44583e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 44593e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __c, __last - __first); 4460b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 44613e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 44623e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __comp, __last - __first); 4463b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 44643e519524SHoward Hinnant} 44653e519524SHoward Hinnant 44663e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 44673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44683e519524SHoward Hinnantvoid 44693e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 44703e519524SHoward Hinnant{ 44713e519524SHoward Hinnant _STD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 44723e519524SHoward Hinnant} 44733e519524SHoward Hinnant 44743e519524SHoward Hinnant// pop_heap 44753e519524SHoward Hinnant 44763e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 44773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44783e519524SHoward Hinnantvoid 44793e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 44803e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 44813e519524SHoward Hinnant{ 44823e519524SHoward Hinnant if (__len > 1) 44833e519524SHoward Hinnant { 44843e519524SHoward Hinnant swap(*__first, *--__last); 44853e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __last, __comp, __len-1); 44863e519524SHoward Hinnant } 44873e519524SHoward Hinnant} 44883e519524SHoward Hinnant 44893e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 44903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44913e519524SHoward Hinnantvoid 44923e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 44933e519524SHoward Hinnant{ 44943e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 44953e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44963e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 44973e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 4498b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 44993e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 45003e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 4501b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 45023e519524SHoward Hinnant} 45033e519524SHoward Hinnant 45043e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 45053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45063e519524SHoward Hinnantvoid 45073e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 45083e519524SHoward Hinnant{ 45093e519524SHoward Hinnant _STD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 45103e519524SHoward Hinnant} 45113e519524SHoward Hinnant 45123e519524SHoward Hinnant// make_heap 45133e519524SHoward Hinnant 45143e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45153e519524SHoward Hinnantvoid 45163e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 45173e519524SHoward Hinnant{ 45183e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 45193e519524SHoward Hinnant difference_type __n = __last - __first; 45203e519524SHoward Hinnant if (__n > 1) 45213e519524SHoward Hinnant { 45223e519524SHoward Hinnant __last = __first; 45233e519524SHoward Hinnant ++__last; 45243e519524SHoward Hinnant for (difference_type __i = 1; __i < __n;) 45253e519524SHoward Hinnant __push_heap_back<_Compare>(__first, ++__last, __comp, ++__i); 45263e519524SHoward Hinnant } 45273e519524SHoward Hinnant} 45283e519524SHoward Hinnant 45293e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 45303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45313e519524SHoward Hinnantvoid 45323e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 45333e519524SHoward Hinnant{ 45343e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 45353e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 45363e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 45373e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 4538b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 45393e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 45403e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 4541b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 45423e519524SHoward Hinnant} 45433e519524SHoward Hinnant 45443e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 45453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45463e519524SHoward Hinnantvoid 45473e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 45483e519524SHoward Hinnant{ 45493e519524SHoward Hinnant _STD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 45503e519524SHoward Hinnant} 45513e519524SHoward Hinnant 45523e519524SHoward Hinnant// sort_heap 45533e519524SHoward Hinnant 45543e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45553e519524SHoward Hinnantvoid 45563e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 45573e519524SHoward Hinnant{ 45583e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 45593e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 45603e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 45613e519524SHoward Hinnant} 45623e519524SHoward Hinnant 45633e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 45643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45653e519524SHoward Hinnantvoid 45663e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 45673e519524SHoward Hinnant{ 45683e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 45693e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 45703e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 45713e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 4572b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 45733e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 45743e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 4575b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 45763e519524SHoward Hinnant} 45773e519524SHoward Hinnant 45783e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 45793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45803e519524SHoward Hinnantvoid 45813e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 45823e519524SHoward Hinnant{ 45833e519524SHoward Hinnant _STD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 45843e519524SHoward Hinnant} 45853e519524SHoward Hinnant 45863e519524SHoward Hinnant// partial_sort 45873e519524SHoward Hinnant 45883e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45893e519524SHoward Hinnantvoid 45903e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 45913e519524SHoward Hinnant _Compare __comp) 45923e519524SHoward Hinnant{ 45933e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 45943e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 45953e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 45963e519524SHoward Hinnant { 45973e519524SHoward Hinnant if (__comp(*__i, *__first)) 45983e519524SHoward Hinnant { 45993e519524SHoward Hinnant swap(*__i, *__first); 46003e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __middle, __comp, __len); 46013e519524SHoward Hinnant } 46023e519524SHoward Hinnant } 46033e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 46043e519524SHoward Hinnant} 46053e519524SHoward Hinnant 46063e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 46073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46083e519524SHoward Hinnantvoid 46093e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 46103e519524SHoward Hinnant _Compare __comp) 46113e519524SHoward Hinnant{ 46123e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 46133e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46143e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 46153e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 4616b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 46173e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 46183e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 4619b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 46203e519524SHoward Hinnant} 46213e519524SHoward Hinnant 46223e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 46233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46243e519524SHoward Hinnantvoid 46253e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 46263e519524SHoward Hinnant{ 46273e519524SHoward Hinnant _STD::partial_sort(__first, __middle, __last, 46283e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 46293e519524SHoward Hinnant} 46303e519524SHoward Hinnant 46313e519524SHoward Hinnant// partial_sort_copy 46323e519524SHoward Hinnant 46333e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 46343e519524SHoward Hinnant_RandomAccessIterator 46353e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 46363e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 46373e519524SHoward Hinnant{ 46383e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 46393e519524SHoward Hinnant if (__r != __result_last) 46403e519524SHoward Hinnant { 46413e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = 0; 46423e519524SHoward Hinnant for (; __first != __last && __r != __result_last; ++__first, ++__r, ++__len) 46433e519524SHoward Hinnant *__r = *__first; 46443e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 46453e519524SHoward Hinnant for (; __first != __last; ++__first) 46463e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 46473e519524SHoward Hinnant { 46483e519524SHoward Hinnant *__result_first = *__first; 46493e519524SHoward Hinnant __push_heap_front<_Compare>(__result_first, __r, __comp, __len); 46503e519524SHoward Hinnant } 46513e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 46523e519524SHoward Hinnant } 46533e519524SHoward Hinnant return __r; 46543e519524SHoward Hinnant} 46553e519524SHoward Hinnant 46563e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 46573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46583e519524SHoward Hinnant_RandomAccessIterator 46593e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 46603e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 46613e519524SHoward Hinnant{ 46623e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 46633e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46643e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 46653e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 4666b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 46673e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 46683e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 4669b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 46703e519524SHoward Hinnant} 46713e519524SHoward Hinnant 46723e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 46733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46743e519524SHoward Hinnant_RandomAccessIterator 46753e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 46763e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 46773e519524SHoward Hinnant{ 46783e519524SHoward Hinnant return _STD::partial_sort_copy(__first, __last, __result_first, __result_last, 46793e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 46803e519524SHoward Hinnant} 46813e519524SHoward Hinnant 46823e519524SHoward Hinnant// nth_element 46833e519524SHoward Hinnant 46843e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46853e519524SHoward Hinnantvoid 46863e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 46873e519524SHoward Hinnant{ 46883e519524SHoward Hinnant // _Compare is known to be a reference type 46893e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46903e519524SHoward Hinnant const difference_type __limit = 7; 46913e519524SHoward Hinnant while (true) 46923e519524SHoward Hinnant { 46933e519524SHoward Hinnant __restart: 46943e519524SHoward Hinnant difference_type __len = __last - __first; 46953e519524SHoward Hinnant switch (__len) 46963e519524SHoward Hinnant { 46973e519524SHoward Hinnant case 0: 46983e519524SHoward Hinnant case 1: 46993e519524SHoward Hinnant return; 47003e519524SHoward Hinnant case 2: 47013e519524SHoward Hinnant if (__comp(*--__last, *__first)) 47023e519524SHoward Hinnant swap(*__first, *__last); 47033e519524SHoward Hinnant return; 47043e519524SHoward Hinnant case 3: 47053e519524SHoward Hinnant { 47063e519524SHoward Hinnant _RandomAccessIterator __m = __first; 47073e519524SHoward Hinnant _STD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 47083e519524SHoward Hinnant return; 47093e519524SHoward Hinnant } 47103e519524SHoward Hinnant } 47113e519524SHoward Hinnant if (__len <= __limit) 47123e519524SHoward Hinnant { 47133e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 47143e519524SHoward Hinnant return; 47153e519524SHoward Hinnant } 47163e519524SHoward Hinnant // __len > __limit >= 3 47173e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 47183e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 47193e519524SHoward Hinnant unsigned __n_swaps = _STD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 47203e519524SHoward Hinnant // *__m is median 47213e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 47223e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 47233e519524SHoward Hinnant _RandomAccessIterator __i = __first; 47243e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 47253e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 47263e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 47273e519524SHoward Hinnant // Prime the downward search with a guard. 47283e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 47293e519524SHoward Hinnant { 47303e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 47313e519524SHoward Hinnant // manually guard downward moving __j against __i 47323e519524SHoward Hinnant while (true) 47333e519524SHoward Hinnant { 47343e519524SHoward Hinnant if (__i == --__j) 47353e519524SHoward Hinnant { 47363e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 47373e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 47383e519524SHoward Hinnant ++__i; // __first + 1 47393e519524SHoward Hinnant __j = __last; 47403e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 47413e519524SHoward Hinnant { 47423e519524SHoward Hinnant while (true) 47433e519524SHoward Hinnant { 47443e519524SHoward Hinnant if (__i == __j) 47453e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 47463e519524SHoward Hinnant if (__comp(*__first, *__i)) 47473e519524SHoward Hinnant { 47483e519524SHoward Hinnant swap(*__i, *__j); 47493e519524SHoward Hinnant ++__n_swaps; 47503e519524SHoward Hinnant ++__i; 47513e519524SHoward Hinnant break; 47523e519524SHoward Hinnant } 47533e519524SHoward Hinnant ++__i; 47543e519524SHoward Hinnant } 47553e519524SHoward Hinnant } 47563e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 47573e519524SHoward Hinnant if (__i == __j) 47583e519524SHoward Hinnant return; 47593e519524SHoward Hinnant while (true) 47603e519524SHoward Hinnant { 47613e519524SHoward Hinnant while (!__comp(*__first, *__i)) 47623e519524SHoward Hinnant ++__i; 47633e519524SHoward Hinnant while (__comp(*__first, *--__j)) 47643e519524SHoward Hinnant ; 47653e519524SHoward Hinnant if (__i >= __j) 47663e519524SHoward Hinnant break; 47673e519524SHoward Hinnant swap(*__i, *__j); 47683e519524SHoward Hinnant ++__n_swaps; 47693e519524SHoward Hinnant ++__i; 47703e519524SHoward Hinnant } 47713e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 47723e519524SHoward Hinnant // The first part is sorted, 47733e519524SHoward Hinnant if (__nth < __i) 47743e519524SHoward Hinnant return; 47753e519524SHoward Hinnant // __nth_element the secod part 47763e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 47773e519524SHoward Hinnant __first = __i; 47783e519524SHoward Hinnant goto __restart; 47793e519524SHoward Hinnant } 47803e519524SHoward Hinnant if (__comp(*__j, *__m)) 47813e519524SHoward Hinnant { 47823e519524SHoward Hinnant swap(*__i, *__j); 47833e519524SHoward Hinnant ++__n_swaps; 47843e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 47853e519524SHoward Hinnant } 47863e519524SHoward Hinnant } 47873e519524SHoward Hinnant } 47883e519524SHoward Hinnant ++__i; 47893e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 47903e519524SHoward Hinnant // if not yet partitioned... 47913e519524SHoward Hinnant if (__i < __j) 47923e519524SHoward Hinnant { 47933e519524SHoward Hinnant // known that *(__i - 1) < *__m 47943e519524SHoward Hinnant while (true) 47953e519524SHoward Hinnant { 47963e519524SHoward Hinnant // __m still guards upward moving __i 47973e519524SHoward Hinnant while (__comp(*__i, *__m)) 47983e519524SHoward Hinnant ++__i; 47993e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 48003e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 48013e519524SHoward Hinnant ; 48023e519524SHoward Hinnant if (__i >= __j) 48033e519524SHoward Hinnant break; 48043e519524SHoward Hinnant swap(*__i, *__j); 48053e519524SHoward Hinnant ++__n_swaps; 48063e519524SHoward Hinnant // It is known that __m != __j 48073e519524SHoward Hinnant // If __m just moved, follow it 48083e519524SHoward Hinnant if (__m == __i) 48093e519524SHoward Hinnant __m = __j; 48103e519524SHoward Hinnant ++__i; 48113e519524SHoward Hinnant } 48123e519524SHoward Hinnant } 48133e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 48143e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 48153e519524SHoward Hinnant { 48163e519524SHoward Hinnant swap(*__i, *__m); 48173e519524SHoward Hinnant ++__n_swaps; 48183e519524SHoward Hinnant } 48193e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 48203e519524SHoward Hinnant if (__nth == __i) 48213e519524SHoward Hinnant return; 48223e519524SHoward Hinnant if (__n_swaps == 0) 48233e519524SHoward Hinnant { 48243e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 48253e519524SHoward Hinnant if (__nth < __i) 48263e519524SHoward Hinnant { 48273e519524SHoward Hinnant // Check for [__first, __i) already sorted 48283e519524SHoward Hinnant __j = __m = __first; 48293e519524SHoward Hinnant while (++__j != __i) 48303e519524SHoward Hinnant { 48313e519524SHoward Hinnant if (__comp(*__j, *__m)) 48323e519524SHoward Hinnant // not yet sorted, so sort 48333e519524SHoward Hinnant goto not_sorted; 48343e519524SHoward Hinnant __m = __j; 48353e519524SHoward Hinnant } 48363e519524SHoward Hinnant // [__first, __i) sorted 48373e519524SHoward Hinnant return; 48383e519524SHoward Hinnant } 48393e519524SHoward Hinnant else 48403e519524SHoward Hinnant { 48413e519524SHoward Hinnant // Check for [__i, __last) already sorted 48423e519524SHoward Hinnant __j = __m = __i; 48433e519524SHoward Hinnant while (++__j != __last) 48443e519524SHoward Hinnant { 48453e519524SHoward Hinnant if (__comp(*__j, *__m)) 48463e519524SHoward Hinnant // not yet sorted, so sort 48473e519524SHoward Hinnant goto not_sorted; 48483e519524SHoward Hinnant __m = __j; 48493e519524SHoward Hinnant } 48503e519524SHoward Hinnant // [__i, __last) sorted 48513e519524SHoward Hinnant return; 48523e519524SHoward Hinnant } 48533e519524SHoward Hinnant } 48543e519524SHoward Hinnantnot_sorted: 48553e519524SHoward Hinnant // __nth_element on range containing __nth 48563e519524SHoward Hinnant if (__nth < __i) 48573e519524SHoward Hinnant { 48583e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 48593e519524SHoward Hinnant __last = __i; 48603e519524SHoward Hinnant } 48613e519524SHoward Hinnant else 48623e519524SHoward Hinnant { 48633e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 48643e519524SHoward Hinnant __first = ++__i; 48653e519524SHoward Hinnant } 48663e519524SHoward Hinnant } 48673e519524SHoward Hinnant} 48683e519524SHoward Hinnant 48693e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48713e519524SHoward Hinnantvoid 48723e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 48733e519524SHoward Hinnant{ 48743e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 48753e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48763e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48773e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 4878b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 48793e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48803e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 4881b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 48823e519524SHoward Hinnant} 48833e519524SHoward Hinnant 48843e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48863e519524SHoward Hinnantvoid 48873e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 48883e519524SHoward Hinnant{ 48893e519524SHoward Hinnant _STD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48903e519524SHoward Hinnant} 48913e519524SHoward Hinnant 48923e519524SHoward Hinnant// includes 48933e519524SHoward Hinnant 48943e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 48953e519524SHoward Hinnantbool 48963e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 48973e519524SHoward Hinnant _Compare __comp) 48983e519524SHoward Hinnant{ 48993e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 49003e519524SHoward Hinnant { 49013e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 49023e519524SHoward Hinnant return false; 49033e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 49043e519524SHoward Hinnant ++__first2; 49053e519524SHoward Hinnant } 49063e519524SHoward Hinnant return true; 49073e519524SHoward Hinnant} 49083e519524SHoward Hinnant 49093e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 49103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49113e519524SHoward Hinnantbool 49123e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 49133e519524SHoward Hinnant _Compare __comp) 49143e519524SHoward Hinnant{ 49153e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 49163e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49173e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49183e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 4919b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 49203e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49213e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 4922b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 49233e519524SHoward Hinnant} 49243e519524SHoward Hinnant 49253e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 49263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49273e519524SHoward Hinnantbool 49283e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 49293e519524SHoward Hinnant{ 49303e519524SHoward Hinnant return _STD::includes(__first1, __last1, __first2, __last2, 49313e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 49323e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 49333e519524SHoward Hinnant} 49343e519524SHoward Hinnant 49353e519524SHoward Hinnant// set_union 49363e519524SHoward Hinnant 49373e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 49383e519524SHoward Hinnant_OutputIterator 49393e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 49403e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 49413e519524SHoward Hinnant{ 49423e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 49433e519524SHoward Hinnant { 49443e519524SHoward Hinnant if (__first2 == __last2) 49453e519524SHoward Hinnant return _STD::copy(__first1, __last1, __result); 49463e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 49473e519524SHoward Hinnant { 49483e519524SHoward Hinnant *__result = *__first2; 49493e519524SHoward Hinnant ++__first2; 49503e519524SHoward Hinnant } 49513e519524SHoward Hinnant else 49523e519524SHoward Hinnant { 49533e519524SHoward Hinnant *__result = *__first1; 49543e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 49553e519524SHoward Hinnant ++__first2; 49563e519524SHoward Hinnant ++__first1; 49573e519524SHoward Hinnant } 49583e519524SHoward Hinnant } 49593e519524SHoward Hinnant return _STD::copy(__first2, __last2, __result); 49603e519524SHoward Hinnant} 49613e519524SHoward Hinnant 49623e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 49633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49643e519524SHoward Hinnant_OutputIterator 49653e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 49663e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 49673e519524SHoward Hinnant{ 49683e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 49693e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49703e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49713e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4972b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 49733e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49743e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4975b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 49763e519524SHoward Hinnant} 49773e519524SHoward Hinnant 49783e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 49793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49803e519524SHoward Hinnant_OutputIterator 49813e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 49823e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 49833e519524SHoward Hinnant{ 49843e519524SHoward Hinnant return _STD::set_union(__first1, __last1, __first2, __last2, __result, 49853e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 49863e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 49873e519524SHoward Hinnant} 49883e519524SHoward Hinnant 49893e519524SHoward Hinnant// set_intersection 49903e519524SHoward Hinnant 49913e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 49923e519524SHoward Hinnant_OutputIterator 49933e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 49943e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 49953e519524SHoward Hinnant{ 49963e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 49973e519524SHoward Hinnant { 49983e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 49993e519524SHoward Hinnant ++__first1; 50003e519524SHoward Hinnant else 50013e519524SHoward Hinnant { 50023e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 50033e519524SHoward Hinnant { 50043e519524SHoward Hinnant *__result = *__first1; 50053e519524SHoward Hinnant ++__result; 50063e519524SHoward Hinnant ++__first1; 50073e519524SHoward Hinnant } 50083e519524SHoward Hinnant ++__first2; 50093e519524SHoward Hinnant } 50103e519524SHoward Hinnant } 50113e519524SHoward Hinnant return __result; 50123e519524SHoward Hinnant} 50133e519524SHoward Hinnant 50143e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 50153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50163e519524SHoward Hinnant_OutputIterator 50173e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 50183e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 50193e519524SHoward Hinnant{ 50203e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 50213e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50223e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50233e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5024b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 50253e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50263e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5027b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 50283e519524SHoward Hinnant} 50293e519524SHoward Hinnant 50303e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 50313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50323e519524SHoward Hinnant_OutputIterator 50333e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 50343e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 50353e519524SHoward Hinnant{ 50363e519524SHoward Hinnant return _STD::set_intersection(__first1, __last1, __first2, __last2, __result, 50373e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 50383e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 50393e519524SHoward Hinnant} 50403e519524SHoward Hinnant 50413e519524SHoward Hinnant// set_difference 50423e519524SHoward Hinnant 50433e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 50443e519524SHoward Hinnant_OutputIterator 50453e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 50463e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 50473e519524SHoward Hinnant{ 50483e519524SHoward Hinnant while (__first1 != __last1) 50493e519524SHoward Hinnant { 50503e519524SHoward Hinnant if (__first2 == __last2) 50513e519524SHoward Hinnant return _STD::copy(__first1, __last1, __result); 50523e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 50533e519524SHoward Hinnant { 50543e519524SHoward Hinnant *__result = *__first1; 50553e519524SHoward Hinnant ++__result; 50563e519524SHoward Hinnant ++__first1; 50573e519524SHoward Hinnant } 50583e519524SHoward Hinnant else 50593e519524SHoward Hinnant { 50603e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 50613e519524SHoward Hinnant ++__first1; 50623e519524SHoward Hinnant ++__first2; 50633e519524SHoward Hinnant } 50643e519524SHoward Hinnant } 50653e519524SHoward Hinnant return __result; 50663e519524SHoward Hinnant} 50673e519524SHoward Hinnant 50683e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 50693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50703e519524SHoward Hinnant_OutputIterator 50713e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 50723e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 50733e519524SHoward Hinnant{ 50743e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 50753e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50763e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50773e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5078b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 50793e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50803e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5081b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 50823e519524SHoward Hinnant} 50833e519524SHoward Hinnant 50843e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 50853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50863e519524SHoward Hinnant_OutputIterator 50873e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 50883e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 50893e519524SHoward Hinnant{ 50903e519524SHoward Hinnant return _STD::set_difference(__first1, __last1, __first2, __last2, __result, 50913e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 50923e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 50933e519524SHoward Hinnant} 50943e519524SHoward Hinnant 50953e519524SHoward Hinnant// set_symmetric_difference 50963e519524SHoward Hinnant 50973e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 50983e519524SHoward Hinnant_OutputIterator 50993e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 51003e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 51013e519524SHoward Hinnant{ 51023e519524SHoward Hinnant while (__first1 != __last1) 51033e519524SHoward Hinnant { 51043e519524SHoward Hinnant if (__first2 == __last2) 51053e519524SHoward Hinnant return _STD::copy(__first1, __last1, __result); 51063e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 51073e519524SHoward Hinnant { 51083e519524SHoward Hinnant *__result = *__first1; 51093e519524SHoward Hinnant ++__result; 51103e519524SHoward Hinnant ++__first1; 51113e519524SHoward Hinnant } 51123e519524SHoward Hinnant else 51133e519524SHoward Hinnant { 51143e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 51153e519524SHoward Hinnant { 51163e519524SHoward Hinnant *__result = *__first2; 51173e519524SHoward Hinnant ++__result; 51183e519524SHoward Hinnant } 51193e519524SHoward Hinnant else 51203e519524SHoward Hinnant ++__first1; 51213e519524SHoward Hinnant ++__first2; 51223e519524SHoward Hinnant } 51233e519524SHoward Hinnant } 51243e519524SHoward Hinnant return _STD::copy(__first2, __last2, __result); 51253e519524SHoward Hinnant} 51263e519524SHoward Hinnant 51273e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 51283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51293e519524SHoward Hinnant_OutputIterator 51303e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 51313e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 51323e519524SHoward Hinnant{ 51333e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 51343e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51353e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51363e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5137b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 51383e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51393e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5140b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 51413e519524SHoward Hinnant} 51423e519524SHoward Hinnant 51433e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 51443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51453e519524SHoward Hinnant_OutputIterator 51463e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 51473e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 51483e519524SHoward Hinnant{ 51493e519524SHoward Hinnant return _STD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 51503e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 51513e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 51523e519524SHoward Hinnant} 51533e519524SHoward Hinnant 51543e519524SHoward Hinnant// lexicographical_compare 51553e519524SHoward Hinnant 51563e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 51573e519524SHoward Hinnantbool 51583e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 51593e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 51603e519524SHoward Hinnant{ 51613e519524SHoward Hinnant for (; __first2 != __last2; ++__first1, ++__first2) 51623e519524SHoward Hinnant { 51633e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 51643e519524SHoward Hinnant return true; 51653e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 51663e519524SHoward Hinnant return false; 51673e519524SHoward Hinnant } 51683e519524SHoward Hinnant return false; 51693e519524SHoward Hinnant} 51703e519524SHoward Hinnant 51713e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 51723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51733e519524SHoward Hinnantbool 51743e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 51753e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 51763e519524SHoward Hinnant{ 51773e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 51783e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51793e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51803e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5181b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 51823e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51833e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5184b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 51853e519524SHoward Hinnant} 51863e519524SHoward Hinnant 51873e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 51883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51893e519524SHoward Hinnantbool 51903e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 51913e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 51923e519524SHoward Hinnant{ 51933e519524SHoward Hinnant return _STD::lexicographical_compare(__first1, __last1, __first2, __last2, 51943e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 51953e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 51963e519524SHoward Hinnant} 51973e519524SHoward Hinnant 51983e519524SHoward Hinnant// next_permutation 51993e519524SHoward Hinnant 52003e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 52013e519524SHoward Hinnantbool 52023e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 52033e519524SHoward Hinnant{ 52043e519524SHoward Hinnant _BidirectionalIterator __i = __last; 52053e519524SHoward Hinnant if (__first == __last || __first == --__i) 52063e519524SHoward Hinnant return false; 52073e519524SHoward Hinnant while (true) 52083e519524SHoward Hinnant { 52093e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 52103e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 52113e519524SHoward Hinnant { 52123e519524SHoward Hinnant _BidirectionalIterator __j = __last; 52133e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 52143e519524SHoward Hinnant ; 52153e519524SHoward Hinnant swap(*__i, *__j); 52163e519524SHoward Hinnant _STD::reverse(__ip1, __last); 52173e519524SHoward Hinnant return true; 52183e519524SHoward Hinnant } 52193e519524SHoward Hinnant if (__i == __first) 52203e519524SHoward Hinnant { 52213e519524SHoward Hinnant _STD::reverse(__first, __last); 52223e519524SHoward Hinnant return false; 52233e519524SHoward Hinnant } 52243e519524SHoward Hinnant } 52253e519524SHoward Hinnant} 52263e519524SHoward Hinnant 52273e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 52283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52293e519524SHoward Hinnantbool 52303e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 52313e519524SHoward Hinnant{ 52323e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 52333e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52343e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52353e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5236b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 52373e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52383e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5239b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 52403e519524SHoward Hinnant} 52413e519524SHoward Hinnant 52423e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 52433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52443e519524SHoward Hinnantbool 52453e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 52463e519524SHoward Hinnant{ 52473e519524SHoward Hinnant return _STD::next_permutation(__first, __last, 52483e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 52493e519524SHoward Hinnant} 52503e519524SHoward Hinnant 52513e519524SHoward Hinnant// prev_permutation 52523e519524SHoward Hinnant 52533e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 52543e519524SHoward Hinnantbool 52553e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 52563e519524SHoward Hinnant{ 52573e519524SHoward Hinnant _BidirectionalIterator __i = __last; 52583e519524SHoward Hinnant if (__first == __last || __first == --__i) 52593e519524SHoward Hinnant return false; 52603e519524SHoward Hinnant while (true) 52613e519524SHoward Hinnant { 52623e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 52633e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 52643e519524SHoward Hinnant { 52653e519524SHoward Hinnant _BidirectionalIterator __j = __last; 52663e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 52673e519524SHoward Hinnant ; 52683e519524SHoward Hinnant swap(*__i, *__j); 52693e519524SHoward Hinnant _STD::reverse(__ip1, __last); 52703e519524SHoward Hinnant return true; 52713e519524SHoward Hinnant } 52723e519524SHoward Hinnant if (__i == __first) 52733e519524SHoward Hinnant { 52743e519524SHoward Hinnant _STD::reverse(__first, __last); 52753e519524SHoward Hinnant return false; 52763e519524SHoward Hinnant } 52773e519524SHoward Hinnant } 52783e519524SHoward Hinnant} 52793e519524SHoward Hinnant 52803e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 52813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52823e519524SHoward Hinnantbool 52833e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 52843e519524SHoward Hinnant{ 52853e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 52863e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52873e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52883e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5289b3371f6fSHoward Hinnant#else // _LIBCPP_DEBUG 52903e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52913e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5292b3371f6fSHoward Hinnant#endif // _LIBCPP_DEBUG 52933e519524SHoward Hinnant} 52943e519524SHoward Hinnant 52953e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 52963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52973e519524SHoward Hinnantbool 52983e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 52993e519524SHoward Hinnant{ 53003e519524SHoward Hinnant return _STD::prev_permutation(__first, __last, 53013e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 53023e519524SHoward Hinnant} 53033e519524SHoward Hinnant 53043e519524SHoward Hinnanttemplate <class _Tp> 53053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53063e519524SHoward Hinnanttypename enable_if 53073e519524SHoward Hinnant< 53083e519524SHoward Hinnant is_integral<_Tp>::value, 53093e519524SHoward Hinnant _Tp 53103e519524SHoward Hinnant>::type 53113e519524SHoward Hinnant__rotate_left(_Tp __t, _Tp __n = 1) 53123e519524SHoward Hinnant{ 53133e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 53143e519524SHoward Hinnant __n &= __bits; 53153e519524SHoward Hinnant return static_cast<_Tp>((__t << __n) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> (__bits - __n))); 53163e519524SHoward Hinnant} 53173e519524SHoward Hinnant 53183e519524SHoward Hinnanttemplate <class _Tp> 53193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53203e519524SHoward Hinnanttypename enable_if 53213e519524SHoward Hinnant< 53223e519524SHoward Hinnant is_integral<_Tp>::value, 53233e519524SHoward Hinnant _Tp 53243e519524SHoward Hinnant>::type 53253e519524SHoward Hinnant__rotate_right(_Tp __t, _Tp __n = 1) 53263e519524SHoward Hinnant{ 53273e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 53283e519524SHoward Hinnant __n &= __bits; 53293e519524SHoward Hinnant return static_cast<_Tp>((__t << (__bits - __n)) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> __n)); 53303e519524SHoward Hinnant} 53313e519524SHoward Hinnant 53323e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 53333e519524SHoward Hinnant 53343e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5335