13e519524SHoward Hinnant// -*- C++ -*- 23e519524SHoward Hinnant//===-------------------------- algorithm ---------------------------------===// 33e519524SHoward Hinnant// 4*5b08a8a4SHoward Hinnant// The LLVM Compiler Infrastructure 53e519524SHoward Hinnant// 63e519524SHoward Hinnant// This file is distributed under the University of Illinois Open Source 73e519524SHoward Hinnant// License. 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 2573e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 2583e519524SHoward Hinnant bool 2593e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 2603e519524SHoward Hinnant 2613e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 2623e519524SHoward Hinnant ForwardIterator 2633e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 2643e519524SHoward Hinnant 2653e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 2663e519524SHoward Hinnant class OutputIterator2, class Predicate> 2673e519524SHoward Hinnant pair<OutputIterator1, OutputIterator2> 2683e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 2693e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 2703e519524SHoward Hinnant Predicate pred); 2713e519524SHoward Hinnant 2723e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 2733e519524SHoward Hinnant ForwardIterator 2743e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 2753e519524SHoward Hinnant 2763e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 2773e519524SHoward Hinnant ForwardIterator 2783e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 2793e519524SHoward Hinnant 2803e519524SHoward Hinnanttemplate <class ForwardIterator> 2813e519524SHoward Hinnant bool 2823e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 2833e519524SHoward Hinnant 2843e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 2853e519524SHoward Hinnant bool 2863e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 2873e519524SHoward Hinnant 2883e519524SHoward Hinnanttemplate<class ForwardIterator> 2893e519524SHoward Hinnant ForwardIterator 2903e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 2913e519524SHoward Hinnant 2923e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 2933e519524SHoward Hinnant ForwardIterator 2943e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 2953e519524SHoward Hinnant 2963e519524SHoward Hinnanttemplate <class RandomAccessIterator> 2973e519524SHoward Hinnant void 2983e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 2993e519524SHoward Hinnant 3003e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3013e519524SHoward Hinnant void 3023e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3033e519524SHoward Hinnant 3043e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3053e519524SHoward Hinnant void 3063e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 3073e519524SHoward Hinnant 3083e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3093e519524SHoward Hinnant void 3103e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3113e519524SHoward Hinnant 3123e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3133e519524SHoward Hinnant void 3143e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 3153e519524SHoward Hinnant 3163e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3173e519524SHoward Hinnant void 3183e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 3193e519524SHoward Hinnant 3203e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 3213e519524SHoward Hinnant RandomAccessIterator 3223e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3233e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 3243e519524SHoward Hinnant 3253e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 3263e519524SHoward Hinnant RandomAccessIterator 3273e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3283e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 3293e519524SHoward Hinnant 3303e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3313e519524SHoward Hinnant void 3323e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 3333e519524SHoward Hinnant 3343e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3353e519524SHoward Hinnant void 3363e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 3373e519524SHoward Hinnant 3383e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3393e519524SHoward Hinnant ForwardIterator 3403e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 3413e519524SHoward Hinnant 3423e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3433e519524SHoward Hinnant ForwardIterator 3443e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3453e519524SHoward Hinnant 3463e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3473e519524SHoward Hinnant ForwardIterator 3483e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 3493e519524SHoward Hinnant 3503e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3513e519524SHoward Hinnant ForwardIterator 3523e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3533e519524SHoward Hinnant 3543e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3553e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3563e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 3573e519524SHoward Hinnant 3583e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3593e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3603e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3613e519524SHoward Hinnant 3623e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3633e519524SHoward Hinnant bool 3643e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 3653e519524SHoward Hinnant 3663e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3673e519524SHoward Hinnant bool 3683e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3693e519524SHoward Hinnant 3703e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 3713e519524SHoward Hinnant OutputIterator 3723e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 3733e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 3743e519524SHoward Hinnant 3753e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 3763e519524SHoward Hinnant OutputIterator 3773e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 3783e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 3793e519524SHoward Hinnant 3803e519524SHoward Hinnanttemplate <class BidirectionalIterator> 3813e519524SHoward Hinnant void 3823e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 3833e519524SHoward Hinnant 3843e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 3853e519524SHoward Hinnant void 3863e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 3873e519524SHoward Hinnant 3883e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 3893e519524SHoward Hinnant bool 3903e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 3913e519524SHoward Hinnant 3923e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 3933e519524SHoward Hinnant bool 3943e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 3953e519524SHoward Hinnant 3963e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 3973e519524SHoward Hinnant OutputIterator 3983e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 3993e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4003e519524SHoward Hinnant 4013e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4023e519524SHoward Hinnant OutputIterator 4033e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4043e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4053e519524SHoward Hinnant 4063e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4073e519524SHoward Hinnant OutputIterator 4083e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4093e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4103e519524SHoward Hinnant 4113e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4123e519524SHoward Hinnant OutputIterator 4133e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4143e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4153e519524SHoward Hinnant 4163e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4173e519524SHoward Hinnant OutputIterator 4183e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4193e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4203e519524SHoward Hinnant 4213e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4223e519524SHoward Hinnant OutputIterator 4233e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4243e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4253e519524SHoward Hinnant 4263e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4273e519524SHoward Hinnant OutputIterator 4283e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4293e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4303e519524SHoward Hinnant 4313e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4323e519524SHoward Hinnant OutputIterator 4333e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4343e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4353e519524SHoward Hinnant 4363e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4373e519524SHoward Hinnant void 4383e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 4393e519524SHoward Hinnant 4403e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4413e519524SHoward Hinnant void 4423e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4433e519524SHoward Hinnant 4443e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4453e519524SHoward Hinnant void 4463e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 4473e519524SHoward Hinnant 4483e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4493e519524SHoward Hinnant void 4503e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4513e519524SHoward Hinnant 4523e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4533e519524SHoward Hinnant void 4543e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 4553e519524SHoward Hinnant 4563e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4573e519524SHoward Hinnant void 4583e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4593e519524SHoward Hinnant 4603e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4613e519524SHoward Hinnant void 4623e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 4633e519524SHoward Hinnant 4643e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4653e519524SHoward Hinnant void 4663e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4673e519524SHoward Hinnant 4683e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4693e519524SHoward Hinnant bool 4703e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 4713e519524SHoward Hinnant 4723e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4733e519524SHoward Hinnant bool 4743e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 4753e519524SHoward Hinnant 4763e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4773e519524SHoward Hinnant RandomAccessIterator 4783e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 4793e519524SHoward Hinnant 4803e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4813e519524SHoward Hinnant RandomAccessIterator 4823e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 4833e519524SHoward Hinnant 4843e519524SHoward Hinnanttemplate <class T> 4853e519524SHoward Hinnant const T& 4863e519524SHoward Hinnant min(const T& a, const T& b); 4873e519524SHoward Hinnant 4883e519524SHoward Hinnanttemplate <class T, class Compare> 4893e519524SHoward Hinnant const T& 4903e519524SHoward Hinnant min(const T& a, const T& b, Compare comp); 4913e519524SHoward Hinnant 4923e519524SHoward Hinnanttemplate <class T> 4933e519524SHoward Hinnant const T& 4943e519524SHoward Hinnant max(const T& a, const T& b); 4953e519524SHoward Hinnant 4963e519524SHoward Hinnanttemplate <class T, class Compare> 4973e519524SHoward Hinnant const T& 4983e519524SHoward Hinnant max(const T& a, const T& b, Compare comp); 4993e519524SHoward Hinnant 5003e519524SHoward Hinnanttemplate <class ForwardIterator> 5013e519524SHoward Hinnant ForwardIterator 5023e519524SHoward Hinnant min_element(ForwardIterator first, ForwardIterator last); 5033e519524SHoward Hinnant 5043e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5053e519524SHoward Hinnant ForwardIterator 5063e519524SHoward Hinnant min_element(ForwardIterator first, ForwardIterator last, Compare comp); 5073e519524SHoward Hinnant 5083e519524SHoward Hinnanttemplate <class ForwardIterator> 5093e519524SHoward Hinnant ForwardIterator 5103e519524SHoward Hinnant max_element(ForwardIterator first, ForwardIterator last); 5113e519524SHoward Hinnant 5123e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5133e519524SHoward Hinnant ForwardIterator 5143e519524SHoward Hinnant max_element(ForwardIterator first, ForwardIterator last, Compare comp); 5153e519524SHoward Hinnant 5163e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 5173e519524SHoward Hinnant bool 5183e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 5193e519524SHoward Hinnant 5203e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 5213e519524SHoward Hinnant bool 5223e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 5233e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 5243e519524SHoward Hinnant 5253e519524SHoward Hinnanttemplate <class BidirectionalIterator> 5263e519524SHoward Hinnant bool 5273e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 5283e519524SHoward Hinnant 5293e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 5303e519524SHoward Hinnant bool 5313e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 5323e519524SHoward Hinnant 5333e519524SHoward Hinnanttemplate <class BidirectionalIterator> 5343e519524SHoward Hinnant bool 5353e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 5363e519524SHoward Hinnant 5373e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 5383e519524SHoward Hinnant bool 5393e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 5403e519524SHoward Hinnant 5413e519524SHoward Hinnant} // std 5423e519524SHoward Hinnant 5433e519524SHoward Hinnant*/ 5443e519524SHoward Hinnant 5453e519524SHoward Hinnant#include <__config> 5463e519524SHoward Hinnant#include <initializer_list> 5473e519524SHoward Hinnant#include <type_traits> 5483e519524SHoward Hinnant#include <cstring> 5493e519524SHoward Hinnant#include <utility> 5503e519524SHoward Hinnant#include <memory> 5513e519524SHoward Hinnant#include <iterator> 5523e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 5533e519524SHoward Hinnant#include <cassert> 5543e519524SHoward Hinnant#endif 5553e519524SHoward Hinnant//#include <cstdlib> 5563e519524SHoward Hinnant#define RAND_MAX 0x7fffffff // #include <cstdlib> 5573e519524SHoward Hinnantextern "C" int rand(void); // #include <cstdlib> 5583e519524SHoward Hinnant 5593e519524SHoward Hinnant#pragma GCC system_header 5603e519524SHoward Hinnant 5613e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 5623e519524SHoward Hinnant 5633e519524SHoward Hinnantusing ::rand; // #include <cstdlib> 5643e519524SHoward Hinnant 5653e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 5663e519524SHoward Hinnantstruct __equal_to 5673e519524SHoward Hinnant{ 5683e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 5693e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 5703e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 5713e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 5723e519524SHoward Hinnant}; 5733e519524SHoward Hinnant 5743e519524SHoward Hinnanttemplate <class _T1> 5753e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 5763e519524SHoward Hinnant{ 5773e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 5783e519524SHoward Hinnant}; 5793e519524SHoward Hinnant 5803e519524SHoward Hinnanttemplate <class _T1> 5813e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 5823e519524SHoward Hinnant{ 5833e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 5843e519524SHoward Hinnant}; 5853e519524SHoward Hinnant 5863e519524SHoward Hinnanttemplate <class _T1> 5873e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 5883e519524SHoward Hinnant{ 5893e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 5903e519524SHoward Hinnant}; 5913e519524SHoward Hinnant 5923e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 5933e519524SHoward Hinnantstruct __less 5943e519524SHoward Hinnant{ 5953e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 5963e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 5973e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 5983e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 5993e519524SHoward Hinnant}; 6003e519524SHoward Hinnant 6013e519524SHoward Hinnanttemplate <class _T1> 6023e519524SHoward Hinnantstruct __less<_T1, _T1> 6033e519524SHoward Hinnant{ 6043e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6053e519524SHoward Hinnant}; 6063e519524SHoward Hinnant 6073e519524SHoward Hinnanttemplate <class _T1> 6083e519524SHoward Hinnantstruct __less<const _T1, _T1> 6093e519524SHoward Hinnant{ 6103e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6113e519524SHoward Hinnant}; 6123e519524SHoward Hinnant 6133e519524SHoward Hinnanttemplate <class _T1> 6143e519524SHoward Hinnantstruct __less<_T1, const _T1> 6153e519524SHoward Hinnant{ 6163e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6173e519524SHoward Hinnant}; 6183e519524SHoward Hinnant 6193e519524SHoward Hinnanttemplate <class _Predicate> 6203e519524SHoward Hinnantclass __negate 6213e519524SHoward Hinnant{ 6223e519524SHoward Hinnantprivate: 6233e519524SHoward Hinnant _Predicate __p_; 6243e519524SHoward Hinnantpublic: 6253e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY __negate() {} 6263e519524SHoward Hinnant 6273e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 6283e519524SHoward Hinnant explicit __negate(_Predicate __p) : __p_(__p) {} 6293e519524SHoward Hinnant 6303e519524SHoward Hinnant template <class _T1> 6313e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 6323e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 6333e519524SHoward Hinnant 6343e519524SHoward Hinnant template <class _T1, class _T2> 6353e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 6363e519524SHoward Hinnant bool operator()(const _T1& __x, const _T2& __y) {return !__p_(__x, __y);} 6373e519524SHoward Hinnant}; 6383e519524SHoward Hinnant 6393e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 6403e519524SHoward Hinnant 6413e519524SHoward Hinnanttemplate <class _Compare> 6423e519524SHoward Hinnantstruct __debug_less 6433e519524SHoward Hinnant{ 6443e519524SHoward Hinnant _Compare __comp_; 6453e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 6463e519524SHoward Hinnant template <class _Tp, class _Up> 6473e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 6483e519524SHoward Hinnant { 6493e519524SHoward Hinnant bool __r = __comp_(__x, __y); 6503e519524SHoward Hinnant if (__r) 6513e519524SHoward Hinnant assert(!__comp_(__y, __x)); 6523e519524SHoward Hinnant return __r; 6533e519524SHoward Hinnant } 6543e519524SHoward Hinnant}; 6553e519524SHoward Hinnant 6563e519524SHoward Hinnant#endif // _LIBCPP_DEBUG 6573e519524SHoward Hinnant 6583e519524SHoward Hinnant// all_of 6593e519524SHoward Hinnant 6603e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 6613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 6623e519524SHoward Hinnantbool 6633e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 6643e519524SHoward Hinnant{ 6653e519524SHoward Hinnant for (; __first != __last; ++__first) 6663e519524SHoward Hinnant if (!__pred(*__first)) 6673e519524SHoward Hinnant return false; 6683e519524SHoward Hinnant return true; 6693e519524SHoward Hinnant} 6703e519524SHoward Hinnant 6713e519524SHoward Hinnant// any_of 6723e519524SHoward Hinnant 6733e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 6743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 6753e519524SHoward Hinnantbool 6763e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 6773e519524SHoward Hinnant{ 6783e519524SHoward Hinnant for (; __first != __last; ++__first) 6793e519524SHoward Hinnant if (__pred(*__first)) 6803e519524SHoward Hinnant return true; 6813e519524SHoward Hinnant return false; 6823e519524SHoward Hinnant} 6833e519524SHoward Hinnant 6843e519524SHoward Hinnant// none_of 6853e519524SHoward Hinnant 6863e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 6873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 6883e519524SHoward Hinnantbool 6893e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 6903e519524SHoward Hinnant{ 6913e519524SHoward Hinnant for (; __first != __last; ++__first) 6923e519524SHoward Hinnant if (__pred(*__first)) 6933e519524SHoward Hinnant return false; 6943e519524SHoward Hinnant return true; 6953e519524SHoward Hinnant} 6963e519524SHoward Hinnant 6973e519524SHoward Hinnant// for_each 6983e519524SHoward Hinnant 6993e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 7003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7013e519524SHoward Hinnant_Function 7023e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 7033e519524SHoward Hinnant{ 7043e519524SHoward Hinnant for (; __first != __last; ++__first) 7053e519524SHoward Hinnant __f(*__first); 7063e519524SHoward Hinnant return _STD::move(__f); 7073e519524SHoward Hinnant} 7083e519524SHoward Hinnant 7093e519524SHoward Hinnant// find 7103e519524SHoward Hinnant 7113e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 7123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7133e519524SHoward Hinnant_InputIterator 7143e519524SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value) 7153e519524SHoward Hinnant{ 7163e519524SHoward Hinnant for (; __first != __last; ++__first) 7173e519524SHoward Hinnant if (*__first == __value) 7183e519524SHoward Hinnant break; 7193e519524SHoward Hinnant return __first; 7203e519524SHoward Hinnant} 7213e519524SHoward Hinnant 7223e519524SHoward Hinnant// find_if 7233e519524SHoward Hinnant 7243e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 7253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7263e519524SHoward Hinnant_InputIterator 7273e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7283e519524SHoward Hinnant{ 7293e519524SHoward Hinnant for (; __first != __last; ++__first) 7303e519524SHoward Hinnant if (__pred(*__first)) 7313e519524SHoward Hinnant break; 7323e519524SHoward Hinnant return __first; 7333e519524SHoward Hinnant} 7343e519524SHoward Hinnant 7353e519524SHoward Hinnant// find_if_not 7363e519524SHoward Hinnant 7373e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 7383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 7393e519524SHoward Hinnant_InputIterator 7403e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7413e519524SHoward Hinnant{ 7423e519524SHoward Hinnant for (; __first != __last; ++__first) 7433e519524SHoward Hinnant if (!__pred(*__first)) 7443e519524SHoward Hinnant break; 7453e519524SHoward Hinnant return __first; 7463e519524SHoward Hinnant} 7473e519524SHoward Hinnant 7483e519524SHoward Hinnant// find_end 7493e519524SHoward Hinnant 7503e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 7513e519524SHoward Hinnant_ForwardIterator1 7523e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 7533e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 7543e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 7553e519524SHoward Hinnant{ 7563e519524SHoward Hinnant // modeled after search algorithm 7573e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 7583e519524SHoward Hinnant if (__first2 == __last2) 7593e519524SHoward Hinnant return __r; 7603e519524SHoward Hinnant while (true) 7613e519524SHoward Hinnant { 7623e519524SHoward Hinnant while (true) 7633e519524SHoward Hinnant { 7643e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 7653e519524SHoward Hinnant return __r; // (or __last1 if never found) 7663e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 7673e519524SHoward Hinnant break; 7683e519524SHoward Hinnant ++__first1; 7693e519524SHoward Hinnant } 7703e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 7713e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 7723e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 7733e519524SHoward Hinnant while (true) 7743e519524SHoward Hinnant { 7753e519524SHoward Hinnant if (++__m2 == __last2) 7763e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 7773e519524SHoward Hinnant __r = __first1; 7783e519524SHoward Hinnant ++__first1; 7793e519524SHoward Hinnant break; 7803e519524SHoward Hinnant } 7813e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 7823e519524SHoward Hinnant return __r; 7833e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 7843e519524SHoward Hinnant { 7853e519524SHoward Hinnant ++__first1; 7863e519524SHoward Hinnant break; 7873e519524SHoward Hinnant } // else there is a match, check next elements 7883e519524SHoward Hinnant } 7893e519524SHoward Hinnant } 7903e519524SHoward Hinnant} 7913e519524SHoward Hinnant 7923e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 7933e519524SHoward Hinnant_BidirectionalIterator1 7943e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 7953e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 7963e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 7973e519524SHoward Hinnant{ 7983e519524SHoward Hinnant // modeled after search algorithm (in reverse) 7993e519524SHoward Hinnant if (__first2 == __last2) 8003e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 8013e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 8023e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 8033e519524SHoward Hinnant --__l2; 8043e519524SHoward Hinnant while (true) 8053e519524SHoward Hinnant { 8063e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 8073e519524SHoward Hinnant while (true) 8083e519524SHoward Hinnant { 8093e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 8103e519524SHoward Hinnant return __last1; 8113e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 8123e519524SHoward Hinnant break; 8133e519524SHoward Hinnant } 8143e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 8153e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 8163e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 8173e519524SHoward Hinnant while (true) 8183e519524SHoward Hinnant { 8193e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 8203e519524SHoward Hinnant return __m1; 8213e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 8223e519524SHoward Hinnant return __last1; 8233e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 8243e519524SHoward Hinnant { 8253e519524SHoward Hinnant break; 8263e519524SHoward Hinnant } // else there is a match, check next elements 8273e519524SHoward Hinnant } 8283e519524SHoward Hinnant } 8293e519524SHoward Hinnant} 8303e519524SHoward Hinnant 8313e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 8323e519524SHoward Hinnant_RandomAccessIterator1 8333e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 8343e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 8353e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 8363e519524SHoward Hinnant{ 8373e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 8383e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 8393e519524SHoward Hinnant if (__len2 == 0) 8403e519524SHoward Hinnant return __last1; 8413e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 8423e519524SHoward Hinnant if (__len1 < __len2) 8433e519524SHoward Hinnant return __last1; 8443e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 8453e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 8463e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 8473e519524SHoward Hinnant --__l2; 8483e519524SHoward Hinnant while (true) 8493e519524SHoward Hinnant { 8503e519524SHoward Hinnant while (true) 8513e519524SHoward Hinnant { 8523e519524SHoward Hinnant if (__s == __l1) 8533e519524SHoward Hinnant return __last1; 8543e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 8553e519524SHoward Hinnant break; 8563e519524SHoward Hinnant } 8573e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 8583e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 8593e519524SHoward Hinnant while (true) 8603e519524SHoward Hinnant { 8613e519524SHoward Hinnant if (__m2 == __first2) 8623e519524SHoward Hinnant return __m1; 8633e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 8643e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 8653e519524SHoward Hinnant { 8663e519524SHoward Hinnant break; 8673e519524SHoward Hinnant } 8683e519524SHoward Hinnant } 8693e519524SHoward Hinnant } 8703e519524SHoward Hinnant} 8713e519524SHoward Hinnant 8723e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 8733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8743e519524SHoward Hinnant_ForwardIterator1 8753e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 8763e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 8773e519524SHoward Hinnant{ 8783e519524SHoward Hinnant return _STD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 8793e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 8803e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 8813e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 8823e519524SHoward Hinnant} 8833e519524SHoward Hinnant 8843e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 8853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8863e519524SHoward Hinnant_ForwardIterator1 8873e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 8883e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 8893e519524SHoward Hinnant{ 8903e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 8913e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 8923e519524SHoward Hinnant return _STD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 8933e519524SHoward Hinnant} 8943e519524SHoward Hinnant 8953e519524SHoward Hinnant// find_first_of 8963e519524SHoward Hinnant 8973e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 8983e519524SHoward Hinnant_ForwardIterator1 8993e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9003e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 9013e519524SHoward Hinnant{ 9023e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 9033e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 9043e519524SHoward Hinnant if (__pred(*__first1, *__j)) 9053e519524SHoward Hinnant return __first1; 9063e519524SHoward Hinnant return __last1; 9073e519524SHoward Hinnant} 9083e519524SHoward Hinnant 9093e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 9103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9113e519524SHoward Hinnant_ForwardIterator1 9123e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9133e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 9143e519524SHoward Hinnant{ 9153e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 9163e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 9173e519524SHoward Hinnant return _STD::find_first_of(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 9183e519524SHoward Hinnant} 9193e519524SHoward Hinnant 9203e519524SHoward Hinnant// adjacent_find 9213e519524SHoward Hinnant 9223e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 9233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9243e519524SHoward Hinnant_ForwardIterator 9253e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 9263e519524SHoward Hinnant{ 9273e519524SHoward Hinnant if (__first != __last) 9283e519524SHoward Hinnant { 9293e519524SHoward Hinnant _ForwardIterator __i = __first; 9303e519524SHoward Hinnant while (++__i != __last) 9313e519524SHoward Hinnant { 9323e519524SHoward Hinnant if (__pred(*__first, *__i)) 9333e519524SHoward Hinnant return __first; 9343e519524SHoward Hinnant __first = __i; 9353e519524SHoward Hinnant } 9363e519524SHoward Hinnant } 9373e519524SHoward Hinnant return __last; 9383e519524SHoward Hinnant} 9393e519524SHoward Hinnant 9403e519524SHoward Hinnanttemplate <class _ForwardIterator> 9413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9423e519524SHoward Hinnant_ForwardIterator 9433e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 9443e519524SHoward Hinnant{ 9453e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 9463e519524SHoward Hinnant return _STD::adjacent_find(__first, __last, __equal_to<__v>()); 9473e519524SHoward Hinnant} 9483e519524SHoward Hinnant 9493e519524SHoward Hinnant// count 9503e519524SHoward Hinnant 9513e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 9523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9533e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 9543e519524SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value) 9553e519524SHoward Hinnant{ 9563e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 9573e519524SHoward Hinnant for (; __first != __last; ++__first) 9583e519524SHoward Hinnant if (*__first == __value) 9593e519524SHoward Hinnant ++__r; 9603e519524SHoward Hinnant return __r; 9613e519524SHoward Hinnant} 9623e519524SHoward Hinnant 9633e519524SHoward Hinnant// count_if 9643e519524SHoward Hinnant 9653e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 9663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9673e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 9683e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9693e519524SHoward Hinnant{ 9703e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 9713e519524SHoward Hinnant for (; __first != __last; ++__first) 9723e519524SHoward Hinnant if (__pred(*__first)) 9733e519524SHoward Hinnant ++__r; 9743e519524SHoward Hinnant return __r; 9753e519524SHoward Hinnant} 9763e519524SHoward Hinnant 9773e519524SHoward Hinnant// mismatch 9783e519524SHoward Hinnant 9793e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 9803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9813e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 9823e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 9833e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 9843e519524SHoward Hinnant{ 9853e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 9863e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 9873e519524SHoward Hinnant break; 9883e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 9893e519524SHoward Hinnant} 9903e519524SHoward Hinnant 9913e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 9923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9933e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 9943e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 9953e519524SHoward Hinnant{ 9963e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 9973e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 9983e519524SHoward Hinnant return _STD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 9993e519524SHoward Hinnant} 10003e519524SHoward Hinnant 10013e519524SHoward Hinnant// equal 10023e519524SHoward Hinnant 10033e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 10043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10053e519524SHoward Hinnantbool 10063e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 10073e519524SHoward Hinnant{ 10083e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 10093e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 10103e519524SHoward Hinnant return false; 10113e519524SHoward Hinnant return true; 10123e519524SHoward Hinnant} 10133e519524SHoward Hinnant 10143e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 10153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10163e519524SHoward Hinnantbool 10173e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 10183e519524SHoward Hinnant{ 10193e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 10203e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 10213e519524SHoward Hinnant return _STD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 10223e519524SHoward Hinnant} 10233e519524SHoward Hinnant 10243e519524SHoward Hinnant// is_permutation 10253e519524SHoward Hinnant 10263e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10273e519524SHoward Hinnantbool 10283e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10293e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 10303e519524SHoward Hinnant{ 10313e519524SHoward Hinnant // shorten sequences as much as possible by lopping of any equal parts 10323e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2) 10333e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 10343e519524SHoward Hinnant goto __not_done; 10353e519524SHoward Hinnant return true; 10363e519524SHoward Hinnant__not_done: 10373e519524SHoward Hinnant // __first1 != __last1 && *__first1 != *__first2 10383e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 10393e519524SHoward Hinnant _D1 __l1 = _STD::distance(__first1, __last1); 10403e519524SHoward Hinnant if (__l1 == _D1(1)) 10413e519524SHoward Hinnant return false; 10423e519524SHoward Hinnant _ForwardIterator2 __last2 = _STD::next(__first2, __l1); 10433e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 10443e519524SHoward Hinnant // equal elements in [f2, l2) 10453e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 10463e519524SHoward Hinnant { 10473e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 10483e519524SHoward Hinnant for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 10493e519524SHoward Hinnant if (__pred(*__j, *__i)) 10503e519524SHoward Hinnant goto __next_iter; 10513e519524SHoward Hinnant { 10523e519524SHoward Hinnant // Count number of *__i in [f2, l2) 10533e519524SHoward Hinnant _D1 __c2 = 0; 10543e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 10553e519524SHoward Hinnant if (__pred(*__i, *__j)) 10563e519524SHoward Hinnant ++__c2; 10573e519524SHoward Hinnant if (__c2 == 0) 10583e519524SHoward Hinnant return false; 10593e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 10603e519524SHoward Hinnant _D1 __c1 = 1; 10613e519524SHoward Hinnant for (_ForwardIterator1 __j = _STD::next(__i); __j != __last1; ++__j) 10623e519524SHoward Hinnant if (__pred(*__i, *__j)) 10633e519524SHoward Hinnant ++__c1; 10643e519524SHoward Hinnant if (__c1 != __c2) 10653e519524SHoward Hinnant return false; 10663e519524SHoward Hinnant } 10673e519524SHoward Hinnant__next_iter:; 10683e519524SHoward Hinnant } 10693e519524SHoward Hinnant return true; 10703e519524SHoward Hinnant} 10713e519524SHoward Hinnant 10723e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 10733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10743e519524SHoward Hinnantbool 10753e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10763e519524SHoward Hinnant _ForwardIterator2 __first2) 10773e519524SHoward Hinnant{ 10783e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10793e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 10803e519524SHoward Hinnant return _STD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 10813e519524SHoward Hinnant} 10823e519524SHoward Hinnant 10833e519524SHoward Hinnant// search 10843e519524SHoward Hinnant 10853e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 10863e519524SHoward Hinnant_ForwardIterator1 10873e519524SHoward Hinnant__search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10883e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 10893e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 10903e519524SHoward Hinnant{ 10913e519524SHoward Hinnant if (__first2 == __last2) 10923e519524SHoward Hinnant return __first1; // Everything matches an empty sequence 10933e519524SHoward Hinnant while (true) 10943e519524SHoward Hinnant { 10953e519524SHoward Hinnant // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks 10963e519524SHoward Hinnant while (true) 10973e519524SHoward Hinnant { 10983e519524SHoward Hinnant if (__first1 == __last1) // return __last1 if no element matches *__first2 10993e519524SHoward Hinnant return __last1; 11003e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 11013e519524SHoward Hinnant break; 11023e519524SHoward Hinnant ++__first1; 11033e519524SHoward Hinnant } 11043e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 11053e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 11063e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 11073e519524SHoward Hinnant while (true) 11083e519524SHoward Hinnant { 11093e519524SHoward Hinnant if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern) 11103e519524SHoward Hinnant return __first1; 11113e519524SHoward Hinnant if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found 11123e519524SHoward Hinnant return __last1; 11133e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1 11143e519524SHoward Hinnant { 11153e519524SHoward Hinnant ++__first1; 11163e519524SHoward Hinnant break; 11173e519524SHoward Hinnant } // else there is a match, check next elements 11183e519524SHoward Hinnant } 11193e519524SHoward Hinnant } 11203e519524SHoward Hinnant} 11213e519524SHoward Hinnant 11223e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 11233e519524SHoward Hinnant_RandomAccessIterator1 11243e519524SHoward Hinnant__search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 11253e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 11263e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 11273e519524SHoward Hinnant{ 11283e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type _D1; 11293e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator2>::difference_type _D2; 11303e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 11313e519524SHoward Hinnant _D2 __len2 = __last2 - __first2; 11323e519524SHoward Hinnant if (__len2 == 0) 11333e519524SHoward Hinnant return __first1; 11343e519524SHoward Hinnant _D1 __len1 = __last1 - __first1; 11353e519524SHoward Hinnant if (__len1 < __len2) 11363e519524SHoward Hinnant return __last1; 11373e519524SHoward Hinnant const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here 11383e519524SHoward Hinnant while (true) 11393e519524SHoward Hinnant { 11403e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 11413e519524SHoward Hinnant while (true) 11423e519524SHoward Hinnant { 11433e519524SHoward Hinnant if (__first1 == __s) 11443e519524SHoward Hinnant return __last1; 11453e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 11463e519524SHoward Hinnant break; 11473e519524SHoward Hinnant ++__first1; 11483e519524SHoward Hinnant } 11493e519524SHoward Hinnant#else // _LIBCPP_UNROLL_LOOPS 11503e519524SHoward Hinnant for (_D1 __loop_unroll = (__s - __first1) / 4; __loop_unroll > 0; --__loop_unroll) 11513e519524SHoward Hinnant { 11523e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 11533e519524SHoward Hinnant goto __phase2; 11543e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 11553e519524SHoward Hinnant goto __phase2; 11563e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 11573e519524SHoward Hinnant goto __phase2; 11583e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 11593e519524SHoward Hinnant goto __phase2; 11603e519524SHoward Hinnant ++__first1; 11613e519524SHoward Hinnant } 11623e519524SHoward Hinnant switch (__s - __first1) 11633e519524SHoward Hinnant { 11643e519524SHoward Hinnant case 3: 11653e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 11663e519524SHoward Hinnant break; 11673e519524SHoward Hinnant ++__first1; 11683e519524SHoward Hinnant case 2: 11693e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 11703e519524SHoward Hinnant break; 11713e519524SHoward Hinnant ++__first1; 11723e519524SHoward Hinnant case 1: 11733e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 11743e519524SHoward Hinnant break; 11753e519524SHoward Hinnant case 0: 11763e519524SHoward Hinnant return __last1; 11773e519524SHoward Hinnant } 11783e519524SHoward Hinnant __phase2: 11793e519524SHoward Hinnant#endif // _LIBCPP_UNROLL_LOOPS 11803e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __first1; 11813e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __first2; 11823e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 11833e519524SHoward Hinnant while (true) 11843e519524SHoward Hinnant { 11853e519524SHoward Hinnant if (++__m2 == __last2) 11863e519524SHoward Hinnant return __first1; 11873e519524SHoward Hinnant ++__m1; // no need to check range on __m1 because __s guarantees we have enough source 11883e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 11893e519524SHoward Hinnant { 11903e519524SHoward Hinnant ++__first1; 11913e519524SHoward Hinnant break; 11923e519524SHoward Hinnant } 11933e519524SHoward Hinnant } 11943e519524SHoward Hinnant#else // _LIBCPP_UNROLL_LOOPS 11953e519524SHoward Hinnant ++__m2; 11963e519524SHoward Hinnant ++__m1; 11973e519524SHoward Hinnant for (_D2 __loop_unroll = (__last2 - __m2) / 4; __loop_unroll > 0; --__loop_unroll) 11983e519524SHoward Hinnant { 11993e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12003e519524SHoward Hinnant goto __continue; 12013e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 12023e519524SHoward Hinnant goto __continue; 12033e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 12043e519524SHoward Hinnant goto __continue; 12053e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 12063e519524SHoward Hinnant goto __continue; 12073e519524SHoward Hinnant ++__m1; 12083e519524SHoward Hinnant ++__m2; 12093e519524SHoward Hinnant } 12103e519524SHoward Hinnant switch (__last2 - __m2) 12113e519524SHoward Hinnant { 12123e519524SHoward Hinnant case 3: 12133e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12143e519524SHoward Hinnant break; 12153e519524SHoward Hinnant ++__m1; 12163e519524SHoward Hinnant ++__m2; 12173e519524SHoward Hinnant case 2: 12183e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12193e519524SHoward Hinnant break; 12203e519524SHoward Hinnant ++__m1; 12213e519524SHoward Hinnant ++__m2; 12223e519524SHoward Hinnant case 1: 12233e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 12243e519524SHoward Hinnant break; 12253e519524SHoward Hinnant case 0: 12263e519524SHoward Hinnant return __first1; 12273e519524SHoward Hinnant } 12283e519524SHoward Hinnant __continue: 12293e519524SHoward Hinnant ++__first1; 12303e519524SHoward Hinnant#endif // _LIBCPP_UNROLL_LOOPS 12313e519524SHoward Hinnant } 12323e519524SHoward Hinnant} 12333e519524SHoward Hinnant 12343e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 12353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12363e519524SHoward Hinnant_ForwardIterator1 12373e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12383e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 12393e519524SHoward Hinnant{ 12403e519524SHoward Hinnant return _STD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 12413e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 12423e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator1>::iterator_category(), 12433e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator2>::iterator_category()); 12443e519524SHoward Hinnant} 12453e519524SHoward Hinnant 12463e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 12473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12483e519524SHoward Hinnant_ForwardIterator1 12493e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12503e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 12513e519524SHoward Hinnant{ 12523e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator1>::value_type __v1; 12533e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator2>::value_type __v2; 12543e519524SHoward Hinnant return _STD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 12553e519524SHoward Hinnant} 12563e519524SHoward Hinnant 12573e519524SHoward Hinnant// search_n 12583e519524SHoward Hinnant 12593e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 12603e519524SHoward Hinnant_ForwardIterator 12613e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 12623e519524SHoward Hinnant _Size __count, const _Tp& __value, _BinaryPredicate __pred, forward_iterator_tag) 12633e519524SHoward Hinnant{ 12643e519524SHoward Hinnant if (__count <= 0) 12653e519524SHoward Hinnant return __first; 12663e519524SHoward Hinnant while (true) 12673e519524SHoward Hinnant { 12683e519524SHoward Hinnant // Find first element in sequence that matchs __value, with a mininum of loop checks 12693e519524SHoward Hinnant while (true) 12703e519524SHoward Hinnant { 12713e519524SHoward Hinnant if (__first == __last) // return __last if no element matches __value 12723e519524SHoward Hinnant return __last; 12733e519524SHoward Hinnant if (__pred(*__first, __value)) 12743e519524SHoward Hinnant break; 12753e519524SHoward Hinnant ++__first; 12763e519524SHoward Hinnant } 12773e519524SHoward Hinnant // *__first matches __value, now match elements after here 12783e519524SHoward Hinnant _ForwardIterator __m = __first; 12793e519524SHoward Hinnant _Size __c(0); 12803e519524SHoward Hinnant while (true) 12813e519524SHoward Hinnant { 12823e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 12833e519524SHoward Hinnant return __first; 12843e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 12853e519524SHoward Hinnant return __last; 12863e519524SHoward Hinnant if (!__pred(*__m, __value)) // if there is a mismatch, restart with a new __first 12873e519524SHoward Hinnant { 12883e519524SHoward Hinnant __first = __m; 12893e519524SHoward Hinnant ++__first; 12903e519524SHoward Hinnant break; 12913e519524SHoward Hinnant } // else there is a match, check next elements 12923e519524SHoward Hinnant } 12933e519524SHoward Hinnant } 12943e519524SHoward Hinnant} 12953e519524SHoward Hinnant 12963e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 12973e519524SHoward Hinnant_RandomAccessIterator 12983e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 12993e519524SHoward Hinnant _Size __count, const _Tp& __value, _BinaryPredicate __pred, random_access_iterator_tag) 13003e519524SHoward Hinnant{ 13013e519524SHoward Hinnant if (__count <= 0) 13023e519524SHoward Hinnant return __first; 13033e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 13043e519524SHoward Hinnant if (__len < __count) 13053e519524SHoward Hinnant return __last; 13063e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 13073e519524SHoward Hinnant while (true) 13083e519524SHoward Hinnant { 13093e519524SHoward Hinnant // Find first element in sequence that matchs __value, with a mininum of loop checks 13103e519524SHoward Hinnant while (true) 13113e519524SHoward Hinnant { 13123e519524SHoward Hinnant if (__first == __s) // return __last if no element matches __value 13133e519524SHoward Hinnant return __last; 13143e519524SHoward Hinnant if (__pred(*__first, __value)) 13153e519524SHoward Hinnant break; 13163e519524SHoward Hinnant ++__first; 13173e519524SHoward Hinnant } 13183e519524SHoward Hinnant // *__first matches __value, now match elements after here 13193e519524SHoward Hinnant _RandomAccessIterator __m = __first; 13203e519524SHoward Hinnant _Size __c(0); 13213e519524SHoward Hinnant while (true) 13223e519524SHoward Hinnant { 13233e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 13243e519524SHoward Hinnant return __first; 13253e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 13263e519524SHoward Hinnant if (!__pred(*__m, __value)) // if there is a mismatch, restart with a new __first 13273e519524SHoward Hinnant { 13283e519524SHoward Hinnant __first = __m; 13293e519524SHoward Hinnant ++__first; 13303e519524SHoward Hinnant break; 13313e519524SHoward Hinnant } // else there is a match, check next elements 13323e519524SHoward Hinnant } 13333e519524SHoward Hinnant } 13343e519524SHoward Hinnant} 13353e519524SHoward Hinnant 13363e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 13373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13383e519524SHoward Hinnant_ForwardIterator 13393e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 13403e519524SHoward Hinnant _Size __count, const _Tp& __value, _BinaryPredicate __pred) 13413e519524SHoward Hinnant{ 13423e519524SHoward Hinnant return _STD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 13433e519524SHoward Hinnant (__first, __last, __count, __value, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 13443e519524SHoward Hinnant} 13453e519524SHoward Hinnant 13463e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 13473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13483e519524SHoward Hinnant_ForwardIterator 13493e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value) 13503e519524SHoward Hinnant{ 13513e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 13523e519524SHoward Hinnant return _STD::search_n(__first, __last, __count, __value, __equal_to<__v, _Tp>()); 13533e519524SHoward Hinnant} 13543e519524SHoward Hinnant 13553e519524SHoward Hinnant// copy 13563e519524SHoward Hinnant 13573e519524SHoward Hinnanttemplate <class _Iter> 13583e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator 13593e519524SHoward Hinnant{ 13603e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 13613e519524SHoward Hinnant}; 13623e519524SHoward Hinnant 13633e519524SHoward Hinnanttemplate <class _Iter> 13643e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<move_iterator<_Iter> > 13653e519524SHoward Hinnant{ 13663e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 13673e519524SHoward Hinnant}; 13683e519524SHoward Hinnant 13693e519524SHoward Hinnanttemplate <class _Iter> 13703e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<__wrap_iter<_Iter> > 13713e519524SHoward Hinnant{ 13723e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 13733e519524SHoward Hinnant}; 13743e519524SHoward Hinnant 13753e519524SHoward Hinnanttemplate <class _Iter> 13763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13773e519524SHoward Hinnant_Iter 13783e519524SHoward Hinnant__unwrap_iter(_Iter __i) 13793e519524SHoward Hinnant{ 13803e519524SHoward Hinnant return __i; 13813e519524SHoward Hinnant} 13823e519524SHoward Hinnant 13833e519524SHoward Hinnanttemplate <class _Tp> 13843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13853e519524SHoward Hinnanttypename enable_if 13863e519524SHoward Hinnant< 13873e519524SHoward Hinnant has_trivial_copy_assign<_Tp>::value, 13883e519524SHoward Hinnant _Tp* 13893e519524SHoward Hinnant>::type 13903e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 13913e519524SHoward Hinnant{ 13923e519524SHoward Hinnant return __i.base(); 13933e519524SHoward Hinnant} 13943e519524SHoward Hinnant 13953e519524SHoward Hinnanttemplate <class _Tp> 13963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13973e519524SHoward Hinnanttypename enable_if 13983e519524SHoward Hinnant< 13993e519524SHoward Hinnant has_trivial_copy_assign<_Tp>::value, 14003e519524SHoward Hinnant _Tp* 14013e519524SHoward Hinnant>::type 14023e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 14033e519524SHoward Hinnant{ 14043e519524SHoward Hinnant return __i.base(); 14053e519524SHoward Hinnant} 14063e519524SHoward Hinnant 14073e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 14083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14093e519524SHoward Hinnant_OutputIterator 14103e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 14113e519524SHoward Hinnant{ 14123e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 14133e519524SHoward Hinnant *__result = *__first; 14143e519524SHoward Hinnant return __result; 14153e519524SHoward Hinnant} 14163e519524SHoward Hinnant 14173e519524SHoward Hinnanttemplate <class _Tp, class _Up> 14183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14193e519524SHoward Hinnanttypename enable_if 14203e519524SHoward Hinnant< 14213e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 14223e519524SHoward Hinnant has_trivial_copy_assign<_Up>::value, 14233e519524SHoward Hinnant _Up* 14243e519524SHoward Hinnant>::type 14253e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 14263e519524SHoward Hinnant{ 14273e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 14283e519524SHoward Hinnant _STD::memmove(__result, __first, __n * sizeof(_Up)); 14293e519524SHoward Hinnant return __result + __n; 14303e519524SHoward Hinnant} 14313e519524SHoward Hinnant 14323e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 14333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14343e519524SHoward Hinnant_OutputIterator 14353e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 14363e519524SHoward Hinnant{ 14373e519524SHoward Hinnant return _STD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 14383e519524SHoward Hinnant} 14393e519524SHoward Hinnant 14403e519524SHoward Hinnant// copy_backward 14413e519524SHoward Hinnant 14423e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 14433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14443e519524SHoward Hinnant_OutputIterator 14453e519524SHoward Hinnant__copy_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 14463e519524SHoward Hinnant{ 14473e519524SHoward Hinnant while (__first != __last) 14483e519524SHoward Hinnant *--__result = *--__last; 14493e519524SHoward Hinnant return __result; 14503e519524SHoward Hinnant} 14513e519524SHoward Hinnant 14523e519524SHoward Hinnanttemplate <class _Tp, class _Up> 14533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14543e519524SHoward Hinnanttypename enable_if 14553e519524SHoward Hinnant< 14563e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 14573e519524SHoward Hinnant has_trivial_copy_assign<_Up>::value, 14583e519524SHoward Hinnant _Up* 14593e519524SHoward Hinnant>::type 14603e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 14613e519524SHoward Hinnant{ 14623e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 14633e519524SHoward Hinnant __result -= __n; 14643e519524SHoward Hinnant _STD::memmove(__result, __first, __n * sizeof(_Up)); 14653e519524SHoward Hinnant return __result; 14663e519524SHoward Hinnant} 14673e519524SHoward Hinnant 14683e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 14693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14703e519524SHoward Hinnant_BidirectionalIterator2 14713e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 14723e519524SHoward Hinnant _BidirectionalIterator2 __result) 14733e519524SHoward Hinnant{ 14743e519524SHoward Hinnant return _STD::__copy_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 14753e519524SHoward Hinnant} 14763e519524SHoward Hinnant 14773e519524SHoward Hinnant// copy_if 14783e519524SHoward Hinnant 14793e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 14803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14813e519524SHoward Hinnant_OutputIterator 14823e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 14833e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 14843e519524SHoward Hinnant{ 14853e519524SHoward Hinnant for (; __first != __last; ++__first) 14863e519524SHoward Hinnant { 14873e519524SHoward Hinnant if (__pred(*__first)) 14883e519524SHoward Hinnant { 14893e519524SHoward Hinnant *__result = *__first; 14903e519524SHoward Hinnant ++__result; 14913e519524SHoward Hinnant } 14923e519524SHoward Hinnant } 14933e519524SHoward Hinnant return __result; 14943e519524SHoward Hinnant} 14953e519524SHoward Hinnant 14963e519524SHoward Hinnant// copy_n 14973e519524SHoward Hinnant 14983e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 14993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15003e519524SHoward Hinnanttypename enable_if 15013e519524SHoward Hinnant< 15023e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 15033e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 15043e519524SHoward Hinnant _OutputIterator 15053e519524SHoward Hinnant>::type 15063e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 15073e519524SHoward Hinnant{ 15083e519524SHoward Hinnant for (; __n > 0; --__n, ++__first, ++__result) 15093e519524SHoward Hinnant *__result = *__first; 15103e519524SHoward Hinnant return __result; 15113e519524SHoward Hinnant} 15123e519524SHoward Hinnant 15133e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 15143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15153e519524SHoward Hinnanttypename enable_if 15163e519524SHoward Hinnant< 15173e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 15183e519524SHoward Hinnant _OutputIterator 15193e519524SHoward Hinnant>::type 15203e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 15213e519524SHoward Hinnant{ 15223e519524SHoward Hinnant return copy(__first, __first + __n, __result); 15233e519524SHoward Hinnant} 15243e519524SHoward Hinnant 15253e519524SHoward Hinnant// move 15263e519524SHoward Hinnant 15273e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 15283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15293e519524SHoward Hinnant_OutputIterator 15303e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 15313e519524SHoward Hinnant{ 15323e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 15333e519524SHoward Hinnant *__result = _STD::move(*__first); 15343e519524SHoward Hinnant return __result; 15353e519524SHoward Hinnant} 15363e519524SHoward Hinnant 15373e519524SHoward Hinnanttemplate <class _Tp, class _Up> 15383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15393e519524SHoward Hinnanttypename enable_if 15403e519524SHoward Hinnant< 15413e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 15423e519524SHoward Hinnant has_trivial_copy_assign<_Up>::value, 15433e519524SHoward Hinnant _Up* 15443e519524SHoward Hinnant>::type 15453e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 15463e519524SHoward Hinnant{ 15473e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 15483e519524SHoward Hinnant _STD::memmove(__result, __first, __n * sizeof(_Up)); 15493e519524SHoward Hinnant return __result + __n; 15503e519524SHoward Hinnant} 15513e519524SHoward Hinnant 15523e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 15533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15543e519524SHoward Hinnant_OutputIterator 15553e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 15563e519524SHoward Hinnant{ 15573e519524SHoward Hinnant return _STD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 15583e519524SHoward Hinnant} 15593e519524SHoward Hinnant 15603e519524SHoward Hinnant// move_backward 15613e519524SHoward Hinnant 15623e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 15633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15643e519524SHoward Hinnant_OutputIterator 15653e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 15663e519524SHoward Hinnant{ 15673e519524SHoward Hinnant while (__first != __last) 15683e519524SHoward Hinnant *--__result = _STD::move(*--__last); 15693e519524SHoward Hinnant return __result; 15703e519524SHoward Hinnant} 15713e519524SHoward Hinnant 15723e519524SHoward Hinnanttemplate <class _Tp, class _Up> 15733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15743e519524SHoward Hinnanttypename enable_if 15753e519524SHoward Hinnant< 15763e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 15773e519524SHoward Hinnant has_trivial_copy_assign<_Up>::value, 15783e519524SHoward Hinnant _Up* 15793e519524SHoward Hinnant>::type 15803e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 15813e519524SHoward Hinnant{ 15823e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 15833e519524SHoward Hinnant __result -= __n; 15843e519524SHoward Hinnant _STD::memmove(__result, __first, __n * sizeof(_Up)); 15853e519524SHoward Hinnant return __result; 15863e519524SHoward Hinnant} 15873e519524SHoward Hinnant 15883e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 15893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15903e519524SHoward Hinnant_BidirectionalIterator2 15913e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 15923e519524SHoward Hinnant _BidirectionalIterator2 __result) 15933e519524SHoward Hinnant{ 15943e519524SHoward Hinnant return _STD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 15953e519524SHoward Hinnant} 15963e519524SHoward Hinnant 15973e519524SHoward Hinnant// iter_swap 15983e519524SHoward Hinnant 15993e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 16003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16013e519524SHoward Hinnantvoid 16023e519524SHoward Hinnantiter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) 16033e519524SHoward Hinnant{ 16043e519524SHoward Hinnant swap(*__a, *__b); 16053e519524SHoward Hinnant} 16063e519524SHoward Hinnant 16073e519524SHoward Hinnant// transform 16083e519524SHoward Hinnant 16093e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 16103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16113e519524SHoward Hinnant_OutputIterator 16123e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 16133e519524SHoward Hinnant{ 16143e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 16153e519524SHoward Hinnant *__result = __op(*__first); 16163e519524SHoward Hinnant return __result; 16173e519524SHoward Hinnant} 16183e519524SHoward Hinnant 16193e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 16203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16213e519524SHoward Hinnant_OutputIterator 16223e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 16233e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 16243e519524SHoward Hinnant{ 16253e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__first2, ++__result) 16263e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 16273e519524SHoward Hinnant return __result; 16283e519524SHoward Hinnant} 16293e519524SHoward Hinnant 16303e519524SHoward Hinnant// replace 16313e519524SHoward Hinnant 16323e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 16333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16343e519524SHoward Hinnantvoid 16353e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 16363e519524SHoward Hinnant{ 16373e519524SHoward Hinnant for (; __first != __last; ++__first) 16383e519524SHoward Hinnant if (*__first == __old_value) 16393e519524SHoward Hinnant *__first = __new_value; 16403e519524SHoward Hinnant} 16413e519524SHoward Hinnant 16423e519524SHoward Hinnant// replace_if 16433e519524SHoward Hinnant 16443e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 16453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16463e519524SHoward Hinnantvoid 16473e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 16483e519524SHoward Hinnant{ 16493e519524SHoward Hinnant for (; __first != __last; ++__first) 16503e519524SHoward Hinnant if (__pred(*__first)) 16513e519524SHoward Hinnant *__first = __new_value; 16523e519524SHoward Hinnant} 16533e519524SHoward Hinnant 16543e519524SHoward Hinnant// replace_copy 16553e519524SHoward Hinnant 16563e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 16573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16583e519524SHoward Hinnant_OutputIterator 16593e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 16603e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 16613e519524SHoward Hinnant{ 16623e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 16633e519524SHoward Hinnant if (*__first == __old_value) 16643e519524SHoward Hinnant *__result = __new_value; 16653e519524SHoward Hinnant else 16663e519524SHoward Hinnant *__result = *__first; 16673e519524SHoward Hinnant return __result; 16683e519524SHoward Hinnant} 16693e519524SHoward Hinnant 16703e519524SHoward Hinnant// replace_copy_if 16713e519524SHoward Hinnant 16723e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 16733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16743e519524SHoward Hinnant_OutputIterator 16753e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 16763e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 16773e519524SHoward Hinnant{ 16783e519524SHoward Hinnant for (; __first != __last; ++__first, ++__result) 16793e519524SHoward Hinnant if (__pred(*__first)) 16803e519524SHoward Hinnant *__result = __new_value; 16813e519524SHoward Hinnant else 16823e519524SHoward Hinnant *__result = *__first; 16833e519524SHoward Hinnant return __result; 16843e519524SHoward Hinnant} 16853e519524SHoward Hinnant 16863e519524SHoward Hinnant// fill_n 16873e519524SHoward Hinnant 16883e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 16893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16903e519524SHoward Hinnant_OutputIterator 16913e519524SHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value, false_type) 16923e519524SHoward Hinnant{ 16933e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 16943e519524SHoward Hinnant *__first = __value; 16953e519524SHoward Hinnant return __first; 16963e519524SHoward Hinnant} 16973e519524SHoward Hinnant 16983e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 16993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17003e519524SHoward Hinnant_OutputIterator 17013e519524SHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value, true_type) 17023e519524SHoward Hinnant{ 17033e519524SHoward Hinnant if (__n > 0) 17043e519524SHoward Hinnant _STD::memset(__first, (unsigned char)__value, (size_t)(__n)); 17053e519524SHoward Hinnant return __first + __n; 17063e519524SHoward Hinnant} 17073e519524SHoward Hinnant 17083e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 17093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17103e519524SHoward Hinnant_OutputIterator 17113e519524SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value) 17123e519524SHoward Hinnant{ 17133e519524SHoward Hinnant return _STD::__fill_n(__first, __n, __value, integral_constant<bool, 17143e519524SHoward Hinnant is_pointer<_OutputIterator>::value && 17153e519524SHoward Hinnant has_trivial_copy_assign<_Tp>::value && 17163e519524SHoward Hinnant sizeof(_Tp) == 1>()); 17173e519524SHoward Hinnant} 17183e519524SHoward Hinnant 17193e519524SHoward Hinnant// fill 17203e519524SHoward Hinnant 17213e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 17223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17233e519524SHoward Hinnantvoid 17243e519524SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, forward_iterator_tag) 17253e519524SHoward Hinnant{ 17263e519524SHoward Hinnant for (; __first != __last; ++__first) 17273e519524SHoward Hinnant *__first = __value; 17283e519524SHoward Hinnant} 17293e519524SHoward Hinnant 17303e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 17313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17323e519524SHoward Hinnantvoid 17333e519524SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value, random_access_iterator_tag) 17343e519524SHoward Hinnant{ 17353e519524SHoward Hinnant _STD::fill_n(__first, __last - __first, __value); 17363e519524SHoward Hinnant} 17373e519524SHoward Hinnant 17383e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 17393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17403e519524SHoward Hinnantvoid 17413e519524SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) 17423e519524SHoward Hinnant{ 17433e519524SHoward Hinnant _STD::__fill(__first, __last, __value, typename iterator_traits<_ForwardIterator>::iterator_category()); 17443e519524SHoward Hinnant} 17453e519524SHoward Hinnant 17463e519524SHoward Hinnant// generate 17473e519524SHoward Hinnant 17483e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 17493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17503e519524SHoward Hinnantvoid 17513e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 17523e519524SHoward Hinnant{ 17533e519524SHoward Hinnant for (; __first != __last; ++__first) 17543e519524SHoward Hinnant *__first = __gen(); 17553e519524SHoward Hinnant} 17563e519524SHoward Hinnant 17573e519524SHoward Hinnant// generate_n 17583e519524SHoward Hinnant 17593e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 17603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17613e519524SHoward Hinnant_OutputIterator 17623e519524SHoward Hinnantgenerate_n(_OutputIterator __first, _Size __n, _Generator __gen) 17633e519524SHoward Hinnant{ 17643e519524SHoward Hinnant for (; __n > 0; ++__first, --__n) 17653e519524SHoward Hinnant *__first = __gen(); 17663e519524SHoward Hinnant return __first; 17673e519524SHoward Hinnant} 17683e519524SHoward Hinnant 17693e519524SHoward Hinnant// remove 17703e519524SHoward Hinnant 17713e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 17723e519524SHoward Hinnant_ForwardIterator 17733e519524SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) 17743e519524SHoward Hinnant{ 17753e519524SHoward Hinnant __first = _STD::find(__first, __last, __value); 17763e519524SHoward Hinnant if (__first != __last) 17773e519524SHoward Hinnant { 17783e519524SHoward Hinnant _ForwardIterator __i = __first; 17793e519524SHoward Hinnant while (++__i != __last) 17803e519524SHoward Hinnant { 17813e519524SHoward Hinnant if (!(*__i == __value)) 17823e519524SHoward Hinnant { 17833e519524SHoward Hinnant *__first = _STD::move(*__i); 17843e519524SHoward Hinnant ++__first; 17853e519524SHoward Hinnant } 17863e519524SHoward Hinnant } 17873e519524SHoward Hinnant } 17883e519524SHoward Hinnant return __first; 17893e519524SHoward Hinnant} 17903e519524SHoward Hinnant 17913e519524SHoward Hinnant// remove_if 17923e519524SHoward Hinnant 17933e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 17943e519524SHoward Hinnant_ForwardIterator 17953e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 17963e519524SHoward Hinnant{ 17973e519524SHoward Hinnant __first = _STD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 17983e519524SHoward Hinnant (__first, __last, __pred); 17993e519524SHoward Hinnant if (__first != __last) 18003e519524SHoward Hinnant { 18013e519524SHoward Hinnant _ForwardIterator __i = __first; 18023e519524SHoward Hinnant while (++__i != __last) 18033e519524SHoward Hinnant { 18043e519524SHoward Hinnant if (!__pred(*__i)) 18053e519524SHoward Hinnant { 18063e519524SHoward Hinnant *__first = _STD::move(*__i); 18073e519524SHoward Hinnant ++__first; 18083e519524SHoward Hinnant } 18093e519524SHoward Hinnant } 18103e519524SHoward Hinnant } 18113e519524SHoward Hinnant return __first; 18123e519524SHoward Hinnant} 18133e519524SHoward Hinnant 18143e519524SHoward Hinnant// remove_copy 18153e519524SHoward Hinnant 18163e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 18173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18183e519524SHoward Hinnant_OutputIterator 18193e519524SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value) 18203e519524SHoward Hinnant{ 18213e519524SHoward Hinnant for (; __first != __last; ++__first) 18223e519524SHoward Hinnant { 18233e519524SHoward Hinnant if (!(*__first == __value)) 18243e519524SHoward Hinnant { 18253e519524SHoward Hinnant *__result = *__first; 18263e519524SHoward Hinnant ++__result; 18273e519524SHoward Hinnant } 18283e519524SHoward Hinnant } 18293e519524SHoward Hinnant return __result; 18303e519524SHoward Hinnant} 18313e519524SHoward Hinnant 18323e519524SHoward Hinnant// remove_copy_if 18333e519524SHoward Hinnant 18343e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 18353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18363e519524SHoward Hinnant_OutputIterator 18373e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 18383e519524SHoward Hinnant{ 18393e519524SHoward Hinnant for (; __first != __last; ++__first) 18403e519524SHoward Hinnant { 18413e519524SHoward Hinnant if (!__pred(*__first)) 18423e519524SHoward Hinnant { 18433e519524SHoward Hinnant *__result = *__first; 18443e519524SHoward Hinnant ++__result; 18453e519524SHoward Hinnant } 18463e519524SHoward Hinnant } 18473e519524SHoward Hinnant return __result; 18483e519524SHoward Hinnant} 18493e519524SHoward Hinnant 18503e519524SHoward Hinnant// unique 18513e519524SHoward Hinnant 18523e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 18533e519524SHoward Hinnant_ForwardIterator 18543e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 18553e519524SHoward Hinnant{ 18563e519524SHoward Hinnant __first = _STD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 18573e519524SHoward Hinnant (__first, __last, __pred); 18583e519524SHoward Hinnant if (__first != __last) 18593e519524SHoward Hinnant { 18603e519524SHoward Hinnant // ... a a ? ... 18613e519524SHoward Hinnant // f i 18623e519524SHoward Hinnant _ForwardIterator __i = __first; 18633e519524SHoward Hinnant for (++__i; ++__i != __last;) 18643e519524SHoward Hinnant if (!__pred(*__first, *__i)) 18653e519524SHoward Hinnant *++__first = _STD::move(*__i); 18663e519524SHoward Hinnant ++__first; 18673e519524SHoward Hinnant } 18683e519524SHoward Hinnant return __first; 18693e519524SHoward Hinnant} 18703e519524SHoward Hinnant 18713e519524SHoward Hinnanttemplate <class _ForwardIterator> 18723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18733e519524SHoward Hinnant_ForwardIterator 18743e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 18753e519524SHoward Hinnant{ 18763e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 18773e519524SHoward Hinnant return _STD::unique(__first, __last, __equal_to<__v>()); 18783e519524SHoward Hinnant} 18793e519524SHoward Hinnant 18803e519524SHoward Hinnant// unique_copy 18813e519524SHoward Hinnant 18823e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 18833e519524SHoward Hinnant_OutputIterator 18843e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 18853e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 18863e519524SHoward Hinnant{ 18873e519524SHoward Hinnant if (__first != __last) 18883e519524SHoward Hinnant { 18893e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 18903e519524SHoward Hinnant *__result = __t; 18913e519524SHoward Hinnant ++__result; 18923e519524SHoward Hinnant while (++__first != __last) 18933e519524SHoward Hinnant { 18943e519524SHoward Hinnant if (!__pred(__t, *__first)) 18953e519524SHoward Hinnant { 18963e519524SHoward Hinnant __t = *__first; 18973e519524SHoward Hinnant *__result = __t; 18983e519524SHoward Hinnant ++__result; 18993e519524SHoward Hinnant } 19003e519524SHoward Hinnant } 19013e519524SHoward Hinnant } 19023e519524SHoward Hinnant return __result; 19033e519524SHoward Hinnant} 19043e519524SHoward Hinnant 19053e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 19063e519524SHoward Hinnant_OutputIterator 19073e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 19083e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 19093e519524SHoward Hinnant{ 19103e519524SHoward Hinnant if (__first != __last) 19113e519524SHoward Hinnant { 19123e519524SHoward Hinnant _ForwardIterator __i = __first; 19133e519524SHoward Hinnant *__result = *__i; 19143e519524SHoward Hinnant ++__result; 19153e519524SHoward Hinnant while (++__first != __last) 19163e519524SHoward Hinnant { 19173e519524SHoward Hinnant if (!__pred(*__i, *__first)) 19183e519524SHoward Hinnant { 19193e519524SHoward Hinnant *__result = *__first; 19203e519524SHoward Hinnant ++__result; 19213e519524SHoward Hinnant __i = __first; 19223e519524SHoward Hinnant } 19233e519524SHoward Hinnant } 19243e519524SHoward Hinnant } 19253e519524SHoward Hinnant return __result; 19263e519524SHoward Hinnant} 19273e519524SHoward Hinnant 19283e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 19293e519524SHoward Hinnant_ForwardIterator 19303e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 19313e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 19323e519524SHoward Hinnant{ 19333e519524SHoward Hinnant if (__first != __last) 19343e519524SHoward Hinnant { 19353e519524SHoward Hinnant *__result = *__first; 19363e519524SHoward Hinnant while (++__first != __last) 19373e519524SHoward Hinnant if (!__pred(*__result, *__first)) 19383e519524SHoward Hinnant *++__result = *__first; 19393e519524SHoward Hinnant ++__result; 19403e519524SHoward Hinnant } 19413e519524SHoward Hinnant return __result; 19423e519524SHoward Hinnant} 19433e519524SHoward Hinnant 19443e519524SHoward Hinnant 19453e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 19463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19473e519524SHoward Hinnant_OutputIterator 19483e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 19493e519524SHoward Hinnant{ 19503e519524SHoward Hinnant return _STD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 19513e519524SHoward Hinnant (__first, __last, __result, __pred, 19523e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 19533e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 19543e519524SHoward Hinnant} 19553e519524SHoward Hinnant 19563e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19583e519524SHoward Hinnant_OutputIterator 19593e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19603e519524SHoward Hinnant{ 19613e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 19623e519524SHoward Hinnant return _STD::unique_copy(__first, __last, __result, __equal_to<__v>()); 19633e519524SHoward Hinnant} 19643e519524SHoward Hinnant 19653e519524SHoward Hinnant// reverse 19663e519524SHoward Hinnant 19673e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 19683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19693e519524SHoward Hinnantvoid 19703e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 19713e519524SHoward Hinnant{ 19723e519524SHoward Hinnant while (__first != __last) 19733e519524SHoward Hinnant { 19743e519524SHoward Hinnant if (__first == --__last) 19753e519524SHoward Hinnant break; 19763e519524SHoward Hinnant swap(*__first, *__last); 19773e519524SHoward Hinnant ++__first; 19783e519524SHoward Hinnant } 19793e519524SHoward Hinnant} 19803e519524SHoward Hinnant 19813e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 19823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19833e519524SHoward Hinnantvoid 19843e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 19853e519524SHoward Hinnant{ 19863e519524SHoward Hinnant if (__first != __last) 19873e519524SHoward Hinnant for (; __first < --__last; ++__first) 19883e519524SHoward Hinnant swap(*__first, *__last); 19893e519524SHoward Hinnant} 19903e519524SHoward Hinnant 19913e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 19923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19933e519524SHoward Hinnantvoid 19943e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 19953e519524SHoward Hinnant{ 19963e519524SHoward Hinnant _STD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 19973e519524SHoward Hinnant} 19983e519524SHoward Hinnant 19993e519524SHoward Hinnant// reverse_copy 20003e519524SHoward Hinnant 20013e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 20023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20033e519524SHoward Hinnant_OutputIterator 20043e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 20053e519524SHoward Hinnant{ 20063e519524SHoward Hinnant for (; __first != __last; ++__result) 20073e519524SHoward Hinnant *__result = *--__last; 20083e519524SHoward Hinnant return __result; 20093e519524SHoward Hinnant} 20103e519524SHoward Hinnant 20113e519524SHoward Hinnant// rotate 20123e519524SHoward Hinnant 20133e519524SHoward Hinnanttemplate <class _ForwardIterator> 20143e519524SHoward Hinnant_ForwardIterator 20153e519524SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, false_type) 20163e519524SHoward Hinnant{ 20173e519524SHoward Hinnant if (__first == __middle) 20183e519524SHoward Hinnant return __last; 20193e519524SHoward Hinnant if (__middle == __last) 20203e519524SHoward Hinnant return __first; 20213e519524SHoward Hinnant _ForwardIterator __i = __middle; 20223e519524SHoward Hinnant while (true) 20233e519524SHoward Hinnant { 20243e519524SHoward Hinnant swap(*__first, *__i); 20253e519524SHoward Hinnant ++__first; 20263e519524SHoward Hinnant if (++__i == __last) 20273e519524SHoward Hinnant break; 20283e519524SHoward Hinnant if (__first == __middle) 20293e519524SHoward Hinnant __middle = __i; 20303e519524SHoward Hinnant } 20313e519524SHoward Hinnant _ForwardIterator __r = __first; 20323e519524SHoward Hinnant if (__first != __middle) 20333e519524SHoward Hinnant { 20343e519524SHoward Hinnant __i = __middle; 20353e519524SHoward Hinnant while (true) 20363e519524SHoward Hinnant { 20373e519524SHoward Hinnant swap(*__first, *__i); 20383e519524SHoward Hinnant ++__first; 20393e519524SHoward Hinnant if (++__i == __last) 20403e519524SHoward Hinnant { 20413e519524SHoward Hinnant if (__first == __middle) 20423e519524SHoward Hinnant break; 20433e519524SHoward Hinnant __i = __middle; 20443e519524SHoward Hinnant } 20453e519524SHoward Hinnant else if (__first == __middle) 20463e519524SHoward Hinnant __middle = __i; 20473e519524SHoward Hinnant } 20483e519524SHoward Hinnant } 20493e519524SHoward Hinnant return __r; 20503e519524SHoward Hinnant} 20513e519524SHoward Hinnant 20523e519524SHoward Hinnanttemplate<typename _Integral> 20533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20543e519524SHoward Hinnant_Integral 20553e519524SHoward Hinnant__gcd(_Integral __x, _Integral __y) 20563e519524SHoward Hinnant{ 20573e519524SHoward Hinnant do 20583e519524SHoward Hinnant { 20593e519524SHoward Hinnant _Integral __t = __x % __y; 20603e519524SHoward Hinnant __x = __y; 20613e519524SHoward Hinnant __y = __t; 20623e519524SHoward Hinnant } while (__y); 20633e519524SHoward Hinnant return __x; 20643e519524SHoward Hinnant} 20653e519524SHoward Hinnant 20663e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 20673e519524SHoward Hinnant_RandomAccessIterator 20683e519524SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, true_type) 20693e519524SHoward Hinnant{ 20703e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 20713e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 20723e519524SHoward Hinnant 20733e519524SHoward Hinnant if (__first == __middle) 20743e519524SHoward Hinnant return __last; 20753e519524SHoward Hinnant if (__middle == __last) 20763e519524SHoward Hinnant return __first; 20773e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 20783e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 20793e519524SHoward Hinnant if (__m1 == __m2) 20803e519524SHoward Hinnant { 20813e519524SHoward Hinnant _STD::swap_ranges(__first, __middle, __middle); 20823e519524SHoward Hinnant return __middle; 20833e519524SHoward Hinnant } 20843e519524SHoward Hinnant const difference_type __g = __gcd(__m1, __m2); 20853e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 20863e519524SHoward Hinnant { 20873e519524SHoward Hinnant value_type __t(*--__p); 20883e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 20893e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 20903e519524SHoward Hinnant do 20913e519524SHoward Hinnant { 20923e519524SHoward Hinnant *__p1 = *__p2; 20933e519524SHoward Hinnant __p1 = __p2; 20943e519524SHoward Hinnant const difference_type __d = __last - __p2; 20953e519524SHoward Hinnant if (__m1 < __d) 20963e519524SHoward Hinnant __p2 += __m1; 20973e519524SHoward Hinnant else 20983e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 20993e519524SHoward Hinnant } while (__p2 != __p); 21003e519524SHoward Hinnant *__p1 = __t; 21013e519524SHoward Hinnant } 21023e519524SHoward Hinnant return __first + __m2; 21033e519524SHoward Hinnant} 21043e519524SHoward Hinnant 21053e519524SHoward Hinnanttemplate <class _ForwardIterator> 21063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21073e519524SHoward Hinnant_ForwardIterator 21083e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 21093e519524SHoward Hinnant{ 21103e519524SHoward Hinnant return _STD::__rotate(__first, __middle, __last, 21113e519524SHoward Hinnant integral_constant 21123e519524SHoward Hinnant < 21133e519524SHoward Hinnant bool, 21143e519524SHoward Hinnant is_convertible 21153e519524SHoward Hinnant < 21163e519524SHoward Hinnant typename iterator_traits<_ForwardIterator>::iterator_category, 21173e519524SHoward Hinnant random_access_iterator_tag 21183e519524SHoward Hinnant >::value && 21193e519524SHoward Hinnant has_trivial_copy_assign 21203e519524SHoward Hinnant < 21213e519524SHoward Hinnant typename iterator_traits<_ForwardIterator>::value_type 21223e519524SHoward Hinnant >::value 21233e519524SHoward Hinnant >()); 21243e519524SHoward Hinnant} 21253e519524SHoward Hinnant 21263e519524SHoward Hinnant// rotate_copy 21273e519524SHoward Hinnant 21283e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 21293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21303e519524SHoward Hinnant_OutputIterator 21313e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 21323e519524SHoward Hinnant{ 21333e519524SHoward Hinnant return _STD::copy(__first, __middle, _STD::copy(__middle, __last, __result)); 21343e519524SHoward Hinnant} 21353e519524SHoward Hinnant 21363e519524SHoward Hinnant// min 21373e519524SHoward Hinnant 21383e519524SHoward Hinnanttemplate <class _Tp, class _Compare> 21393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21403e519524SHoward Hinnantconst _Tp& 21413e519524SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 21423e519524SHoward Hinnant{ 21433e519524SHoward Hinnant return __comp(__b, __a) ? __b : __a; 21443e519524SHoward Hinnant} 21453e519524SHoward Hinnant 21463e519524SHoward Hinnanttemplate <class _Tp> 21473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21483e519524SHoward Hinnantconst _Tp& 21493e519524SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 21503e519524SHoward Hinnant{ 21513e519524SHoward Hinnant return _STD::min(__a, __b, __less<_Tp>()); 21523e519524SHoward Hinnant} 21533e519524SHoward Hinnant 21543e519524SHoward Hinnant// max 21553e519524SHoward Hinnant 21563e519524SHoward Hinnanttemplate <class _Tp, class _Compare> 21573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21583e519524SHoward Hinnantconst _Tp& 21593e519524SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 21603e519524SHoward Hinnant{ 21613e519524SHoward Hinnant return __comp(__a, __b) ? __b : __a; 21623e519524SHoward Hinnant} 21633e519524SHoward Hinnant 21643e519524SHoward Hinnanttemplate <class _Tp> 21653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21663e519524SHoward Hinnantconst _Tp& 21673e519524SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 21683e519524SHoward Hinnant{ 21693e519524SHoward Hinnant return _STD::max(__a, __b, __less<_Tp>()); 21703e519524SHoward Hinnant} 21713e519524SHoward Hinnant 21723e519524SHoward Hinnant// min_element 21733e519524SHoward Hinnant 21743e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 21753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21763e519524SHoward Hinnant_ForwardIterator 21773e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 21783e519524SHoward Hinnant{ 21793e519524SHoward Hinnant if (__first != __last) 21803e519524SHoward Hinnant { 21813e519524SHoward Hinnant _ForwardIterator __i = __first; 21823e519524SHoward Hinnant while (++__i != __last) 21833e519524SHoward Hinnant if (__comp(*__i, *__first)) 21843e519524SHoward Hinnant __first = __i; 21853e519524SHoward Hinnant } 21863e519524SHoward Hinnant return __first; 21873e519524SHoward Hinnant} 21883e519524SHoward Hinnant 21893e519524SHoward Hinnanttemplate <class _ForwardIterator> 21903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21913e519524SHoward Hinnant_ForwardIterator 21923e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 21933e519524SHoward Hinnant{ 21943e519524SHoward Hinnant return _STD::min_element(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 21953e519524SHoward Hinnant} 21963e519524SHoward Hinnant 21973e519524SHoward Hinnant// max_element 21983e519524SHoward Hinnant 21993e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 22003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22013e519524SHoward Hinnant_ForwardIterator 22023e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 22033e519524SHoward Hinnant{ 22043e519524SHoward Hinnant if (__first != __last) 22053e519524SHoward Hinnant { 22063e519524SHoward Hinnant _ForwardIterator __i = __first; 22073e519524SHoward Hinnant while (++__i != __last) 22083e519524SHoward Hinnant if (__comp(*__first, *__i)) 22093e519524SHoward Hinnant __first = __i; 22103e519524SHoward Hinnant } 22113e519524SHoward Hinnant return __first; 22123e519524SHoward Hinnant} 22133e519524SHoward Hinnant 22143e519524SHoward Hinnanttemplate <class _ForwardIterator> 22153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22163e519524SHoward Hinnant_ForwardIterator 22173e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 22183e519524SHoward Hinnant{ 22193e519524SHoward Hinnant return _STD::max_element(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 22203e519524SHoward Hinnant} 22213e519524SHoward Hinnant 22223e519524SHoward Hinnant// minmax_element 22233e519524SHoward Hinnant 22243e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 22253e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 22263e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 22273e519524SHoward Hinnant{ 22283e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 22293e519524SHoward Hinnant if (__first != __last) 22303e519524SHoward Hinnant { 22313e519524SHoward Hinnant if (++__first != __last) 22323e519524SHoward Hinnant { 22333e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 22343e519524SHoward Hinnant { 22353e519524SHoward Hinnant __result.second = __result.first; 22363e519524SHoward Hinnant __result.first = __first; 22373e519524SHoward Hinnant } 22383e519524SHoward Hinnant else 22393e519524SHoward Hinnant __result.second = __first; 22403e519524SHoward Hinnant while (++__first != __last) 22413e519524SHoward Hinnant { 22423e519524SHoward Hinnant _ForwardIterator __i = __first; 22433e519524SHoward Hinnant if (++__first == __last) 22443e519524SHoward Hinnant { 22453e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 22463e519524SHoward Hinnant __result.first = __i; 22473e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 22483e519524SHoward Hinnant __result.second = __i; 22493e519524SHoward Hinnant break; 22503e519524SHoward Hinnant } 22513e519524SHoward Hinnant else 22523e519524SHoward Hinnant { 22533e519524SHoward Hinnant if (__comp(*__first, *__i)) 22543e519524SHoward Hinnant { 22553e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 22563e519524SHoward Hinnant __result.first = __first; 22573e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 22583e519524SHoward Hinnant __result.second = __i; 22593e519524SHoward Hinnant } 22603e519524SHoward Hinnant else 22613e519524SHoward Hinnant { 22623e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 22633e519524SHoward Hinnant __result.first = __i; 22643e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 22653e519524SHoward Hinnant __result.second = __first; 22663e519524SHoward Hinnant } 22673e519524SHoward Hinnant } 22683e519524SHoward Hinnant } 22693e519524SHoward Hinnant } 22703e519524SHoward Hinnant } 22713e519524SHoward Hinnant return __result; 22723e519524SHoward Hinnant} 22733e519524SHoward Hinnant 22743e519524SHoward Hinnanttemplate <class _ForwardIterator> 22753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22763e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 22773e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 22783e519524SHoward Hinnant{ 22793e519524SHoward Hinnant return _STD::minmax_element(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 22803e519524SHoward Hinnant} 22813e519524SHoward Hinnant 22823e519524SHoward Hinnant// random_shuffle 22833e519524SHoward Hinnant 22843e519524SHoward Hinnanttemplate <unsigned int _Bits> 22853e519524SHoward Hinnantstruct __num_bits 22863e519524SHoward Hinnant{ 22873e519524SHoward Hinnant static const int __value = 1 + __num_bits<(_Bits >> 1)>::__value; 22883e519524SHoward Hinnant}; 22893e519524SHoward Hinnant 22903e519524SHoward Hinnanttemplate <> 22913e519524SHoward Hinnantstruct __num_bits<0> 22923e519524SHoward Hinnant{ 22933e519524SHoward Hinnant static const int __value = 0; 22943e519524SHoward Hinnant}; 22953e519524SHoward Hinnant 22963e519524SHoward Hinnantconst int __rbits = __num_bits<RAND_MAX>::__value; 22973e519524SHoward Hinnantconst int __lbits = static_cast<int>(sizeof(unsigned long) * __CHAR_BIT__); 22983e519524SHoward Hinnant 22993e519524SHoward Hinnanttemplate <int _NBits, bool = _NBits <= __rbits> 23003e519524SHoward Hinnantstruct __random_bits 23013e519524SHoward Hinnant{ 23023e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY operator unsigned long () const 23033e519524SHoward Hinnant {return static_cast<unsigned long>(_STD::rand()) >> (__rbits - _NBits);} 23043e519524SHoward Hinnant}; 23053e519524SHoward Hinnant 23063e519524SHoward Hinnanttemplate <int _NBits> 23073e519524SHoward Hinnantstruct __random_bits<_NBits, false> 23083e519524SHoward Hinnant{ 23093e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY operator unsigned long () const 23103e519524SHoward Hinnant {return static_cast<unsigned long>(_STD::rand()) << (_NBits - __rbits) | __random_bits<_NBits - __rbits>();} 23113e519524SHoward Hinnant}; 23123e519524SHoward Hinnant 23133e519524SHoward Hinnanttemplate <int _NBits> 23143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23153e519524SHoward Hinnantunsigned long 23163e519524SHoward Hinnant__slab_size(unsigned long __n) 23173e519524SHoward Hinnant{ 23183e519524SHoward Hinnant return (1UL << _NBits) / __n; 23193e519524SHoward Hinnant} 23203e519524SHoward Hinnant 23213e519524SHoward Hinnanttemplate <> 23223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23233e519524SHoward Hinnantunsigned long 23243e519524SHoward Hinnant__slab_size<__lbits>(unsigned long __n) 23253e519524SHoward Hinnant{ 23263e519524SHoward Hinnant if (__n & 1) 23273e519524SHoward Hinnant return (unsigned long)(~0) / __n; 23283e519524SHoward Hinnant return (1UL << (__lbits-1)) / (__n >> 1); 23293e519524SHoward Hinnant} 23303e519524SHoward Hinnant 23313e519524SHoward Hinnanttemplate <int _NBits> 23323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23333e519524SHoward Hinnantunsigned long 23343e519524SHoward Hinnant__scaled_random_number(unsigned long __n) 23353e519524SHoward Hinnant{ 23363e519524SHoward Hinnant const unsigned long __slab = __slab_size<_NBits>(__n); 23373e519524SHoward Hinnant const unsigned long __usable = __slab * __n; 23383e519524SHoward Hinnant unsigned long __raw; 23393e519524SHoward Hinnant do 23403e519524SHoward Hinnant __raw = __random_bits<_NBits>(); 23413e519524SHoward Hinnant while (__raw >= __usable); 23423e519524SHoward Hinnant return __raw / __slab; 23433e519524SHoward Hinnant} 23443e519524SHoward Hinnant 23453e519524SHoward Hinnanttemplate <bool __b, unsigned long = __lbits/__rbits> struct __rs_default; 23463e519524SHoward Hinnant 23473e519524SHoward Hinnanttemplate <bool __b> 23483e519524SHoward Hinnantstruct __rs_default<__b, 1> 23493e519524SHoward Hinnant{ 23503e519524SHoward Hinnant unsigned long operator()(unsigned long __n = 0) const; 23513e519524SHoward Hinnant}; 23523e519524SHoward Hinnant 23533e519524SHoward Hinnanttemplate <bool __b> 23543e519524SHoward Hinnantunsigned long 23553e519524SHoward Hinnant__rs_default<__b, 1>::operator()(unsigned long __n) const 23563e519524SHoward Hinnant{ 23573e519524SHoward Hinnant switch (__n) 23583e519524SHoward Hinnant { 23593e519524SHoward Hinnant case 0: 23603e519524SHoward Hinnant return __random_bits<__lbits>(); 23613e519524SHoward Hinnant case 1: 23623e519524SHoward Hinnant return 0; 23633e519524SHoward Hinnant } 23643e519524SHoward Hinnant if (__n <= (1UL << __rbits)) 23653e519524SHoward Hinnant return __scaled_random_number<__rbits>(__n); 23663e519524SHoward Hinnant return __scaled_random_number<__lbits>(__n); 23673e519524SHoward Hinnant} 23683e519524SHoward Hinnant 23693e519524SHoward Hinnanttemplate <bool __b> 23703e519524SHoward Hinnantstruct __rs_default<__b, 2> 23713e519524SHoward Hinnant{ 23723e519524SHoward Hinnant unsigned long operator()(unsigned long __n = 0) const; 23733e519524SHoward Hinnant}; 23743e519524SHoward Hinnant 23753e519524SHoward Hinnanttemplate <bool __b> 23763e519524SHoward Hinnantunsigned long 23773e519524SHoward Hinnant__rs_default<__b, 2>::operator()(unsigned long __n) const 23783e519524SHoward Hinnant{ 23793e519524SHoward Hinnant switch (__n) 23803e519524SHoward Hinnant { 23813e519524SHoward Hinnant case 0: 23823e519524SHoward Hinnant return __random_bits<__lbits>(); 23833e519524SHoward Hinnant case 1: 23843e519524SHoward Hinnant return 0; 23853e519524SHoward Hinnant } 23863e519524SHoward Hinnant int __nb = __rbits; 23873e519524SHoward Hinnant while (__nb < __lbits && __n > (1UL << __nb)) 23883e519524SHoward Hinnant __nb += _STD::min(__rbits, __lbits - __nb); 23893e519524SHoward Hinnant switch (__nb) 23903e519524SHoward Hinnant { 23913e519524SHoward Hinnant case __rbits: 23923e519524SHoward Hinnant return __scaled_random_number<__rbits>(__n); 23933e519524SHoward Hinnant case 2*__rbits: 23943e519524SHoward Hinnant return __scaled_random_number<2*__rbits>(__n); 23953e519524SHoward Hinnant } 23963e519524SHoward Hinnant return __scaled_random_number<__lbits>(__n); 23973e519524SHoward Hinnant} 23983e519524SHoward Hinnant 23993e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 24003e519524SHoward Hinnantvoid 24013e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 24023e519524SHoward Hinnant{ 24033e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 24043e519524SHoward Hinnant difference_type __d = __last - __first; 24053e519524SHoward Hinnant if (__d > 1) 24063e519524SHoward Hinnant { 24073e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 24083e519524SHoward Hinnant swap(*__first, *(__first 24093e519524SHoward Hinnant + static_cast<difference_type>(__rs_default<true>()(static_cast<unsigned long>(__d))))); 24103e519524SHoward Hinnant } 24113e519524SHoward Hinnant} 24123e519524SHoward Hinnant 24133e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 24143e519524SHoward Hinnantvoid 24153e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 24163e519524SHoward Hinnant#ifdef _LIBCPP_MOVE 24173e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 24183e519524SHoward Hinnant#else 24193e519524SHoward Hinnant _RandomNumberGenerator& __rand) 24203e519524SHoward Hinnant#endif 24213e519524SHoward Hinnant{ 24223e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 24233e519524SHoward Hinnant difference_type __d = __last - __first; 24243e519524SHoward Hinnant if (__d > 1) 24253e519524SHoward Hinnant { 24263e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 24273e519524SHoward Hinnant swap(*__first, *(__first + __rand(__d))); 24283e519524SHoward Hinnant } 24293e519524SHoward Hinnant} 24303e519524SHoward Hinnant 24313e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 24323e519524SHoward Hinnantbool 24333e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 24343e519524SHoward Hinnant{ 24353e519524SHoward Hinnant for (; __first != __last; ++__first) 24363e519524SHoward Hinnant if (!__pred(*__first)) 24373e519524SHoward Hinnant break; 24383e519524SHoward Hinnant for (; __first != __last; ++__first) 24393e519524SHoward Hinnant if (__pred(*__first)) 24403e519524SHoward Hinnant return false; 24413e519524SHoward Hinnant return true; 24423e519524SHoward Hinnant} 24433e519524SHoward Hinnant 24443e519524SHoward Hinnant// partition 24453e519524SHoward Hinnant 24463e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 24473e519524SHoward Hinnant_ForwardIterator 24483e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 24493e519524SHoward Hinnant{ 24503e519524SHoward Hinnant while (true) 24513e519524SHoward Hinnant { 24523e519524SHoward Hinnant if (__first == __last) 24533e519524SHoward Hinnant return __first; 24543e519524SHoward Hinnant if (!__pred(*__first)) 24553e519524SHoward Hinnant break; 24563e519524SHoward Hinnant ++__first; 24573e519524SHoward Hinnant } 24583e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 24593e519524SHoward Hinnant { 24603e519524SHoward Hinnant if (__pred(*__p)) 24613e519524SHoward Hinnant { 24623e519524SHoward Hinnant swap(*__first, *__p); 24633e519524SHoward Hinnant ++__first; 24643e519524SHoward Hinnant } 24653e519524SHoward Hinnant } 24663e519524SHoward Hinnant return __first; 24673e519524SHoward Hinnant} 24683e519524SHoward Hinnant 24693e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 24703e519524SHoward Hinnant_BidirectionalIterator 24713e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 24723e519524SHoward Hinnant bidirectional_iterator_tag) 24733e519524SHoward Hinnant{ 24743e519524SHoward Hinnant while (true) 24753e519524SHoward Hinnant { 24763e519524SHoward Hinnant while (true) 24773e519524SHoward Hinnant { 24783e519524SHoward Hinnant if (__first == __last) 24793e519524SHoward Hinnant return __first; 24803e519524SHoward Hinnant if (!__pred(*__first)) 24813e519524SHoward Hinnant break; 24823e519524SHoward Hinnant ++__first; 24833e519524SHoward Hinnant } 24843e519524SHoward Hinnant do 24853e519524SHoward Hinnant { 24863e519524SHoward Hinnant if (__first == --__last) 24873e519524SHoward Hinnant return __first; 24883e519524SHoward Hinnant } while (!__pred(*__last)); 24893e519524SHoward Hinnant swap(*__first, *__last); 24903e519524SHoward Hinnant ++__first; 24913e519524SHoward Hinnant } 24923e519524SHoward Hinnant} 24933e519524SHoward Hinnant 24943e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 24953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24963e519524SHoward Hinnant_ForwardIterator 24973e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 24983e519524SHoward Hinnant{ 24993e519524SHoward Hinnant return _STD::__partition<typename add_lvalue_reference<_Predicate>::type> 25003e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 25013e519524SHoward Hinnant} 25023e519524SHoward Hinnant 25033e519524SHoward Hinnant// partition_copy 25043e519524SHoward Hinnant 25053e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 25063e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 25073e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 25083e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 25093e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 25103e519524SHoward Hinnant _Predicate __pred) 25113e519524SHoward Hinnant{ 25123e519524SHoward Hinnant for (; __first != __last; ++__first) 25133e519524SHoward Hinnant { 25143e519524SHoward Hinnant if (__pred(*__first)) 25153e519524SHoward Hinnant { 25163e519524SHoward Hinnant *__out_true = *__first; 25173e519524SHoward Hinnant ++__out_true; 25183e519524SHoward Hinnant } 25193e519524SHoward Hinnant else 25203e519524SHoward Hinnant { 25213e519524SHoward Hinnant *__out_false = *__first; 25223e519524SHoward Hinnant ++__out_false; 25233e519524SHoward Hinnant } 25243e519524SHoward Hinnant } 25253e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 25263e519524SHoward Hinnant} 25273e519524SHoward Hinnant 25283e519524SHoward Hinnant// partition_point 25293e519524SHoward Hinnant 25303e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 25313e519524SHoward Hinnant_ForwardIterator 25323e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 25333e519524SHoward Hinnant{ 25343e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 25353e519524SHoward Hinnant difference_type __len = _STD::distance(__first, __last); 25363e519524SHoward Hinnant while (__len != 0) 25373e519524SHoward Hinnant { 25383e519524SHoward Hinnant difference_type __l2 = __len / 2; 25393e519524SHoward Hinnant _ForwardIterator __m = __first; 25403e519524SHoward Hinnant _STD::advance(__m, __l2); 25413e519524SHoward Hinnant if (__pred(*__m)) 25423e519524SHoward Hinnant { 25433e519524SHoward Hinnant __first = ++__m; 25443e519524SHoward Hinnant __len -= __l2 + 1; 25453e519524SHoward Hinnant } 25463e519524SHoward Hinnant else 25473e519524SHoward Hinnant __len = __l2; 25483e519524SHoward Hinnant } 25493e519524SHoward Hinnant return __first; 25503e519524SHoward Hinnant} 25513e519524SHoward Hinnant 25523e519524SHoward Hinnant// stable_partition 25533e519524SHoward Hinnant 25543e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 25553e519524SHoward Hinnant_ForwardIterator 25563e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 25573e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 25583e519524SHoward Hinnant{ 25593e519524SHoward Hinnant // *__first is known to be false 25603e519524SHoward Hinnant // __len >= 1 25613e519524SHoward Hinnant if (__len == 1) 25623e519524SHoward Hinnant return __first; 25633e519524SHoward Hinnant if (__len == 2) 25643e519524SHoward Hinnant { 25653e519524SHoward Hinnant _ForwardIterator __m = __first; 25663e519524SHoward Hinnant if (__pred(*++__m)) 25673e519524SHoward Hinnant { 25683e519524SHoward Hinnant swap(*__first, *__m); 25693e519524SHoward Hinnant return __m; 25703e519524SHoward Hinnant } 25713e519524SHoward Hinnant return __first; 25723e519524SHoward Hinnant } 25733e519524SHoward Hinnant if (__len <= __p.second) 25743e519524SHoward Hinnant { // The buffer is big enough to use 25753e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 25763e519524SHoward Hinnant __destruct_n __d(0); 25773e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 25783e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 25793e519524SHoward Hinnant // Update __first to always point to the end of the trues 25803e519524SHoward Hinnant value_type* __t = __p.first; 25813e519524SHoward Hinnant ::new(__t) value_type(_STD::move(*__first)); 25823e519524SHoward Hinnant __d.__incr((value_type*)0); 25833e519524SHoward Hinnant ++__t; 25843e519524SHoward Hinnant _ForwardIterator __i = __first; 25853e519524SHoward Hinnant while (++__i != __last) 25863e519524SHoward Hinnant { 25873e519524SHoward Hinnant if (__pred(*__i)) 25883e519524SHoward Hinnant { 25893e519524SHoward Hinnant *__first = _STD::move(*__i); 25903e519524SHoward Hinnant ++__first; 25913e519524SHoward Hinnant } 25923e519524SHoward Hinnant else 25933e519524SHoward Hinnant { 25943e519524SHoward Hinnant ::new(__t) value_type(_STD::move(*__i)); 25953e519524SHoward Hinnant __d.__incr((value_type*)0); 25963e519524SHoward Hinnant ++__t; 25973e519524SHoward Hinnant } 25983e519524SHoward Hinnant } 25993e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 26003e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 26013e519524SHoward Hinnant __i = __first; 26023e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 26033e519524SHoward Hinnant *__i = _STD::move(*__t2); 26043e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 26053e519524SHoward Hinnant return __first; 26063e519524SHoward Hinnant } 26073e519524SHoward Hinnant // Else not enough buffer, do in place 26083e519524SHoward Hinnant // __len >= 3 26093e519524SHoward Hinnant _ForwardIterator __m = __first; 26103e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 26113e519524SHoward Hinnant _STD::advance(__m, __len2); 26123e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 26133e519524SHoward Hinnant // F????????????????? 26143e519524SHoward Hinnant // f m l 26153e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 26163e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 26173e519524SHoward Hinnant // TTTFFFFF?????????? 26183e519524SHoward Hinnant // f ff m l 26193e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 26203e519524SHoward Hinnant _ForwardIterator __m1 = __m; 26213e519524SHoward Hinnant _ForwardIterator __second_false = __last; 26223e519524SHoward Hinnant _Distance __len_half = __len - __len2; 26233e519524SHoward Hinnant while (__pred(*__m1)) 26243e519524SHoward Hinnant { 26253e519524SHoward Hinnant if (++__m1 == __last) 26263e519524SHoward Hinnant goto __second_half_done; 26273e519524SHoward Hinnant --__len_half; 26283e519524SHoward Hinnant } 26293e519524SHoward Hinnant // TTTFFFFFTTTF?????? 26303e519524SHoward Hinnant // f ff m m1 l 26313e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 26323e519524SHoward Hinnant__second_half_done: 26333e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 26343e519524SHoward Hinnant // f ff m sf l 26353e519524SHoward Hinnant return _STD::rotate(__first_false, __m, __second_false); 26363e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 26373e519524SHoward Hinnant // | 26383e519524SHoward Hinnant} 26393e519524SHoward Hinnant 26403e519524SHoward Hinnantstruct __return_temporary_buffer 26413e519524SHoward Hinnant{ 26423e519524SHoward Hinnant template <class _Tp> 26433e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_STD::return_temporary_buffer(__p);} 26443e519524SHoward Hinnant}; 26453e519524SHoward Hinnant 26463e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 26473e519524SHoward Hinnant_ForwardIterator 26483e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 26493e519524SHoward Hinnant forward_iterator_tag) 26503e519524SHoward Hinnant{ 26513e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 26523e519524SHoward Hinnant // Either prove all true and return __first or point to first false 26533e519524SHoward Hinnant while (true) 26543e519524SHoward Hinnant { 26553e519524SHoward Hinnant if (__first == __last) 26563e519524SHoward Hinnant return __first; 26573e519524SHoward Hinnant if (!__pred(*__first)) 26583e519524SHoward Hinnant break; 26593e519524SHoward Hinnant ++__first; 26603e519524SHoward Hinnant } 26613e519524SHoward Hinnant // We now have a reduced range [__first, __last) 26623e519524SHoward Hinnant // *__first is known to be false 26633e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 26643e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 26653e519524SHoward Hinnant difference_type __len = _STD::distance(__first, __last); 26663e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 26673e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 26683e519524SHoward Hinnant if (__len >= __alloc_limit) 26693e519524SHoward Hinnant { 26703e519524SHoward Hinnant __p = _STD::get_temporary_buffer<value_type>(__len); 26713e519524SHoward Hinnant __h.reset(__p.first); 26723e519524SHoward Hinnant } 26733e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 26743e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 26753e519524SHoward Hinnant} 26763e519524SHoward Hinnant 26773e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 26783e519524SHoward Hinnant_BidirectionalIterator 26793e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 26803e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 26813e519524SHoward Hinnant{ 26823e519524SHoward Hinnant // *__first is known to be false 26833e519524SHoward Hinnant // *__last is known to be true 26843e519524SHoward Hinnant // __len >= 2 26853e519524SHoward Hinnant if (__len == 2) 26863e519524SHoward Hinnant { 26873e519524SHoward Hinnant swap(*__first, *__last); 26883e519524SHoward Hinnant return __last; 26893e519524SHoward Hinnant } 26903e519524SHoward Hinnant if (__len == 3) 26913e519524SHoward Hinnant { 26923e519524SHoward Hinnant _BidirectionalIterator __m = __first; 26933e519524SHoward Hinnant if (__pred(*++__m)) 26943e519524SHoward Hinnant { 26953e519524SHoward Hinnant swap(*__first, *__m); 26963e519524SHoward Hinnant swap(*__m, *__last); 26973e519524SHoward Hinnant return __last; 26983e519524SHoward Hinnant } 26993e519524SHoward Hinnant swap(*__m, *__last); 27003e519524SHoward Hinnant swap(*__first, *__m); 27013e519524SHoward Hinnant return __m; 27023e519524SHoward Hinnant } 27033e519524SHoward Hinnant if (__len <= __p.second) 27043e519524SHoward Hinnant { // The buffer is big enough to use 27053e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 27063e519524SHoward Hinnant __destruct_n __d(0); 27073e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 27083e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 27093e519524SHoward Hinnant // Update __first to always point to the end of the trues 27103e519524SHoward Hinnant value_type* __t = __p.first; 27113e519524SHoward Hinnant ::new(__t) value_type(_STD::move(*__first)); 27123e519524SHoward Hinnant __d.__incr((value_type*)0); 27133e519524SHoward Hinnant ++__t; 27143e519524SHoward Hinnant _BidirectionalIterator __i = __first; 27153e519524SHoward Hinnant while (++__i != __last) 27163e519524SHoward Hinnant { 27173e519524SHoward Hinnant if (__pred(*__i)) 27183e519524SHoward Hinnant { 27193e519524SHoward Hinnant *__first = _STD::move(*__i); 27203e519524SHoward Hinnant ++__first; 27213e519524SHoward Hinnant } 27223e519524SHoward Hinnant else 27233e519524SHoward Hinnant { 27243e519524SHoward Hinnant ::new(__t) value_type(_STD::move(*__i)); 27253e519524SHoward Hinnant __d.__incr((value_type*)0); 27263e519524SHoward Hinnant ++__t; 27273e519524SHoward Hinnant } 27283e519524SHoward Hinnant } 27293e519524SHoward Hinnant // move *__last, known to be true 27303e519524SHoward Hinnant *__first = _STD::move(*__i); 27313e519524SHoward Hinnant __i = ++__first; 27323e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 27333e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 27343e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 27353e519524SHoward Hinnant *__i = _STD::move(*__t2); 27363e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 27373e519524SHoward Hinnant return __first; 27383e519524SHoward Hinnant } 27393e519524SHoward Hinnant // Else not enough buffer, do in place 27403e519524SHoward Hinnant // __len >= 4 27413e519524SHoward Hinnant _BidirectionalIterator __m = __first; 27423e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 27433e519524SHoward Hinnant _STD::advance(__m, __len2); 27443e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 27453e519524SHoward Hinnant // F????????????????T 27463e519524SHoward Hinnant // f m l 27473e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 27483e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 27493e519524SHoward Hinnant _Distance __len_half = __len2; 27503e519524SHoward Hinnant while (!__pred(*--__m1)) 27513e519524SHoward Hinnant { 27523e519524SHoward Hinnant if (__m1 == __first) 27533e519524SHoward Hinnant goto __first_half_done; 27543e519524SHoward Hinnant --__len_half; 27553e519524SHoward Hinnant } 27563e519524SHoward Hinnant // F???TFFF?????????T 27573e519524SHoward Hinnant // f m1 m l 27583e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 27593e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 27603e519524SHoward Hinnant__first_half_done: 27613e519524SHoward Hinnant // TTTFFFFF?????????T 27623e519524SHoward Hinnant // f ff m l 27633e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 27643e519524SHoward Hinnant __m1 = __m; 27653e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 27663e519524SHoward Hinnant ++__second_false; 27673e519524SHoward Hinnant __len_half = __len - __len2; 27683e519524SHoward Hinnant while (__pred(*__m1)) 27693e519524SHoward Hinnant { 27703e519524SHoward Hinnant if (++__m1 == __last) 27713e519524SHoward Hinnant goto __second_half_done; 27723e519524SHoward Hinnant --__len_half; 27733e519524SHoward Hinnant } 27743e519524SHoward Hinnant // TTTFFFFFTTTF?????T 27753e519524SHoward Hinnant // f ff m m1 l 27763e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 27773e519524SHoward Hinnant__second_half_done: 27783e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 27793e519524SHoward Hinnant // f ff m sf l 27803e519524SHoward Hinnant return _STD::rotate(__first_false, __m, __second_false); 27813e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 27823e519524SHoward Hinnant // | 27833e519524SHoward Hinnant} 27843e519524SHoward Hinnant 27853e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 27863e519524SHoward Hinnant_BidirectionalIterator 27873e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 27883e519524SHoward Hinnant bidirectional_iterator_tag) 27893e519524SHoward Hinnant{ 27903e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 27913e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 27923e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 27933e519524SHoward Hinnant // Either prove all true and return __first or point to first false 27943e519524SHoward Hinnant while (true) 27953e519524SHoward Hinnant { 27963e519524SHoward Hinnant if (__first == __last) 27973e519524SHoward Hinnant return __first; 27983e519524SHoward Hinnant if (!__pred(*__first)) 27993e519524SHoward Hinnant break; 28003e519524SHoward Hinnant ++__first; 28013e519524SHoward Hinnant } 28023e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 28033e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 28043e519524SHoward Hinnant do 28053e519524SHoward Hinnant { 28063e519524SHoward Hinnant if (__first == --__last) 28073e519524SHoward Hinnant return __first; 28083e519524SHoward Hinnant } while (!__pred(*__last)); 28093e519524SHoward Hinnant // We now have a reduced range [__first, __last] 28103e519524SHoward Hinnant // *__first is known to be false 28113e519524SHoward Hinnant // *__last is known to be true 28123e519524SHoward Hinnant // __len >= 2 28133e519524SHoward Hinnant difference_type __len = _STD::distance(__first, __last) + 1; 28143e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 28153e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 28163e519524SHoward Hinnant if (__len >= __alloc_limit) 28173e519524SHoward Hinnant { 28183e519524SHoward Hinnant __p = _STD::get_temporary_buffer<value_type>(__len); 28193e519524SHoward Hinnant __h.reset(__p.first); 28203e519524SHoward Hinnant } 28213e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 28223e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 28233e519524SHoward Hinnant} 28243e519524SHoward Hinnant 28253e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 28263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 28273e519524SHoward Hinnant_ForwardIterator 28283e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 28293e519524SHoward Hinnant{ 28303e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 28313e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 28323e519524SHoward Hinnant} 28333e519524SHoward Hinnant 28343e519524SHoward Hinnant// is_sorted_until 28353e519524SHoward Hinnant 28363e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 28373e519524SHoward Hinnant_ForwardIterator 28383e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 28393e519524SHoward Hinnant{ 28403e519524SHoward Hinnant if (__first != __last) 28413e519524SHoward Hinnant { 28423e519524SHoward Hinnant _ForwardIterator __i = __first; 28433e519524SHoward Hinnant while (++__i != __last) 28443e519524SHoward Hinnant { 28453e519524SHoward Hinnant if (__comp(*__i, *__first)) 28463e519524SHoward Hinnant return __i; 28473e519524SHoward Hinnant __first = __i; 28483e519524SHoward Hinnant } 28493e519524SHoward Hinnant } 28503e519524SHoward Hinnant return __last; 28513e519524SHoward Hinnant} 28523e519524SHoward Hinnant 28533e519524SHoward Hinnanttemplate<class _ForwardIterator> 28543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 28553e519524SHoward Hinnant_ForwardIterator 28563e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 28573e519524SHoward Hinnant{ 28583e519524SHoward Hinnant return _STD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 28593e519524SHoward Hinnant} 28603e519524SHoward Hinnant 28613e519524SHoward Hinnant// is_sorted 28623e519524SHoward Hinnant 28633e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 28643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 28653e519524SHoward Hinnantbool 28663e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 28673e519524SHoward Hinnant{ 28683e519524SHoward Hinnant return _STD::is_sorted_until(__first, __last, __comp) == __last; 28693e519524SHoward Hinnant} 28703e519524SHoward Hinnant 28713e519524SHoward Hinnanttemplate<class _ForwardIterator> 28723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 28733e519524SHoward Hinnantbool 28743e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 28753e519524SHoward Hinnant{ 28763e519524SHoward Hinnant return _STD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 28773e519524SHoward Hinnant} 28783e519524SHoward Hinnant 28793e519524SHoward Hinnant// sort 28803e519524SHoward Hinnant 28813e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 28823e519524SHoward Hinnant 28833e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 28843e519524SHoward Hinnantunsigned 28853e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 28863e519524SHoward Hinnant{ 28873e519524SHoward Hinnant unsigned __r = 0; 28883e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 28893e519524SHoward Hinnant { 28903e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 28913e519524SHoward Hinnant return __r; // x <= y && y <= z 28923e519524SHoward Hinnant // x <= y && y > z 28933e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 28943e519524SHoward Hinnant __r = 1; 28953e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 28963e519524SHoward Hinnant { 28973e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 28983e519524SHoward Hinnant __r = 2; 28993e519524SHoward Hinnant } 29003e519524SHoward Hinnant return __r; // x <= y && y < z 29013e519524SHoward Hinnant } 29023e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 29033e519524SHoward Hinnant { 29043e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 29053e519524SHoward Hinnant __r = 1; 29063e519524SHoward Hinnant return __r; 29073e519524SHoward Hinnant } 29083e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 29093e519524SHoward Hinnant __r = 1; // x < y && x <= z 29103e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 29113e519524SHoward Hinnant { 29123e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 29133e519524SHoward Hinnant __r = 2; 29143e519524SHoward Hinnant } 29153e519524SHoward Hinnant return __r; 29163e519524SHoward Hinnant} // x <= y && y <= z 29173e519524SHoward Hinnant 29183e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 29193e519524SHoward Hinnant 29203e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 29213e519524SHoward Hinnantunsigned 29223e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 29233e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 29243e519524SHoward Hinnant{ 29253e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 29263e519524SHoward Hinnant if (__c(*__x4, *__x3)) 29273e519524SHoward Hinnant { 29283e519524SHoward Hinnant swap(*__x3, *__x4); 29293e519524SHoward Hinnant ++__r; 29303e519524SHoward Hinnant if (__c(*__x3, *__x2)) 29313e519524SHoward Hinnant { 29323e519524SHoward Hinnant swap(*__x2, *__x3); 29333e519524SHoward Hinnant ++__r; 29343e519524SHoward Hinnant if (__c(*__x2, *__x1)) 29353e519524SHoward Hinnant { 29363e519524SHoward Hinnant swap(*__x1, *__x2); 29373e519524SHoward Hinnant ++__r; 29383e519524SHoward Hinnant } 29393e519524SHoward Hinnant } 29403e519524SHoward Hinnant } 29413e519524SHoward Hinnant return __r; 29423e519524SHoward Hinnant} 29433e519524SHoward Hinnant 29443e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 29453e519524SHoward Hinnant 29463e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 29473e519524SHoward Hinnantunsigned 29483e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 29493e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 29503e519524SHoward Hinnant{ 29513e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 29523e519524SHoward Hinnant if (__c(*__x5, *__x4)) 29533e519524SHoward Hinnant { 29543e519524SHoward Hinnant swap(*__x4, *__x5); 29553e519524SHoward Hinnant ++__r; 29563e519524SHoward Hinnant if (__c(*__x4, *__x3)) 29573e519524SHoward Hinnant { 29583e519524SHoward Hinnant swap(*__x3, *__x4); 29593e519524SHoward Hinnant ++__r; 29603e519524SHoward Hinnant if (__c(*__x3, *__x2)) 29613e519524SHoward Hinnant { 29623e519524SHoward Hinnant swap(*__x2, *__x3); 29633e519524SHoward Hinnant ++__r; 29643e519524SHoward Hinnant if (__c(*__x2, *__x1)) 29653e519524SHoward Hinnant { 29663e519524SHoward Hinnant swap(*__x1, *__x2); 29673e519524SHoward Hinnant ++__r; 29683e519524SHoward Hinnant } 29693e519524SHoward Hinnant } 29703e519524SHoward Hinnant } 29713e519524SHoward Hinnant } 29723e519524SHoward Hinnant return __r; 29733e519524SHoward Hinnant} 29743e519524SHoward Hinnant 29753e519524SHoward Hinnant// Assumes size > 0 29763e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 29773e519524SHoward Hinnantvoid 29783e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 29793e519524SHoward Hinnant{ 29803e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 29813e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 29823e519524SHoward Hinnant { 29833e519524SHoward Hinnant _BirdirectionalIterator __i = _STD::min_element<_BirdirectionalIterator, 29843e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 29853e519524SHoward Hinnant (__first, __last, __comp); 29863e519524SHoward Hinnant if (__i != __first) 29873e519524SHoward Hinnant swap(*__first, *__i); 29883e519524SHoward Hinnant } 29893e519524SHoward Hinnant} 29903e519524SHoward Hinnant 29913e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 29923e519524SHoward Hinnantvoid 29933e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 29943e519524SHoward Hinnant{ 29953e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 29963e519524SHoward Hinnant if (__first != __last) 29973e519524SHoward Hinnant { 29983e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 29993e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 30003e519524SHoward Hinnant { 30013e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 30023e519524SHoward Hinnant value_type __t(_STD::move(*__j)); 30033e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 30043e519524SHoward Hinnant *__j = _STD::move(*__k); 30053e519524SHoward Hinnant *__j = _STD::move(__t); 30063e519524SHoward Hinnant } 30073e519524SHoward Hinnant } 30083e519524SHoward Hinnant} 30093e519524SHoward Hinnant 30103e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 30113e519524SHoward Hinnantvoid 30123e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 30133e519524SHoward Hinnant{ 30143e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 30153e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 30163e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 30173e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 30183e519524SHoward Hinnant { 30193e519524SHoward Hinnant if (__comp(*__i, *__j)) 30203e519524SHoward Hinnant { 30213e519524SHoward Hinnant value_type __t(_STD::move(*__i)); 30223e519524SHoward Hinnant _RandomAccessIterator __k = __j; 30233e519524SHoward Hinnant __j = __i; 30243e519524SHoward Hinnant do 30253e519524SHoward Hinnant { 30263e519524SHoward Hinnant *__j = _STD::move(*__k); 30273e519524SHoward Hinnant __j = __k; 30283e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 30293e519524SHoward Hinnant *__j = _STD::move(__t); 30303e519524SHoward Hinnant } 30313e519524SHoward Hinnant __j = __i; 30323e519524SHoward Hinnant } 30333e519524SHoward Hinnant} 30343e519524SHoward Hinnant 30353e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 30363e519524SHoward Hinnantbool 30373e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 30383e519524SHoward Hinnant{ 30393e519524SHoward Hinnant switch (__last - __first) 30403e519524SHoward Hinnant { 30413e519524SHoward Hinnant case 0: 30423e519524SHoward Hinnant case 1: 30433e519524SHoward Hinnant return true; 30443e519524SHoward Hinnant case 2: 30453e519524SHoward Hinnant if (__comp(*--__last, *__first)) 30463e519524SHoward Hinnant swap(*__first, *__last); 30473e519524SHoward Hinnant return true; 30483e519524SHoward Hinnant case 3: 30493e519524SHoward Hinnant _STD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 30503e519524SHoward Hinnant return true; 30513e519524SHoward Hinnant case 4: 30523e519524SHoward Hinnant _STD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 30533e519524SHoward Hinnant return true; 30543e519524SHoward Hinnant case 5: 30553e519524SHoward Hinnant _STD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 30563e519524SHoward Hinnant return true; 30573e519524SHoward Hinnant } 30583e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 30593e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 30603e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 30613e519524SHoward Hinnant const unsigned __limit = 8; 30623e519524SHoward Hinnant unsigned __count = 0; 30633e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 30643e519524SHoward Hinnant { 30653e519524SHoward Hinnant if (__comp(*__i, *__j)) 30663e519524SHoward Hinnant { 30673e519524SHoward Hinnant value_type __t(_STD::move(*__i)); 30683e519524SHoward Hinnant _RandomAccessIterator __k = __j; 30693e519524SHoward Hinnant __j = __i; 30703e519524SHoward Hinnant do 30713e519524SHoward Hinnant { 30723e519524SHoward Hinnant *__j = _STD::move(*__k); 30733e519524SHoward Hinnant __j = __k; 30743e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 30753e519524SHoward Hinnant *__j = _STD::move(__t); 30763e519524SHoward Hinnant if (++__count == __limit) 30773e519524SHoward Hinnant return ++__i == __last; 30783e519524SHoward Hinnant } 30793e519524SHoward Hinnant __j = __i; 30803e519524SHoward Hinnant } 30813e519524SHoward Hinnant return true; 30823e519524SHoward Hinnant} 30833e519524SHoward Hinnant 30843e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 30853e519524SHoward Hinnantvoid 30863e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 30873e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 30883e519524SHoward Hinnant{ 30893e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 30903e519524SHoward Hinnant if (__first1 != __last1) 30913e519524SHoward Hinnant { 30923e519524SHoward Hinnant __destruct_n __d(0); 30933e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 30943e519524SHoward Hinnant value_type* __last2 = __first2; 30953e519524SHoward Hinnant ::new(__last2) value_type(_STD::move(*__first1)); 30963e519524SHoward Hinnant __d.__incr((value_type*)0); 30973e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 30983e519524SHoward Hinnant { 30993e519524SHoward Hinnant value_type* __j2 = __last2; 31003e519524SHoward Hinnant value_type* __i2 = __j2; 31013e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 31023e519524SHoward Hinnant { 31033e519524SHoward Hinnant ::new(__j2) value_type(_STD::move(*__i2)); 31043e519524SHoward Hinnant __d.__incr((value_type*)0); 31053e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 31063e519524SHoward Hinnant *__j2 = _STD::move(*__i2); 31073e519524SHoward Hinnant *__j2 = _STD::move(*__first1); 31083e519524SHoward Hinnant } 31093e519524SHoward Hinnant else 31103e519524SHoward Hinnant { 31113e519524SHoward Hinnant ::new(__j2) value_type(_STD::move(*__first1)); 31123e519524SHoward Hinnant __d.__incr((value_type*)0); 31133e519524SHoward Hinnant } 31143e519524SHoward Hinnant } 31153e519524SHoward Hinnant __h.release(); 31163e519524SHoward Hinnant } 31173e519524SHoward Hinnant} 31183e519524SHoward Hinnant 31193e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 31203e519524SHoward Hinnantvoid 31213e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 31223e519524SHoward Hinnant{ 31233e519524SHoward Hinnant // _Compare is known to be a reference type 31243e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 31253e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 31263e519524SHoward Hinnant const difference_type __limit = has_trivial_copy_constructor<value_type>::value && 31273e519524SHoward Hinnant has_trivial_copy_assign<value_type>::value ? 30 : 6; 31283e519524SHoward Hinnant while (true) 31293e519524SHoward Hinnant { 31303e519524SHoward Hinnant __restart: 31313e519524SHoward Hinnant difference_type __len = __last - __first; 31323e519524SHoward Hinnant switch (__len) 31333e519524SHoward Hinnant { 31343e519524SHoward Hinnant case 0: 31353e519524SHoward Hinnant case 1: 31363e519524SHoward Hinnant return; 31373e519524SHoward Hinnant case 2: 31383e519524SHoward Hinnant if (__comp(*--__last, *__first)) 31393e519524SHoward Hinnant swap(*__first, *__last); 31403e519524SHoward Hinnant return; 31413e519524SHoward Hinnant case 3: 31423e519524SHoward Hinnant _STD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 31433e519524SHoward Hinnant return; 31443e519524SHoward Hinnant case 4: 31453e519524SHoward Hinnant _STD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 31463e519524SHoward Hinnant return; 31473e519524SHoward Hinnant case 5: 31483e519524SHoward Hinnant _STD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 31493e519524SHoward Hinnant return; 31503e519524SHoward Hinnant } 31513e519524SHoward Hinnant if (__len <= __limit) 31523e519524SHoward Hinnant { 31533e519524SHoward Hinnant _STD::__insertion_sort_3<_Compare>(__first, __last, __comp); 31543e519524SHoward Hinnant return; 31553e519524SHoward Hinnant } 31563e519524SHoward Hinnant // __len > 5 31573e519524SHoward Hinnant _RandomAccessIterator __m = __first; 31583e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 31593e519524SHoward Hinnant --__lm1; 31603e519524SHoward Hinnant unsigned __n_swaps; 31613e519524SHoward Hinnant { 31623e519524SHoward Hinnant difference_type __delta; 31633e519524SHoward Hinnant if (__len >= 1000) 31643e519524SHoward Hinnant { 31653e519524SHoward Hinnant __delta = __len/2; 31663e519524SHoward Hinnant __m += __delta; 31673e519524SHoward Hinnant __delta /= 2; 31683e519524SHoward Hinnant __n_swaps = _STD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 31693e519524SHoward Hinnant } 31703e519524SHoward Hinnant else 31713e519524SHoward Hinnant { 31723e519524SHoward Hinnant __delta = __len/2; 31733e519524SHoward Hinnant __m += __delta; 31743e519524SHoward Hinnant __n_swaps = _STD::__sort3<_Compare>(__first, __m, __lm1, __comp); 31753e519524SHoward Hinnant } 31763e519524SHoward Hinnant } 31773e519524SHoward Hinnant // *__m is median 31783e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 31793e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 31803e519524SHoward Hinnant _RandomAccessIterator __i = __first; 31813e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 31823e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 31833e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 31843e519524SHoward Hinnant // Prime the downward search with a guard. 31853e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 31863e519524SHoward Hinnant { 31873e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 31883e519524SHoward Hinnant // manually guard downward moving __j against __i 31893e519524SHoward Hinnant while (true) 31903e519524SHoward Hinnant { 31913e519524SHoward Hinnant if (__i == --__j) 31923e519524SHoward Hinnant { 31933e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 31943e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 31953e519524SHoward Hinnant ++__i; // __first + 1 31963e519524SHoward Hinnant __j = __last; 31973e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 31983e519524SHoward Hinnant { 31993e519524SHoward Hinnant while (true) 32003e519524SHoward Hinnant { 32013e519524SHoward Hinnant if (__i == __j) 32023e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 32033e519524SHoward Hinnant if (__comp(*__first, *__i)) 32043e519524SHoward Hinnant { 32053e519524SHoward Hinnant swap(*__i, *__j); 32063e519524SHoward Hinnant ++__n_swaps; 32073e519524SHoward Hinnant ++__i; 32083e519524SHoward Hinnant break; 32093e519524SHoward Hinnant } 32103e519524SHoward Hinnant ++__i; 32113e519524SHoward Hinnant } 32123e519524SHoward Hinnant } 32133e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 32143e519524SHoward Hinnant if (__i == __j) 32153e519524SHoward Hinnant return; 32163e519524SHoward Hinnant while (true) 32173e519524SHoward Hinnant { 32183e519524SHoward Hinnant while (!__comp(*__first, *__i)) 32193e519524SHoward Hinnant ++__i; 32203e519524SHoward Hinnant while (__comp(*__first, *--__j)) 32213e519524SHoward Hinnant ; 32223e519524SHoward Hinnant if (__i >= __j) 32233e519524SHoward Hinnant break; 32243e519524SHoward Hinnant swap(*__i, *__j); 32253e519524SHoward Hinnant ++__n_swaps; 32263e519524SHoward Hinnant ++__i; 32273e519524SHoward Hinnant } 32283e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 32293e519524SHoward Hinnant // The first part is sorted, sort the secod part 32303e519524SHoward Hinnant // _STD::__sort<_Compare>(__i, __last, __comp); 32313e519524SHoward Hinnant __first = __i; 32323e519524SHoward Hinnant goto __restart; 32333e519524SHoward Hinnant } 32343e519524SHoward Hinnant if (__comp(*__j, *__m)) 32353e519524SHoward Hinnant { 32363e519524SHoward Hinnant swap(*__i, *__j); 32373e519524SHoward Hinnant ++__n_swaps; 32383e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 32393e519524SHoward Hinnant } 32403e519524SHoward Hinnant } 32413e519524SHoward Hinnant } 32423e519524SHoward Hinnant // It is known that *__i < *__m 32433e519524SHoward Hinnant ++__i; 32443e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 32453e519524SHoward Hinnant // if not yet partitioned... 32463e519524SHoward Hinnant if (__i < __j) 32473e519524SHoward Hinnant { 32483e519524SHoward Hinnant // known that *(__i - 1) < *__m 32493e519524SHoward Hinnant // known that __i <= __m 32503e519524SHoward Hinnant while (true) 32513e519524SHoward Hinnant { 32523e519524SHoward Hinnant // __m still guards upward moving __i 32533e519524SHoward Hinnant while (__comp(*__i, *__m)) 32543e519524SHoward Hinnant ++__i; 32553e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 32563e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 32573e519524SHoward Hinnant ; 32583e519524SHoward Hinnant if (__i > __j) 32593e519524SHoward Hinnant break; 32603e519524SHoward Hinnant swap(*__i, *__j); 32613e519524SHoward Hinnant ++__n_swaps; 32623e519524SHoward Hinnant // It is known that __m != __j 32633e519524SHoward Hinnant // If __m just moved, follow it 32643e519524SHoward Hinnant if (__m == __i) 32653e519524SHoward Hinnant __m = __j; 32663e519524SHoward Hinnant ++__i; 32673e519524SHoward Hinnant } 32683e519524SHoward Hinnant } 32693e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 32703e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 32713e519524SHoward Hinnant { 32723e519524SHoward Hinnant swap(*__i, *__m); 32733e519524SHoward Hinnant ++__n_swaps; 32743e519524SHoward Hinnant } 32753e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 32763e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 32773e519524SHoward Hinnant if (__n_swaps == 0) 32783e519524SHoward Hinnant { 32793e519524SHoward Hinnant bool __fs = _STD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 32803e519524SHoward Hinnant if (_STD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 32813e519524SHoward Hinnant { 32823e519524SHoward Hinnant if (__fs) 32833e519524SHoward Hinnant return; 32843e519524SHoward Hinnant __last = __i; 32853e519524SHoward Hinnant continue; 32863e519524SHoward Hinnant } 32873e519524SHoward Hinnant else 32883e519524SHoward Hinnant { 32893e519524SHoward Hinnant if (__fs) 32903e519524SHoward Hinnant { 32913e519524SHoward Hinnant __first = ++__i; 32923e519524SHoward Hinnant continue; 32933e519524SHoward Hinnant } 32943e519524SHoward Hinnant } 32953e519524SHoward Hinnant } 32963e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 32973e519524SHoward Hinnant if (__i - __first < __last - __i) 32983e519524SHoward Hinnant { 32993e519524SHoward Hinnant _STD::__sort<_Compare>(__first, __i, __comp); 33003e519524SHoward Hinnant // _STD::__sort<_Compare>(__i+1, __last, __comp); 33013e519524SHoward Hinnant __first = ++__i; 33023e519524SHoward Hinnant } 33033e519524SHoward Hinnant else 33043e519524SHoward Hinnant { 33053e519524SHoward Hinnant _STD::__sort<_Compare>(__i+1, __last, __comp); 33063e519524SHoward Hinnant // _STD::__sort<_Compare>(__first, __i, __comp); 33073e519524SHoward Hinnant __last = __i; 33083e519524SHoward Hinnant } 33093e519524SHoward Hinnant } 33103e519524SHoward Hinnant} 33113e519524SHoward Hinnant 33123e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 33133e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 33143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 33153e519524SHoward Hinnantvoid 33163e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 33173e519524SHoward Hinnant{ 33183e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 33193e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 33203e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 33213e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 33223e519524SHoward Hinnant#else 33233e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 33243e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 33253e519524SHoward Hinnant#endif 33263e519524SHoward Hinnant} 33273e519524SHoward Hinnant 33283e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 33293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 33303e519524SHoward Hinnantvoid 33313e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 33323e519524SHoward Hinnant{ 33333e519524SHoward Hinnant _STD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 33343e519524SHoward Hinnant} 33353e519524SHoward Hinnant 33363e519524SHoward Hinnanttemplate <class _Tp> 33373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 33383e519524SHoward Hinnantvoid 33393e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 33403e519524SHoward Hinnant{ 33413e519524SHoward Hinnant _STD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 33423e519524SHoward Hinnant} 33433e519524SHoward Hinnant 33443e519524SHoward Hinnanttemplate <class _Tp> 33453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 33463e519524SHoward Hinnantvoid 33473e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 33483e519524SHoward Hinnant{ 33493e519524SHoward Hinnant _STD::sort(__first.base(), __last.base()); 33503e519524SHoward Hinnant} 33513e519524SHoward Hinnant 33523e519524SHoward Hinnantextern template void __sort<__less<char>&, char*>(char*, char*, __less<char>&); 33533e519524SHoward Hinnantextern template void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&); 33543e519524SHoward Hinnantextern template void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&); 33553e519524SHoward Hinnantextern template void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&); 33563e519524SHoward Hinnantextern template void __sort<__less<short>&, short*>(short*, short*, __less<short>&); 33573e519524SHoward Hinnantextern template void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&); 33583e519524SHoward Hinnantextern template void __sort<__less<int>&, int*>(int*, int*, __less<int>&); 33593e519524SHoward Hinnantextern template void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&); 33603e519524SHoward Hinnantextern template void __sort<__less<long>&, long*>(long*, long*, __less<long>&); 33613e519524SHoward Hinnantextern template void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&); 33623e519524SHoward Hinnantextern template void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&); 33633e519524SHoward Hinnantextern template void __sort<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&); 33643e519524SHoward Hinnantextern template void __sort<__less<float>&, float*>(float*, float*, __less<float>&); 33653e519524SHoward Hinnantextern template void __sort<__less<double>&, double*>(double*, double*, __less<double>&); 33663e519524SHoward Hinnantextern template void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&); 33673e519524SHoward Hinnant 33683e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&); 33693e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&); 33703e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&); 33713e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&); 33723e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&); 33733e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&); 33743e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&); 33753e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&); 33763e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&); 33773e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&); 33783e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&); 33793e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&); 33803e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&); 33813e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&); 33823e519524SHoward Hinnantextern template bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&); 33833e519524SHoward Hinnant 33843e519524SHoward Hinnantextern template unsigned __sort5<__less<long double>&, long double*>(long double*, long double*, long double*, long double*, long double*, __less<long double>&); 33853e519524SHoward Hinnant 33863e519524SHoward Hinnant// lower_bound 33873e519524SHoward Hinnant 33883e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 33893e519524SHoward Hinnant_ForwardIterator 33903e519524SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 33913e519524SHoward Hinnant{ 33923e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 33933e519524SHoward Hinnant difference_type __len = _STD::distance(__first, __last); 33943e519524SHoward Hinnant while (__len != 0) 33953e519524SHoward Hinnant { 33963e519524SHoward Hinnant difference_type __l2 = __len / 2; 33973e519524SHoward Hinnant _ForwardIterator __m = __first; 33983e519524SHoward Hinnant _STD::advance(__m, __l2); 33993e519524SHoward Hinnant if (__comp(*__m, __value)) 34003e519524SHoward Hinnant { 34013e519524SHoward Hinnant __first = ++__m; 34023e519524SHoward Hinnant __len -= __l2 + 1; 34033e519524SHoward Hinnant } 34043e519524SHoward Hinnant else 34053e519524SHoward Hinnant __len = __l2; 34063e519524SHoward Hinnant } 34073e519524SHoward Hinnant return __first; 34083e519524SHoward Hinnant} 34093e519524SHoward Hinnant 34103e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 34113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 34123e519524SHoward Hinnant_ForwardIterator 34133e519524SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 34143e519524SHoward Hinnant{ 34153e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 34163e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 34173e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 34183e519524SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value, __c); 34193e519524SHoward Hinnant#else 34203e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 34213e519524SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value, __comp); 34223e519524SHoward Hinnant#endif 34233e519524SHoward Hinnant} 34243e519524SHoward Hinnant 34253e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 34263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 34273e519524SHoward Hinnant_ForwardIterator 34283e519524SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) 34293e519524SHoward Hinnant{ 34303e519524SHoward Hinnant return _STD::lower_bound(__first, __last, __value, 34313e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 34323e519524SHoward Hinnant} 34333e519524SHoward Hinnant 34343e519524SHoward Hinnant// upper_bound 34353e519524SHoward Hinnant 34363e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 34373e519524SHoward Hinnant_ForwardIterator 34383e519524SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 34393e519524SHoward Hinnant{ 34403e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 34413e519524SHoward Hinnant difference_type __len = _STD::distance(__first, __last); 34423e519524SHoward Hinnant while (__len != 0) 34433e519524SHoward Hinnant { 34443e519524SHoward Hinnant difference_type __l2 = __len / 2; 34453e519524SHoward Hinnant _ForwardIterator __m = __first; 34463e519524SHoward Hinnant _STD::advance(__m, __l2); 34473e519524SHoward Hinnant if (__comp(__value, *__m)) 34483e519524SHoward Hinnant __len = __l2; 34493e519524SHoward Hinnant else 34503e519524SHoward Hinnant { 34513e519524SHoward Hinnant __first = ++__m; 34523e519524SHoward Hinnant __len -= __l2 + 1; 34533e519524SHoward Hinnant } 34543e519524SHoward Hinnant } 34553e519524SHoward Hinnant return __first; 34563e519524SHoward Hinnant} 34573e519524SHoward Hinnant 34583e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 34593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 34603e519524SHoward Hinnant_ForwardIterator 34613e519524SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 34623e519524SHoward Hinnant{ 34633e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 34643e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 34653e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 34663e519524SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value, __c); 34673e519524SHoward Hinnant#else 34683e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 34693e519524SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value, __comp); 34703e519524SHoward Hinnant#endif 34713e519524SHoward Hinnant} 34723e519524SHoward Hinnant 34733e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 34743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 34753e519524SHoward Hinnant_ForwardIterator 34763e519524SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) 34773e519524SHoward Hinnant{ 34783e519524SHoward Hinnant return _STD::upper_bound(__first, __last, __value, 34793e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 34803e519524SHoward Hinnant} 34813e519524SHoward Hinnant 34823e519524SHoward Hinnant// equal_range 34833e519524SHoward Hinnant 34843e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 34853e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 34863e519524SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 34873e519524SHoward Hinnant{ 34883e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 34893e519524SHoward Hinnant difference_type __len = _STD::distance(__first, __last); 34903e519524SHoward Hinnant while (__len != 0) 34913e519524SHoward Hinnant { 34923e519524SHoward Hinnant difference_type __l2 = __len / 2; 34933e519524SHoward Hinnant _ForwardIterator __m = __first; 34943e519524SHoward Hinnant _STD::advance(__m, __l2); 34953e519524SHoward Hinnant if (__comp(*__m, __value)) 34963e519524SHoward Hinnant { 34973e519524SHoward Hinnant __first = ++__m; 34983e519524SHoward Hinnant __len -= __l2 + 1; 34993e519524SHoward Hinnant } 35003e519524SHoward Hinnant else if (__comp(__value, *__m)) 35013e519524SHoward Hinnant { 35023e519524SHoward Hinnant __last = __m; 35033e519524SHoward Hinnant __len = __l2; 35043e519524SHoward Hinnant } 35053e519524SHoward Hinnant else 35063e519524SHoward Hinnant { 35073e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 35083e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 35093e519524SHoward Hinnant ( 35103e519524SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value, __comp), 35113e519524SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value, __comp) 35123e519524SHoward Hinnant ); 35133e519524SHoward Hinnant } 35143e519524SHoward Hinnant } 35153e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 35163e519524SHoward Hinnant} 35173e519524SHoward Hinnant 35183e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 35193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35203e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 35213e519524SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 35223e519524SHoward Hinnant{ 35233e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 35243e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 35253e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 35263e519524SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value, __c); 35273e519524SHoward Hinnant#else 35283e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 35293e519524SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value, __comp); 35303e519524SHoward Hinnant#endif 35313e519524SHoward Hinnant} 35323e519524SHoward Hinnant 35333e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 35343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35353e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 35363e519524SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) 35373e519524SHoward Hinnant{ 35383e519524SHoward Hinnant return _STD::equal_range(__first, __last, __value, 35393e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 35403e519524SHoward Hinnant} 35413e519524SHoward Hinnant 35423e519524SHoward Hinnant// binary_search 35433e519524SHoward Hinnant 35443e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 35453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35463e519524SHoward Hinnantbool 35473e519524SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 35483e519524SHoward Hinnant{ 35493e519524SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value, __comp); 35503e519524SHoward Hinnant return __first != __last && !__comp(__value, *__first); 35513e519524SHoward Hinnant} 35523e519524SHoward Hinnant 35533e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 35543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35553e519524SHoward Hinnantbool 35563e519524SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) 35573e519524SHoward Hinnant{ 35583e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 35593e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 35603e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 35613e519524SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value, __c); 35623e519524SHoward Hinnant#else 35633e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 35643e519524SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value, __comp); 35653e519524SHoward Hinnant#endif 35663e519524SHoward Hinnant} 35673e519524SHoward Hinnant 35683e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 35693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35703e519524SHoward Hinnantbool 35713e519524SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) 35723e519524SHoward Hinnant{ 35733e519524SHoward Hinnant return _STD::binary_search(__first, __last, __value, 35743e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 35753e519524SHoward Hinnant} 35763e519524SHoward Hinnant 35773e519524SHoward Hinnant// merge 35783e519524SHoward Hinnant 35793e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 35803e519524SHoward Hinnant_OutputIterator 35813e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 35823e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 35833e519524SHoward Hinnant{ 35843e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 35853e519524SHoward Hinnant { 35863e519524SHoward Hinnant if (__first2 == __last2) 35873e519524SHoward Hinnant return _STD::copy(__first1, __last1, __result); 35883e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 35893e519524SHoward Hinnant { 35903e519524SHoward Hinnant *__result = *__first2; 35913e519524SHoward Hinnant ++__first2; 35923e519524SHoward Hinnant } 35933e519524SHoward Hinnant else 35943e519524SHoward Hinnant { 35953e519524SHoward Hinnant *__result = *__first1; 35963e519524SHoward Hinnant ++__first1; 35973e519524SHoward Hinnant } 35983e519524SHoward Hinnant } 35993e519524SHoward Hinnant return _STD::copy(__first2, __last2, __result); 36003e519524SHoward Hinnant} 36013e519524SHoward Hinnant 36023e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 36033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36043e519524SHoward Hinnant_OutputIterator 36053e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 36063e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 36073e519524SHoward Hinnant{ 36083e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 36093e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 36103e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 36113e519524SHoward Hinnant return _STD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 36123e519524SHoward Hinnant#else 36133e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 36143e519524SHoward Hinnant return _STD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 36153e519524SHoward Hinnant#endif 36163e519524SHoward Hinnant} 36173e519524SHoward Hinnant 36183e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 36193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36203e519524SHoward Hinnant_OutputIterator 36213e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 36223e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 36233e519524SHoward Hinnant{ 36243e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 36253e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 36263e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 36273e519524SHoward Hinnant} 36283e519524SHoward Hinnant 36293e519524SHoward Hinnant// inplace_merge 36303e519524SHoward Hinnant 36313e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 36323e519524SHoward Hinnantvoid 36333e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 36343e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 36353e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 36363e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 36373e519524SHoward Hinnant{ 36383e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 36393e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 36403e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::pointer pointer; 36413e519524SHoward Hinnant __destruct_n __d(0); 36423e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 36433e519524SHoward Hinnant if (__len1 <= __len2) 36443e519524SHoward Hinnant { 36453e519524SHoward Hinnant value_type* __p = __buff; 36463e519524SHoward Hinnant for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), ++__i, ++__p) 36473e519524SHoward Hinnant ::new(__p) value_type(_STD::move(*__i)); 36483e519524SHoward Hinnant __merge<_Compare>(move_iterator<value_type*>(__buff), 36493e519524SHoward Hinnant move_iterator<value_type*>(__p), 36503e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__middle), 36513e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__last), 36523e519524SHoward Hinnant __first, __comp); 36533e519524SHoward Hinnant } 36543e519524SHoward Hinnant else 36553e519524SHoward Hinnant { 36563e519524SHoward Hinnant value_type* __p = __buff; 36573e519524SHoward Hinnant for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), ++__i, ++__p) 36583e519524SHoward Hinnant ::new(__p) value_type(_STD::move(*__i)); 36593e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 36603e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 36613e519524SHoward Hinnant __merge(move_iterator<_RBi>(_RBi(__middle)), move_iterator<_RBi>(_RBi(__first)), 36623e519524SHoward Hinnant move_iterator<_Rv>(_Rv(__p)), move_iterator<_Rv>(_Rv(__buff)), 36633e519524SHoward Hinnant _RBi(__last), __negate<_Compare>(__comp)); 36643e519524SHoward Hinnant } 36653e519524SHoward Hinnant} 36663e519524SHoward Hinnant 36673e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 36683e519524SHoward Hinnantvoid 36693e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 36703e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 36713e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 36723e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 36733e519524SHoward Hinnant{ 36743e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 36753e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 36763e519524SHoward Hinnant while (true) 36773e519524SHoward Hinnant { 36783e519524SHoward Hinnant // if __middle == __last, we're done 36793e519524SHoward Hinnant if (__len2 == 0) 36803e519524SHoward Hinnant return; 36813e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 36823e519524SHoward Hinnant for (; true; ++__first, --__len1) 36833e519524SHoward Hinnant { 36843e519524SHoward Hinnant if (__len1 == 0) 36853e519524SHoward Hinnant return; 36863e519524SHoward Hinnant if (__comp(*__middle, *__first)) 36873e519524SHoward Hinnant break; 36883e519524SHoward Hinnant } 36893e519524SHoward Hinnant if (__len1 <= __buff_size || __len2 <= __buff_size) 36903e519524SHoward Hinnant { 36913e519524SHoward Hinnant __buffered_inplace_merge<_Compare>(__first, __middle, __last, __comp, __len1, __len2, __buff); 36923e519524SHoward Hinnant return; 36933e519524SHoward Hinnant } 36943e519524SHoward Hinnant // __first < __middle < __last 36953e519524SHoward Hinnant // *__first > *__middle 36963e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 36973e519524SHoward Hinnant // all elements in: 36983e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 36993e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 37003e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 37013e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 37023e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 37033e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 37043e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 37053e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 37063e519524SHoward Hinnant // binary search smaller range 37073e519524SHoward Hinnant if (__len1 < __len2) 37083e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 37093e519524SHoward Hinnant __len21 = __len2 / 2; 37103e519524SHoward Hinnant __m2 = __middle; 37113e519524SHoward Hinnant _STD::advance(__m2, __len21); 37123e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 37133e519524SHoward Hinnant __len11 = _STD::distance(__first, __m1); 37143e519524SHoward Hinnant } 37153e519524SHoward Hinnant else 37163e519524SHoward Hinnant { 37173e519524SHoward Hinnant if (__len1 == 1) 37183e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 37193e519524SHoward Hinnant // It is known *__first > *__middle 37203e519524SHoward Hinnant swap(*__first, *__middle); 37213e519524SHoward Hinnant return; 37223e519524SHoward Hinnant } 37233e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 37243e519524SHoward Hinnant __len11 = __len1 / 2; 37253e519524SHoward Hinnant __m1 = __first; 37263e519524SHoward Hinnant _STD::advance(__m1, __len11); 37273e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 37283e519524SHoward Hinnant __len21 = _STD::distance(__middle, __m2); 37293e519524SHoward Hinnant } 37303e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 37313e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 37323e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 37333e519524SHoward Hinnant // swap middle two partitions 37343e519524SHoward Hinnant __middle = _STD::rotate(__m1, __middle, __m2); 37353e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 37363e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 37373e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 37383e519524SHoward Hinnant { 37393e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 37403e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 37413e519524SHoward Hinnant __first = __middle; 37423e519524SHoward Hinnant __middle = __m2; 37433e519524SHoward Hinnant __len1 = __len12; 37443e519524SHoward Hinnant __len2 = __len22; 37453e519524SHoward Hinnant } 37463e519524SHoward Hinnant else 37473e519524SHoward Hinnant { 37483e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 37493e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 37503e519524SHoward Hinnant __last = __middle; 37513e519524SHoward Hinnant __middle = __m1; 37523e519524SHoward Hinnant __len1 = __len11; 37533e519524SHoward Hinnant __len2 = __len21; 37543e519524SHoward Hinnant } 37553e519524SHoward Hinnant } 37563e519524SHoward Hinnant} 37573e519524SHoward Hinnant 37583e519524SHoward Hinnanttemplate <class _Tp> 37593e519524SHoward Hinnantstruct __inplace_merge_switch 37603e519524SHoward Hinnant{ 37613e519524SHoward Hinnant static const unsigned value = has_trivial_copy_assign<_Tp>::value; 37623e519524SHoward Hinnant}; 37633e519524SHoward Hinnant 37643e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 37653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37663e519524SHoward Hinnantvoid 37673e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 37683e519524SHoward Hinnant _Compare __comp) 37693e519524SHoward Hinnant{ 37703e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 37713e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 37723e519524SHoward Hinnant difference_type __len1 = _STD::distance(__first, __middle); 37733e519524SHoward Hinnant difference_type __len2 = _STD::distance(__middle, __last); 37743e519524SHoward Hinnant difference_type __buf_size = _STD::min(__len1, __len2); 37753e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 37763e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 37773e519524SHoward Hinnant if (__inplace_merge_switch<value_type>::value && __buf_size > 8) 37783e519524SHoward Hinnant { 37793e519524SHoward Hinnant __buf = _STD::get_temporary_buffer<value_type>(__buf_size); 37803e519524SHoward Hinnant __h.reset(__buf.first); 37813e519524SHoward Hinnant } 37823e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 37833e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 37843e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 37853e519524SHoward Hinnant return _STD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 37863e519524SHoward Hinnant __buf.first, __buf.second); 37873e519524SHoward Hinnant#else 37883e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 37893e519524SHoward Hinnant return _STD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 37903e519524SHoward Hinnant __buf.first, __buf.second); 37913e519524SHoward Hinnant#endif 37923e519524SHoward Hinnant} 37933e519524SHoward Hinnant 37943e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 37953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37963e519524SHoward Hinnantvoid 37973e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 37983e519524SHoward Hinnant{ 37993e519524SHoward Hinnant _STD::inplace_merge(__first, __middle, __last, 38003e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 38013e519524SHoward Hinnant} 38023e519524SHoward Hinnant 38033e519524SHoward Hinnant// stable_sort 38043e519524SHoward Hinnant 38053e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 38063e519524SHoward Hinnantvoid 38073e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 38083e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 38093e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 38103e519524SHoward Hinnant{ 38113e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 38123e519524SHoward Hinnant __destruct_n __d(0); 38133e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 38143e519524SHoward Hinnant for (; true; ++__result) 38153e519524SHoward Hinnant { 38163e519524SHoward Hinnant if (__first1 == __last1) 38173e519524SHoward Hinnant { 38183e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 38193e519524SHoward Hinnant ::new (__result) value_type(_STD::move(*__first2)); 38203e519524SHoward Hinnant __h.release(); 38213e519524SHoward Hinnant return; 38223e519524SHoward Hinnant } 38233e519524SHoward Hinnant if (__first2 == __last2) 38243e519524SHoward Hinnant { 38253e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 38263e519524SHoward Hinnant ::new (__result) value_type(_STD::move(*__first1)); 38273e519524SHoward Hinnant __h.release(); 38283e519524SHoward Hinnant return; 38293e519524SHoward Hinnant } 38303e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 38313e519524SHoward Hinnant { 38323e519524SHoward Hinnant ::new (__result) value_type(_STD::move(*__first2)); 38333e519524SHoward Hinnant __d.__incr((value_type*)0); 38343e519524SHoward Hinnant ++__first2; 38353e519524SHoward Hinnant } 38363e519524SHoward Hinnant else 38373e519524SHoward Hinnant { 38383e519524SHoward Hinnant ::new (__result) value_type(_STD::move(*__first1)); 38393e519524SHoward Hinnant __d.__incr((value_type*)0); 38403e519524SHoward Hinnant ++__first1; 38413e519524SHoward Hinnant } 38423e519524SHoward Hinnant } 38433e519524SHoward Hinnant} 38443e519524SHoward Hinnant 38453e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 38463e519524SHoward Hinnantvoid 38473e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 38483e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 38493e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 38503e519524SHoward Hinnant{ 38513e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 38523e519524SHoward Hinnant { 38533e519524SHoward Hinnant if (__first2 == __last2) 38543e519524SHoward Hinnant { 38553e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 38563e519524SHoward Hinnant *__result = _STD::move(*__first1); 38573e519524SHoward Hinnant return; 38583e519524SHoward Hinnant } 38593e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 38603e519524SHoward Hinnant { 38613e519524SHoward Hinnant *__result = _STD::move(*__first2); 38623e519524SHoward Hinnant ++__first2; 38633e519524SHoward Hinnant } 38643e519524SHoward Hinnant else 38653e519524SHoward Hinnant { 38663e519524SHoward Hinnant *__result = _STD::move(*__first1); 38673e519524SHoward Hinnant ++__first1; 38683e519524SHoward Hinnant } 38693e519524SHoward Hinnant } 38703e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 38713e519524SHoward Hinnant *__result = _STD::move(*__first2); 38723e519524SHoward Hinnant} 38733e519524SHoward Hinnant 38743e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38753e519524SHoward Hinnantvoid 38763e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 38773e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 38783e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 38793e519524SHoward Hinnant 38803e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38813e519524SHoward Hinnantvoid 38823e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 38833e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 38843e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 38853e519524SHoward Hinnant{ 38863e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 38873e519524SHoward Hinnant switch (__len) 38883e519524SHoward Hinnant { 38893e519524SHoward Hinnant case 0: 38903e519524SHoward Hinnant return; 38913e519524SHoward Hinnant case 1: 38923e519524SHoward Hinnant ::new(__first2) value_type(_STD::move(*__first1)); 38933e519524SHoward Hinnant return; 38943e519524SHoward Hinnant case 2: 38953e519524SHoward Hinnant __destruct_n __d(0); 38963e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 38973e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 38983e519524SHoward Hinnant { 38993e519524SHoward Hinnant ::new(__first2) value_type(_STD::move(*__last1)); 39003e519524SHoward Hinnant __d.__incr((value_type*)0); 39013e519524SHoward Hinnant ++__first2; 39023e519524SHoward Hinnant ::new(__first2) value_type(_STD::move(*__first1)); 39033e519524SHoward Hinnant } 39043e519524SHoward Hinnant else 39053e519524SHoward Hinnant { 39063e519524SHoward Hinnant ::new(__first2) value_type(_STD::move(*__first1)); 39073e519524SHoward Hinnant __d.__incr((value_type*)0); 39083e519524SHoward Hinnant ++__first2; 39093e519524SHoward Hinnant ::new(__first2) value_type(_STD::move(*__last1)); 39103e519524SHoward Hinnant } 39113e519524SHoward Hinnant __h2.release(); 39123e519524SHoward Hinnant return; 39133e519524SHoward Hinnant } 39143e519524SHoward Hinnant if (__len <= 8) 39153e519524SHoward Hinnant { 39163e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 39173e519524SHoward Hinnant return; 39183e519524SHoward Hinnant } 39193e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 39203e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 39213e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 39223e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 39233e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 39243e519524SHoward Hinnant} 39253e519524SHoward Hinnant 39263e519524SHoward Hinnanttemplate <class _Tp> 39273e519524SHoward Hinnantstruct __stable_sort_switch 39283e519524SHoward Hinnant{ 39293e519524SHoward Hinnant static const unsigned value = 128*has_trivial_copy_assign<_Tp>::value; 39303e519524SHoward Hinnant}; 39313e519524SHoward Hinnant 39323e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 39333e519524SHoward Hinnantvoid 39343e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 39353e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 39363e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 39373e519524SHoward Hinnant{ 39383e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 39393e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 39403e519524SHoward Hinnant switch (__len) 39413e519524SHoward Hinnant { 39423e519524SHoward Hinnant case 0: 39433e519524SHoward Hinnant case 1: 39443e519524SHoward Hinnant return; 39453e519524SHoward Hinnant case 2: 39463e519524SHoward Hinnant if (__comp(*--__last, *__first)) 39473e519524SHoward Hinnant swap(*__first, *__last); 39483e519524SHoward Hinnant return; 39493e519524SHoward Hinnant } 39503e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 39513e519524SHoward Hinnant { 39523e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 39533e519524SHoward Hinnant return; 39543e519524SHoward Hinnant } 39553e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 39563e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 39573e519524SHoward Hinnant if (__len <= __buff_size) 39583e519524SHoward Hinnant { 39593e519524SHoward Hinnant __destruct_n __d(0); 39603e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 39613e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 39623e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 39633e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 39643e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 39653e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 39663e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 39673e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 39683e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 39693e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 39703e519524SHoward Hinnant// __first, __comp); 39713e519524SHoward Hinnant return; 39723e519524SHoward Hinnant } 39733e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 39743e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 39753e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 39763e519524SHoward Hinnant} 39773e519524SHoward Hinnant 39783e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 39793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39803e519524SHoward Hinnantvoid 39813e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39823e519524SHoward Hinnant{ 39833e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 39843e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 39853e519524SHoward Hinnant difference_type __len = __last - __first; 39863e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 39873e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 39883e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 39893e519524SHoward Hinnant { 39903e519524SHoward Hinnant __buf = _STD::get_temporary_buffer<value_type>(__len); 39913e519524SHoward Hinnant __h.reset(__buf.first); 39923e519524SHoward Hinnant } 39933e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 39943e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 39953e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 39963e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 39973e519524SHoward Hinnant#else 39983e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 39993e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 40003e519524SHoward Hinnant#endif 40013e519524SHoward Hinnant} 40023e519524SHoward Hinnant 40033e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 40043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40053e519524SHoward Hinnantvoid 40063e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 40073e519524SHoward Hinnant{ 40083e519524SHoward Hinnant _STD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 40093e519524SHoward Hinnant} 40103e519524SHoward Hinnant 40113e519524SHoward Hinnant// is_heap_until 40123e519524SHoward Hinnant 40133e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 40143e519524SHoward Hinnant_RandomAccessIterator 40153e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 40163e519524SHoward Hinnant{ 40173e519524SHoward Hinnant typedef typename _STD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 40183e519524SHoward Hinnant difference_type __len = __last - __first; 40193e519524SHoward Hinnant difference_type __p = 0; 40203e519524SHoward Hinnant difference_type __c = 1; 40213e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 40223e519524SHoward Hinnant while (__c < __len) 40233e519524SHoward Hinnant { 40243e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 40253e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 40263e519524SHoward Hinnant return __cp; 40273e519524SHoward Hinnant ++__c; 40283e519524SHoward Hinnant ++__cp; 40293e519524SHoward Hinnant if (__c == __len) 40303e519524SHoward Hinnant return __last; 40313e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 40323e519524SHoward Hinnant return __cp; 40333e519524SHoward Hinnant ++__p; 40343e519524SHoward Hinnant ++__pp; 40353e519524SHoward Hinnant __c = 2 * __p + 1; 40363e519524SHoward Hinnant } 40373e519524SHoward Hinnant return __last; 40383e519524SHoward Hinnant} 40393e519524SHoward Hinnant 40403e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 40413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40423e519524SHoward Hinnant_RandomAccessIterator 40433e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 40443e519524SHoward Hinnant{ 40453e519524SHoward Hinnant return _STD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 40463e519524SHoward Hinnant} 40473e519524SHoward Hinnant 40483e519524SHoward Hinnant// is_heap 40493e519524SHoward Hinnant 40503e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 40513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40523e519524SHoward Hinnantbool 40533e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 40543e519524SHoward Hinnant{ 40553e519524SHoward Hinnant return _STD::is_heap_until(__first, __last, __comp) == __last; 40563e519524SHoward Hinnant} 40573e519524SHoward Hinnant 40583e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 40593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40603e519524SHoward Hinnantbool 40613e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 40623e519524SHoward Hinnant{ 40633e519524SHoward Hinnant return _STD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 40643e519524SHoward Hinnant} 40653e519524SHoward Hinnant 40663e519524SHoward Hinnant// push_heap 40673e519524SHoward Hinnant 40683e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 40693e519524SHoward Hinnantvoid 40703e519524SHoward Hinnant__push_heap_front(_RandomAccessIterator __first, _RandomAccessIterator, _Compare __comp, 40713e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 40723e519524SHoward Hinnant{ 40733e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 40743e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 40753e519524SHoward Hinnant if (__len > 1) 40763e519524SHoward Hinnant { 40773e519524SHoward Hinnant difference_type __p = 0; 40783e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 40793e519524SHoward Hinnant difference_type __c = 2; 40803e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 40813e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 40823e519524SHoward Hinnant { 40833e519524SHoward Hinnant --__c; 40843e519524SHoward Hinnant --__cp; 40853e519524SHoward Hinnant } 40863e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 40873e519524SHoward Hinnant { 40883e519524SHoward Hinnant value_type __t(_STD::move(*__pp)); 40893e519524SHoward Hinnant do 40903e519524SHoward Hinnant { 40913e519524SHoward Hinnant *__pp = _STD::move(*__cp); 40923e519524SHoward Hinnant __pp = __cp; 40933e519524SHoward Hinnant __p = __c; 40943e519524SHoward Hinnant __c = (__p + 1) * 2; 40953e519524SHoward Hinnant if (__c > __len) 40963e519524SHoward Hinnant break; 40973e519524SHoward Hinnant __cp = __first + __c; 40983e519524SHoward Hinnant if (__c == __len || __comp(*__cp, *(__cp - 1))) 40993e519524SHoward Hinnant { 41003e519524SHoward Hinnant --__c; 41013e519524SHoward Hinnant --__cp; 41023e519524SHoward Hinnant } 41033e519524SHoward Hinnant } while (__comp(__t, *__cp)); 41043e519524SHoward Hinnant *__pp = _STD::move(__t); 41053e519524SHoward Hinnant } 41063e519524SHoward Hinnant } 41073e519524SHoward Hinnant} 41083e519524SHoward Hinnant 41093e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 41103e519524SHoward Hinnantvoid 41113e519524SHoward Hinnant__push_heap_back(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 41123e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 41133e519524SHoward Hinnant{ 41143e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 41153e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 41163e519524SHoward Hinnant if (__len > 1) 41173e519524SHoward Hinnant { 41183e519524SHoward Hinnant __len = (__len - 2) / 2; 41193e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 41203e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 41213e519524SHoward Hinnant { 41223e519524SHoward Hinnant value_type __t(_STD::move(*__last)); 41233e519524SHoward Hinnant do 41243e519524SHoward Hinnant { 41253e519524SHoward Hinnant *__last = _STD::move(*__ptr); 41263e519524SHoward Hinnant __last = __ptr; 41273e519524SHoward Hinnant if (__len == 0) 41283e519524SHoward Hinnant break; 41293e519524SHoward Hinnant __len = (__len - 1) / 2; 41303e519524SHoward Hinnant __ptr = __first + __len; 41313e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 41323e519524SHoward Hinnant *__last = _STD::move(__t); 41333e519524SHoward Hinnant } 41343e519524SHoward Hinnant } 41353e519524SHoward Hinnant} 41363e519524SHoward Hinnant 41373e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 41383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41393e519524SHoward Hinnantvoid 41403e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 41413e519524SHoward Hinnant{ 41423e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 41433e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41443e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 41453e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __c, __last - __first); 41463e519524SHoward Hinnant#else 41473e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 41483e519524SHoward Hinnant __push_heap_back<_Comp_ref>(__first, __last, __comp, __last - __first); 41493e519524SHoward Hinnant#endif 41503e519524SHoward Hinnant} 41513e519524SHoward Hinnant 41523e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 41533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41543e519524SHoward Hinnantvoid 41553e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 41563e519524SHoward Hinnant{ 41573e519524SHoward Hinnant _STD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 41583e519524SHoward Hinnant} 41593e519524SHoward Hinnant 41603e519524SHoward Hinnant// pop_heap 41613e519524SHoward Hinnant 41623e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 41633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41643e519524SHoward Hinnantvoid 41653e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 41663e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 41673e519524SHoward Hinnant{ 41683e519524SHoward Hinnant if (__len > 1) 41693e519524SHoward Hinnant { 41703e519524SHoward Hinnant swap(*__first, *--__last); 41713e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __last, __comp, __len-1); 41723e519524SHoward Hinnant } 41733e519524SHoward Hinnant} 41743e519524SHoward Hinnant 41753e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 41763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41773e519524SHoward Hinnantvoid 41783e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 41793e519524SHoward Hinnant{ 41803e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 41813e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41823e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 41833e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 41843e519524SHoward Hinnant#else 41853e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 41863e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 41873e519524SHoward Hinnant#endif 41883e519524SHoward Hinnant} 41893e519524SHoward Hinnant 41903e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 41913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41923e519524SHoward Hinnantvoid 41933e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 41943e519524SHoward Hinnant{ 41953e519524SHoward Hinnant _STD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 41963e519524SHoward Hinnant} 41973e519524SHoward Hinnant 41983e519524SHoward Hinnant// make_heap 41993e519524SHoward Hinnant 42003e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 42013e519524SHoward Hinnantvoid 42023e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 42033e519524SHoward Hinnant{ 42043e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 42053e519524SHoward Hinnant difference_type __n = __last - __first; 42063e519524SHoward Hinnant if (__n > 1) 42073e519524SHoward Hinnant { 42083e519524SHoward Hinnant __last = __first; 42093e519524SHoward Hinnant ++__last; 42103e519524SHoward Hinnant for (difference_type __i = 1; __i < __n;) 42113e519524SHoward Hinnant __push_heap_back<_Compare>(__first, ++__last, __comp, ++__i); 42123e519524SHoward Hinnant } 42133e519524SHoward Hinnant} 42143e519524SHoward Hinnant 42153e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 42163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42173e519524SHoward Hinnantvoid 42183e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 42193e519524SHoward Hinnant{ 42203e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 42213e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42223e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 42233e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 42243e519524SHoward Hinnant#else 42253e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 42263e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 42273e519524SHoward Hinnant#endif 42283e519524SHoward Hinnant} 42293e519524SHoward Hinnant 42303e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 42313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42323e519524SHoward Hinnantvoid 42333e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 42343e519524SHoward Hinnant{ 42353e519524SHoward Hinnant _STD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 42363e519524SHoward Hinnant} 42373e519524SHoward Hinnant 42383e519524SHoward Hinnant// sort_heap 42393e519524SHoward Hinnant 42403e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 42413e519524SHoward Hinnantvoid 42423e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 42433e519524SHoward Hinnant{ 42443e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 42453e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 42463e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 42473e519524SHoward Hinnant} 42483e519524SHoward Hinnant 42493e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 42503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42513e519524SHoward Hinnantvoid 42523e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 42533e519524SHoward Hinnant{ 42543e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 42553e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42563e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 42573e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 42583e519524SHoward Hinnant#else 42593e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 42603e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 42613e519524SHoward Hinnant#endif 42623e519524SHoward Hinnant} 42633e519524SHoward Hinnant 42643e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 42653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42663e519524SHoward Hinnantvoid 42673e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 42683e519524SHoward Hinnant{ 42693e519524SHoward Hinnant _STD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 42703e519524SHoward Hinnant} 42713e519524SHoward Hinnant 42723e519524SHoward Hinnant// partial_sort 42733e519524SHoward Hinnant 42743e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 42753e519524SHoward Hinnantvoid 42763e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 42773e519524SHoward Hinnant _Compare __comp) 42783e519524SHoward Hinnant{ 42793e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 42803e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 42813e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 42823e519524SHoward Hinnant { 42833e519524SHoward Hinnant if (__comp(*__i, *__first)) 42843e519524SHoward Hinnant { 42853e519524SHoward Hinnant swap(*__i, *__first); 42863e519524SHoward Hinnant __push_heap_front<_Compare>(__first, __middle, __comp, __len); 42873e519524SHoward Hinnant } 42883e519524SHoward Hinnant } 42893e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 42903e519524SHoward Hinnant} 42913e519524SHoward Hinnant 42923e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 42933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42943e519524SHoward Hinnantvoid 42953e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 42963e519524SHoward Hinnant _Compare __comp) 42973e519524SHoward Hinnant{ 42983e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 42993e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43003e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 43013e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 43023e519524SHoward Hinnant#else 43033e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 43043e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 43053e519524SHoward Hinnant#endif 43063e519524SHoward Hinnant} 43073e519524SHoward Hinnant 43083e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 43093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43103e519524SHoward Hinnantvoid 43113e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 43123e519524SHoward Hinnant{ 43133e519524SHoward Hinnant _STD::partial_sort(__first, __middle, __last, 43143e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 43153e519524SHoward Hinnant} 43163e519524SHoward Hinnant 43173e519524SHoward Hinnant// partial_sort_copy 43183e519524SHoward Hinnant 43193e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 43203e519524SHoward Hinnant_RandomAccessIterator 43213e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 43223e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 43233e519524SHoward Hinnant{ 43243e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 43253e519524SHoward Hinnant if (__r != __result_last) 43263e519524SHoward Hinnant { 43273e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = 0; 43283e519524SHoward Hinnant for (; __first != __last && __r != __result_last; ++__first, ++__r, ++__len) 43293e519524SHoward Hinnant *__r = *__first; 43303e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 43313e519524SHoward Hinnant for (; __first != __last; ++__first) 43323e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 43333e519524SHoward Hinnant { 43343e519524SHoward Hinnant *__result_first = *__first; 43353e519524SHoward Hinnant __push_heap_front<_Compare>(__result_first, __r, __comp, __len); 43363e519524SHoward Hinnant } 43373e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 43383e519524SHoward Hinnant } 43393e519524SHoward Hinnant return __r; 43403e519524SHoward Hinnant} 43413e519524SHoward Hinnant 43423e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 43433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43443e519524SHoward Hinnant_RandomAccessIterator 43453e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 43463e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 43473e519524SHoward Hinnant{ 43483e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 43493e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43503e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 43513e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 43523e519524SHoward Hinnant#else 43533e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 43543e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 43553e519524SHoward Hinnant#endif 43563e519524SHoward Hinnant} 43573e519524SHoward Hinnant 43583e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 43593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43603e519524SHoward Hinnant_RandomAccessIterator 43613e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 43623e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 43633e519524SHoward Hinnant{ 43643e519524SHoward Hinnant return _STD::partial_sort_copy(__first, __last, __result_first, __result_last, 43653e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 43663e519524SHoward Hinnant} 43673e519524SHoward Hinnant 43683e519524SHoward Hinnant// nth_element 43693e519524SHoward Hinnant 43703e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 43713e519524SHoward Hinnantvoid 43723e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 43733e519524SHoward Hinnant{ 43743e519524SHoward Hinnant // _Compare is known to be a reference type 43753e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 43763e519524SHoward Hinnant const difference_type __limit = 7; 43773e519524SHoward Hinnant while (true) 43783e519524SHoward Hinnant { 43793e519524SHoward Hinnant __restart: 43803e519524SHoward Hinnant difference_type __len = __last - __first; 43813e519524SHoward Hinnant switch (__len) 43823e519524SHoward Hinnant { 43833e519524SHoward Hinnant case 0: 43843e519524SHoward Hinnant case 1: 43853e519524SHoward Hinnant return; 43863e519524SHoward Hinnant case 2: 43873e519524SHoward Hinnant if (__comp(*--__last, *__first)) 43883e519524SHoward Hinnant swap(*__first, *__last); 43893e519524SHoward Hinnant return; 43903e519524SHoward Hinnant case 3: 43913e519524SHoward Hinnant { 43923e519524SHoward Hinnant _RandomAccessIterator __m = __first; 43933e519524SHoward Hinnant _STD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 43943e519524SHoward Hinnant return; 43953e519524SHoward Hinnant } 43963e519524SHoward Hinnant } 43973e519524SHoward Hinnant if (__len <= __limit) 43983e519524SHoward Hinnant { 43993e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 44003e519524SHoward Hinnant return; 44013e519524SHoward Hinnant } 44023e519524SHoward Hinnant // __len > __limit >= 3 44033e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 44043e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 44053e519524SHoward Hinnant unsigned __n_swaps = _STD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 44063e519524SHoward Hinnant // *__m is median 44073e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 44083e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 44093e519524SHoward Hinnant _RandomAccessIterator __i = __first; 44103e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 44113e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 44123e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 44133e519524SHoward Hinnant // Prime the downward search with a guard. 44143e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 44153e519524SHoward Hinnant { 44163e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 44173e519524SHoward Hinnant // manually guard downward moving __j against __i 44183e519524SHoward Hinnant while (true) 44193e519524SHoward Hinnant { 44203e519524SHoward Hinnant if (__i == --__j) 44213e519524SHoward Hinnant { 44223e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 44233e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 44243e519524SHoward Hinnant ++__i; // __first + 1 44253e519524SHoward Hinnant __j = __last; 44263e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 44273e519524SHoward Hinnant { 44283e519524SHoward Hinnant while (true) 44293e519524SHoward Hinnant { 44303e519524SHoward Hinnant if (__i == __j) 44313e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 44323e519524SHoward Hinnant if (__comp(*__first, *__i)) 44333e519524SHoward Hinnant { 44343e519524SHoward Hinnant swap(*__i, *__j); 44353e519524SHoward Hinnant ++__n_swaps; 44363e519524SHoward Hinnant ++__i; 44373e519524SHoward Hinnant break; 44383e519524SHoward Hinnant } 44393e519524SHoward Hinnant ++__i; 44403e519524SHoward Hinnant } 44413e519524SHoward Hinnant } 44423e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 44433e519524SHoward Hinnant if (__i == __j) 44443e519524SHoward Hinnant return; 44453e519524SHoward Hinnant while (true) 44463e519524SHoward Hinnant { 44473e519524SHoward Hinnant while (!__comp(*__first, *__i)) 44483e519524SHoward Hinnant ++__i; 44493e519524SHoward Hinnant while (__comp(*__first, *--__j)) 44503e519524SHoward Hinnant ; 44513e519524SHoward Hinnant if (__i >= __j) 44523e519524SHoward Hinnant break; 44533e519524SHoward Hinnant swap(*__i, *__j); 44543e519524SHoward Hinnant ++__n_swaps; 44553e519524SHoward Hinnant ++__i; 44563e519524SHoward Hinnant } 44573e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 44583e519524SHoward Hinnant // The first part is sorted, 44593e519524SHoward Hinnant if (__nth < __i) 44603e519524SHoward Hinnant return; 44613e519524SHoward Hinnant // __nth_element the secod part 44623e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 44633e519524SHoward Hinnant __first = __i; 44643e519524SHoward Hinnant goto __restart; 44653e519524SHoward Hinnant } 44663e519524SHoward Hinnant if (__comp(*__j, *__m)) 44673e519524SHoward Hinnant { 44683e519524SHoward Hinnant swap(*__i, *__j); 44693e519524SHoward Hinnant ++__n_swaps; 44703e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 44713e519524SHoward Hinnant } 44723e519524SHoward Hinnant } 44733e519524SHoward Hinnant } 44743e519524SHoward Hinnant ++__i; 44753e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 44763e519524SHoward Hinnant // if not yet partitioned... 44773e519524SHoward Hinnant if (__i < __j) 44783e519524SHoward Hinnant { 44793e519524SHoward Hinnant // known that *(__i - 1) < *__m 44803e519524SHoward Hinnant while (true) 44813e519524SHoward Hinnant { 44823e519524SHoward Hinnant // __m still guards upward moving __i 44833e519524SHoward Hinnant while (__comp(*__i, *__m)) 44843e519524SHoward Hinnant ++__i; 44853e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 44863e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 44873e519524SHoward Hinnant ; 44883e519524SHoward Hinnant if (__i >= __j) 44893e519524SHoward Hinnant break; 44903e519524SHoward Hinnant swap(*__i, *__j); 44913e519524SHoward Hinnant ++__n_swaps; 44923e519524SHoward Hinnant // It is known that __m != __j 44933e519524SHoward Hinnant // If __m just moved, follow it 44943e519524SHoward Hinnant if (__m == __i) 44953e519524SHoward Hinnant __m = __j; 44963e519524SHoward Hinnant ++__i; 44973e519524SHoward Hinnant } 44983e519524SHoward Hinnant } 44993e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 45003e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 45013e519524SHoward Hinnant { 45023e519524SHoward Hinnant swap(*__i, *__m); 45033e519524SHoward Hinnant ++__n_swaps; 45043e519524SHoward Hinnant } 45053e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 45063e519524SHoward Hinnant if (__nth == __i) 45073e519524SHoward Hinnant return; 45083e519524SHoward Hinnant if (__n_swaps == 0) 45093e519524SHoward Hinnant { 45103e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 45113e519524SHoward Hinnant if (__nth < __i) 45123e519524SHoward Hinnant { 45133e519524SHoward Hinnant // Check for [__first, __i) already sorted 45143e519524SHoward Hinnant __j = __m = __first; 45153e519524SHoward Hinnant while (++__j != __i) 45163e519524SHoward Hinnant { 45173e519524SHoward Hinnant if (__comp(*__j, *__m)) 45183e519524SHoward Hinnant // not yet sorted, so sort 45193e519524SHoward Hinnant goto not_sorted; 45203e519524SHoward Hinnant __m = __j; 45213e519524SHoward Hinnant } 45223e519524SHoward Hinnant // [__first, __i) sorted 45233e519524SHoward Hinnant return; 45243e519524SHoward Hinnant } 45253e519524SHoward Hinnant else 45263e519524SHoward Hinnant { 45273e519524SHoward Hinnant // Check for [__i, __last) already sorted 45283e519524SHoward Hinnant __j = __m = __i; 45293e519524SHoward Hinnant while (++__j != __last) 45303e519524SHoward Hinnant { 45313e519524SHoward Hinnant if (__comp(*__j, *__m)) 45323e519524SHoward Hinnant // not yet sorted, so sort 45333e519524SHoward Hinnant goto not_sorted; 45343e519524SHoward Hinnant __m = __j; 45353e519524SHoward Hinnant } 45363e519524SHoward Hinnant // [__i, __last) sorted 45373e519524SHoward Hinnant return; 45383e519524SHoward Hinnant } 45393e519524SHoward Hinnant } 45403e519524SHoward Hinnantnot_sorted: 45413e519524SHoward Hinnant // __nth_element on range containing __nth 45423e519524SHoward Hinnant if (__nth < __i) 45433e519524SHoward Hinnant { 45443e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 45453e519524SHoward Hinnant __last = __i; 45463e519524SHoward Hinnant } 45473e519524SHoward Hinnant else 45483e519524SHoward Hinnant { 45493e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 45503e519524SHoward Hinnant __first = ++__i; 45513e519524SHoward Hinnant } 45523e519524SHoward Hinnant } 45533e519524SHoward Hinnant} 45543e519524SHoward Hinnant 45553e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 45563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45573e519524SHoward Hinnantvoid 45583e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 45593e519524SHoward Hinnant{ 45603e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 45613e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 45623e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 45633e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 45643e519524SHoward Hinnant#else 45653e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 45663e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 45673e519524SHoward Hinnant#endif 45683e519524SHoward Hinnant} 45693e519524SHoward Hinnant 45703e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 45713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45723e519524SHoward Hinnantvoid 45733e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 45743e519524SHoward Hinnant{ 45753e519524SHoward Hinnant _STD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 45763e519524SHoward Hinnant} 45773e519524SHoward Hinnant 45783e519524SHoward Hinnant// includes 45793e519524SHoward Hinnant 45803e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 45813e519524SHoward Hinnantbool 45823e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 45833e519524SHoward Hinnant _Compare __comp) 45843e519524SHoward Hinnant{ 45853e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 45863e519524SHoward Hinnant { 45873e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 45883e519524SHoward Hinnant return false; 45893e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 45903e519524SHoward Hinnant ++__first2; 45913e519524SHoward Hinnant } 45923e519524SHoward Hinnant return true; 45933e519524SHoward Hinnant} 45943e519524SHoward Hinnant 45953e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 45963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45973e519524SHoward Hinnantbool 45983e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 45993e519524SHoward Hinnant _Compare __comp) 46003e519524SHoward Hinnant{ 46013e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 46023e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46033e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 46043e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 46053e519524SHoward Hinnant#else 46063e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 46073e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 46083e519524SHoward Hinnant#endif 46093e519524SHoward Hinnant} 46103e519524SHoward Hinnant 46113e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 46123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46133e519524SHoward Hinnantbool 46143e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 46153e519524SHoward Hinnant{ 46163e519524SHoward Hinnant return _STD::includes(__first1, __last1, __first2, __last2, 46173e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 46183e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 46193e519524SHoward Hinnant} 46203e519524SHoward Hinnant 46213e519524SHoward Hinnant// set_union 46223e519524SHoward Hinnant 46233e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 46243e519524SHoward Hinnant_OutputIterator 46253e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 46263e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 46273e519524SHoward Hinnant{ 46283e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 46293e519524SHoward Hinnant { 46303e519524SHoward Hinnant if (__first2 == __last2) 46313e519524SHoward Hinnant return _STD::copy(__first1, __last1, __result); 46323e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 46333e519524SHoward Hinnant { 46343e519524SHoward Hinnant *__result = *__first2; 46353e519524SHoward Hinnant ++__first2; 46363e519524SHoward Hinnant } 46373e519524SHoward Hinnant else 46383e519524SHoward Hinnant { 46393e519524SHoward Hinnant *__result = *__first1; 46403e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 46413e519524SHoward Hinnant ++__first2; 46423e519524SHoward Hinnant ++__first1; 46433e519524SHoward Hinnant } 46443e519524SHoward Hinnant } 46453e519524SHoward Hinnant return _STD::copy(__first2, __last2, __result); 46463e519524SHoward Hinnant} 46473e519524SHoward Hinnant 46483e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 46493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46503e519524SHoward Hinnant_OutputIterator 46513e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 46523e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 46533e519524SHoward Hinnant{ 46543e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 46553e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46563e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 46573e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 46583e519524SHoward Hinnant#else 46593e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 46603e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 46613e519524SHoward Hinnant#endif 46623e519524SHoward Hinnant} 46633e519524SHoward Hinnant 46643e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 46653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46663e519524SHoward Hinnant_OutputIterator 46673e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 46683e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 46693e519524SHoward Hinnant{ 46703e519524SHoward Hinnant return _STD::set_union(__first1, __last1, __first2, __last2, __result, 46713e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 46723e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 46733e519524SHoward Hinnant} 46743e519524SHoward Hinnant 46753e519524SHoward Hinnant// set_intersection 46763e519524SHoward Hinnant 46773e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 46783e519524SHoward Hinnant_OutputIterator 46793e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 46803e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 46813e519524SHoward Hinnant{ 46823e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 46833e519524SHoward Hinnant { 46843e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 46853e519524SHoward Hinnant ++__first1; 46863e519524SHoward Hinnant else 46873e519524SHoward Hinnant { 46883e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 46893e519524SHoward Hinnant { 46903e519524SHoward Hinnant *__result = *__first1; 46913e519524SHoward Hinnant ++__result; 46923e519524SHoward Hinnant ++__first1; 46933e519524SHoward Hinnant } 46943e519524SHoward Hinnant ++__first2; 46953e519524SHoward Hinnant } 46963e519524SHoward Hinnant } 46973e519524SHoward Hinnant return __result; 46983e519524SHoward Hinnant} 46993e519524SHoward Hinnant 47003e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 47013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47023e519524SHoward Hinnant_OutputIterator 47033e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 47043e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 47053e519524SHoward Hinnant{ 47063e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 47073e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 47083e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 47093e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 47103e519524SHoward Hinnant#else 47113e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 47123e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 47133e519524SHoward Hinnant#endif 47143e519524SHoward Hinnant} 47153e519524SHoward Hinnant 47163e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 47173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47183e519524SHoward Hinnant_OutputIterator 47193e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 47203e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 47213e519524SHoward Hinnant{ 47223e519524SHoward Hinnant return _STD::set_intersection(__first1, __last1, __first2, __last2, __result, 47233e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 47243e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 47253e519524SHoward Hinnant} 47263e519524SHoward Hinnant 47273e519524SHoward Hinnant// set_difference 47283e519524SHoward Hinnant 47293e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 47303e519524SHoward Hinnant_OutputIterator 47313e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 47323e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 47333e519524SHoward Hinnant{ 47343e519524SHoward Hinnant while (__first1 != __last1) 47353e519524SHoward Hinnant { 47363e519524SHoward Hinnant if (__first2 == __last2) 47373e519524SHoward Hinnant return _STD::copy(__first1, __last1, __result); 47383e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 47393e519524SHoward Hinnant { 47403e519524SHoward Hinnant *__result = *__first1; 47413e519524SHoward Hinnant ++__result; 47423e519524SHoward Hinnant ++__first1; 47433e519524SHoward Hinnant } 47443e519524SHoward Hinnant else 47453e519524SHoward Hinnant { 47463e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 47473e519524SHoward Hinnant ++__first1; 47483e519524SHoward Hinnant ++__first2; 47493e519524SHoward Hinnant } 47503e519524SHoward Hinnant } 47513e519524SHoward Hinnant return __result; 47523e519524SHoward Hinnant} 47533e519524SHoward Hinnant 47543e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 47553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47563e519524SHoward Hinnant_OutputIterator 47573e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 47583e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 47593e519524SHoward Hinnant{ 47603e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 47613e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 47623e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 47633e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 47643e519524SHoward Hinnant#else 47653e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 47663e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 47673e519524SHoward Hinnant#endif 47683e519524SHoward Hinnant} 47693e519524SHoward Hinnant 47703e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 47713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47723e519524SHoward Hinnant_OutputIterator 47733e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 47743e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 47753e519524SHoward Hinnant{ 47763e519524SHoward Hinnant return _STD::set_difference(__first1, __last1, __first2, __last2, __result, 47773e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 47783e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 47793e519524SHoward Hinnant} 47803e519524SHoward Hinnant 47813e519524SHoward Hinnant// set_symmetric_difference 47823e519524SHoward Hinnant 47833e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 47843e519524SHoward Hinnant_OutputIterator 47853e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 47863e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 47873e519524SHoward Hinnant{ 47883e519524SHoward Hinnant while (__first1 != __last1) 47893e519524SHoward Hinnant { 47903e519524SHoward Hinnant if (__first2 == __last2) 47913e519524SHoward Hinnant return _STD::copy(__first1, __last1, __result); 47923e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 47933e519524SHoward Hinnant { 47943e519524SHoward Hinnant *__result = *__first1; 47953e519524SHoward Hinnant ++__result; 47963e519524SHoward Hinnant ++__first1; 47973e519524SHoward Hinnant } 47983e519524SHoward Hinnant else 47993e519524SHoward Hinnant { 48003e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 48013e519524SHoward Hinnant { 48023e519524SHoward Hinnant *__result = *__first2; 48033e519524SHoward Hinnant ++__result; 48043e519524SHoward Hinnant } 48053e519524SHoward Hinnant else 48063e519524SHoward Hinnant ++__first1; 48073e519524SHoward Hinnant ++__first2; 48083e519524SHoward Hinnant } 48093e519524SHoward Hinnant } 48103e519524SHoward Hinnant return _STD::copy(__first2, __last2, __result); 48113e519524SHoward Hinnant} 48123e519524SHoward Hinnant 48133e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 48143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48153e519524SHoward Hinnant_OutputIterator 48163e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 48173e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 48183e519524SHoward Hinnant{ 48193e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 48203e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48213e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48223e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 48233e519524SHoward Hinnant#else 48243e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48253e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 48263e519524SHoward Hinnant#endif 48273e519524SHoward Hinnant} 48283e519524SHoward Hinnant 48293e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 48303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48313e519524SHoward Hinnant_OutputIterator 48323e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 48333e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 48343e519524SHoward Hinnant{ 48353e519524SHoward Hinnant return _STD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 48363e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 48373e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 48383e519524SHoward Hinnant} 48393e519524SHoward Hinnant 48403e519524SHoward Hinnant// lexicographical_compare 48413e519524SHoward Hinnant 48423e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 48433e519524SHoward Hinnantbool 48443e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 48453e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 48463e519524SHoward Hinnant{ 48473e519524SHoward Hinnant for (; __first2 != __last2; ++__first1, ++__first2) 48483e519524SHoward Hinnant { 48493e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 48503e519524SHoward Hinnant return true; 48513e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 48523e519524SHoward Hinnant return false; 48533e519524SHoward Hinnant } 48543e519524SHoward Hinnant return false; 48553e519524SHoward Hinnant} 48563e519524SHoward Hinnant 48573e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 48583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48593e519524SHoward Hinnantbool 48603e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 48613e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 48623e519524SHoward Hinnant{ 48633e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 48643e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48653e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48663e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 48673e519524SHoward Hinnant#else 48683e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48693e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 48703e519524SHoward Hinnant#endif 48713e519524SHoward Hinnant} 48723e519524SHoward Hinnant 48733e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 48743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48753e519524SHoward Hinnantbool 48763e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 48773e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 48783e519524SHoward Hinnant{ 48793e519524SHoward Hinnant return _STD::lexicographical_compare(__first1, __last1, __first2, __last2, 48803e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 48813e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 48823e519524SHoward Hinnant} 48833e519524SHoward Hinnant 48843e519524SHoward Hinnant// next_permutation 48853e519524SHoward Hinnant 48863e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 48873e519524SHoward Hinnantbool 48883e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 48893e519524SHoward Hinnant{ 48903e519524SHoward Hinnant _BidirectionalIterator __i = __last; 48913e519524SHoward Hinnant if (__first == __last || __first == --__i) 48923e519524SHoward Hinnant return false; 48933e519524SHoward Hinnant while (true) 48943e519524SHoward Hinnant { 48953e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 48963e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 48973e519524SHoward Hinnant { 48983e519524SHoward Hinnant _BidirectionalIterator __j = __last; 48993e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 49003e519524SHoward Hinnant ; 49013e519524SHoward Hinnant swap(*__i, *__j); 49023e519524SHoward Hinnant _STD::reverse(__ip1, __last); 49033e519524SHoward Hinnant return true; 49043e519524SHoward Hinnant } 49053e519524SHoward Hinnant if (__i == __first) 49063e519524SHoward Hinnant { 49073e519524SHoward Hinnant _STD::reverse(__first, __last); 49083e519524SHoward Hinnant return false; 49093e519524SHoward Hinnant } 49103e519524SHoward Hinnant } 49113e519524SHoward Hinnant} 49123e519524SHoward Hinnant 49133e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 49143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49153e519524SHoward Hinnantbool 49163e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 49173e519524SHoward Hinnant{ 49183e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 49193e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49203e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49213e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 49223e519524SHoward Hinnant#else 49233e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49243e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 49253e519524SHoward Hinnant#endif 49263e519524SHoward Hinnant} 49273e519524SHoward Hinnant 49283e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 49293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49303e519524SHoward Hinnantbool 49313e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 49323e519524SHoward Hinnant{ 49333e519524SHoward Hinnant return _STD::next_permutation(__first, __last, 49343e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 49353e519524SHoward Hinnant} 49363e519524SHoward Hinnant 49373e519524SHoward Hinnant// prev_permutation 49383e519524SHoward Hinnant 49393e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 49403e519524SHoward Hinnantbool 49413e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 49423e519524SHoward Hinnant{ 49433e519524SHoward Hinnant _BidirectionalIterator __i = __last; 49443e519524SHoward Hinnant if (__first == __last || __first == --__i) 49453e519524SHoward Hinnant return false; 49463e519524SHoward Hinnant while (true) 49473e519524SHoward Hinnant { 49483e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 49493e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 49503e519524SHoward Hinnant { 49513e519524SHoward Hinnant _BidirectionalIterator __j = __last; 49523e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 49533e519524SHoward Hinnant ; 49543e519524SHoward Hinnant swap(*__i, *__j); 49553e519524SHoward Hinnant _STD::reverse(__ip1, __last); 49563e519524SHoward Hinnant return true; 49573e519524SHoward Hinnant } 49583e519524SHoward Hinnant if (__i == __first) 49593e519524SHoward Hinnant { 49603e519524SHoward Hinnant _STD::reverse(__first, __last); 49613e519524SHoward Hinnant return false; 49623e519524SHoward Hinnant } 49633e519524SHoward Hinnant } 49643e519524SHoward Hinnant} 49653e519524SHoward Hinnant 49663e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 49673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49683e519524SHoward Hinnantbool 49693e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 49703e519524SHoward Hinnant{ 49713e519524SHoward Hinnant#ifdef _LIBCPP_DEBUG 49723e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49733e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49743e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 49753e519524SHoward Hinnant#else 49763e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49773e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 49783e519524SHoward Hinnant#endif 49793e519524SHoward Hinnant} 49803e519524SHoward Hinnant 49813e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 49823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49833e519524SHoward Hinnantbool 49843e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 49853e519524SHoward Hinnant{ 49863e519524SHoward Hinnant return _STD::prev_permutation(__first, __last, 49873e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 49883e519524SHoward Hinnant} 49893e519524SHoward Hinnant 49903e519524SHoward Hinnanttemplate <class _Tp> 49913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49923e519524SHoward Hinnanttypename enable_if 49933e519524SHoward Hinnant< 49943e519524SHoward Hinnant is_integral<_Tp>::value, 49953e519524SHoward Hinnant _Tp 49963e519524SHoward Hinnant>::type 49973e519524SHoward Hinnant__rotate_left(_Tp __t, _Tp __n = 1) 49983e519524SHoward Hinnant{ 49993e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 50003e519524SHoward Hinnant __n &= __bits; 50013e519524SHoward Hinnant return static_cast<_Tp>((__t << __n) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> (__bits - __n))); 50023e519524SHoward Hinnant} 50033e519524SHoward Hinnant 50043e519524SHoward Hinnanttemplate <class _Tp> 50053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50063e519524SHoward Hinnanttypename enable_if 50073e519524SHoward Hinnant< 50083e519524SHoward Hinnant is_integral<_Tp>::value, 50093e519524SHoward Hinnant _Tp 50103e519524SHoward Hinnant>::type 50113e519524SHoward Hinnant__rotate_right(_Tp __t, _Tp __n = 1) 50123e519524SHoward Hinnant{ 50133e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 50143e519524SHoward Hinnant __n &= __bits; 50153e519524SHoward Hinnant return static_cast<_Tp>((__t << (__bits - __n)) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> __n)); 50163e519524SHoward Hinnant} 50173e519524SHoward Hinnant 50183e519524SHoward Hinnant// Precondition: __x != 0 50193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned __ctz(unsigned __x) {return __builtin_ctz (__x);} 50203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned long __ctz(unsigned long __x) {return __builtin_ctzl (__x);} 50213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned long long __ctz(unsigned long long __x) {return __builtin_ctzll(__x);} 50223e519524SHoward Hinnant 50233e519524SHoward Hinnant// Precondition: __x != 0 50243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned __clz(unsigned __x) {return __builtin_clz (__x);} 50253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned long __clz(unsigned long __x) {return __builtin_clzl (__x);} 50263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY unsigned long long __clz(unsigned long long __x) {return __builtin_clzll(__x);} 50273e519524SHoward Hinnant 50283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) {return __builtin_popcount (__x);} 50293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) {return __builtin_popcountl (__x);} 50303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) {return __builtin_popcountll(__x);} 50313e519524SHoward Hinnant 50323e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 50333e519524SHoward Hinnant 50343e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5035