13e519524SHoward Hinnant// -*- C++ -*- 23e519524SHoward Hinnant//===-------------------------- algorithm ---------------------------------===// 33e519524SHoward Hinnant// 457b08b09SChandler Carruth// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 557b08b09SChandler Carruth// See https://llvm.org/LICENSE.txt for license information. 657b08b09SChandler Carruth// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 73e519524SHoward Hinnant// 83e519524SHoward Hinnant//===----------------------------------------------------------------------===// 93e519524SHoward Hinnant 103e519524SHoward Hinnant#ifndef _LIBCPP_ALGORITHM 113e519524SHoward Hinnant#define _LIBCPP_ALGORITHM 123e519524SHoward Hinnant 133e519524SHoward Hinnant/* 143e519524SHoward Hinnant algorithm synopsis 153e519524SHoward Hinnant 163e519524SHoward Hinnant#include <initializer_list> 173e519524SHoward Hinnant 183e519524SHoward Hinnantnamespace std 193e519524SHoward Hinnant{ 203e519524SHoward Hinnant 213e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 22706ffef7SMarshall Clow constexpr bool // constexpr in C++20 233e519524SHoward Hinnant all_of(InputIterator first, InputIterator last, Predicate pred); 243e519524SHoward Hinnant 253e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 26706ffef7SMarshall Clow constexpr bool // constexpr in C++20 273e519524SHoward Hinnant any_of(InputIterator first, InputIterator last, Predicate pred); 283e519524SHoward Hinnant 293e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 30706ffef7SMarshall Clow constexpr bool // constexpr in C++20 313e519524SHoward Hinnant none_of(InputIterator first, InputIterator last, Predicate pred); 323e519524SHoward Hinnant 333e519524SHoward Hinnanttemplate <class InputIterator, class Function> 341b9a4ffdSMarshall Clow constexpr Function // constexpr in C++20 353e519524SHoward Hinnant for_each(InputIterator first, InputIterator last, Function f); 363e519524SHoward Hinnant 37d5c65ffaSMarshall Clowtemplate<class InputIterator, class Size, class Function> 381b9a4ffdSMarshall Clow constexpr InputIterator // constexpr in C++20 391b9a4ffdSMarshall Clow for_each_n(InputIterator first, Size n, Function f); // C++17 40d5c65ffaSMarshall Clow 413e519524SHoward Hinnanttemplate <class InputIterator, class T> 4249c7643cSMarshall Clow constexpr InputIterator // constexpr in C++20 433e519524SHoward Hinnant find(InputIterator first, InputIterator last, const T& value); 443e519524SHoward Hinnant 453e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 4649c7643cSMarshall Clow constexpr InputIterator // constexpr in C++20 473e519524SHoward Hinnant find_if(InputIterator first, InputIterator last, Predicate pred); 483e519524SHoward Hinnant 493e519524SHoward Hinnanttemplate<class InputIterator, class Predicate> 508694428eSMarshall Clow InputIterator // constexpr in C++20 513e519524SHoward Hinnant find_if_not(InputIterator first, InputIterator last, Predicate pred); 523e519524SHoward Hinnant 533e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 548694428eSMarshall Clow ForwardIterator1 // constexpr in C++20 553e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 563e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 573e519524SHoward Hinnant 583e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 598694428eSMarshall Clow ForwardIterator1 // constexpr in C++20 603e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 613e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 623e519524SHoward Hinnant 633e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 648694428eSMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 653e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 663e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 673e519524SHoward Hinnant 683e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 698694428eSMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 703e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 713e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 723e519524SHoward Hinnant 733e519524SHoward Hinnanttemplate <class ForwardIterator> 748694428eSMarshall Clow constexpr ForwardIterator // constexpr in C++20 753e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last); 763e519524SHoward Hinnant 773e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 788694428eSMarshall Clow constexpr ForwardIterator // constexpr in C++20 793e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 803e519524SHoward Hinnant 813e519524SHoward Hinnanttemplate <class InputIterator, class T> 82056f15e3SMarshall Clow constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 833e519524SHoward Hinnant count(InputIterator first, InputIterator last, const T& value); 843e519524SHoward Hinnant 853e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 86056f15e3SMarshall Clow constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 873e519524SHoward Hinnant count_if(InputIterator first, InputIterator last, Predicate pred); 883e519524SHoward Hinnant 893e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 906538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 913e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 923e519524SHoward Hinnant 930b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 946538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 950b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 960b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 970b0bbd2fSMarshall Clow 983e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 996538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 1003e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, 1013e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 1023e519524SHoward Hinnant 1030b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1046538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 1050b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 1060b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1070b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1080b0bbd2fSMarshall Clow 1093e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 1106538e28dSMarshall Clow constexpr bool // constexpr in C++20 1113e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 1123e519524SHoward Hinnant 1130b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 1146538e28dSMarshall Clow constexpr bool // constexpr in C++20 1150b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1160b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 1170b0bbd2fSMarshall Clow 1183e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1196538e28dSMarshall Clow constexpr bool // constexpr in C++20 1203e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, 1213e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 1223e519524SHoward Hinnant 1230b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1246538e28dSMarshall Clow constexpr bool // constexpr in C++20 1250b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1260b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1270b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1280b0bbd2fSMarshall Clow 1293e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2> 13049c7643cSMarshall Clow constexpr bool // constexpr in C++20 1313e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1323e519524SHoward Hinnant ForwardIterator2 first2); 1333e519524SHoward Hinnant 1340b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2> 13549c7643cSMarshall Clow constexpr bool // constexpr in C++20 1360b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1370b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 1380b0bbd2fSMarshall Clow 1393e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 14049c7643cSMarshall Clow constexpr bool // constexpr in C++20 1413e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1423e519524SHoward Hinnant ForwardIterator2 first2, BinaryPredicate pred); 1433e519524SHoward Hinnant 1440b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 14549c7643cSMarshall Clow constexpr bool // constexpr in C++20 1460b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1470b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2, 1480b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1490b0bbd2fSMarshall Clow 1503e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 15112f0a779SMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 1523e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1533e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 1543e519524SHoward Hinnant 1553e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 15612f0a779SMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 1573e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1583e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 1593e519524SHoward Hinnant 1603e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T> 16112f0a779SMarshall Clow constexpr ForwardIterator // constexpr in C++20 1623e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 1633e519524SHoward Hinnant 1643e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T, class BinaryPredicate> 16512f0a779SMarshall Clow constexpr ForwardIterator // constexpr in C++20 1663e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, 1673e519524SHoward Hinnant Size count, const T& value, BinaryPredicate pred); 1683e519524SHoward Hinnant 1693e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 1703e519524SHoward Hinnant OutputIterator 1713e519524SHoward Hinnant copy(InputIterator first, InputIterator last, OutputIterator result); 1723e519524SHoward Hinnant 1733e519524SHoward Hinnanttemplate<class InputIterator, class OutputIterator, class Predicate> 1743e519524SHoward Hinnant OutputIterator 1753e519524SHoward Hinnant copy_if(InputIterator first, InputIterator last, 1763e519524SHoward Hinnant OutputIterator result, Predicate pred); 1773e519524SHoward Hinnant 1783e519524SHoward Hinnanttemplate<class InputIterator, class Size, class OutputIterator> 1793e519524SHoward Hinnant OutputIterator 1803e519524SHoward Hinnant copy_n(InputIterator first, Size n, OutputIterator result); 1813e519524SHoward Hinnant 1823e519524SHoward Hinnanttemplate <class BidirectionalIterator1, class BidirectionalIterator2> 1833e519524SHoward Hinnant BidirectionalIterator2 1843e519524SHoward Hinnant copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 1853e519524SHoward Hinnant BidirectionalIterator2 result); 1863e519524SHoward Hinnant 1873e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1883e519524SHoward Hinnant ForwardIterator2 1893e519524SHoward Hinnant swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 1903e519524SHoward Hinnant 1913e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1923e519524SHoward Hinnant void 1933e519524SHoward Hinnant iter_swap(ForwardIterator1 a, ForwardIterator2 b); 1943e519524SHoward Hinnant 1953e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class UnaryOperation> 19699894b61SMarshall Clow constexpr OutputIterator // constexpr in C++20 1973e519524SHoward Hinnant transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 1983e519524SHoward Hinnant 1993e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 20099894b61SMarshall Clow constexpr OutputIterator // constexpr in C++20 2013e519524SHoward Hinnant transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 2023e519524SHoward Hinnant OutputIterator result, BinaryOperation binary_op); 2033e519524SHoward Hinnant 2043e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 20512c7423fSMarshall Clow constexpr void // constexpr in C++20 2063e519524SHoward Hinnant replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 2073e519524SHoward Hinnant 2083e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate, class T> 20912c7423fSMarshall Clow constexpr void // constexpr in C++20 2103e519524SHoward Hinnant replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 2113e519524SHoward Hinnant 2123e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 21312c7423fSMarshall Clow constexpr OutputIterator // constexpr in C++20 2143e519524SHoward Hinnant replace_copy(InputIterator first, InputIterator last, OutputIterator result, 2153e519524SHoward Hinnant const T& old_value, const T& new_value); 2163e519524SHoward Hinnant 2173e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate, class T> 21812c7423fSMarshall Clow constexpr OutputIterator // constexpr in C++20 2193e519524SHoward Hinnant replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 2203e519524SHoward Hinnant 2213e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2224bfb9313SMarshall Clow constexpr void // constexpr in C++20 2233e519524SHoward Hinnant fill(ForwardIterator first, ForwardIterator last, const T& value); 2243e519524SHoward Hinnant 2253e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class T> 2264bfb9313SMarshall Clow constexpr OutputIterator // constexpr in C++20 2273e519524SHoward Hinnant fill_n(OutputIterator first, Size n, const T& value); 2283e519524SHoward Hinnant 2293e519524SHoward Hinnanttemplate <class ForwardIterator, class Generator> 2304bfb9313SMarshall Clow constexpr void // constexpr in C++20 2313e519524SHoward Hinnant generate(ForwardIterator first, ForwardIterator last, Generator gen); 2323e519524SHoward Hinnant 2333e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class Generator> 2344bfb9313SMarshall Clow constexpr OutputIterator // constexpr in C++20 2353e519524SHoward Hinnant generate_n(OutputIterator first, Size n, Generator gen); 2363e519524SHoward Hinnant 2373e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 238e8ea8296SMarshall Clow constexpr ForwardIterator // constexpr in C++20 2393e519524SHoward Hinnant remove(ForwardIterator first, ForwardIterator last, const T& value); 2403e519524SHoward Hinnant 2413e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 242e8ea8296SMarshall Clow constexpr ForwardIterator // constexpr in C++20 2433e519524SHoward Hinnant remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 2443e519524SHoward Hinnant 2453e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 246e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 2473e519524SHoward Hinnant remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 2483e519524SHoward Hinnant 2493e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate> 250e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 2513e519524SHoward Hinnant remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 2523e519524SHoward Hinnant 2533e519524SHoward Hinnanttemplate <class ForwardIterator> 2543e519524SHoward Hinnant ForwardIterator 2553e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last); 2563e519524SHoward Hinnant 2573e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 2583e519524SHoward Hinnant ForwardIterator 2593e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 2603e519524SHoward Hinnant 2613e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 2623e519524SHoward Hinnant OutputIterator 2633e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result); 2643e519524SHoward Hinnant 2653e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class BinaryPredicate> 2663e519524SHoward Hinnant OutputIterator 2673e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 2683e519524SHoward Hinnant 2693e519524SHoward Hinnanttemplate <class BidirectionalIterator> 2703e519524SHoward Hinnant void 2713e519524SHoward Hinnant reverse(BidirectionalIterator first, BidirectionalIterator last); 2723e519524SHoward Hinnant 2733e519524SHoward Hinnanttemplate <class BidirectionalIterator, class OutputIterator> 274e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 2753e519524SHoward Hinnant reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 2763e519524SHoward Hinnant 2773e519524SHoward Hinnanttemplate <class ForwardIterator> 2783e519524SHoward Hinnant ForwardIterator 2793e519524SHoward Hinnant rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 2803e519524SHoward Hinnant 2813e519524SHoward Hinnanttemplate <class ForwardIterator, class OutputIterator> 2823e519524SHoward Hinnant OutputIterator 2833e519524SHoward Hinnant rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 2843e519524SHoward Hinnant 2853e519524SHoward Hinnanttemplate <class RandomAccessIterator> 2863e519524SHoward Hinnant void 2870f37a410SMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17 2883e519524SHoward Hinnant 2893e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 2903e519524SHoward Hinnant void 29106965c1fSMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last, 2920f37a410SMarshall Clow RandomNumberGenerator& rand); // deprecated in C++14, removed in C++17 2933e519524SHoward Hinnant 294e7154709SEric Fiseliertemplate<class PopulationIterator, class SampleIterator, 295e7154709SEric Fiselier class Distance, class UniformRandomBitGenerator> 296e7154709SEric Fiselier SampleIterator sample(PopulationIterator first, PopulationIterator last, 297e7154709SEric Fiselier SampleIterator out, Distance n, 298e7154709SEric Fiselier UniformRandomBitGenerator&& g); // C++17 299e7154709SEric Fiselier 300f9d540b0SHoward Hinnanttemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 301f9d540b0SHoward Hinnant void shuffle(RandomAccessIterator first, RandomAccessIterator last, 302fb340102SHoward Hinnant UniformRandomNumberGenerator&& g); 303f9d540b0SHoward Hinnant 3043e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 30549c7643cSMarshall Clow constexpr bool // constexpr in C++20 3063e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 3073e519524SHoward Hinnant 3083e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3093e519524SHoward Hinnant ForwardIterator 3103e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3113e519524SHoward Hinnant 3123e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 3133e519524SHoward Hinnant class OutputIterator2, class Predicate> 3141b9a4ffdSMarshall Clow constexpr pair<OutputIterator1, OutputIterator2> // constexpr in C++20 3153e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 3163e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 3173e519524SHoward Hinnant Predicate pred); 3183e519524SHoward Hinnant 3193e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3203e519524SHoward Hinnant ForwardIterator 3213e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3223e519524SHoward Hinnant 3233e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 324d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 3253e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 3263e519524SHoward Hinnant 3273e519524SHoward Hinnanttemplate <class ForwardIterator> 32849c7643cSMarshall Clow constexpr bool // constexpr in C++20 3293e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 3303e519524SHoward Hinnant 3313e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3323e519524SHoward Hinnant bool 3333e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 3343e519524SHoward Hinnant 3353e519524SHoward Hinnanttemplate<class ForwardIterator> 336056f15e3SMarshall Clow constexpr ForwardIterator // constexpr in C++20 3373e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 3383e519524SHoward Hinnant 3393e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 340056f15e3SMarshall Clow constexpr ForwardIterator // constexpr in C++20 3413e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 3423e519524SHoward Hinnant 3433e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3443e519524SHoward Hinnant void 3453e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 3463e519524SHoward Hinnant 3473e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3483e519524SHoward Hinnant void 3493e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3503e519524SHoward Hinnant 3513e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3523e519524SHoward Hinnant void 3533e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 3543e519524SHoward Hinnant 3553e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3563e519524SHoward Hinnant void 3573e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3583e519524SHoward Hinnant 3593e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3603e519524SHoward Hinnant void 3613e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 3623e519524SHoward Hinnant 3633e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3643e519524SHoward Hinnant void 3653e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 3663e519524SHoward Hinnant 3673e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 3683e519524SHoward Hinnant RandomAccessIterator 3693e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3703e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 3713e519524SHoward Hinnant 3723e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 3733e519524SHoward Hinnant RandomAccessIterator 3743e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3753e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 3763e519524SHoward Hinnant 3773e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3783e519524SHoward Hinnant void 3793e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 3803e519524SHoward Hinnant 3813e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3823e519524SHoward Hinnant void 3833e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 3843e519524SHoward Hinnant 3853e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 386d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 3873e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 3883e519524SHoward Hinnant 3893e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 390d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 3913e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3923e519524SHoward Hinnant 3933e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 394d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 3953e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 3963e519524SHoward Hinnant 3973e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 398d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 3993e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4003e519524SHoward Hinnant 4013e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 402d57c03ddSMarshall Clow constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 4033e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 4043e519524SHoward Hinnant 4053e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 406d57c03ddSMarshall Clow constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 4073e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4083e519524SHoward Hinnant 4093e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 410d57c03ddSMarshall Clow constexpr bool // constexpr in C++20 4113e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 4123e519524SHoward Hinnant 4133e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 4148da1a487SMarshall Clow constexpr bool // constexpr in C++20 4153e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4163e519524SHoward Hinnant 4173e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4183e519524SHoward Hinnant OutputIterator 4193e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4203e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4213e519524SHoward Hinnant 4223e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4233e519524SHoward Hinnant OutputIterator 4243e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4253e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4263e519524SHoward Hinnant 4273e519524SHoward Hinnanttemplate <class BidirectionalIterator> 4283e519524SHoward Hinnant void 4293e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 4303e519524SHoward Hinnant 4313e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 4323e519524SHoward Hinnant void 4333e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 4343e519524SHoward Hinnant 4353e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 4368da1a487SMarshall Clow constexpr bool // constexpr in C++20 4373e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 4383e519524SHoward Hinnant 4393e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 4408da1a487SMarshall Clow constexpr bool // constexpr in C++20 4413e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 4423e519524SHoward Hinnant 4433e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4443e519524SHoward Hinnant OutputIterator 4453e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4463e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4473e519524SHoward Hinnant 4483e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4493e519524SHoward Hinnant OutputIterator 4503e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4513e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4523e519524SHoward Hinnant 4533e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4548da1a487SMarshall Clow constexpr OutputIterator // constexpr in C++20 4553e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4563e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4573e519524SHoward Hinnant 4583e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4598da1a487SMarshall Clow constexpr OutputIterator // constexpr in C++20 4603e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4613e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4623e519524SHoward Hinnant 4633e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4643e519524SHoward Hinnant OutputIterator 4653e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4663e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4673e519524SHoward Hinnant 4683e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4693e519524SHoward Hinnant OutputIterator 4703e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4713e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4723e519524SHoward Hinnant 4733e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4743e519524SHoward Hinnant OutputIterator 4753e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4763e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4773e519524SHoward Hinnant 4783e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4793e519524SHoward Hinnant OutputIterator 4803e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4813e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4823e519524SHoward Hinnant 4833e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4843e519524SHoward Hinnant void 4853e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 4863e519524SHoward Hinnant 4873e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4883e519524SHoward Hinnant void 4893e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4903e519524SHoward Hinnant 4913e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4923e519524SHoward Hinnant void 4933e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 4943e519524SHoward Hinnant 4953e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4963e519524SHoward Hinnant void 4973e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4983e519524SHoward Hinnant 4993e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5003e519524SHoward Hinnant void 5013e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 5023e519524SHoward Hinnant 5033e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5043e519524SHoward Hinnant void 5053e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5063e519524SHoward Hinnant 5073e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5083e519524SHoward Hinnant void 5093e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 5103e519524SHoward Hinnant 5113e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5123e519524SHoward Hinnant void 5133e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5143e519524SHoward Hinnant 5153e519524SHoward Hinnanttemplate <class RandomAccessIterator> 51649c7643cSMarshall Clow constexpr bool // constexpr in C++20 5173e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 5183e519524SHoward Hinnant 5193e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 52049c7643cSMarshall Clow constexpr bool // constexpr in C++20 5213e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5223e519524SHoward Hinnant 5233e519524SHoward Hinnanttemplate <class RandomAccessIterator> 52449c7643cSMarshall Clow constexpr RandomAccessIterator // constexpr in C++20 5253e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 5263e519524SHoward Hinnant 5273e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 52849c7643cSMarshall Clow constexpr RandomAccessIterator // constexpr in C++20 5293e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5303e519524SHoward Hinnant 5314eb27b79SHoward Hinnanttemplate <class ForwardIterator> 5324eb27b79SHoward Hinnant ForwardIterator 5330b0671aeSMarshall Clow min_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5344eb27b79SHoward Hinnant 5354eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5364eb27b79SHoward Hinnant ForwardIterator 5370b0671aeSMarshall Clow min_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5384eb27b79SHoward Hinnant 5393e519524SHoward Hinnanttemplate <class T> 5403e519524SHoward Hinnant const T& 5419d67c6d5SMarshall Clow min(const T& a, const T& b); // constexpr in C++14 5423e519524SHoward Hinnant 5433e519524SHoward Hinnanttemplate <class T, class Compare> 5443e519524SHoward Hinnant const T& 5459d67c6d5SMarshall Clow min(const T& a, const T& b, Compare comp); // constexpr in C++14 5463e519524SHoward Hinnant 5473e519524SHoward Hinnanttemplate<class T> 5484eb27b79SHoward Hinnant T 5499d67c6d5SMarshall Clow min(initializer_list<T> t); // constexpr in C++14 5503e519524SHoward Hinnant 5513e519524SHoward Hinnanttemplate<class T, class Compare> 5524eb27b79SHoward Hinnant T 5539d67c6d5SMarshall Clow min(initializer_list<T> t, Compare comp); // constexpr in C++14 5543e519524SHoward Hinnant 555146c14acSMarshall Clowtemplate<class T> 556146c14acSMarshall Clow constexpr const T& clamp( const T& v, const T& lo, const T& hi ); // C++17 557146c14acSMarshall Clow 558146c14acSMarshall Clowtemplate<class T, class Compare> 559146c14acSMarshall Clow constexpr const T& clamp( const T& v, const T& lo, const T& hi, Compare comp ); // C++17 560146c14acSMarshall Clow 5613e519524SHoward Hinnanttemplate <class ForwardIterator> 5623e519524SHoward Hinnant ForwardIterator 5630b0671aeSMarshall Clow max_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5643e519524SHoward Hinnant 5653e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5663e519524SHoward Hinnant ForwardIterator 5670b0671aeSMarshall Clow max_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5683e519524SHoward Hinnant 5694eb27b79SHoward Hinnanttemplate <class T> 5704eb27b79SHoward Hinnant const T& 5719d67c6d5SMarshall Clow max(const T& a, const T& b); // constexpr in C++14 5724eb27b79SHoward Hinnant 5734eb27b79SHoward Hinnanttemplate <class T, class Compare> 5744eb27b79SHoward Hinnant const T& 5759d67c6d5SMarshall Clow max(const T& a, const T& b, Compare comp); // constexpr in C++14 5764eb27b79SHoward Hinnant 5774eb27b79SHoward Hinnanttemplate<class T> 5784eb27b79SHoward Hinnant T 5799d67c6d5SMarshall Clow max(initializer_list<T> t); // constexpr in C++14 5804eb27b79SHoward Hinnant 5814eb27b79SHoward Hinnanttemplate<class T, class Compare> 5824eb27b79SHoward Hinnant T 5839d67c6d5SMarshall Clow max(initializer_list<T> t, Compare comp); // constexpr in C++14 5844eb27b79SHoward Hinnant 5854eb27b79SHoward Hinnanttemplate<class ForwardIterator> 5864eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5870b0671aeSMarshall Clow minmax_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5884eb27b79SHoward Hinnant 5894eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 5904eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5910b0671aeSMarshall Clow minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5924eb27b79SHoward Hinnant 5934eb27b79SHoward Hinnanttemplate<class T> 5944eb27b79SHoward Hinnant pair<const T&, const T&> 5959d67c6d5SMarshall Clow minmax(const T& a, const T& b); // constexpr in C++14 5964eb27b79SHoward Hinnant 5974eb27b79SHoward Hinnanttemplate<class T, class Compare> 5984eb27b79SHoward Hinnant pair<const T&, const T&> 5999d67c6d5SMarshall Clow minmax(const T& a, const T& b, Compare comp); // constexpr in C++14 6004eb27b79SHoward Hinnant 6014eb27b79SHoward Hinnanttemplate<class T> 6024eb27b79SHoward Hinnant pair<T, T> 6039d67c6d5SMarshall Clow minmax(initializer_list<T> t); // constexpr in C++14 6044eb27b79SHoward Hinnant 6054eb27b79SHoward Hinnanttemplate<class T, class Compare> 6064eb27b79SHoward Hinnant pair<T, T> 6079d67c6d5SMarshall Clow minmax(initializer_list<T> t, Compare comp); // constexpr in C++14 6084eb27b79SHoward Hinnant 6093e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 6101b9a4ffdSMarshall Clow constexpr bool // constexpr in C++20 6113e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 6123e519524SHoward Hinnant 6133e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 6141b9a4ffdSMarshall Clow constexpr bool // constexpr in C++20 6153e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 6163e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 6173e519524SHoward Hinnant 6183e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6193e519524SHoward Hinnant bool 6203e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 6213e519524SHoward Hinnant 6223e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6233e519524SHoward Hinnant bool 6243e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6253e519524SHoward Hinnant 6263e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6273e519524SHoward Hinnant bool 6283e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 6293e519524SHoward Hinnant 6303e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6313e519524SHoward Hinnant bool 6323e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6333e519524SHoward Hinnant 6343e519524SHoward Hinnant} // std 6353e519524SHoward Hinnant 6363e519524SHoward Hinnant*/ 6373e519524SHoward Hinnant 6383e519524SHoward Hinnant#include <__config> 6393e519524SHoward Hinnant#include <initializer_list> 6403e519524SHoward Hinnant#include <type_traits> 6413e519524SHoward Hinnant#include <cstring> 642f07dd8d0SEric Fiselier#include <utility> // needed to provide swap_ranges. 6433e519524SHoward Hinnant#include <memory> 644d835e592SMarshall Clow#include <functional> 6453e519524SHoward Hinnant#include <iterator> 646a1d07d57SHoward Hinnant#include <cstddef> 647e02ee4f0SMarshall Clow#include <bit> 648f56972e2SMarshall Clow#include <version> 6495d1a701dSHoward Hinnant 650c1bd9197SEric Fiselier#include <__debug> 651c1bd9197SEric Fiselier 652073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6533e519524SHoward Hinnant#pragma GCC system_header 654073458b1SHoward Hinnant#endif 6553e519524SHoward Hinnant 656a016efb1SEric Fiselier_LIBCPP_PUSH_MACROS 657a016efb1SEric Fiselier#include <__undef_macros> 658a016efb1SEric Fiselier 659a016efb1SEric Fiselier 6603e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6613e519524SHoward Hinnant 6629d67c6d5SMarshall Clow// I'd like to replace these with _VSTD::equal_to<void>, but can't because: 6639d67c6d5SMarshall Clow// * That only works with C++14 and later, and 6649d67c6d5SMarshall Clow// * We haven't included <functional> here. 6653e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6663e519524SHoward Hinnantstruct __equal_to 6673e519524SHoward Hinnant{ 668d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 669d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 670d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 671d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6723e519524SHoward Hinnant}; 6733e519524SHoward Hinnant 6743e519524SHoward Hinnanttemplate <class _T1> 6753e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6763e519524SHoward Hinnant{ 6779d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6789d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6793e519524SHoward Hinnant}; 6803e519524SHoward Hinnant 6813e519524SHoward Hinnanttemplate <class _T1> 6823e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6833e519524SHoward Hinnant{ 6849d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6859d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6863e519524SHoward Hinnant}; 6873e519524SHoward Hinnant 6883e519524SHoward Hinnanttemplate <class _T1> 6893e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6903e519524SHoward Hinnant{ 6919d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6929d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6933e519524SHoward Hinnant}; 6943e519524SHoward Hinnant 6953e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6963e519524SHoward Hinnantstruct __less 6973e519524SHoward Hinnant{ 6989d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6999d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7009d67c6d5SMarshall Clow 7019d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7029d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 7039d67c6d5SMarshall Clow 7049d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7059d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 7069d67c6d5SMarshall Clow 7079d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7089d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 7093e519524SHoward Hinnant}; 7103e519524SHoward Hinnant 7113e519524SHoward Hinnanttemplate <class _T1> 7123e519524SHoward Hinnantstruct __less<_T1, _T1> 7133e519524SHoward Hinnant{ 7149d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7159d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7163e519524SHoward Hinnant}; 7173e519524SHoward Hinnant 7183e519524SHoward Hinnanttemplate <class _T1> 7193e519524SHoward Hinnantstruct __less<const _T1, _T1> 7203e519524SHoward Hinnant{ 7219d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7229d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7233e519524SHoward Hinnant}; 7243e519524SHoward Hinnant 7253e519524SHoward Hinnanttemplate <class _T1> 7263e519524SHoward Hinnantstruct __less<_T1, const _T1> 7273e519524SHoward Hinnant{ 7289d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7299d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7303e519524SHoward Hinnant}; 7313e519524SHoward Hinnant 7323e519524SHoward Hinnanttemplate <class _Predicate> 733a763b36fSMarshall Clowclass __invert // invert the sense of a comparison 7343e519524SHoward Hinnant{ 7353e519524SHoward Hinnantprivate: 7363e519524SHoward Hinnant _Predicate __p_; 7373e519524SHoward Hinnantpublic: 738a763b36fSMarshall Clow _LIBCPP_INLINE_VISIBILITY __invert() {} 7393e519524SHoward Hinnant 7403e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 741a763b36fSMarshall Clow explicit __invert(_Predicate __p) : __p_(__p) {} 7423e519524SHoward Hinnant 7433e519524SHoward Hinnant template <class _T1> 7443e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7453e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 7463e519524SHoward Hinnant 7473e519524SHoward Hinnant template <class _T1, class _T2> 7483e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 749a763b36fSMarshall Clow bool operator()(const _T1& __x, const _T2& __y) {return __p_(__y, __x);} 7503e519524SHoward Hinnant}; 7513e519524SHoward Hinnant 75204695a75SLouis Dionne// Perform division by two quickly for positive integers (llvm.org/PR39129) 75304695a75SLouis Dionne 75404695a75SLouis Dionnetemplate <typename _Integral> 75504695a75SLouis Dionne_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 75604695a75SLouis Dionnetypename enable_if 75704695a75SLouis Dionne< 75804695a75SLouis Dionne is_integral<_Integral>::value, 75904695a75SLouis Dionne _Integral 76004695a75SLouis Dionne>::type 76104695a75SLouis Dionne__half_positive(_Integral __value) 76204695a75SLouis Dionne{ 76304695a75SLouis Dionne return static_cast<_Integral>(static_cast<typename make_unsigned<_Integral>::type>(__value) / 2); 76404695a75SLouis Dionne} 76504695a75SLouis Dionne 76604695a75SLouis Dionnetemplate <typename _Tp> 76704695a75SLouis Dionne_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 76804695a75SLouis Dionnetypename enable_if 76904695a75SLouis Dionne< 77004695a75SLouis Dionne !is_integral<_Tp>::value, 77104695a75SLouis Dionne _Tp 77204695a75SLouis Dionne>::type 77304695a75SLouis Dionne__half_positive(_Tp __value) 77404695a75SLouis Dionne{ 77504695a75SLouis Dionne return __value / 2; 77604695a75SLouis Dionne} 77704695a75SLouis Dionne 778145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 7793e519524SHoward Hinnant 7803e519524SHoward Hinnanttemplate <class _Compare> 7813e519524SHoward Hinnantstruct __debug_less 7823e519524SHoward Hinnant{ 7833e519524SHoward Hinnant _Compare __comp_; 7843e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 785331d2159SEric Fiselier 7863e519524SHoward Hinnant template <class _Tp, class _Up> 787*6e4ec602SEric Fiselier bool operator()(_Tp& __x, _Up& __y) 7883e519524SHoward Hinnant { 7893e519524SHoward Hinnant bool __r = __comp_(__x, __y); 7903e519524SHoward Hinnant if (__r) 791331d2159SEric Fiselier __do_compare_assert(0, __y, __x); 7923e519524SHoward Hinnant return __r; 7933e519524SHoward Hinnant } 794331d2159SEric Fiselier 795331d2159SEric Fiselier template <class _LHS, class _RHS> 796331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 797331d2159SEric Fiselier decltype((void)_VSTD::declval<_Compare&>()( 798*6e4ec602SEric Fiselier _VSTD::declval<_LHS &>(), _VSTD::declval<_RHS &>())) 799*6e4ec602SEric Fiselier __do_compare_assert(int, _LHS & __l, _RHS & __r) { 800331d2159SEric Fiselier _LIBCPP_ASSERT(!__comp_(__l, __r), 801331d2159SEric Fiselier "Comparator does not induce a strict weak ordering"); 802331d2159SEric Fiselier } 803331d2159SEric Fiselier 804331d2159SEric Fiselier template <class _LHS, class _RHS> 805331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 806*6e4ec602SEric Fiselier void __do_compare_assert(long, _LHS &, _RHS &) {} 8073e519524SHoward Hinnant}; 8083e519524SHoward Hinnant 809145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 8103e519524SHoward Hinnant 8113e519524SHoward Hinnant// all_of 8123e519524SHoward Hinnant 8133e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 814706ffef7SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8153e519524SHoward Hinnantbool 8163e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8173e519524SHoward Hinnant{ 8183e519524SHoward Hinnant for (; __first != __last; ++__first) 8193e519524SHoward Hinnant if (!__pred(*__first)) 8203e519524SHoward Hinnant return false; 8213e519524SHoward Hinnant return true; 8223e519524SHoward Hinnant} 8233e519524SHoward Hinnant 8243e519524SHoward Hinnant// any_of 8253e519524SHoward Hinnant 8263e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 827706ffef7SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8283e519524SHoward Hinnantbool 8293e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8303e519524SHoward Hinnant{ 8313e519524SHoward Hinnant for (; __first != __last; ++__first) 8323e519524SHoward Hinnant if (__pred(*__first)) 8333e519524SHoward Hinnant return true; 8343e519524SHoward Hinnant return false; 8353e519524SHoward Hinnant} 8363e519524SHoward Hinnant 8373e519524SHoward Hinnant// none_of 8383e519524SHoward Hinnant 8393e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 840706ffef7SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8413e519524SHoward Hinnantbool 8423e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8433e519524SHoward Hinnant{ 8443e519524SHoward Hinnant for (; __first != __last; ++__first) 8453e519524SHoward Hinnant if (__pred(*__first)) 8463e519524SHoward Hinnant return false; 8473e519524SHoward Hinnant return true; 8483e519524SHoward Hinnant} 8493e519524SHoward Hinnant 8503e519524SHoward Hinnant// for_each 8513e519524SHoward Hinnant 8523e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 8531b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8543e519524SHoward Hinnant_Function 8553e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 8563e519524SHoward Hinnant{ 8573e519524SHoward Hinnant for (; __first != __last; ++__first) 8583e519524SHoward Hinnant __f(*__first); 8591c7fe126SMarshall Clow return __f; 8603e519524SHoward Hinnant} 8613e519524SHoward Hinnant 8621d02996dSMarshall Clow#if _LIBCPP_STD_VER > 14 863d5c65ffaSMarshall Clow// for_each_n 864d5c65ffaSMarshall Clow 865d5c65ffaSMarshall Clowtemplate <class _InputIterator, class _Size, class _Function> 8661b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 867d5c65ffaSMarshall Clow_InputIterator 868d5c65ffaSMarshall Clowfor_each_n(_InputIterator __first, _Size __orig_n, _Function __f) 869d5c65ffaSMarshall Clow{ 870d5c65ffaSMarshall Clow typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 871d5c65ffaSMarshall Clow _IntegralSize __n = __orig_n; 872d5c65ffaSMarshall Clow while (__n > 0) 873d5c65ffaSMarshall Clow { 874d5c65ffaSMarshall Clow __f(*__first); 875d5c65ffaSMarshall Clow ++__first; 876d5c65ffaSMarshall Clow --__n; 877d5c65ffaSMarshall Clow } 878d5c65ffaSMarshall Clow return __first; 879d5c65ffaSMarshall Clow} 8801d02996dSMarshall Clow#endif 881d5c65ffaSMarshall Clow 8823e519524SHoward Hinnant// find 8833e519524SHoward Hinnant 8843e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 88549c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8863e519524SHoward Hinnant_InputIterator 887e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 8883e519524SHoward Hinnant{ 8893e519524SHoward Hinnant for (; __first != __last; ++__first) 890e4383379SHoward Hinnant if (*__first == __value_) 8913e519524SHoward Hinnant break; 8923e519524SHoward Hinnant return __first; 8933e519524SHoward Hinnant} 8943e519524SHoward Hinnant 8953e519524SHoward Hinnant// find_if 8963e519524SHoward Hinnant 8973e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 89849c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8993e519524SHoward Hinnant_InputIterator 9003e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9013e519524SHoward Hinnant{ 9023e519524SHoward Hinnant for (; __first != __last; ++__first) 9033e519524SHoward Hinnant if (__pred(*__first)) 9043e519524SHoward Hinnant break; 9053e519524SHoward Hinnant return __first; 9063e519524SHoward Hinnant} 9073e519524SHoward Hinnant 9083e519524SHoward Hinnant// find_if_not 9093e519524SHoward Hinnant 9103e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 9118694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9123e519524SHoward Hinnant_InputIterator 9133e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9143e519524SHoward Hinnant{ 9153e519524SHoward Hinnant for (; __first != __last; ++__first) 9163e519524SHoward Hinnant if (!__pred(*__first)) 9173e519524SHoward Hinnant break; 9183e519524SHoward Hinnant return __first; 9193e519524SHoward Hinnant} 9203e519524SHoward Hinnant 9213e519524SHoward Hinnant// find_end 9223e519524SHoward Hinnant 9233e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 9248694428eSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator1 9253e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9263e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 9273e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 9283e519524SHoward Hinnant{ 9293e519524SHoward Hinnant // modeled after search algorithm 9303e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 9313e519524SHoward Hinnant if (__first2 == __last2) 9323e519524SHoward Hinnant return __r; 9333e519524SHoward Hinnant while (true) 9343e519524SHoward Hinnant { 9353e519524SHoward Hinnant while (true) 9363e519524SHoward Hinnant { 9373e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 9383e519524SHoward Hinnant return __r; // (or __last1 if never found) 9393e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 9403e519524SHoward Hinnant break; 9413e519524SHoward Hinnant ++__first1; 9423e519524SHoward Hinnant } 9433e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 9443e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 9453e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 9463e519524SHoward Hinnant while (true) 9473e519524SHoward Hinnant { 9483e519524SHoward Hinnant if (++__m2 == __last2) 9493e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 9503e519524SHoward Hinnant __r = __first1; 9513e519524SHoward Hinnant ++__first1; 9523e519524SHoward Hinnant break; 9533e519524SHoward Hinnant } 9543e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 9553e519524SHoward Hinnant return __r; 9563e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 9573e519524SHoward Hinnant { 9583e519524SHoward Hinnant ++__first1; 9593e519524SHoward Hinnant break; 9603e519524SHoward Hinnant } // else there is a match, check next elements 9613e519524SHoward Hinnant } 9623e519524SHoward Hinnant } 9633e519524SHoward Hinnant} 9643e519524SHoward Hinnant 9653e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 9668694428eSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _BidirectionalIterator1 9673e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 9683e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 9693e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 9703e519524SHoward Hinnant{ 9713e519524SHoward Hinnant // modeled after search algorithm (in reverse) 9723e519524SHoward Hinnant if (__first2 == __last2) 9733e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 9743e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 9753e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 9763e519524SHoward Hinnant --__l2; 9773e519524SHoward Hinnant while (true) 9783e519524SHoward Hinnant { 9793e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 9803e519524SHoward Hinnant while (true) 9813e519524SHoward Hinnant { 9823e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 9833e519524SHoward Hinnant return __last1; 9843e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9853e519524SHoward Hinnant break; 9863e519524SHoward Hinnant } 9873e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 9883e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 9893e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 9903e519524SHoward Hinnant while (true) 9913e519524SHoward Hinnant { 9923e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 9933e519524SHoward Hinnant return __m1; 9943e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 9953e519524SHoward Hinnant return __last1; 9963e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 9973e519524SHoward Hinnant { 9983e519524SHoward Hinnant break; 9993e519524SHoward Hinnant } // else there is a match, check next elements 10003e519524SHoward Hinnant } 10013e519524SHoward Hinnant } 10023e519524SHoward Hinnant} 10033e519524SHoward Hinnant 10043e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 10059b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1 10063e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 10073e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 10083e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 10093e519524SHoward Hinnant{ 10103e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 10113e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 10123e519524SHoward Hinnant if (__len2 == 0) 10133e519524SHoward Hinnant return __last1; 10143e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 10153e519524SHoward Hinnant if (__len1 < __len2) 10163e519524SHoward Hinnant return __last1; 10173e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 10183e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 10193e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 10203e519524SHoward Hinnant --__l2; 10213e519524SHoward Hinnant while (true) 10223e519524SHoward Hinnant { 10233e519524SHoward Hinnant while (true) 10243e519524SHoward Hinnant { 10253e519524SHoward Hinnant if (__s == __l1) 10263e519524SHoward Hinnant return __last1; 10273e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10283e519524SHoward Hinnant break; 10293e519524SHoward Hinnant } 10303e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 10313e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 10323e519524SHoward Hinnant while (true) 10333e519524SHoward Hinnant { 10343e519524SHoward Hinnant if (__m2 == __first2) 10353e519524SHoward Hinnant return __m1; 10363e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 10373e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 10383e519524SHoward Hinnant { 10393e519524SHoward Hinnant break; 10403e519524SHoward Hinnant } 10413e519524SHoward Hinnant } 10423e519524SHoward Hinnant } 10433e519524SHoward Hinnant} 10443e519524SHoward Hinnant 10453e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10468694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10473e519524SHoward Hinnant_ForwardIterator1 10483e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10493e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10503e519524SHoward Hinnant{ 1051ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 10523e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 10533e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 10543e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 10553e519524SHoward Hinnant} 10563e519524SHoward Hinnant 10573e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10588694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10593e519524SHoward Hinnant_ForwardIterator1 10603e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10613e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10623e519524SHoward Hinnant{ 10633e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10643e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1065ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10663e519524SHoward Hinnant} 10673e519524SHoward Hinnant 10683e519524SHoward Hinnant// find_first_of 10693e519524SHoward Hinnant 10703e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10719b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1 10729b0af34dSMarshall Clow__find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10733e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10743e519524SHoward Hinnant{ 10753e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 10763e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 10773e519524SHoward Hinnant if (__pred(*__first1, *__j)) 10783e519524SHoward Hinnant return __first1; 10793e519524SHoward Hinnant return __last1; 10803e519524SHoward Hinnant} 10813e519524SHoward Hinnant 10829b0af34dSMarshall Clow 10839b0af34dSMarshall Clowtemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10848694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10859b0af34dSMarshall Clow_ForwardIterator1 10869b0af34dSMarshall Clowfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10879b0af34dSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10889b0af34dSMarshall Clow{ 10899b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); 10909b0af34dSMarshall Clow} 10919b0af34dSMarshall Clow 10923e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10938694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10943e519524SHoward Hinnant_ForwardIterator1 10953e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10963e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10973e519524SHoward Hinnant{ 10983e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10993e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 11009b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11013e519524SHoward Hinnant} 11023e519524SHoward Hinnant 11033e519524SHoward Hinnant// adjacent_find 11043e519524SHoward Hinnant 11053e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 11068694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11073e519524SHoward Hinnant_ForwardIterator 11083e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 11093e519524SHoward Hinnant{ 11103e519524SHoward Hinnant if (__first != __last) 11113e519524SHoward Hinnant { 11123e519524SHoward Hinnant _ForwardIterator __i = __first; 11133e519524SHoward Hinnant while (++__i != __last) 11143e519524SHoward Hinnant { 11153e519524SHoward Hinnant if (__pred(*__first, *__i)) 11163e519524SHoward Hinnant return __first; 11173e519524SHoward Hinnant __first = __i; 11183e519524SHoward Hinnant } 11193e519524SHoward Hinnant } 11203e519524SHoward Hinnant return __last; 11213e519524SHoward Hinnant} 11223e519524SHoward Hinnant 11233e519524SHoward Hinnanttemplate <class _ForwardIterator> 11248694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11253e519524SHoward Hinnant_ForwardIterator 11263e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 11273e519524SHoward Hinnant{ 11283e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1129ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 11303e519524SHoward Hinnant} 11313e519524SHoward Hinnant 11323e519524SHoward Hinnant// count 11333e519524SHoward Hinnant 11343e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 1135056f15e3SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11363e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1137e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 11383e519524SHoward Hinnant{ 11393e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11403e519524SHoward Hinnant for (; __first != __last; ++__first) 1141e4383379SHoward Hinnant if (*__first == __value_) 11423e519524SHoward Hinnant ++__r; 11433e519524SHoward Hinnant return __r; 11443e519524SHoward Hinnant} 11453e519524SHoward Hinnant 11463e519524SHoward Hinnant// count_if 11473e519524SHoward Hinnant 11483e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 1149056f15e3SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11503e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 11513e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 11523e519524SHoward Hinnant{ 11533e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11543e519524SHoward Hinnant for (; __first != __last; ++__first) 11553e519524SHoward Hinnant if (__pred(*__first)) 11563e519524SHoward Hinnant ++__r; 11573e519524SHoward Hinnant return __r; 11583e519524SHoward Hinnant} 11593e519524SHoward Hinnant 11603e519524SHoward Hinnant// mismatch 11613e519524SHoward Hinnant 11623e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11636538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11643e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11653e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11663e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 11673e519524SHoward Hinnant{ 1168bd7c7b55SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__first2) 11693e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11703e519524SHoward Hinnant break; 11713e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11723e519524SHoward Hinnant} 11733e519524SHoward Hinnant 11743e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11756538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11763e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11773e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11783e519524SHoward Hinnant{ 11793e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11803e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1181ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11823e519524SHoward Hinnant} 11833e519524SHoward Hinnant 11840b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 11850b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11866538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11870b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11880b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11890b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 11900b0bbd2fSMarshall Clow _BinaryPredicate __pred) 11910b0bbd2fSMarshall Clow{ 1192bd7c7b55SMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 11930b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 11940b0bbd2fSMarshall Clow break; 11950b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11960b0bbd2fSMarshall Clow} 11970b0bbd2fSMarshall Clow 11980b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 11996538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12000b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 12010b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12020b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12030b0bbd2fSMarshall Clow{ 12040b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12050b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12060b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 12070b0bbd2fSMarshall Clow} 12080b0bbd2fSMarshall Clow#endif 12090b0bbd2fSMarshall Clow 12103e519524SHoward Hinnant// equal 12113e519524SHoward Hinnant 12123e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12136538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12143e519524SHoward Hinnantbool 12153e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 12163e519524SHoward Hinnant{ 1217910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 12183e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12193e519524SHoward Hinnant return false; 12203e519524SHoward Hinnant return true; 12213e519524SHoward Hinnant} 12223e519524SHoward Hinnant 12233e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 12246538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12253e519524SHoward Hinnantbool 12263e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12273e519524SHoward Hinnant{ 12283e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12293e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1230ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12313e519524SHoward Hinnant} 12323e519524SHoward Hinnant 12330b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12340b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 12356538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12360b0bbd2fSMarshall Clowbool 12370b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 12380b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 12390b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 12400b0bbd2fSMarshall Clow{ 1241910285b2SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 12420b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 12430b0bbd2fSMarshall Clow return false; 12440b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 12450b0bbd2fSMarshall Clow} 12460b0bbd2fSMarshall Clow 12470b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 12486538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12490b0bbd2fSMarshall Clowbool 12500b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 12510b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 12520b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 12530b0bbd2fSMarshall Clow{ 12540b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 12550b0bbd2fSMarshall Clow return false; 12560b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 12570b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 12580b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 12590b0bbd2fSMarshall Clow} 12600b0bbd2fSMarshall Clow 12610b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12626538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12630b0bbd2fSMarshall Clowbool 12640b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12650b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 12660b0bbd2fSMarshall Clow{ 12670b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 12680b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 12690b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12700b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12710b0bbd2fSMarshall Clow} 12720b0bbd2fSMarshall Clow 12730b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 12746538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12750b0bbd2fSMarshall Clowbool 12760b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12770b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12780b0bbd2fSMarshall Clow{ 12790b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12800b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12810b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 12820b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12830b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12840b0bbd2fSMarshall Clow} 12850b0bbd2fSMarshall Clow#endif 12860b0bbd2fSMarshall Clow 12873e519524SHoward Hinnant// is_permutation 12883e519524SHoward Hinnant 12893e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 129049c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 12913e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12923e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 12933e519524SHoward Hinnant{ 129449c7643cSMarshall Clow// shorten sequences as much as possible by lopping of any equal prefix 1295910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 12963e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 129749c7643cSMarshall Clow break; 129849c7643cSMarshall Clow if (__first1 == __last1) 12993e519524SHoward Hinnant return true; 130049c7643cSMarshall Clow 13013e519524SHoward Hinnant// __first1 != __last1 && *__first1 != *__first2 13023e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1303ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 13043e519524SHoward Hinnant if (__l1 == _D1(1)) 13053e519524SHoward Hinnant return false; 1306ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 13073e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 13083e519524SHoward Hinnant // equal elements in [f2, l2) 13093e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13103e519524SHoward Hinnant { 13113e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 1312939b1623SPeter Collingbourne _ForwardIterator1 __match = __first1; 1313939b1623SPeter Collingbourne for (; __match != __i; ++__match) 1314939b1623SPeter Collingbourne if (__pred(*__match, *__i)) 1315939b1623SPeter Collingbourne break; 1316939b1623SPeter Collingbourne if (__match == __i) { 13173e519524SHoward Hinnant // Count number of *__i in [f2, l2) 13183e519524SHoward Hinnant _D1 __c2 = 0; 13193e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13203e519524SHoward Hinnant if (__pred(*__i, *__j)) 13213e519524SHoward Hinnant ++__c2; 13223e519524SHoward Hinnant if (__c2 == 0) 13233e519524SHoward Hinnant return false; 13243e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 13253e519524SHoward Hinnant _D1 __c1 = 1; 1326ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13273e519524SHoward Hinnant if (__pred(*__i, *__j)) 13283e519524SHoward Hinnant ++__c1; 13293e519524SHoward Hinnant if (__c1 != __c2) 13303e519524SHoward Hinnant return false; 13313e519524SHoward Hinnant } 13323e519524SHoward Hinnant } 13333e519524SHoward Hinnant return true; 13343e519524SHoward Hinnant} 13353e519524SHoward Hinnant 13363e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 133749c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13383e519524SHoward Hinnantbool 13393e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13403e519524SHoward Hinnant _ForwardIterator2 __first2) 13413e519524SHoward Hinnant{ 13423e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 13433e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1344ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 13453e519524SHoward Hinnant} 13463e519524SHoward Hinnant 13470b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 13480b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 134949c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 13500b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13510b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 13520b0bbd2fSMarshall Clow _BinaryPredicate __pred, 13530b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 13540b0bbd2fSMarshall Clow{ 135549c7643cSMarshall Clow// shorten sequences as much as possible by lopping of any equal prefix 1356847ee131SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 13570b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 135849c7643cSMarshall Clow break; 135949c7643cSMarshall Clow if (__first1 == __last1) 136049c7643cSMarshall Clow return __first2 == __last2; 136149c7643cSMarshall Clow else if (__first2 == __last2) 136249c7643cSMarshall Clow return false; 136349c7643cSMarshall Clow 13640b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 13650b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 13660b0bbd2fSMarshall Clow 13670b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1368fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 13690b0bbd2fSMarshall Clow if (__l1 != __l2) 13700b0bbd2fSMarshall Clow return false; 13710b0bbd2fSMarshall Clow 13720b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 13730b0bbd2fSMarshall Clow // equal elements in [f2, l2) 13740b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13750b0bbd2fSMarshall Clow { 13760b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 1377939b1623SPeter Collingbourne _ForwardIterator1 __match = __first1; 1378939b1623SPeter Collingbourne for (; __match != __i; ++__match) 1379939b1623SPeter Collingbourne if (__pred(*__match, *__i)) 1380939b1623SPeter Collingbourne break; 1381939b1623SPeter Collingbourne if (__match == __i) { 13820b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 13830b0bbd2fSMarshall Clow _D1 __c2 = 0; 13840b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13850b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13860b0bbd2fSMarshall Clow ++__c2; 13870b0bbd2fSMarshall Clow if (__c2 == 0) 13880b0bbd2fSMarshall Clow return false; 13890b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 13900b0bbd2fSMarshall Clow _D1 __c1 = 1; 13910b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13920b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13930b0bbd2fSMarshall Clow ++__c1; 13940b0bbd2fSMarshall Clow if (__c1 != __c2) 13950b0bbd2fSMarshall Clow return false; 13960b0bbd2fSMarshall Clow } 13970b0bbd2fSMarshall Clow } 13980b0bbd2fSMarshall Clow return true; 13990b0bbd2fSMarshall Clow} 14000b0bbd2fSMarshall Clow 14010b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 140249c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 14030b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 14040b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 14050b0bbd2fSMarshall Clow _BinaryPredicate __pred, 14060b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 14070b0bbd2fSMarshall Clow{ 14080b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 14090b0bbd2fSMarshall Clow return false; 14100b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 14110b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 14120b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 14130b0bbd2fSMarshall Clow} 14140b0bbd2fSMarshall Clow 14150b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 141649c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14170b0bbd2fSMarshall Clowbool 14180b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14190b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 14200b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 14210b0bbd2fSMarshall Clow{ 14220b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 14230b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 14240b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 14250b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14260b0bbd2fSMarshall Clow} 14270b0bbd2fSMarshall Clow 14280b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 142949c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14300b0bbd2fSMarshall Clowbool 14310b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14320b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 14330b0bbd2fSMarshall Clow{ 14340b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 14350b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 14360b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 14370b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 14380b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 14390b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14400b0bbd2fSMarshall Clow} 14410b0bbd2fSMarshall Clow#endif 14420b0bbd2fSMarshall Clow 14433e519524SHoward Hinnant// search 1444d835e592SMarshall Clow// __search is in <functional> 14453e519524SHoward Hinnant 14463e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 144712f0a779SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14483e519524SHoward Hinnant_ForwardIterator1 14493e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14503e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 14513e519524SHoward Hinnant{ 1452ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 14533e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 145428cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 145528cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()) 145628cc4ddeSMarshall Clow .first; 14573e519524SHoward Hinnant} 14583e519524SHoward Hinnant 14593e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 146012f0a779SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14613e519524SHoward Hinnant_ForwardIterator1 14623e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14633e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 14643e519524SHoward Hinnant{ 146528cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 146628cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1467ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 14683e519524SHoward Hinnant} 14693e519524SHoward Hinnant 1470d835e592SMarshall Clow 1471d835e592SMarshall Clow#if _LIBCPP_STD_VER > 14 1472d835e592SMarshall Clowtemplate <class _ForwardIterator, class _Searcher> 147312f0a779SMarshall Clow_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1474d835e592SMarshall Clow_ForwardIterator search(_ForwardIterator __f, _ForwardIterator __l, const _Searcher &__s) 1475d835e592SMarshall Clow{ return __s(__f, __l).first; } 1476d835e592SMarshall Clow#endif 1477d835e592SMarshall Clow 14783e519524SHoward Hinnant// search_n 14793e519524SHoward Hinnant 14803e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 148112f0a779SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 14823e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1483e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 14843e519524SHoward Hinnant{ 14853e519524SHoward Hinnant if (__count <= 0) 14863e519524SHoward Hinnant return __first; 14873e519524SHoward Hinnant while (true) 14883e519524SHoward Hinnant { 1489e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 14903e519524SHoward Hinnant while (true) 14913e519524SHoward Hinnant { 1492e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 14933e519524SHoward Hinnant return __last; 1494e4383379SHoward Hinnant if (__pred(*__first, __value_)) 14953e519524SHoward Hinnant break; 14963e519524SHoward Hinnant ++__first; 14973e519524SHoward Hinnant } 1498e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 14993e519524SHoward Hinnant _ForwardIterator __m = __first; 15003e519524SHoward Hinnant _Size __c(0); 15013e519524SHoward Hinnant while (true) 15023e519524SHoward Hinnant { 15033e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 15043e519524SHoward Hinnant return __first; 15053e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 15063e519524SHoward Hinnant return __last; 1507e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 15083e519524SHoward Hinnant { 15093e519524SHoward Hinnant __first = __m; 15103e519524SHoward Hinnant ++__first; 15113e519524SHoward Hinnant break; 15123e519524SHoward Hinnant } // else there is a match, check next elements 15133e519524SHoward Hinnant } 15143e519524SHoward Hinnant } 15153e519524SHoward Hinnant} 15163e519524SHoward Hinnant 15173e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 151812f0a779SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 15193e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1520e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 15213e519524SHoward Hinnant{ 15223e519524SHoward Hinnant if (__count <= 0) 15233e519524SHoward Hinnant return __first; 15243e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 15253e519524SHoward Hinnant if (__len < __count) 15263e519524SHoward Hinnant return __last; 15273e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 15283e519524SHoward Hinnant while (true) 15293e519524SHoward Hinnant { 1530e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 15313e519524SHoward Hinnant while (true) 15323e519524SHoward Hinnant { 1533b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 15343e519524SHoward Hinnant return __last; 1535e4383379SHoward Hinnant if (__pred(*__first, __value_)) 15363e519524SHoward Hinnant break; 15373e519524SHoward Hinnant ++__first; 15383e519524SHoward Hinnant } 1539e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 15403e519524SHoward Hinnant _RandomAccessIterator __m = __first; 15413e519524SHoward Hinnant _Size __c(0); 15423e519524SHoward Hinnant while (true) 15433e519524SHoward Hinnant { 15443e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 15453e519524SHoward Hinnant return __first; 15463e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1547e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 15483e519524SHoward Hinnant { 15493e519524SHoward Hinnant __first = __m; 15503e519524SHoward Hinnant ++__first; 15513e519524SHoward Hinnant break; 15523e519524SHoward Hinnant } // else there is a match, check next elements 15533e519524SHoward Hinnant } 15543e519524SHoward Hinnant } 15553e519524SHoward Hinnant} 15563e519524SHoward Hinnant 15573e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 155812f0a779SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 15593e519524SHoward Hinnant_ForwardIterator 15603e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1561e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 15623e519524SHoward Hinnant{ 1563ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 156451544023SEric Fiselier (__first, __last, __convert_to_integral(__count), __value_, __pred, 156551544023SEric Fiselier typename iterator_traits<_ForwardIterator>::iterator_category()); 15663e519524SHoward Hinnant} 15673e519524SHoward Hinnant 15683e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 156912f0a779SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 15703e519524SHoward Hinnant_ForwardIterator 1571e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 15723e519524SHoward Hinnant{ 15733e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 157451544023SEric Fiselier return _VSTD::search_n(__first, __last, __convert_to_integral(__count), 157551544023SEric Fiselier __value_, __equal_to<__v, _Tp>()); 15763e519524SHoward Hinnant} 15773e519524SHoward Hinnant 15783e519524SHoward Hinnant// copy 15793e519524SHoward Hinnanttemplate <class _Iter> 15803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15813e519524SHoward Hinnant_Iter 15823e519524SHoward Hinnant__unwrap_iter(_Iter __i) 15833e519524SHoward Hinnant{ 15843e519524SHoward Hinnant return __i; 15853e519524SHoward Hinnant} 15863e519524SHoward Hinnant 15873e519524SHoward Hinnanttemplate <class _Tp> 15885b7c98e5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 15893e519524SHoward Hinnanttypename enable_if 15903e519524SHoward Hinnant< 1591ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 15923e519524SHoward Hinnant _Tp* 15933e519524SHoward Hinnant>::type 15943e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 15953e519524SHoward Hinnant{ 15963e519524SHoward Hinnant return __i.base(); 15973e519524SHoward Hinnant} 15983e519524SHoward Hinnant 1599fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1600fc88dbd2SHoward Hinnant 16013e519524SHoward Hinnanttemplate <class _Tp> 16029cad5025SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG 16033e519524SHoward Hinnanttypename enable_if 16043e519524SHoward Hinnant< 1605ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 16063e519524SHoward Hinnant _Tp* 16073e519524SHoward Hinnant>::type 16083e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 16093e519524SHoward Hinnant{ 16103e519524SHoward Hinnant return __i.base(); 16113e519524SHoward Hinnant} 16123e519524SHoward Hinnant 1613c8879ab2SMarshall Clowtemplate <class _Tp> 1614c8879ab2SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG 1615c8879ab2SMarshall Clowtypename enable_if 1616c8879ab2SMarshall Clow< 1617c8879ab2SMarshall Clow is_trivially_copy_assignable<_Tp>::value, 1618c8879ab2SMarshall Clow const _Tp* 1619c8879ab2SMarshall Clow>::type 1620c8879ab2SMarshall Clow__unwrap_iter(__wrap_iter<const _Tp*> __i) 1621c8879ab2SMarshall Clow{ 1622c8879ab2SMarshall Clow return __i.base(); 1623c8879ab2SMarshall Clow} 1624c8879ab2SMarshall Clow 162514bd0bf0SEric Fiselier#else 162614bd0bf0SEric Fiselier 162714bd0bf0SEric Fiseliertemplate <class _Tp> 16289cad5025SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG 162914bd0bf0SEric Fiseliertypename enable_if 163014bd0bf0SEric Fiselier< 163114bd0bf0SEric Fiselier is_trivially_copy_assignable<_Tp>::value, 163214bd0bf0SEric Fiselier __wrap_iter<_Tp*> 163314bd0bf0SEric Fiselier>::type 163414bd0bf0SEric Fiselier__unwrap_iter(__wrap_iter<_Tp*> __i) 163514bd0bf0SEric Fiselier{ 163614bd0bf0SEric Fiselier return __i; 163714bd0bf0SEric Fiselier} 163814bd0bf0SEric Fiselier 1639fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1640fc88dbd2SHoward Hinnant 16413e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 16423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16433e519524SHoward Hinnant_OutputIterator 16443e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 16453e519524SHoward Hinnant{ 1646910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 16473e519524SHoward Hinnant *__result = *__first; 16483e519524SHoward Hinnant return __result; 16493e519524SHoward Hinnant} 16503e519524SHoward Hinnant 16513e519524SHoward Hinnanttemplate <class _Tp, class _Up> 16523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16533e519524SHoward Hinnanttypename enable_if 16543e519524SHoward Hinnant< 16553e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1656ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 16573e519524SHoward Hinnant _Up* 16583e519524SHoward Hinnant>::type 16593e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 16603e519524SHoward Hinnant{ 16613e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 16625b312052SMarshall Clow if (__n > 0) 1663ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 16643e519524SHoward Hinnant return __result + __n; 16653e519524SHoward Hinnant} 16663e519524SHoward Hinnant 16673e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 16683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16693e519524SHoward Hinnant_OutputIterator 16703e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 16713e519524SHoward Hinnant{ 1672ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 16733e519524SHoward Hinnant} 16743e519524SHoward Hinnant 16753e519524SHoward Hinnant// copy_backward 16763e519524SHoward Hinnant 1677d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 16783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16793e519524SHoward Hinnant_OutputIterator 1680d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 16813e519524SHoward Hinnant{ 16823e519524SHoward Hinnant while (__first != __last) 16833e519524SHoward Hinnant *--__result = *--__last; 16843e519524SHoward Hinnant return __result; 16853e519524SHoward Hinnant} 16863e519524SHoward Hinnant 16873e519524SHoward Hinnanttemplate <class _Tp, class _Up> 16883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16893e519524SHoward Hinnanttypename enable_if 16903e519524SHoward Hinnant< 16913e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1692ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 16933e519524SHoward Hinnant _Up* 16943e519524SHoward Hinnant>::type 16953e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 16963e519524SHoward Hinnant{ 16973e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 16985b312052SMarshall Clow if (__n > 0) 16995b312052SMarshall Clow { 17003e519524SHoward Hinnant __result -= __n; 1701ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17025b312052SMarshall Clow } 17033e519524SHoward Hinnant return __result; 17043e519524SHoward Hinnant} 17053e519524SHoward Hinnant 17063e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 17073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17083e519524SHoward Hinnant_BidirectionalIterator2 17093e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 17103e519524SHoward Hinnant _BidirectionalIterator2 __result) 17113e519524SHoward Hinnant{ 1712fd838227SEric Fiselier return _VSTD::__copy_backward(__unwrap_iter(__first), 1713fd838227SEric Fiselier __unwrap_iter(__last), 1714fd838227SEric Fiselier __unwrap_iter(__result)); 17153e519524SHoward Hinnant} 17163e519524SHoward Hinnant 17173e519524SHoward Hinnant// copy_if 17183e519524SHoward Hinnant 17193e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 17203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17213e519524SHoward Hinnant_OutputIterator 17223e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 17233e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 17243e519524SHoward Hinnant{ 17253e519524SHoward Hinnant for (; __first != __last; ++__first) 17263e519524SHoward Hinnant { 17273e519524SHoward Hinnant if (__pred(*__first)) 17283e519524SHoward Hinnant { 17293e519524SHoward Hinnant *__result = *__first; 17303e519524SHoward Hinnant ++__result; 17313e519524SHoward Hinnant } 17323e519524SHoward Hinnant } 17333e519524SHoward Hinnant return __result; 17343e519524SHoward Hinnant} 17353e519524SHoward Hinnant 17363e519524SHoward Hinnant// copy_n 17373e519524SHoward Hinnant 17383e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 17393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17403e519524SHoward Hinnanttypename enable_if 17413e519524SHoward Hinnant< 17423e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 17433e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 17443e519524SHoward Hinnant _OutputIterator 17453e519524SHoward Hinnant>::type 174651544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 17473e519524SHoward Hinnant{ 174851544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 174951544023SEric Fiselier _IntegralSize __n = __orig_n; 175099847d2bSHoward Hinnant if (__n > 0) 175199847d2bSHoward Hinnant { 17523e519524SHoward Hinnant *__result = *__first; 175399847d2bSHoward Hinnant ++__result; 175499847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 175599847d2bSHoward Hinnant { 175699847d2bSHoward Hinnant ++__first; 175799847d2bSHoward Hinnant *__result = *__first; 175899847d2bSHoward Hinnant ++__result; 175999847d2bSHoward Hinnant } 176099847d2bSHoward Hinnant } 17613e519524SHoward Hinnant return __result; 17623e519524SHoward Hinnant} 17633e519524SHoward Hinnant 17643e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 17653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17663e519524SHoward Hinnanttypename enable_if 17673e519524SHoward Hinnant< 17683e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 17693e519524SHoward Hinnant _OutputIterator 17703e519524SHoward Hinnant>::type 177151544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 17723e519524SHoward Hinnant{ 177351544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 177451544023SEric Fiselier _IntegralSize __n = __orig_n; 1775ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 17763e519524SHoward Hinnant} 17773e519524SHoward Hinnant 17783e519524SHoward Hinnant// move 17793e519524SHoward Hinnant 17803e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17823e519524SHoward Hinnant_OutputIterator 17833e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17843e519524SHoward Hinnant{ 1785910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1786ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 17873e519524SHoward Hinnant return __result; 17883e519524SHoward Hinnant} 17893e519524SHoward Hinnant 17903e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17923e519524SHoward Hinnanttypename enable_if 17933e519524SHoward Hinnant< 17943e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1795ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17963e519524SHoward Hinnant _Up* 17973e519524SHoward Hinnant>::type 17983e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 17993e519524SHoward Hinnant{ 18003e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18015b312052SMarshall Clow if (__n > 0) 1802ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18033e519524SHoward Hinnant return __result + __n; 18043e519524SHoward Hinnant} 18053e519524SHoward Hinnant 18063e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18083e519524SHoward Hinnant_OutputIterator 18093e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18103e519524SHoward Hinnant{ 1811ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18123e519524SHoward Hinnant} 18133e519524SHoward Hinnant 18143e519524SHoward Hinnant// move_backward 18153e519524SHoward Hinnant 18163e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18183e519524SHoward Hinnant_OutputIterator 18193e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18203e519524SHoward Hinnant{ 18213e519524SHoward Hinnant while (__first != __last) 1822ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 18233e519524SHoward Hinnant return __result; 18243e519524SHoward Hinnant} 18253e519524SHoward Hinnant 18263e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18283e519524SHoward Hinnanttypename enable_if 18293e519524SHoward Hinnant< 18303e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1831ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18323e519524SHoward Hinnant _Up* 18333e519524SHoward Hinnant>::type 18343e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 18353e519524SHoward Hinnant{ 18363e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18375b312052SMarshall Clow if (__n > 0) 18385b312052SMarshall Clow { 18393e519524SHoward Hinnant __result -= __n; 1840ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18415b312052SMarshall Clow } 18423e519524SHoward Hinnant return __result; 18433e519524SHoward Hinnant} 18443e519524SHoward Hinnant 18453e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 18463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18473e519524SHoward Hinnant_BidirectionalIterator2 18483e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 18493e519524SHoward Hinnant _BidirectionalIterator2 __result) 18503e519524SHoward Hinnant{ 1851ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18523e519524SHoward Hinnant} 18533e519524SHoward Hinnant 18543e519524SHoward Hinnant// iter_swap 18553e519524SHoward Hinnant 1856a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 18573e519524SHoward Hinnant 18583e519524SHoward Hinnant// transform 18593e519524SHoward Hinnant 18603e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 186199894b61SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18623e519524SHoward Hinnant_OutputIterator 18633e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 18643e519524SHoward Hinnant{ 1865910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 18663e519524SHoward Hinnant *__result = __op(*__first); 18673e519524SHoward Hinnant return __result; 18683e519524SHoward Hinnant} 18693e519524SHoward Hinnant 18703e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 187199894b61SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18723e519524SHoward Hinnant_OutputIterator 18733e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 18743e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 18753e519524SHoward Hinnant{ 1876910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 18773e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 18783e519524SHoward Hinnant return __result; 18793e519524SHoward Hinnant} 18803e519524SHoward Hinnant 18813e519524SHoward Hinnant// replace 18823e519524SHoward Hinnant 18833e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 188412c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18853e519524SHoward Hinnantvoid 18863e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 18873e519524SHoward Hinnant{ 18883e519524SHoward Hinnant for (; __first != __last; ++__first) 18893e519524SHoward Hinnant if (*__first == __old_value) 18903e519524SHoward Hinnant *__first = __new_value; 18913e519524SHoward Hinnant} 18923e519524SHoward Hinnant 18933e519524SHoward Hinnant// replace_if 18943e519524SHoward Hinnant 18953e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 189612c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18973e519524SHoward Hinnantvoid 18983e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 18993e519524SHoward Hinnant{ 19003e519524SHoward Hinnant for (; __first != __last; ++__first) 19013e519524SHoward Hinnant if (__pred(*__first)) 19023e519524SHoward Hinnant *__first = __new_value; 19033e519524SHoward Hinnant} 19043e519524SHoward Hinnant 19053e519524SHoward Hinnant// replace_copy 19063e519524SHoward Hinnant 19073e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 190812c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19093e519524SHoward Hinnant_OutputIterator 19103e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19113e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 19123e519524SHoward Hinnant{ 1913910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19143e519524SHoward Hinnant if (*__first == __old_value) 19153e519524SHoward Hinnant *__result = __new_value; 19163e519524SHoward Hinnant else 19173e519524SHoward Hinnant *__result = *__first; 19183e519524SHoward Hinnant return __result; 19193e519524SHoward Hinnant} 19203e519524SHoward Hinnant 19213e519524SHoward Hinnant// replace_copy_if 19223e519524SHoward Hinnant 19233e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 192412c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19253e519524SHoward Hinnant_OutputIterator 19263e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19273e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 19283e519524SHoward Hinnant{ 1929910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19303e519524SHoward Hinnant if (__pred(*__first)) 19313e519524SHoward Hinnant *__result = __new_value; 19323e519524SHoward Hinnant else 19333e519524SHoward Hinnant *__result = *__first; 19343e519524SHoward Hinnant return __result; 19353e519524SHoward Hinnant} 19363e519524SHoward Hinnant 19373e519524SHoward Hinnant// fill_n 19383e519524SHoward Hinnant 19393e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 19404bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19413e519524SHoward Hinnant_OutputIterator 19420f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 19433e519524SHoward Hinnant{ 1944910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 1945e4383379SHoward Hinnant *__first = __value_; 19463e519524SHoward Hinnant return __first; 19473e519524SHoward Hinnant} 19483e519524SHoward Hinnant 19493e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 19504bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19513e519524SHoward Hinnant_OutputIterator 1952e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 19533e519524SHoward Hinnant{ 195451544023SEric Fiselier return _VSTD::__fill_n(__first, __convert_to_integral(__n), __value_); 19553e519524SHoward Hinnant} 19563e519524SHoward Hinnant 19573e519524SHoward Hinnant// fill 19583e519524SHoward Hinnant 19593e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19604bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19613e519524SHoward Hinnantvoid 1962e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 19633e519524SHoward Hinnant{ 19643e519524SHoward Hinnant for (; __first != __last; ++__first) 1965e4383379SHoward Hinnant *__first = __value_; 19663e519524SHoward Hinnant} 19673e519524SHoward Hinnant 19683e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 19694bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19703e519524SHoward Hinnantvoid 1971e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 19723e519524SHoward Hinnant{ 1973e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 19743e519524SHoward Hinnant} 19753e519524SHoward Hinnant 19763e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19774bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19783e519524SHoward Hinnantvoid 1979e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 19803e519524SHoward Hinnant{ 1981e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 19823e519524SHoward Hinnant} 19833e519524SHoward Hinnant 19843e519524SHoward Hinnant// generate 19853e519524SHoward Hinnant 19863e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 19874bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19883e519524SHoward Hinnantvoid 19893e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 19903e519524SHoward Hinnant{ 19913e519524SHoward Hinnant for (; __first != __last; ++__first) 19923e519524SHoward Hinnant *__first = __gen(); 19933e519524SHoward Hinnant} 19943e519524SHoward Hinnant 19953e519524SHoward Hinnant// generate_n 19963e519524SHoward Hinnant 19973e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 19984bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19993e519524SHoward Hinnant_OutputIterator 200051544023SEric Fiseliergenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 20013e519524SHoward Hinnant{ 200251544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 200351544023SEric Fiselier _IntegralSize __n = __orig_n; 2004910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 20053e519524SHoward Hinnant *__first = __gen(); 20063e519524SHoward Hinnant return __first; 20073e519524SHoward Hinnant} 20083e519524SHoward Hinnant 20093e519524SHoward Hinnant// remove 20103e519524SHoward Hinnant 20113e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 2012e8ea8296SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 2013e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20143e519524SHoward Hinnant{ 2015e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 20163e519524SHoward Hinnant if (__first != __last) 20173e519524SHoward Hinnant { 20183e519524SHoward Hinnant _ForwardIterator __i = __first; 20193e519524SHoward Hinnant while (++__i != __last) 20203e519524SHoward Hinnant { 2021e4383379SHoward Hinnant if (!(*__i == __value_)) 20223e519524SHoward Hinnant { 2023ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 20243e519524SHoward Hinnant ++__first; 20253e519524SHoward Hinnant } 20263e519524SHoward Hinnant } 20273e519524SHoward Hinnant } 20283e519524SHoward Hinnant return __first; 20293e519524SHoward Hinnant} 20303e519524SHoward Hinnant 20313e519524SHoward Hinnant// remove_if 20323e519524SHoward Hinnant 20333e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 2034e8ea8296SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 20353e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 20363e519524SHoward Hinnant{ 2037ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 20383e519524SHoward Hinnant (__first, __last, __pred); 20393e519524SHoward Hinnant if (__first != __last) 20403e519524SHoward Hinnant { 20413e519524SHoward Hinnant _ForwardIterator __i = __first; 20423e519524SHoward Hinnant while (++__i != __last) 20433e519524SHoward Hinnant { 20443e519524SHoward Hinnant if (!__pred(*__i)) 20453e519524SHoward Hinnant { 2046ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 20473e519524SHoward Hinnant ++__first; 20483e519524SHoward Hinnant } 20493e519524SHoward Hinnant } 20503e519524SHoward Hinnant } 20513e519524SHoward Hinnant return __first; 20523e519524SHoward Hinnant} 20533e519524SHoward Hinnant 20543e519524SHoward Hinnant// remove_copy 20553e519524SHoward Hinnant 20563e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 2057e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20583e519524SHoward Hinnant_OutputIterator 2059e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 20603e519524SHoward Hinnant{ 20613e519524SHoward Hinnant for (; __first != __last; ++__first) 20623e519524SHoward Hinnant { 2063e4383379SHoward Hinnant if (!(*__first == __value_)) 20643e519524SHoward Hinnant { 20653e519524SHoward Hinnant *__result = *__first; 20663e519524SHoward Hinnant ++__result; 20673e519524SHoward Hinnant } 20683e519524SHoward Hinnant } 20693e519524SHoward Hinnant return __result; 20703e519524SHoward Hinnant} 20713e519524SHoward Hinnant 20723e519524SHoward Hinnant// remove_copy_if 20733e519524SHoward Hinnant 20743e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 2075e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20763e519524SHoward Hinnant_OutputIterator 20773e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 20783e519524SHoward Hinnant{ 20793e519524SHoward Hinnant for (; __first != __last; ++__first) 20803e519524SHoward Hinnant { 20813e519524SHoward Hinnant if (!__pred(*__first)) 20823e519524SHoward Hinnant { 20833e519524SHoward Hinnant *__result = *__first; 20843e519524SHoward Hinnant ++__result; 20853e519524SHoward Hinnant } 20863e519524SHoward Hinnant } 20873e519524SHoward Hinnant return __result; 20883e519524SHoward Hinnant} 20893e519524SHoward Hinnant 20903e519524SHoward Hinnant// unique 20913e519524SHoward Hinnant 20923e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 20934bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 20943e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 20953e519524SHoward Hinnant{ 2096ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 20973e519524SHoward Hinnant (__first, __last, __pred); 20983e519524SHoward Hinnant if (__first != __last) 20993e519524SHoward Hinnant { 21003e519524SHoward Hinnant // ... a a ? ... 21013e519524SHoward Hinnant // f i 21023e519524SHoward Hinnant _ForwardIterator __i = __first; 21033e519524SHoward Hinnant for (++__i; ++__i != __last;) 21043e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2105ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 21063e519524SHoward Hinnant ++__first; 21073e519524SHoward Hinnant } 21083e519524SHoward Hinnant return __first; 21093e519524SHoward Hinnant} 21103e519524SHoward Hinnant 21113e519524SHoward Hinnanttemplate <class _ForwardIterator> 21124bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21133e519524SHoward Hinnant_ForwardIterator 21143e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 21153e519524SHoward Hinnant{ 21163e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2117ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 21183e519524SHoward Hinnant} 21193e519524SHoward Hinnant 21203e519524SHoward Hinnant// unique_copy 21213e519524SHoward Hinnant 21223e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 21234bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 21243e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 21253e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 21263e519524SHoward Hinnant{ 21273e519524SHoward Hinnant if (__first != __last) 21283e519524SHoward Hinnant { 21293e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 21303e519524SHoward Hinnant *__result = __t; 21313e519524SHoward Hinnant ++__result; 21323e519524SHoward Hinnant while (++__first != __last) 21333e519524SHoward Hinnant { 21343e519524SHoward Hinnant if (!__pred(__t, *__first)) 21353e519524SHoward Hinnant { 21363e519524SHoward Hinnant __t = *__first; 21373e519524SHoward Hinnant *__result = __t; 21383e519524SHoward Hinnant ++__result; 21393e519524SHoward Hinnant } 21403e519524SHoward Hinnant } 21413e519524SHoward Hinnant } 21423e519524SHoward Hinnant return __result; 21433e519524SHoward Hinnant} 21443e519524SHoward Hinnant 21453e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 21464bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 21473e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 21483e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 21493e519524SHoward Hinnant{ 21503e519524SHoward Hinnant if (__first != __last) 21513e519524SHoward Hinnant { 21523e519524SHoward Hinnant _ForwardIterator __i = __first; 21533e519524SHoward Hinnant *__result = *__i; 21543e519524SHoward Hinnant ++__result; 21553e519524SHoward Hinnant while (++__first != __last) 21563e519524SHoward Hinnant { 21573e519524SHoward Hinnant if (!__pred(*__i, *__first)) 21583e519524SHoward Hinnant { 21593e519524SHoward Hinnant *__result = *__first; 21603e519524SHoward Hinnant ++__result; 21613e519524SHoward Hinnant __i = __first; 21623e519524SHoward Hinnant } 21633e519524SHoward Hinnant } 21643e519524SHoward Hinnant } 21653e519524SHoward Hinnant return __result; 21663e519524SHoward Hinnant} 21673e519524SHoward Hinnant 21683e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 21694bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 21703e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 21713e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 21723e519524SHoward Hinnant{ 21733e519524SHoward Hinnant if (__first != __last) 21743e519524SHoward Hinnant { 21753e519524SHoward Hinnant *__result = *__first; 21763e519524SHoward Hinnant while (++__first != __last) 21773e519524SHoward Hinnant if (!__pred(*__result, *__first)) 21783e519524SHoward Hinnant *++__result = *__first; 21793e519524SHoward Hinnant ++__result; 21803e519524SHoward Hinnant } 21813e519524SHoward Hinnant return __result; 21823e519524SHoward Hinnant} 21833e519524SHoward Hinnant 21843e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 21854bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21863e519524SHoward Hinnant_OutputIterator 21873e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 21883e519524SHoward Hinnant{ 2189ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 21903e519524SHoward Hinnant (__first, __last, __result, __pred, 21913e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 21923e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 21933e519524SHoward Hinnant} 21943e519524SHoward Hinnant 21953e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 21964bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21973e519524SHoward Hinnant_OutputIterator 21983e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 21993e519524SHoward Hinnant{ 22003e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2201ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 22023e519524SHoward Hinnant} 22033e519524SHoward Hinnant 22043e519524SHoward Hinnant// reverse 22053e519524SHoward Hinnant 22063e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 22073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22083e519524SHoward Hinnantvoid 22093e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 22103e519524SHoward Hinnant{ 22113e519524SHoward Hinnant while (__first != __last) 22123e519524SHoward Hinnant { 22133e519524SHoward Hinnant if (__first == --__last) 22143e519524SHoward Hinnant break; 2215def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 22163e519524SHoward Hinnant ++__first; 22173e519524SHoward Hinnant } 22183e519524SHoward Hinnant} 22193e519524SHoward Hinnant 22203e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 22213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22223e519524SHoward Hinnantvoid 22233e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 22243e519524SHoward Hinnant{ 22253e519524SHoward Hinnant if (__first != __last) 22263e519524SHoward Hinnant for (; __first < --__last; ++__first) 2227def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 22283e519524SHoward Hinnant} 22293e519524SHoward Hinnant 22303e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 22313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22323e519524SHoward Hinnantvoid 22333e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 22343e519524SHoward Hinnant{ 2235ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 22363e519524SHoward Hinnant} 22373e519524SHoward Hinnant 22383e519524SHoward Hinnant// reverse_copy 22393e519524SHoward Hinnant 22403e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 2241e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 22423e519524SHoward Hinnant_OutputIterator 22433e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 22443e519524SHoward Hinnant{ 22453e519524SHoward Hinnant for (; __first != __last; ++__result) 22463e519524SHoward Hinnant *__result = *--__last; 22473e519524SHoward Hinnant return __result; 22483e519524SHoward Hinnant} 22493e519524SHoward Hinnant 22503e519524SHoward Hinnant// rotate 22513e519524SHoward Hinnant 22523e519524SHoward Hinnanttemplate <class _ForwardIterator> 22533e519524SHoward Hinnant_ForwardIterator 2254aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 22553e519524SHoward Hinnant{ 2256aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2257aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2258aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2259aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2260aca09de3SHoward Hinnant return __lm1; 2261aca09de3SHoward Hinnant} 2262aca09de3SHoward Hinnant 2263aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2264aca09de3SHoward Hinnant_BidirectionalIterator 2265aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2266aca09de3SHoward Hinnant{ 2267aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2268aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2269aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2270aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2271aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2272aca09de3SHoward Hinnant return __fp1; 2273aca09de3SHoward Hinnant} 2274aca09de3SHoward Hinnant 2275aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2276aca09de3SHoward Hinnant_ForwardIterator 2277aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2278aca09de3SHoward Hinnant{ 22793e519524SHoward Hinnant _ForwardIterator __i = __middle; 22803e519524SHoward Hinnant while (true) 22813e519524SHoward Hinnant { 22823e519524SHoward Hinnant swap(*__first, *__i); 22833e519524SHoward Hinnant ++__first; 22843e519524SHoward Hinnant if (++__i == __last) 22853e519524SHoward Hinnant break; 22863e519524SHoward Hinnant if (__first == __middle) 22873e519524SHoward Hinnant __middle = __i; 22883e519524SHoward Hinnant } 22893e519524SHoward Hinnant _ForwardIterator __r = __first; 22903e519524SHoward Hinnant if (__first != __middle) 22913e519524SHoward Hinnant { 22923e519524SHoward Hinnant __i = __middle; 22933e519524SHoward Hinnant while (true) 22943e519524SHoward Hinnant { 22953e519524SHoward Hinnant swap(*__first, *__i); 22963e519524SHoward Hinnant ++__first; 22973e519524SHoward Hinnant if (++__i == __last) 22983e519524SHoward Hinnant { 22993e519524SHoward Hinnant if (__first == __middle) 23003e519524SHoward Hinnant break; 23013e519524SHoward Hinnant __i = __middle; 23023e519524SHoward Hinnant } 23033e519524SHoward Hinnant else if (__first == __middle) 23043e519524SHoward Hinnant __middle = __i; 23053e519524SHoward Hinnant } 23063e519524SHoward Hinnant } 23073e519524SHoward Hinnant return __r; 23083e519524SHoward Hinnant} 23093e519524SHoward Hinnant 23103e519524SHoward Hinnanttemplate<typename _Integral> 23113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23123e519524SHoward Hinnant_Integral 231319b4035fSMarshall Clow__algo_gcd(_Integral __x, _Integral __y) 23143e519524SHoward Hinnant{ 23153e519524SHoward Hinnant do 23163e519524SHoward Hinnant { 23173e519524SHoward Hinnant _Integral __t = __x % __y; 23183e519524SHoward Hinnant __x = __y; 23193e519524SHoward Hinnant __y = __t; 23203e519524SHoward Hinnant } while (__y); 23213e519524SHoward Hinnant return __x; 23223e519524SHoward Hinnant} 23233e519524SHoward Hinnant 23243e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 23253e519524SHoward Hinnant_RandomAccessIterator 2326aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 23273e519524SHoward Hinnant{ 23283e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 23293e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 23303e519524SHoward Hinnant 23313e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 23323e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 23333e519524SHoward Hinnant if (__m1 == __m2) 23343e519524SHoward Hinnant { 2335ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 23363e519524SHoward Hinnant return __middle; 23373e519524SHoward Hinnant } 233819b4035fSMarshall Clow const difference_type __g = _VSTD::__algo_gcd(__m1, __m2); 23393e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 23403e519524SHoward Hinnant { 2341aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 23423e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 23433e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 23443e519524SHoward Hinnant do 23453e519524SHoward Hinnant { 2346aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 23473e519524SHoward Hinnant __p1 = __p2; 23483e519524SHoward Hinnant const difference_type __d = __last - __p2; 23493e519524SHoward Hinnant if (__m1 < __d) 23503e519524SHoward Hinnant __p2 += __m1; 23513e519524SHoward Hinnant else 23523e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 23533e519524SHoward Hinnant } while (__p2 != __p); 2354aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 23553e519524SHoward Hinnant } 23563e519524SHoward Hinnant return __first + __m2; 23573e519524SHoward Hinnant} 23583e519524SHoward Hinnant 23593e519524SHoward Hinnanttemplate <class _ForwardIterator> 23603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23613e519524SHoward Hinnant_ForwardIterator 2362aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2363aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2364aca09de3SHoward Hinnant{ 2365aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2366aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2367aca09de3SHoward Hinnant { 2368aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2369aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2370aca09de3SHoward Hinnant } 2371aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2372aca09de3SHoward Hinnant} 2373aca09de3SHoward Hinnant 2374aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2375aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2376aca09de3SHoward Hinnant_BidirectionalIterator 2377aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2378aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2379aca09de3SHoward Hinnant{ 2380aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2381aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2382aca09de3SHoward Hinnant { 2383aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2384aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2385aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2386aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2387aca09de3SHoward Hinnant } 2388aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2389aca09de3SHoward Hinnant} 2390aca09de3SHoward Hinnant 2391aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2392aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2393aca09de3SHoward Hinnant_RandomAccessIterator 2394aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2395aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2396aca09de3SHoward Hinnant{ 2397aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2398aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2399aca09de3SHoward Hinnant { 2400aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2401aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2402aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2403aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2404aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2405aca09de3SHoward Hinnant } 2406aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2407aca09de3SHoward Hinnant} 2408aca09de3SHoward Hinnant 2409aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2410aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2411aca09de3SHoward Hinnant_ForwardIterator 24123e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 24133e519524SHoward Hinnant{ 2414aca09de3SHoward Hinnant if (__first == __middle) 2415aca09de3SHoward Hinnant return __last; 2416aca09de3SHoward Hinnant if (__middle == __last) 2417aca09de3SHoward Hinnant return __first; 2418ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2419aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 24203e519524SHoward Hinnant} 24213e519524SHoward Hinnant 24223e519524SHoward Hinnant// rotate_copy 24233e519524SHoward Hinnant 24243e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 24253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24263e519524SHoward Hinnant_OutputIterator 24273e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 24283e519524SHoward Hinnant{ 2429ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 24303e519524SHoward Hinnant} 24313e519524SHoward Hinnant 24323e519524SHoward Hinnant// min_element 24333e519524SHoward Hinnant 24343e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 24359d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24363e519524SHoward Hinnant_ForwardIterator 24370b0671aeSMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 24383e519524SHoward Hinnant{ 2439a60d7facSEric Fiselier static_assert(__is_forward_iterator<_ForwardIterator>::value, 2440a60d7facSEric Fiselier "std::min_element requires a ForwardIterator"); 24413e519524SHoward Hinnant if (__first != __last) 24423e519524SHoward Hinnant { 24433e519524SHoward Hinnant _ForwardIterator __i = __first; 24443e519524SHoward Hinnant while (++__i != __last) 24453e519524SHoward Hinnant if (__comp(*__i, *__first)) 24463e519524SHoward Hinnant __first = __i; 24473e519524SHoward Hinnant } 24483e519524SHoward Hinnant return __first; 24493e519524SHoward Hinnant} 24503e519524SHoward Hinnant 24513e519524SHoward Hinnanttemplate <class _ForwardIterator> 24520b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24533e519524SHoward Hinnant_ForwardIterator 24543e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 24553e519524SHoward Hinnant{ 24560b0671aeSMarshall Clow return _VSTD::min_element(__first, __last, 24574eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 24584eb27b79SHoward Hinnant} 24594eb27b79SHoward Hinnant 24604eb27b79SHoward Hinnant// min 24614eb27b79SHoward Hinnant 24624eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 24639d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24644eb27b79SHoward Hinnantconst _Tp& 24654eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 24664eb27b79SHoward Hinnant{ 24674eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 24684eb27b79SHoward Hinnant} 24694eb27b79SHoward Hinnant 24704eb27b79SHoward Hinnanttemplate <class _Tp> 24719d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24724eb27b79SHoward Hinnantconst _Tp& 24734eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 24744eb27b79SHoward Hinnant{ 2475ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 24764eb27b79SHoward Hinnant} 24774eb27b79SHoward Hinnant 2478ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 247954976f26SHoward Hinnant 24804eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 24819d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24824eb27b79SHoward Hinnant_Tp 24834eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 24844eb27b79SHoward Hinnant{ 24850b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 24864eb27b79SHoward Hinnant} 24874eb27b79SHoward Hinnant 24884eb27b79SHoward Hinnanttemplate<class _Tp> 24899d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24904eb27b79SHoward Hinnant_Tp 24914eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 24924eb27b79SHoward Hinnant{ 24930b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 24943e519524SHoward Hinnant} 24953e519524SHoward Hinnant 2496ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 249754976f26SHoward Hinnant 24983e519524SHoward Hinnant// max_element 24993e519524SHoward Hinnant 25003e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25019d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25023e519524SHoward Hinnant_ForwardIterator 25030b0671aeSMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25043e519524SHoward Hinnant{ 2505a60d7facSEric Fiselier static_assert(__is_forward_iterator<_ForwardIterator>::value, 2506a60d7facSEric Fiselier "std::max_element requires a ForwardIterator"); 25073e519524SHoward Hinnant if (__first != __last) 25083e519524SHoward Hinnant { 25093e519524SHoward Hinnant _ForwardIterator __i = __first; 25103e519524SHoward Hinnant while (++__i != __last) 25113e519524SHoward Hinnant if (__comp(*__first, *__i)) 25123e519524SHoward Hinnant __first = __i; 25133e519524SHoward Hinnant } 25143e519524SHoward Hinnant return __first; 25153e519524SHoward Hinnant} 25163e519524SHoward Hinnant 25179d67c6d5SMarshall Clow 25183e519524SHoward Hinnanttemplate <class _ForwardIterator> 25190b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25203e519524SHoward Hinnant_ForwardIterator 25213e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 25223e519524SHoward Hinnant{ 25230b0671aeSMarshall Clow return _VSTD::max_element(__first, __last, 25244eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25254eb27b79SHoward Hinnant} 25264eb27b79SHoward Hinnant 25274eb27b79SHoward Hinnant// max 25284eb27b79SHoward Hinnant 25294eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25309d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25314eb27b79SHoward Hinnantconst _Tp& 25324eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 25334eb27b79SHoward Hinnant{ 25344eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 25354eb27b79SHoward Hinnant} 25364eb27b79SHoward Hinnant 25374eb27b79SHoward Hinnanttemplate <class _Tp> 25389d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25394eb27b79SHoward Hinnantconst _Tp& 25404eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 25414eb27b79SHoward Hinnant{ 2542ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 25434eb27b79SHoward Hinnant} 25444eb27b79SHoward Hinnant 2545ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 254654976f26SHoward Hinnant 25474eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 25489d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25494eb27b79SHoward Hinnant_Tp 25504eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 25514eb27b79SHoward Hinnant{ 25520b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 25534eb27b79SHoward Hinnant} 25544eb27b79SHoward Hinnant 25554eb27b79SHoward Hinnanttemplate<class _Tp> 25569d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25574eb27b79SHoward Hinnant_Tp 25584eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 25594eb27b79SHoward Hinnant{ 25600b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); 25613e519524SHoward Hinnant} 25623e519524SHoward Hinnant 2563ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 256454976f26SHoward Hinnant 2565146c14acSMarshall Clow#if _LIBCPP_STD_VER > 14 2566146c14acSMarshall Clow// clamp 2567146c14acSMarshall Clowtemplate<class _Tp, class _Compare> 2568146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2569146c14acSMarshall Clowconst _Tp& 2570146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) 2571146c14acSMarshall Clow{ 2572146c14acSMarshall Clow _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); 2573146c14acSMarshall Clow return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; 2574146c14acSMarshall Clow 2575146c14acSMarshall Clow} 2576146c14acSMarshall Clow 2577146c14acSMarshall Clowtemplate<class _Tp> 2578146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2579146c14acSMarshall Clowconst _Tp& 2580146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi) 2581146c14acSMarshall Clow{ 2582146c14acSMarshall Clow return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); 2583146c14acSMarshall Clow} 2584146c14acSMarshall Clow#endif 2585146c14acSMarshall Clow 25863e519524SHoward Hinnant// minmax_element 25873e519524SHoward Hinnant 25883e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25890b0671aeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 25903e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 25913e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25923e519524SHoward Hinnant{ 2593a60d7facSEric Fiselier static_assert(__is_forward_iterator<_ForwardIterator>::value, 2594a60d7facSEric Fiselier "std::minmax_element requires a ForwardIterator"); 25953e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 25963e519524SHoward Hinnant if (__first != __last) 25973e519524SHoward Hinnant { 25983e519524SHoward Hinnant if (++__first != __last) 25993e519524SHoward Hinnant { 26003e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26013e519524SHoward Hinnant __result.first = __first; 26023e519524SHoward Hinnant else 26033e519524SHoward Hinnant __result.second = __first; 26043e519524SHoward Hinnant while (++__first != __last) 26053e519524SHoward Hinnant { 26063e519524SHoward Hinnant _ForwardIterator __i = __first; 26073e519524SHoward Hinnant if (++__first == __last) 26083e519524SHoward Hinnant { 26093e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 26103e519524SHoward Hinnant __result.first = __i; 26113e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 26123e519524SHoward Hinnant __result.second = __i; 26133e519524SHoward Hinnant break; 26143e519524SHoward Hinnant } 26153e519524SHoward Hinnant else 26163e519524SHoward Hinnant { 26173e519524SHoward Hinnant if (__comp(*__first, *__i)) 26183e519524SHoward Hinnant { 26193e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26203e519524SHoward Hinnant __result.first = __first; 26213e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 26223e519524SHoward Hinnant __result.second = __i; 26233e519524SHoward Hinnant } 26243e519524SHoward Hinnant else 26253e519524SHoward Hinnant { 26263e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 26273e519524SHoward Hinnant __result.first = __i; 26283e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 26293e519524SHoward Hinnant __result.second = __first; 26303e519524SHoward Hinnant } 26313e519524SHoward Hinnant } 26323e519524SHoward Hinnant } 26333e519524SHoward Hinnant } 26343e519524SHoward Hinnant } 26353e519524SHoward Hinnant return __result; 26363e519524SHoward Hinnant} 26373e519524SHoward Hinnant 26383e519524SHoward Hinnanttemplate <class _ForwardIterator> 26390b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26403e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26413e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 26423e519524SHoward Hinnant{ 26439d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 26449d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26453e519524SHoward Hinnant} 26463e519524SHoward Hinnant 26474eb27b79SHoward Hinnant// minmax 26484eb27b79SHoward Hinnant 26494eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26509d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26514eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 26524eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26534eb27b79SHoward Hinnant{ 26544eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 26554eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 26564eb27b79SHoward Hinnant} 26574eb27b79SHoward Hinnant 26584eb27b79SHoward Hinnanttemplate<class _Tp> 26599d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26604eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 26614eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 26624eb27b79SHoward Hinnant{ 2663ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 26644eb27b79SHoward Hinnant} 26654eb27b79SHoward Hinnant 2666ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 266754976f26SHoward Hinnant 26684eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26699d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26704eb27b79SHoward Hinnantpair<_Tp, _Tp> 26714eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 26724eb27b79SHoward Hinnant{ 26739d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 26749d67c6d5SMarshall Clow _Iter __first = __t.begin(); 26759d67c6d5SMarshall Clow _Iter __last = __t.end(); 26769d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result(*__first, *__first); 26779d67c6d5SMarshall Clow 26789d67c6d5SMarshall Clow ++__first; 26799d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 26809d67c6d5SMarshall Clow { 26819d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 26829d67c6d5SMarshall Clow __result.first = *__first; 26839d67c6d5SMarshall Clow else 26849d67c6d5SMarshall Clow __result.second = *__first; 26859d67c6d5SMarshall Clow ++__first; 26869d67c6d5SMarshall Clow } 26879d67c6d5SMarshall Clow 26889d67c6d5SMarshall Clow while (__first != __last) 26899d67c6d5SMarshall Clow { 26909d67c6d5SMarshall Clow _Tp __prev = *__first++; 2691002144f6SMarshall Clow if (__comp(*__first, __prev)) { 2692002144f6SMarshall Clow if ( __comp(*__first, __result.first)) __result.first = *__first; 2693002144f6SMarshall Clow if (!__comp(__prev, __result.second)) __result.second = __prev; 26949d67c6d5SMarshall Clow } 26959d67c6d5SMarshall Clow else { 2696002144f6SMarshall Clow if ( __comp(__prev, __result.first)) __result.first = __prev; 2697002144f6SMarshall Clow if (!__comp(*__first, __result.second)) __result.second = *__first; 26989d67c6d5SMarshall Clow } 26999d67c6d5SMarshall Clow 27009d67c6d5SMarshall Clow __first++; 27019d67c6d5SMarshall Clow } 27029d67c6d5SMarshall Clow return __result; 27039d67c6d5SMarshall Clow} 27049d67c6d5SMarshall Clow 27059d67c6d5SMarshall Clowtemplate<class _Tp> 27069d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27079d67c6d5SMarshall Clowpair<_Tp, _Tp> 27089d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 27099d67c6d5SMarshall Clow{ 27109d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 27114eb27b79SHoward Hinnant} 27124eb27b79SHoward Hinnant 2713ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 271454976f26SHoward Hinnant 27153e519524SHoward Hinnant// random_shuffle 27163e519524SHoward Hinnant 2717f9d540b0SHoward Hinnant// __independent_bits_engine 2718f9d540b0SHoward Hinnant 2719c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2720f9d540b0SHoward Hinnantstruct __log2_imp 27213e519524SHoward Hinnant{ 2722c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2723c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 27243e519524SHoward Hinnant}; 27253e519524SHoward Hinnant 2726c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2727c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 27283e519524SHoward Hinnant{ 2729f9d540b0SHoward Hinnant static const size_t value = 0; 27303e519524SHoward Hinnant}; 27313e519524SHoward Hinnant 2732c003db1fSHoward Hinnanttemplate <size_t _Rp> 2733c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 27343e519524SHoward Hinnant{ 2735c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 27363e519524SHoward Hinnant}; 27373e519524SHoward Hinnant 273889918caaSEric Fiseliertemplate <class _UIntType, _UIntType _Xp> 2739f9d540b0SHoward Hinnantstruct __log2 27403e519524SHoward Hinnant{ 2741c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 274289918caaSEric Fiselier sizeof(_UIntType) * __CHAR_BIT__ - 1>::value; 27433e519524SHoward Hinnant}; 27443e519524SHoward Hinnant 2745f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2746f9d540b0SHoward Hinnantclass __independent_bits_engine 27473e519524SHoward Hinnant{ 2748f9d540b0SHoward Hinnantpublic: 2749f9d540b0SHoward Hinnant // types 2750f9d540b0SHoward Hinnant typedef _UIntType result_type; 2751f9d540b0SHoward Hinnant 2752f9d540b0SHoward Hinnantprivate: 2753f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2754f9d540b0SHoward Hinnant typedef typename conditional 2755f9d540b0SHoward Hinnant < 2756f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2757f9d540b0SHoward Hinnant result_type, 2758f9d540b0SHoward Hinnant _Engine_result_type 2759f9d540b0SHoward Hinnant >::type _Working_result_type; 2760f9d540b0SHoward Hinnant 2761f9d540b0SHoward Hinnant _Engine& __e_; 2762f9d540b0SHoward Hinnant size_t __w_; 2763f9d540b0SHoward Hinnant size_t __w0_; 2764f9d540b0SHoward Hinnant size_t __n_; 2765f9d540b0SHoward Hinnant size_t __n0_; 2766f9d540b0SHoward Hinnant _Working_result_type __y0_; 2767f9d540b0SHoward Hinnant _Working_result_type __y1_; 2768f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2769f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2770f9d540b0SHoward Hinnant 2771ddda456aSEric Fiselier#ifdef _LIBCPP_CXX03_LANG 2772c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2773f9d540b0SHoward Hinnant + _Working_result_type(1); 2774e386b7b3SHoward Hinnant#else 2775e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2776e386b7b3SHoward Hinnant + _Working_result_type(1); 2777e386b7b3SHoward Hinnant#endif 2778e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2779e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2780e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2781f9d540b0SHoward Hinnant 2782f9d540b0SHoward Hinnantpublic: 2783f9d540b0SHoward Hinnant // constructors and seeding functions 2784f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2785f9d540b0SHoward Hinnant 2786f9d540b0SHoward Hinnant // generating functions 2787c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2788f9d540b0SHoward Hinnant 2789f9d540b0SHoward Hinnantprivate: 279008bba64aSMarshall Clow result_type __eval(false_type); 279108bba64aSMarshall Clow result_type __eval(true_type); 2792f9d540b0SHoward Hinnant}; 2793f9d540b0SHoward Hinnant 2794f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2795f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2796f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2797f9d540b0SHoward Hinnant : __e_(__e), 2798f9d540b0SHoward Hinnant __w_(__w) 2799f9d540b0SHoward Hinnant{ 2800f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2801f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2802c003db1fSHoward Hinnant if (_Rp == 0) 2803c003db1fSHoward Hinnant __y0_ = _Rp; 2804f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2805c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2806f9d540b0SHoward Hinnant else 2807f9d540b0SHoward Hinnant __y0_ = 0; 2808c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2809f9d540b0SHoward Hinnant { 2810f9d540b0SHoward Hinnant ++__n_; 2811f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2812f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2813c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2814f9d540b0SHoward Hinnant else 2815f9d540b0SHoward Hinnant __y0_ = 0; 2816f9d540b0SHoward Hinnant } 2817f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2818f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2819c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2820f9d540b0SHoward Hinnant else 2821f9d540b0SHoward Hinnant __y1_ = 0; 2822f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2823f9d540b0SHoward Hinnant _Engine_result_type(0); 2824f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2825f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2826f9d540b0SHoward Hinnant _Engine_result_type(~0); 28273e519524SHoward Hinnant} 28283e519524SHoward Hinnant 2829f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2830f9d540b0SHoward Hinnantinline 2831f9d540b0SHoward Hinnant_UIntType 283208bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 28333e519524SHoward Hinnant{ 2834f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 28353e519524SHoward Hinnant} 28363e519524SHoward Hinnant 2837f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2838f9d540b0SHoward Hinnant_UIntType 283908bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 28403e519524SHoward Hinnant{ 28415beb2c3aSMarshall Clow const size_t _WRt = numeric_limits<result_type>::digits; 2842c003db1fSHoward Hinnant result_type _Sp = 0; 2843f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2844f9d540b0SHoward Hinnant { 2845f9d540b0SHoward Hinnant _Engine_result_type __u; 28463e519524SHoward Hinnant do 2847f9d540b0SHoward Hinnant { 2848f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2849f9d540b0SHoward Hinnant } while (__u >= __y0_); 28505beb2c3aSMarshall Clow if (__w0_ < _WRt) 2851c003db1fSHoward Hinnant _Sp <<= __w0_; 2852f9d540b0SHoward Hinnant else 2853c003db1fSHoward Hinnant _Sp = 0; 2854c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2855f9d540b0SHoward Hinnant } 2856f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2857f9d540b0SHoward Hinnant { 2858f9d540b0SHoward Hinnant _Engine_result_type __u; 2859f9d540b0SHoward Hinnant do 2860f9d540b0SHoward Hinnant { 2861f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2862f9d540b0SHoward Hinnant } while (__u >= __y1_); 28635beb2c3aSMarshall Clow if (__w0_ < _WRt - 1) 2864c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2865f9d540b0SHoward Hinnant else 2866c003db1fSHoward Hinnant _Sp = 0; 2867c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2868f9d540b0SHoward Hinnant } 2869c003db1fSHoward Hinnant return _Sp; 28703e519524SHoward Hinnant} 28713e519524SHoward Hinnant 2872f9d540b0SHoward Hinnant// uniform_int_distribution 28733e519524SHoward Hinnant 2874f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2875f9d540b0SHoward Hinnantclass uniform_int_distribution 28763e519524SHoward Hinnant{ 2877f9d540b0SHoward Hinnantpublic: 2878f9d540b0SHoward Hinnant // types 2879f9d540b0SHoward Hinnant typedef _IntType result_type; 2880f9d540b0SHoward Hinnant 2881f9d540b0SHoward Hinnant class param_type 2882f9d540b0SHoward Hinnant { 2883f9d540b0SHoward Hinnant result_type __a_; 2884f9d540b0SHoward Hinnant result_type __b_; 2885f9d540b0SHoward Hinnant public: 2886f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2887f9d540b0SHoward Hinnant 2888f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2889f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2890f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2891f9d540b0SHoward Hinnant 2892f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2893f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2894f9d540b0SHoward Hinnant 2895f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2896f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2897f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2898f9d540b0SHoward Hinnant {return !(__x == __y);} 28993e519524SHoward Hinnant }; 29003e519524SHoward Hinnant 2901f9d540b0SHoward Hinnantprivate: 2902f9d540b0SHoward Hinnant param_type __p_; 29033e519524SHoward Hinnant 2904f9d540b0SHoward Hinnantpublic: 2905f9d540b0SHoward Hinnant // constructors and reset functions 2906f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 2907f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2908f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 2909f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 2910f9d540b0SHoward Hinnant void reset() {} 2911f9d540b0SHoward Hinnant 2912f9d540b0SHoward Hinnant // generating functions 2913f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 2914f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 2915f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 2916f9d540b0SHoward Hinnant 2917f9d540b0SHoward Hinnant // property functions 2918f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 2919f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 2920f9d540b0SHoward Hinnant 2921f9d540b0SHoward Hinnant param_type param() const {return __p_;} 2922f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 2923f9d540b0SHoward Hinnant 2924f9d540b0SHoward Hinnant result_type min() const {return a();} 2925f9d540b0SHoward Hinnant result_type max() const {return b();} 2926f9d540b0SHoward Hinnant 2927f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 2928f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2929f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 2930f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 2931f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2932f9d540b0SHoward Hinnant {return !(__x == __y);} 29333e519524SHoward Hinnant}; 29343e519524SHoward Hinnant 2935f9d540b0SHoward Hinnanttemplate<class _IntType> 2936f9d540b0SHoward Hinnanttemplate<class _URNG> 2937f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 2938f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 29392dd53352SMarshall Clow_LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK 29403e519524SHoward Hinnant{ 2941f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 2942f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 29432dd53352SMarshall Clow const _UIntType _Rp = _UIntType(__p.b()) - _UIntType(__p.a()) + _UIntType(1); 2944c003db1fSHoward Hinnant if (_Rp == 1) 2945f9d540b0SHoward Hinnant return __p.a(); 2946f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 2947f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 2948c003db1fSHoward Hinnant if (_Rp == 0) 2949f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 2950c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 2951a6438ca1SMarshall Clow if ((_Rp & (std::numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0) 2952f9d540b0SHoward Hinnant ++__w; 2953f9d540b0SHoward Hinnant _Eng __e(__g, __w); 2954f9d540b0SHoward Hinnant _UIntType __u; 2955f9d540b0SHoward Hinnant do 29563e519524SHoward Hinnant { 2957f9d540b0SHoward Hinnant __u = __e(); 2958c003db1fSHoward Hinnant } while (__u >= _Rp); 2959f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 29603e519524SHoward Hinnant} 2961f9d540b0SHoward Hinnant 296266f1ec46SEric Fiselier#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_RANDOM_SHUFFLE) \ 296366f1ec46SEric Fiselier || defined(_LIBCPP_BUILDING_LIBRARY) 2964f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 2965f9d540b0SHoward Hinnant 2966f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 2967f9d540b0SHoward Hinnant 2968f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 29693e519524SHoward Hinnant{ 2970f9d540b0SHoward Hinnant static unsigned __c_; 2971f9d540b0SHoward Hinnant 2972f9d540b0SHoward Hinnant __rs_default(); 2973f9d540b0SHoward Hinnantpublic: 2974b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 2975f9d540b0SHoward Hinnant 2976f9d540b0SHoward Hinnant static const result_type _Min = 0; 2977f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 2978f9d540b0SHoward Hinnant 2979f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 2980f9d540b0SHoward Hinnant ~__rs_default(); 2981f9d540b0SHoward Hinnant 2982f9d540b0SHoward Hinnant result_type operator()(); 2983f9d540b0SHoward Hinnant 2984788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 2985788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 2986f9d540b0SHoward Hinnant 2987f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 2988f9d540b0SHoward Hinnant}; 2989f9d540b0SHoward Hinnant 2990f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 29913e519524SHoward Hinnant 29923e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 2993ea5cd3b4SLouis Dionne_LIBCPP_DEPRECATED_IN_CXX14 void 29943e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 29953e519524SHoward Hinnant{ 29963e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 2997c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 2998c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 29993e519524SHoward Hinnant difference_type __d = __last - __first; 30003e519524SHoward Hinnant if (__d > 1) 30013e519524SHoward Hinnant { 3002c003db1fSHoward Hinnant _Dp __uid; 3003f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 30045a8525e0SMarshall Clow for (--__last, (void) --__d; __first < __last; ++__first, (void) --__d) 3005007b26beSHoward Hinnant { 3006c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3007007b26beSHoward Hinnant if (__i != difference_type(0)) 3008007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3009007b26beSHoward Hinnant } 30103e519524SHoward Hinnant } 30113e519524SHoward Hinnant} 30123e519524SHoward Hinnant 30133e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 3014ea5cd3b4SLouis Dionne_LIBCPP_DEPRECATED_IN_CXX14 void 30153e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3016ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 30173e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 30183e519524SHoward Hinnant#else 30193e519524SHoward Hinnant _RandomNumberGenerator& __rand) 30203e519524SHoward Hinnant#endif 30213e519524SHoward Hinnant{ 30223e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 30233e519524SHoward Hinnant difference_type __d = __last - __first; 30243e519524SHoward Hinnant if (__d > 1) 30253e519524SHoward Hinnant { 30265a8525e0SMarshall Clow for (--__last; __first < __last; ++__first, (void) --__d) 3027007b26beSHoward Hinnant { 3028007b26beSHoward Hinnant difference_type __i = __rand(__d); 3029e9cc5451SMarshall Clow if (__i != difference_type(0)) 3030007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3031007b26beSHoward Hinnant } 30323e519524SHoward Hinnant } 30333e519524SHoward Hinnant} 30340f37a410SMarshall Clow#endif 30353e519524SHoward Hinnant 3036e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3037e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3038e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3039e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 304042bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3041e7154709SEric Fiselier _Distance __n, 3042e7154709SEric Fiselier _UniformRandomNumberGenerator & __g, 3043e7154709SEric Fiselier input_iterator_tag) { 3044e7154709SEric Fiselier 3045e7154709SEric Fiselier _Distance __k = 0; 3046e7154709SEric Fiselier for (; __first != __last && __k < __n; ++__first, (void)++__k) 304742bfedd9SAlexander Richardson __output_iter[__k] = *__first; 3048e7154709SEric Fiselier _Distance __sz = __k; 3049e7154709SEric Fiselier for (; __first != __last; ++__first, (void)++__k) { 3050e7154709SEric Fiselier _Distance __r = _VSTD::uniform_int_distribution<_Distance>(0, __k)(__g); 3051e7154709SEric Fiselier if (__r < __sz) 305242bfedd9SAlexander Richardson __output_iter[__r] = *__first; 3053e7154709SEric Fiselier } 305442bfedd9SAlexander Richardson return __output_iter + _VSTD::min(__n, __k); 3055e7154709SEric Fiselier} 3056e7154709SEric Fiselier 3057e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3058e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3059e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3060e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 306142bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3062e7154709SEric Fiselier _Distance __n, 3063e7154709SEric Fiselier _UniformRandomNumberGenerator& __g, 3064e7154709SEric Fiselier forward_iterator_tag) { 3065e7154709SEric Fiselier _Distance __unsampled_sz = _VSTD::distance(__first, __last); 3066e7154709SEric Fiselier for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) { 3067e7154709SEric Fiselier _Distance __r = 3068e7154709SEric Fiselier _VSTD::uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g); 3069e7154709SEric Fiselier if (__r < __n) { 307042bfedd9SAlexander Richardson *__output_iter++ = *__first; 3071e7154709SEric Fiselier --__n; 3072e7154709SEric Fiselier } 3073e7154709SEric Fiselier } 307442bfedd9SAlexander Richardson return __output_iter; 3075e7154709SEric Fiselier} 3076e7154709SEric Fiselier 3077e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3078e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3079e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3080e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 308142bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3082e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator& __g) { 3083e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::iterator_category 3084e7154709SEric Fiselier _PopCategory; 3085e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::difference_type 3086e7154709SEric Fiselier _Difference; 3087e7154709SEric Fiselier static_assert(__is_forward_iterator<_PopulationIterator>::value || 3088e7154709SEric Fiselier __is_random_access_iterator<_SampleIterator>::value, 3089e7154709SEric Fiselier "SampleIterator must meet the requirements of RandomAccessIterator"); 3090e7154709SEric Fiselier typedef typename common_type<_Distance, _Difference>::type _CommonType; 3091e7154709SEric Fiselier _LIBCPP_ASSERT(__n >= 0, "N must be a positive number."); 3092e7154709SEric Fiselier return _VSTD::__sample( 309342bfedd9SAlexander Richardson __first, __last, __output_iter, _CommonType(__n), 3094e7154709SEric Fiselier __g, _PopCategory()); 3095e7154709SEric Fiselier} 3096e7154709SEric Fiselier 3097e7154709SEric Fiselier#if _LIBCPP_STD_VER > 14 3098e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3099e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3100e7154709SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY 3101e7154709SEric Fiselier_SampleIterator sample(_PopulationIterator __first, 310242bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3103e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator&& __g) { 310442bfedd9SAlexander Richardson return _VSTD::__sample(__first, __last, __output_iter, __n, __g); 3105e7154709SEric Fiselier} 3106e7154709SEric Fiselier#endif // _LIBCPP_STD_VER > 14 3107e7154709SEric Fiselier 3108f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3109f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3110ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 3111fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3112fb340102SHoward Hinnant#else 3113f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3114fb340102SHoward Hinnant#endif 3115f9d540b0SHoward Hinnant{ 3116f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3117c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3118c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3119f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3120f9d540b0SHoward Hinnant if (__d > 1) 3121f9d540b0SHoward Hinnant { 3122c003db1fSHoward Hinnant _Dp __uid; 3123f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3124007b26beSHoward Hinnant { 3125c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3126007b26beSHoward Hinnant if (__i != difference_type(0)) 3127007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3128007b26beSHoward Hinnant } 3129f9d540b0SHoward Hinnant } 3130f9d540b0SHoward Hinnant} 3131f9d540b0SHoward Hinnant 31323e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 313349c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 31343e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 31353e519524SHoward Hinnant{ 31363e519524SHoward Hinnant for (; __first != __last; ++__first) 31373e519524SHoward Hinnant if (!__pred(*__first)) 31383e519524SHoward Hinnant break; 3139b9595b79SMarshall Clow if ( __first == __last ) 3140b9595b79SMarshall Clow return true; 3141b9595b79SMarshall Clow ++__first; 31423e519524SHoward Hinnant for (; __first != __last; ++__first) 31433e519524SHoward Hinnant if (__pred(*__first)) 31443e519524SHoward Hinnant return false; 31453e519524SHoward Hinnant return true; 31463e519524SHoward Hinnant} 31473e519524SHoward Hinnant 31483e519524SHoward Hinnant// partition 31493e519524SHoward Hinnant 31503e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 31513e519524SHoward Hinnant_ForwardIterator 31523e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 31533e519524SHoward Hinnant{ 31543e519524SHoward Hinnant while (true) 31553e519524SHoward Hinnant { 31563e519524SHoward Hinnant if (__first == __last) 31573e519524SHoward Hinnant return __first; 31583e519524SHoward Hinnant if (!__pred(*__first)) 31593e519524SHoward Hinnant break; 31603e519524SHoward Hinnant ++__first; 31613e519524SHoward Hinnant } 31623e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 31633e519524SHoward Hinnant { 31643e519524SHoward Hinnant if (__pred(*__p)) 31653e519524SHoward Hinnant { 31663e519524SHoward Hinnant swap(*__first, *__p); 31673e519524SHoward Hinnant ++__first; 31683e519524SHoward Hinnant } 31693e519524SHoward Hinnant } 31703e519524SHoward Hinnant return __first; 31713e519524SHoward Hinnant} 31723e519524SHoward Hinnant 31733e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 31743e519524SHoward Hinnant_BidirectionalIterator 31753e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 31763e519524SHoward Hinnant bidirectional_iterator_tag) 31773e519524SHoward Hinnant{ 31783e519524SHoward Hinnant while (true) 31793e519524SHoward Hinnant { 31803e519524SHoward Hinnant while (true) 31813e519524SHoward Hinnant { 31823e519524SHoward Hinnant if (__first == __last) 31833e519524SHoward Hinnant return __first; 31843e519524SHoward Hinnant if (!__pred(*__first)) 31853e519524SHoward Hinnant break; 31863e519524SHoward Hinnant ++__first; 31873e519524SHoward Hinnant } 31883e519524SHoward Hinnant do 31893e519524SHoward Hinnant { 31903e519524SHoward Hinnant if (__first == --__last) 31913e519524SHoward Hinnant return __first; 31923e519524SHoward Hinnant } while (!__pred(*__last)); 31933e519524SHoward Hinnant swap(*__first, *__last); 31943e519524SHoward Hinnant ++__first; 31953e519524SHoward Hinnant } 31963e519524SHoward Hinnant} 31973e519524SHoward Hinnant 31983e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 31993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 32003e519524SHoward Hinnant_ForwardIterator 32013e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 32023e519524SHoward Hinnant{ 3203ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 32043e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 32053e519524SHoward Hinnant} 32063e519524SHoward Hinnant 32073e519524SHoward Hinnant// partition_copy 32083e519524SHoward Hinnant 32093e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 32103e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 32111b9a4ffdSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_OutputIterator1, _OutputIterator2> 32123e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 32133e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 32143e519524SHoward Hinnant _Predicate __pred) 32153e519524SHoward Hinnant{ 32163e519524SHoward Hinnant for (; __first != __last; ++__first) 32173e519524SHoward Hinnant { 32183e519524SHoward Hinnant if (__pred(*__first)) 32193e519524SHoward Hinnant { 32203e519524SHoward Hinnant *__out_true = *__first; 32213e519524SHoward Hinnant ++__out_true; 32223e519524SHoward Hinnant } 32233e519524SHoward Hinnant else 32243e519524SHoward Hinnant { 32253e519524SHoward Hinnant *__out_false = *__first; 32263e519524SHoward Hinnant ++__out_false; 32273e519524SHoward Hinnant } 32283e519524SHoward Hinnant } 32293e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 32303e519524SHoward Hinnant} 32313e519524SHoward Hinnant 32323e519524SHoward Hinnant// partition_point 32333e519524SHoward Hinnant 32343e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 3235674f9128SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 32363e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 32373e519524SHoward Hinnant{ 32383e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3239ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 32403e519524SHoward Hinnant while (__len != 0) 32413e519524SHoward Hinnant { 324204695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 32433e519524SHoward Hinnant _ForwardIterator __m = __first; 3244ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 32453e519524SHoward Hinnant if (__pred(*__m)) 32463e519524SHoward Hinnant { 32473e519524SHoward Hinnant __first = ++__m; 32483e519524SHoward Hinnant __len -= __l2 + 1; 32493e519524SHoward Hinnant } 32503e519524SHoward Hinnant else 32513e519524SHoward Hinnant __len = __l2; 32523e519524SHoward Hinnant } 32533e519524SHoward Hinnant return __first; 32543e519524SHoward Hinnant} 32553e519524SHoward Hinnant 32563e519524SHoward Hinnant// stable_partition 32573e519524SHoward Hinnant 32583e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 32593e519524SHoward Hinnant_ForwardIterator 32603e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 32613e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 32623e519524SHoward Hinnant{ 32633e519524SHoward Hinnant // *__first is known to be false 32643e519524SHoward Hinnant // __len >= 1 32653e519524SHoward Hinnant if (__len == 1) 32663e519524SHoward Hinnant return __first; 32673e519524SHoward Hinnant if (__len == 2) 32683e519524SHoward Hinnant { 32693e519524SHoward Hinnant _ForwardIterator __m = __first; 32703e519524SHoward Hinnant if (__pred(*++__m)) 32713e519524SHoward Hinnant { 32723e519524SHoward Hinnant swap(*__first, *__m); 32733e519524SHoward Hinnant return __m; 32743e519524SHoward Hinnant } 32753e519524SHoward Hinnant return __first; 32763e519524SHoward Hinnant } 32773e519524SHoward Hinnant if (__len <= __p.second) 32783e519524SHoward Hinnant { // The buffer is big enough to use 32793e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 32803e519524SHoward Hinnant __destruct_n __d(0); 32813e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 32823e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 32833e519524SHoward Hinnant // Update __first to always point to the end of the trues 32843e519524SHoward Hinnant value_type* __t = __p.first; 3285ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 32863e519524SHoward Hinnant __d.__incr((value_type*)0); 32873e519524SHoward Hinnant ++__t; 32883e519524SHoward Hinnant _ForwardIterator __i = __first; 32893e519524SHoward Hinnant while (++__i != __last) 32903e519524SHoward Hinnant { 32913e519524SHoward Hinnant if (__pred(*__i)) 32923e519524SHoward Hinnant { 3293ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 32943e519524SHoward Hinnant ++__first; 32953e519524SHoward Hinnant } 32963e519524SHoward Hinnant else 32973e519524SHoward Hinnant { 3298ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 32993e519524SHoward Hinnant __d.__incr((value_type*)0); 33003e519524SHoward Hinnant ++__t; 33013e519524SHoward Hinnant } 33023e519524SHoward Hinnant } 33033e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 33043e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 33053e519524SHoward Hinnant __i = __first; 33063e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3307ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 33083e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 33093e519524SHoward Hinnant return __first; 33103e519524SHoward Hinnant } 33113e519524SHoward Hinnant // Else not enough buffer, do in place 33123e519524SHoward Hinnant // __len >= 3 33133e519524SHoward Hinnant _ForwardIterator __m = __first; 33143e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3315ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 33163e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 33173e519524SHoward Hinnant // F????????????????? 33183e519524SHoward Hinnant // f m l 33193e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 33203e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 33213e519524SHoward Hinnant // TTTFFFFF?????????? 33223e519524SHoward Hinnant // f ff m l 33233e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 33243e519524SHoward Hinnant _ForwardIterator __m1 = __m; 33253e519524SHoward Hinnant _ForwardIterator __second_false = __last; 33263e519524SHoward Hinnant _Distance __len_half = __len - __len2; 33273e519524SHoward Hinnant while (__pred(*__m1)) 33283e519524SHoward Hinnant { 33293e519524SHoward Hinnant if (++__m1 == __last) 33303e519524SHoward Hinnant goto __second_half_done; 33313e519524SHoward Hinnant --__len_half; 33323e519524SHoward Hinnant } 33333e519524SHoward Hinnant // TTTFFFFFTTTF?????? 33343e519524SHoward Hinnant // f ff m m1 l 33353e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 33363e519524SHoward Hinnant__second_half_done: 33373e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 33383e519524SHoward Hinnant // f ff m sf l 3339ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 33403e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 33413e519524SHoward Hinnant // | 33423e519524SHoward Hinnant} 33433e519524SHoward Hinnant 33443e519524SHoward Hinnantstruct __return_temporary_buffer 33453e519524SHoward Hinnant{ 33463e519524SHoward Hinnant template <class _Tp> 3347ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 33483e519524SHoward Hinnant}; 33493e519524SHoward Hinnant 33503e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 33513e519524SHoward Hinnant_ForwardIterator 33523e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 33533e519524SHoward Hinnant forward_iterator_tag) 33543e519524SHoward Hinnant{ 33553e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 33563e519524SHoward Hinnant // Either prove all true and return __first or point to first false 33573e519524SHoward Hinnant while (true) 33583e519524SHoward Hinnant { 33593e519524SHoward Hinnant if (__first == __last) 33603e519524SHoward Hinnant return __first; 33613e519524SHoward Hinnant if (!__pred(*__first)) 33623e519524SHoward Hinnant break; 33633e519524SHoward Hinnant ++__first; 33643e519524SHoward Hinnant } 33653e519524SHoward Hinnant // We now have a reduced range [__first, __last) 33663e519524SHoward Hinnant // *__first is known to be false 33673e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 33683e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3369ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 33703e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 33713e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 33723e519524SHoward Hinnant if (__len >= __alloc_limit) 33733e519524SHoward Hinnant { 3374ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 33753e519524SHoward Hinnant __h.reset(__p.first); 33763e519524SHoward Hinnant } 33773e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 33783e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 33793e519524SHoward Hinnant} 33803e519524SHoward Hinnant 33813e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 33823e519524SHoward Hinnant_BidirectionalIterator 33833e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 33843e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 33853e519524SHoward Hinnant{ 33863e519524SHoward Hinnant // *__first is known to be false 33873e519524SHoward Hinnant // *__last is known to be true 33883e519524SHoward Hinnant // __len >= 2 33893e519524SHoward Hinnant if (__len == 2) 33903e519524SHoward Hinnant { 33913e519524SHoward Hinnant swap(*__first, *__last); 33923e519524SHoward Hinnant return __last; 33933e519524SHoward Hinnant } 33943e519524SHoward Hinnant if (__len == 3) 33953e519524SHoward Hinnant { 33963e519524SHoward Hinnant _BidirectionalIterator __m = __first; 33973e519524SHoward Hinnant if (__pred(*++__m)) 33983e519524SHoward Hinnant { 33993e519524SHoward Hinnant swap(*__first, *__m); 34003e519524SHoward Hinnant swap(*__m, *__last); 34013e519524SHoward Hinnant return __last; 34023e519524SHoward Hinnant } 34033e519524SHoward Hinnant swap(*__m, *__last); 34043e519524SHoward Hinnant swap(*__first, *__m); 34053e519524SHoward Hinnant return __m; 34063e519524SHoward Hinnant } 34073e519524SHoward Hinnant if (__len <= __p.second) 34083e519524SHoward Hinnant { // The buffer is big enough to use 34093e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 34103e519524SHoward Hinnant __destruct_n __d(0); 34113e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 34123e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 34133e519524SHoward Hinnant // Update __first to always point to the end of the trues 34143e519524SHoward Hinnant value_type* __t = __p.first; 3415ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 34163e519524SHoward Hinnant __d.__incr((value_type*)0); 34173e519524SHoward Hinnant ++__t; 34183e519524SHoward Hinnant _BidirectionalIterator __i = __first; 34193e519524SHoward Hinnant while (++__i != __last) 34203e519524SHoward Hinnant { 34213e519524SHoward Hinnant if (__pred(*__i)) 34223e519524SHoward Hinnant { 3423ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34243e519524SHoward Hinnant ++__first; 34253e519524SHoward Hinnant } 34263e519524SHoward Hinnant else 34273e519524SHoward Hinnant { 3428ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 34293e519524SHoward Hinnant __d.__incr((value_type*)0); 34303e519524SHoward Hinnant ++__t; 34313e519524SHoward Hinnant } 34323e519524SHoward Hinnant } 34333e519524SHoward Hinnant // move *__last, known to be true 3434ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34353e519524SHoward Hinnant __i = ++__first; 34363e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 34373e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 34383e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3439ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 34403e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 34413e519524SHoward Hinnant return __first; 34423e519524SHoward Hinnant } 34433e519524SHoward Hinnant // Else not enough buffer, do in place 34443e519524SHoward Hinnant // __len >= 4 34453e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34463e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3447ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 34483e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 34493e519524SHoward Hinnant // F????????????????T 34503e519524SHoward Hinnant // f m l 34513e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 34523e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 34533e519524SHoward Hinnant _Distance __len_half = __len2; 34543e519524SHoward Hinnant while (!__pred(*--__m1)) 34553e519524SHoward Hinnant { 34563e519524SHoward Hinnant if (__m1 == __first) 34573e519524SHoward Hinnant goto __first_half_done; 34583e519524SHoward Hinnant --__len_half; 34593e519524SHoward Hinnant } 34603e519524SHoward Hinnant // F???TFFF?????????T 34613e519524SHoward Hinnant // f m1 m l 34623e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 34633e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 34643e519524SHoward Hinnant__first_half_done: 34653e519524SHoward Hinnant // TTTFFFFF?????????T 34663e519524SHoward Hinnant // f ff m l 34673e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 34683e519524SHoward Hinnant __m1 = __m; 34693e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 34703e519524SHoward Hinnant ++__second_false; 34713e519524SHoward Hinnant __len_half = __len - __len2; 34723e519524SHoward Hinnant while (__pred(*__m1)) 34733e519524SHoward Hinnant { 34743e519524SHoward Hinnant if (++__m1 == __last) 34753e519524SHoward Hinnant goto __second_half_done; 34763e519524SHoward Hinnant --__len_half; 34773e519524SHoward Hinnant } 34783e519524SHoward Hinnant // TTTFFFFFTTTF?????T 34793e519524SHoward Hinnant // f ff m m1 l 34803e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 34813e519524SHoward Hinnant__second_half_done: 34823e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 34833e519524SHoward Hinnant // f ff m sf l 3484ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 34853e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 34863e519524SHoward Hinnant // | 34873e519524SHoward Hinnant} 34883e519524SHoward Hinnant 34893e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 34903e519524SHoward Hinnant_BidirectionalIterator 34913e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34923e519524SHoward Hinnant bidirectional_iterator_tag) 34933e519524SHoward Hinnant{ 34943e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 34953e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 34963e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 34973e519524SHoward Hinnant // Either prove all true and return __first or point to first false 34983e519524SHoward Hinnant while (true) 34993e519524SHoward Hinnant { 35003e519524SHoward Hinnant if (__first == __last) 35013e519524SHoward Hinnant return __first; 35023e519524SHoward Hinnant if (!__pred(*__first)) 35033e519524SHoward Hinnant break; 35043e519524SHoward Hinnant ++__first; 35053e519524SHoward Hinnant } 35063e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 35073e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 35083e519524SHoward Hinnant do 35093e519524SHoward Hinnant { 35103e519524SHoward Hinnant if (__first == --__last) 35113e519524SHoward Hinnant return __first; 35123e519524SHoward Hinnant } while (!__pred(*__last)); 35133e519524SHoward Hinnant // We now have a reduced range [__first, __last] 35143e519524SHoward Hinnant // *__first is known to be false 35153e519524SHoward Hinnant // *__last is known to be true 35163e519524SHoward Hinnant // __len >= 2 3517ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 35183e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 35193e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 35203e519524SHoward Hinnant if (__len >= __alloc_limit) 35213e519524SHoward Hinnant { 3522ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 35233e519524SHoward Hinnant __h.reset(__p.first); 35243e519524SHoward Hinnant } 35253e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35263e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 35273e519524SHoward Hinnant} 35283e519524SHoward Hinnant 35293e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 35303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35313e519524SHoward Hinnant_ForwardIterator 35323e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 35333e519524SHoward Hinnant{ 35343e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35353e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 35363e519524SHoward Hinnant} 35373e519524SHoward Hinnant 35383e519524SHoward Hinnant// is_sorted_until 35393e519524SHoward Hinnant 35403e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 354149c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 35423e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35433e519524SHoward Hinnant{ 35443e519524SHoward Hinnant if (__first != __last) 35453e519524SHoward Hinnant { 35463e519524SHoward Hinnant _ForwardIterator __i = __first; 35473e519524SHoward Hinnant while (++__i != __last) 35483e519524SHoward Hinnant { 35493e519524SHoward Hinnant if (__comp(*__i, *__first)) 35503e519524SHoward Hinnant return __i; 35513e519524SHoward Hinnant __first = __i; 35523e519524SHoward Hinnant } 35533e519524SHoward Hinnant } 35543e519524SHoward Hinnant return __last; 35553e519524SHoward Hinnant} 35563e519524SHoward Hinnant 35573e519524SHoward Hinnanttemplate<class _ForwardIterator> 355849c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 35593e519524SHoward Hinnant_ForwardIterator 35603e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 35613e519524SHoward Hinnant{ 3562ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35633e519524SHoward Hinnant} 35643e519524SHoward Hinnant 35653e519524SHoward Hinnant// is_sorted 35663e519524SHoward Hinnant 35673e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 356849c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 35693e519524SHoward Hinnantbool 35703e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35713e519524SHoward Hinnant{ 3572ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 35733e519524SHoward Hinnant} 35743e519524SHoward Hinnant 35753e519524SHoward Hinnanttemplate<class _ForwardIterator> 357649c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 35773e519524SHoward Hinnantbool 35783e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 35793e519524SHoward Hinnant{ 3580ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35813e519524SHoward Hinnant} 35823e519524SHoward Hinnant 35833e519524SHoward Hinnant// sort 35843e519524SHoward Hinnant 35853e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 35863e519524SHoward Hinnant 35873e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 35883e519524SHoward Hinnantunsigned 35893e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 35903e519524SHoward Hinnant{ 35913e519524SHoward Hinnant unsigned __r = 0; 35923e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 35933e519524SHoward Hinnant { 35943e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 35953e519524SHoward Hinnant return __r; // x <= y && y <= z 35963e519524SHoward Hinnant // x <= y && y > z 35973e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 35983e519524SHoward Hinnant __r = 1; 35993e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 36003e519524SHoward Hinnant { 36013e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 36023e519524SHoward Hinnant __r = 2; 36033e519524SHoward Hinnant } 36043e519524SHoward Hinnant return __r; // x <= y && y < z 36053e519524SHoward Hinnant } 36063e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 36073e519524SHoward Hinnant { 36083e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 36093e519524SHoward Hinnant __r = 1; 36103e519524SHoward Hinnant return __r; 36113e519524SHoward Hinnant } 36123e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 36133e519524SHoward Hinnant __r = 1; // x < y && x <= z 36143e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 36153e519524SHoward Hinnant { 36163e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 36173e519524SHoward Hinnant __r = 2; 36183e519524SHoward Hinnant } 36193e519524SHoward Hinnant return __r; 36203e519524SHoward Hinnant} // x <= y && y <= z 36213e519524SHoward Hinnant 36223e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 36233e519524SHoward Hinnant 36243e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36253e519524SHoward Hinnantunsigned 36263e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 36273e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 36283e519524SHoward Hinnant{ 36293e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 36303e519524SHoward Hinnant if (__c(*__x4, *__x3)) 36313e519524SHoward Hinnant { 36323e519524SHoward Hinnant swap(*__x3, *__x4); 36333e519524SHoward Hinnant ++__r; 36343e519524SHoward Hinnant if (__c(*__x3, *__x2)) 36353e519524SHoward Hinnant { 36363e519524SHoward Hinnant swap(*__x2, *__x3); 36373e519524SHoward Hinnant ++__r; 36383e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36393e519524SHoward Hinnant { 36403e519524SHoward Hinnant swap(*__x1, *__x2); 36413e519524SHoward Hinnant ++__r; 36423e519524SHoward Hinnant } 36433e519524SHoward Hinnant } 36443e519524SHoward Hinnant } 36453e519524SHoward Hinnant return __r; 36463e519524SHoward Hinnant} 36473e519524SHoward Hinnant 36483e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 36493e519524SHoward Hinnant 36503e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 3651835140a4SLouis Dionne_LIBCPP_HIDDEN 36523e519524SHoward Hinnantunsigned 36533e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 36543e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 36553e519524SHoward Hinnant{ 36563e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 36573e519524SHoward Hinnant if (__c(*__x5, *__x4)) 36583e519524SHoward Hinnant { 36593e519524SHoward Hinnant swap(*__x4, *__x5); 36603e519524SHoward Hinnant ++__r; 36613e519524SHoward Hinnant if (__c(*__x4, *__x3)) 36623e519524SHoward Hinnant { 36633e519524SHoward Hinnant swap(*__x3, *__x4); 36643e519524SHoward Hinnant ++__r; 36653e519524SHoward Hinnant if (__c(*__x3, *__x2)) 36663e519524SHoward Hinnant { 36673e519524SHoward Hinnant swap(*__x2, *__x3); 36683e519524SHoward Hinnant ++__r; 36693e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36703e519524SHoward Hinnant { 36713e519524SHoward Hinnant swap(*__x1, *__x2); 36723e519524SHoward Hinnant ++__r; 36733e519524SHoward Hinnant } 36743e519524SHoward Hinnant } 36753e519524SHoward Hinnant } 36763e519524SHoward Hinnant } 36773e519524SHoward Hinnant return __r; 36783e519524SHoward Hinnant} 36793e519524SHoward Hinnant 36803e519524SHoward Hinnant// Assumes size > 0 36813e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36823e519524SHoward Hinnantvoid 36833e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36843e519524SHoward Hinnant{ 36853e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 36863e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 36873e519524SHoward Hinnant { 3688ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 36893e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 36903e519524SHoward Hinnant (__first, __last, __comp); 36913e519524SHoward Hinnant if (__i != __first) 36923e519524SHoward Hinnant swap(*__first, *__i); 36933e519524SHoward Hinnant } 36943e519524SHoward Hinnant} 36953e519524SHoward Hinnant 36963e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36973e519524SHoward Hinnantvoid 36983e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36993e519524SHoward Hinnant{ 37003e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 37013e519524SHoward Hinnant if (__first != __last) 37023e519524SHoward Hinnant { 37033e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 37043e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 37053e519524SHoward Hinnant { 37063e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3707ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 37083e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3709ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3710ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37113e519524SHoward Hinnant } 37123e519524SHoward Hinnant } 37133e519524SHoward Hinnant} 37143e519524SHoward Hinnant 37153e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37163e519524SHoward Hinnantvoid 37173e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37183e519524SHoward Hinnant{ 37193e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37203e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37213e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37223e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37233e519524SHoward Hinnant { 37243e519524SHoward Hinnant if (__comp(*__i, *__j)) 37253e519524SHoward Hinnant { 3726ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37273e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37283e519524SHoward Hinnant __j = __i; 37293e519524SHoward Hinnant do 37303e519524SHoward Hinnant { 3731ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37323e519524SHoward Hinnant __j = __k; 37333e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3734ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37353e519524SHoward Hinnant } 37363e519524SHoward Hinnant __j = __i; 37373e519524SHoward Hinnant } 37383e519524SHoward Hinnant} 37393e519524SHoward Hinnant 37403e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37413e519524SHoward Hinnantbool 37423e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37433e519524SHoward Hinnant{ 37443e519524SHoward Hinnant switch (__last - __first) 37453e519524SHoward Hinnant { 37463e519524SHoward Hinnant case 0: 37473e519524SHoward Hinnant case 1: 37483e519524SHoward Hinnant return true; 37493e519524SHoward Hinnant case 2: 37503e519524SHoward Hinnant if (__comp(*--__last, *__first)) 37513e519524SHoward Hinnant swap(*__first, *__last); 37523e519524SHoward Hinnant return true; 37533e519524SHoward Hinnant case 3: 3754ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 37553e519524SHoward Hinnant return true; 37563e519524SHoward Hinnant case 4: 3757ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 37583e519524SHoward Hinnant return true; 37593e519524SHoward Hinnant case 5: 3760ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 37613e519524SHoward Hinnant return true; 37623e519524SHoward Hinnant } 37633e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37643e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37653e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37663e519524SHoward Hinnant const unsigned __limit = 8; 37673e519524SHoward Hinnant unsigned __count = 0; 37683e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37693e519524SHoward Hinnant { 37703e519524SHoward Hinnant if (__comp(*__i, *__j)) 37713e519524SHoward Hinnant { 3772ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37733e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37743e519524SHoward Hinnant __j = __i; 37753e519524SHoward Hinnant do 37763e519524SHoward Hinnant { 3777ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37783e519524SHoward Hinnant __j = __k; 37793e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3780ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37813e519524SHoward Hinnant if (++__count == __limit) 37823e519524SHoward Hinnant return ++__i == __last; 37833e519524SHoward Hinnant } 37843e519524SHoward Hinnant __j = __i; 37853e519524SHoward Hinnant } 37863e519524SHoward Hinnant return true; 37873e519524SHoward Hinnant} 37883e519524SHoward Hinnant 37893e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37903e519524SHoward Hinnantvoid 37913e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 37923e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 37933e519524SHoward Hinnant{ 37943e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 37953e519524SHoward Hinnant if (__first1 != __last1) 37963e519524SHoward Hinnant { 37973e519524SHoward Hinnant __destruct_n __d(0); 37983e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 37993e519524SHoward Hinnant value_type* __last2 = __first2; 3800ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 38013e519524SHoward Hinnant __d.__incr((value_type*)0); 38023e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 38033e519524SHoward Hinnant { 38043e519524SHoward Hinnant value_type* __j2 = __last2; 38053e519524SHoward Hinnant value_type* __i2 = __j2; 38063e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 38073e519524SHoward Hinnant { 3808ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 38093e519524SHoward Hinnant __d.__incr((value_type*)0); 38103e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3811ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3812ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 38133e519524SHoward Hinnant } 38143e519524SHoward Hinnant else 38153e519524SHoward Hinnant { 3816ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 38173e519524SHoward Hinnant __d.__incr((value_type*)0); 38183e519524SHoward Hinnant } 38193e519524SHoward Hinnant } 38203e519524SHoward Hinnant __h.release(); 38213e519524SHoward Hinnant } 38223e519524SHoward Hinnant} 38233e519524SHoward Hinnant 38243e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38253e519524SHoward Hinnantvoid 38263e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38273e519524SHoward Hinnant{ 38283e519524SHoward Hinnant // _Compare is known to be a reference type 38293e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 38303e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3831ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3832ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 38333e519524SHoward Hinnant while (true) 38343e519524SHoward Hinnant { 38353e519524SHoward Hinnant __restart: 38363e519524SHoward Hinnant difference_type __len = __last - __first; 38373e519524SHoward Hinnant switch (__len) 38383e519524SHoward Hinnant { 38393e519524SHoward Hinnant case 0: 38403e519524SHoward Hinnant case 1: 38413e519524SHoward Hinnant return; 38423e519524SHoward Hinnant case 2: 38433e519524SHoward Hinnant if (__comp(*--__last, *__first)) 38443e519524SHoward Hinnant swap(*__first, *__last); 38453e519524SHoward Hinnant return; 38463e519524SHoward Hinnant case 3: 3847ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 38483e519524SHoward Hinnant return; 38493e519524SHoward Hinnant case 4: 3850ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 38513e519524SHoward Hinnant return; 38523e519524SHoward Hinnant case 5: 3853ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 38543e519524SHoward Hinnant return; 38553e519524SHoward Hinnant } 38563e519524SHoward Hinnant if (__len <= __limit) 38573e519524SHoward Hinnant { 3858ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 38593e519524SHoward Hinnant return; 38603e519524SHoward Hinnant } 38613e519524SHoward Hinnant // __len > 5 38623e519524SHoward Hinnant _RandomAccessIterator __m = __first; 38633e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 38643e519524SHoward Hinnant --__lm1; 38653e519524SHoward Hinnant unsigned __n_swaps; 38663e519524SHoward Hinnant { 38673e519524SHoward Hinnant difference_type __delta; 38683e519524SHoward Hinnant if (__len >= 1000) 38693e519524SHoward Hinnant { 38703e519524SHoward Hinnant __delta = __len/2; 38713e519524SHoward Hinnant __m += __delta; 38723e519524SHoward Hinnant __delta /= 2; 3873ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 38743e519524SHoward Hinnant } 38753e519524SHoward Hinnant else 38763e519524SHoward Hinnant { 38773e519524SHoward Hinnant __delta = __len/2; 38783e519524SHoward Hinnant __m += __delta; 3879ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 38803e519524SHoward Hinnant } 38813e519524SHoward Hinnant } 38823e519524SHoward Hinnant // *__m is median 38833e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 38843e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 38853e519524SHoward Hinnant _RandomAccessIterator __i = __first; 38863e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 38873e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 38883e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 38893e519524SHoward Hinnant // Prime the downward search with a guard. 38903e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 38913e519524SHoward Hinnant { 38923e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 38933e519524SHoward Hinnant // manually guard downward moving __j against __i 38943e519524SHoward Hinnant while (true) 38953e519524SHoward Hinnant { 38963e519524SHoward Hinnant if (__i == --__j) 38973e519524SHoward Hinnant { 38983e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 38993e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 39003e519524SHoward Hinnant ++__i; // __first + 1 39013e519524SHoward Hinnant __j = __last; 39023e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 39033e519524SHoward Hinnant { 39043e519524SHoward Hinnant while (true) 39053e519524SHoward Hinnant { 39063e519524SHoward Hinnant if (__i == __j) 39073e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 39083e519524SHoward Hinnant if (__comp(*__first, *__i)) 39093e519524SHoward Hinnant { 39103e519524SHoward Hinnant swap(*__i, *__j); 39113e519524SHoward Hinnant ++__n_swaps; 39123e519524SHoward Hinnant ++__i; 39133e519524SHoward Hinnant break; 39143e519524SHoward Hinnant } 39153e519524SHoward Hinnant ++__i; 39163e519524SHoward Hinnant } 39173e519524SHoward Hinnant } 39183e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 39193e519524SHoward Hinnant if (__i == __j) 39203e519524SHoward Hinnant return; 39213e519524SHoward Hinnant while (true) 39223e519524SHoward Hinnant { 39233e519524SHoward Hinnant while (!__comp(*__first, *__i)) 39243e519524SHoward Hinnant ++__i; 39253e519524SHoward Hinnant while (__comp(*__first, *--__j)) 39263e519524SHoward Hinnant ; 39273e519524SHoward Hinnant if (__i >= __j) 39283e519524SHoward Hinnant break; 39293e519524SHoward Hinnant swap(*__i, *__j); 39303e519524SHoward Hinnant ++__n_swaps; 39313e519524SHoward Hinnant ++__i; 39323e519524SHoward Hinnant } 39333e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 39343e519524SHoward Hinnant // The first part is sorted, sort the secod part 3935ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 39363e519524SHoward Hinnant __first = __i; 39373e519524SHoward Hinnant goto __restart; 39383e519524SHoward Hinnant } 39393e519524SHoward Hinnant if (__comp(*__j, *__m)) 39403e519524SHoward Hinnant { 39413e519524SHoward Hinnant swap(*__i, *__j); 39423e519524SHoward Hinnant ++__n_swaps; 39433e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 39443e519524SHoward Hinnant } 39453e519524SHoward Hinnant } 39463e519524SHoward Hinnant } 39473e519524SHoward Hinnant // It is known that *__i < *__m 39483e519524SHoward Hinnant ++__i; 39493e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 39503e519524SHoward Hinnant // if not yet partitioned... 39513e519524SHoward Hinnant if (__i < __j) 39523e519524SHoward Hinnant { 39533e519524SHoward Hinnant // known that *(__i - 1) < *__m 39543e519524SHoward Hinnant // known that __i <= __m 39553e519524SHoward Hinnant while (true) 39563e519524SHoward Hinnant { 39573e519524SHoward Hinnant // __m still guards upward moving __i 39583e519524SHoward Hinnant while (__comp(*__i, *__m)) 39593e519524SHoward Hinnant ++__i; 39603e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 39613e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 39623e519524SHoward Hinnant ; 39633e519524SHoward Hinnant if (__i > __j) 39643e519524SHoward Hinnant break; 39653e519524SHoward Hinnant swap(*__i, *__j); 39663e519524SHoward Hinnant ++__n_swaps; 39673e519524SHoward Hinnant // It is known that __m != __j 39683e519524SHoward Hinnant // If __m just moved, follow it 39693e519524SHoward Hinnant if (__m == __i) 39703e519524SHoward Hinnant __m = __j; 39713e519524SHoward Hinnant ++__i; 39723e519524SHoward Hinnant } 39733e519524SHoward Hinnant } 39743e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 39753e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 39763e519524SHoward Hinnant { 39773e519524SHoward Hinnant swap(*__i, *__m); 39783e519524SHoward Hinnant ++__n_swaps; 39793e519524SHoward Hinnant } 39803e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 39813e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 39823e519524SHoward Hinnant if (__n_swaps == 0) 39833e519524SHoward Hinnant { 3984ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 3985ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 39863e519524SHoward Hinnant { 39873e519524SHoward Hinnant if (__fs) 39883e519524SHoward Hinnant return; 39893e519524SHoward Hinnant __last = __i; 39903e519524SHoward Hinnant continue; 39913e519524SHoward Hinnant } 39923e519524SHoward Hinnant else 39933e519524SHoward Hinnant { 39943e519524SHoward Hinnant if (__fs) 39953e519524SHoward Hinnant { 39963e519524SHoward Hinnant __first = ++__i; 39973e519524SHoward Hinnant continue; 39983e519524SHoward Hinnant } 39993e519524SHoward Hinnant } 40003e519524SHoward Hinnant } 40013e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 40023e519524SHoward Hinnant if (__i - __first < __last - __i) 40033e519524SHoward Hinnant { 4004ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 4005ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 40063e519524SHoward Hinnant __first = ++__i; 40073e519524SHoward Hinnant } 40083e519524SHoward Hinnant else 40093e519524SHoward Hinnant { 4010ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4011ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 40123e519524SHoward Hinnant __last = __i; 40133e519524SHoward Hinnant } 40143e519524SHoward Hinnant } 40153e519524SHoward Hinnant} 40163e519524SHoward Hinnant 40173e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 40183e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 40193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40203e519524SHoward Hinnantvoid 40213e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 40223e519524SHoward Hinnant{ 4023145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 40243e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 40253e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 40263e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 4027145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 40283e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 40293e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 4030145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 40313e519524SHoward Hinnant} 40323e519524SHoward Hinnant 40333e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 40343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40353e519524SHoward Hinnantvoid 40363e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 40373e519524SHoward Hinnant{ 4038ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 40393e519524SHoward Hinnant} 40403e519524SHoward Hinnant 40413e519524SHoward Hinnanttemplate <class _Tp> 40423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40433e519524SHoward Hinnantvoid 40443e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 40453e519524SHoward Hinnant{ 4046ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 40473e519524SHoward Hinnant} 40483e519524SHoward Hinnant 40493e519524SHoward Hinnanttemplate <class _Tp> 40503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40513e519524SHoward Hinnantvoid 40523e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 40533e519524SHoward Hinnant{ 4054ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 40553e519524SHoward Hinnant} 40563e519524SHoward Hinnant 4057f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4058f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4059f554add5SHoward Hinnantvoid 4060f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4061f554add5SHoward Hinnant{ 4062f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4063f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4064f554add5SHoward Hinnant} 4065f554add5SHoward Hinnant 4066f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4067f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4068f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4069f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4070f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4071f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4072f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4073f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4074f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4075f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4076f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4077f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&)) 4078f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4079f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4080f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40813e519524SHoward Hinnant 4082f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4083f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4084f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4085f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4086f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4087f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4088f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4089f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4090f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4091f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4092f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4093f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&)) 4094f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4095f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4096f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40973e519524SHoward Hinnant 4098f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS unsigned __sort5<__less<long double>&, long double*>(long double*, long double*, long double*, long double*, long double*, __less<long double>&)) 40993e519524SHoward Hinnant 41003e519524SHoward Hinnant// lower_bound 41013e519524SHoward Hinnant 41023e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4103d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 4104e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41053e519524SHoward Hinnant{ 41063e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4107ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41083e519524SHoward Hinnant while (__len != 0) 41093e519524SHoward Hinnant { 411004695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 41113e519524SHoward Hinnant _ForwardIterator __m = __first; 4112ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4113e4383379SHoward Hinnant if (__comp(*__m, __value_)) 41143e519524SHoward Hinnant { 41153e519524SHoward Hinnant __first = ++__m; 41163e519524SHoward Hinnant __len -= __l2 + 1; 41173e519524SHoward Hinnant } 41183e519524SHoward Hinnant else 41193e519524SHoward Hinnant __len = __l2; 41203e519524SHoward Hinnant } 41213e519524SHoward Hinnant return __first; 41223e519524SHoward Hinnant} 41233e519524SHoward Hinnant 41243e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 4125d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 41263e519524SHoward Hinnant_ForwardIterator 4127e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41283e519524SHoward Hinnant{ 41293e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4130e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 41313e519524SHoward Hinnant} 41323e519524SHoward Hinnant 41333e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 4134d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 41353e519524SHoward Hinnant_ForwardIterator 4136e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41373e519524SHoward Hinnant{ 4138e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 41393e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 41403e519524SHoward Hinnant} 41413e519524SHoward Hinnant 41423e519524SHoward Hinnant// upper_bound 41433e519524SHoward Hinnant 41443e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4145d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 4146e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41473e519524SHoward Hinnant{ 41483e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4149ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41503e519524SHoward Hinnant while (__len != 0) 41513e519524SHoward Hinnant { 415204695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 41533e519524SHoward Hinnant _ForwardIterator __m = __first; 4154ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4155e4383379SHoward Hinnant if (__comp(__value_, *__m)) 41563e519524SHoward Hinnant __len = __l2; 41573e519524SHoward Hinnant else 41583e519524SHoward Hinnant { 41593e519524SHoward Hinnant __first = ++__m; 41603e519524SHoward Hinnant __len -= __l2 + 1; 41613e519524SHoward Hinnant } 41623e519524SHoward Hinnant } 41633e519524SHoward Hinnant return __first; 41643e519524SHoward Hinnant} 41653e519524SHoward Hinnant 41663e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 4167d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 41683e519524SHoward Hinnant_ForwardIterator 4169e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41703e519524SHoward Hinnant{ 41713e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4172e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 41733e519524SHoward Hinnant} 41743e519524SHoward Hinnant 41753e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 4176d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 41773e519524SHoward Hinnant_ForwardIterator 4178e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41793e519524SHoward Hinnant{ 4180e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 41813e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 41823e519524SHoward Hinnant} 41833e519524SHoward Hinnant 41843e519524SHoward Hinnant// equal_range 41853e519524SHoward Hinnant 41863e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4187d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_ForwardIterator, _ForwardIterator> 4188e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41893e519524SHoward Hinnant{ 41903e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4191ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41923e519524SHoward Hinnant while (__len != 0) 41933e519524SHoward Hinnant { 419404695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 41953e519524SHoward Hinnant _ForwardIterator __m = __first; 4196ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4197e4383379SHoward Hinnant if (__comp(*__m, __value_)) 41983e519524SHoward Hinnant { 41993e519524SHoward Hinnant __first = ++__m; 42003e519524SHoward Hinnant __len -= __l2 + 1; 42013e519524SHoward Hinnant } 4202e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 42033e519524SHoward Hinnant { 42043e519524SHoward Hinnant __last = __m; 42053e519524SHoward Hinnant __len = __l2; 42063e519524SHoward Hinnant } 42073e519524SHoward Hinnant else 42083e519524SHoward Hinnant { 42093e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 42103e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 42113e519524SHoward Hinnant ( 4212e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4213e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 42143e519524SHoward Hinnant ); 42153e519524SHoward Hinnant } 42163e519524SHoward Hinnant } 42173e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 42183e519524SHoward Hinnant} 42193e519524SHoward Hinnant 42203e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 4221d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42223e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4223e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42243e519524SHoward Hinnant{ 4225145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42263e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42273e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4228e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4229145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42303e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4231e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4232145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42333e519524SHoward Hinnant} 42343e519524SHoward Hinnant 42353e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 4236d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42373e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4238e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42393e519524SHoward Hinnant{ 4240e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 42413e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42423e519524SHoward Hinnant} 42433e519524SHoward Hinnant 42443e519524SHoward Hinnant// binary_search 42453e519524SHoward Hinnant 42463e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4247d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42483e519524SHoward Hinnantbool 4249e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42503e519524SHoward Hinnant{ 4251e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4252e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 42533e519524SHoward Hinnant} 42543e519524SHoward Hinnant 42553e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 4256d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42573e519524SHoward Hinnantbool 4258e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42593e519524SHoward Hinnant{ 4260145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42613e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42623e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4263e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4264145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42653e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4266e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4267145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42683e519524SHoward Hinnant} 42693e519524SHoward Hinnant 42703e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 4271d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42723e519524SHoward Hinnantbool 4273e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42743e519524SHoward Hinnant{ 4275e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 42763e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42773e519524SHoward Hinnant} 42783e519524SHoward Hinnant 42793e519524SHoward Hinnant// merge 42803e519524SHoward Hinnant 42813e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 42823e519524SHoward Hinnant_OutputIterator 42833e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 42843e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 42853e519524SHoward Hinnant{ 42863e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 42873e519524SHoward Hinnant { 42883e519524SHoward Hinnant if (__first2 == __last2) 4289ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 42903e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 42913e519524SHoward Hinnant { 42923e519524SHoward Hinnant *__result = *__first2; 42933e519524SHoward Hinnant ++__first2; 42943e519524SHoward Hinnant } 42953e519524SHoward Hinnant else 42963e519524SHoward Hinnant { 42973e519524SHoward Hinnant *__result = *__first1; 42983e519524SHoward Hinnant ++__first1; 42993e519524SHoward Hinnant } 43003e519524SHoward Hinnant } 4301ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 43023e519524SHoward Hinnant} 43033e519524SHoward Hinnant 43043e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 43053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43063e519524SHoward Hinnant_OutputIterator 43073e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43083e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 43093e519524SHoward Hinnant{ 4310145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43113e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43123e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4313ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4314145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43153e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4316ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4317145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43183e519524SHoward Hinnant} 43193e519524SHoward Hinnant 43203e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 43213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43223e519524SHoward Hinnant_OutputIterator 43233e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43243e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 43253e519524SHoward Hinnant{ 43263e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 43273e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 43283e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 43293e519524SHoward Hinnant} 43303e519524SHoward Hinnant 43313e519524SHoward Hinnant// inplace_merge 43323e519524SHoward Hinnant 4333adfdae18SMarshall Clowtemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4334adfdae18SMarshall Clow class _OutputIterator> 4335adfdae18SMarshall Clowvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4336adfdae18SMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 4337adfdae18SMarshall Clow _OutputIterator __result, _Compare __comp) 4338adfdae18SMarshall Clow{ 4339adfdae18SMarshall Clow for (; __first1 != __last1; ++__result) 4340adfdae18SMarshall Clow { 4341adfdae18SMarshall Clow if (__first2 == __last2) 4342adfdae18SMarshall Clow { 4343adfdae18SMarshall Clow _VSTD::move(__first1, __last1, __result); 4344adfdae18SMarshall Clow return; 4345adfdae18SMarshall Clow } 4346adfdae18SMarshall Clow 4347adfdae18SMarshall Clow if (__comp(*__first2, *__first1)) 4348adfdae18SMarshall Clow { 4349adfdae18SMarshall Clow *__result = _VSTD::move(*__first2); 4350adfdae18SMarshall Clow ++__first2; 4351adfdae18SMarshall Clow } 4352adfdae18SMarshall Clow else 4353adfdae18SMarshall Clow { 4354adfdae18SMarshall Clow *__result = _VSTD::move(*__first1); 4355adfdae18SMarshall Clow ++__first1; 4356adfdae18SMarshall Clow } 4357adfdae18SMarshall Clow } 4358adfdae18SMarshall Clow // __first2 through __last2 are already in the right spot. 4359adfdae18SMarshall Clow} 4360adfdae18SMarshall Clow 43613e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 43623e519524SHoward Hinnantvoid 43633e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 43643e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 43653e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 43663e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 43673e519524SHoward Hinnant{ 43683e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 43693e519524SHoward Hinnant __destruct_n __d(0); 43703e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 43713e519524SHoward Hinnant if (__len1 <= __len2) 43723e519524SHoward Hinnant { 43733e519524SHoward Hinnant value_type* __p = __buff; 4374910285b2SEric Fiselier for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4375ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 4376adfdae18SMarshall Clow __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp); 43773e519524SHoward Hinnant } 43783e519524SHoward Hinnant else 43793e519524SHoward Hinnant { 43803e519524SHoward Hinnant value_type* __p = __buff; 4381910285b2SEric Fiselier for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4382ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 43833e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 43843e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 4385adfdae18SMarshall Clow __half_inplace_merge(_Rv(__p), _Rv(__buff), 4386adfdae18SMarshall Clow _RBi(__middle), _RBi(__first), 4387a763b36fSMarshall Clow _RBi(__last), __invert<_Compare>(__comp)); 43883e519524SHoward Hinnant } 43893e519524SHoward Hinnant} 43903e519524SHoward Hinnant 43913e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 43923e519524SHoward Hinnantvoid 43933e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 43943e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 43953e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 43963e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 43973e519524SHoward Hinnant{ 43983e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 43993e519524SHoward Hinnant while (true) 44003e519524SHoward Hinnant { 44013e519524SHoward Hinnant // if __middle == __last, we're done 44023e519524SHoward Hinnant if (__len2 == 0) 44033e519524SHoward Hinnant return; 4404526e0929SMarshall Clow if (__len1 <= __buff_size || __len2 <= __buff_size) 4405526e0929SMarshall Clow return __buffered_inplace_merge<_Compare> 4406526e0929SMarshall Clow (__first, __middle, __last, __comp, __len1, __len2, __buff); 44073e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4408910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 44093e519524SHoward Hinnant { 44103e519524SHoward Hinnant if (__len1 == 0) 44113e519524SHoward Hinnant return; 44123e519524SHoward Hinnant if (__comp(*__middle, *__first)) 44133e519524SHoward Hinnant break; 44143e519524SHoward Hinnant } 44153e519524SHoward Hinnant // __first < __middle < __last 44163e519524SHoward Hinnant // *__first > *__middle 44173e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 44183e519524SHoward Hinnant // all elements in: 44193e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 44203e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 44213e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 44223e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 44233e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 44243e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 44253e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 44263e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 44273e519524SHoward Hinnant // binary search smaller range 44283e519524SHoward Hinnant if (__len1 < __len2) 44293e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 44303e519524SHoward Hinnant __len21 = __len2 / 2; 44313e519524SHoward Hinnant __m2 = __middle; 4432ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 44333e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4434ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 44353e519524SHoward Hinnant } 44363e519524SHoward Hinnant else 44373e519524SHoward Hinnant { 44383e519524SHoward Hinnant if (__len1 == 1) 44393e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 44403e519524SHoward Hinnant // It is known *__first > *__middle 44413e519524SHoward Hinnant swap(*__first, *__middle); 44423e519524SHoward Hinnant return; 44433e519524SHoward Hinnant } 44443e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 44453e519524SHoward Hinnant __len11 = __len1 / 2; 44463e519524SHoward Hinnant __m1 = __first; 4447ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 44483e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4449ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 44503e519524SHoward Hinnant } 44513e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 44523e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 44533e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 44543e519524SHoward Hinnant // swap middle two partitions 4455ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 44563e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 44573e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 44583e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 44593e519524SHoward Hinnant { 44603e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 44613e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 44623e519524SHoward Hinnant __first = __middle; 44633e519524SHoward Hinnant __middle = __m2; 44643e519524SHoward Hinnant __len1 = __len12; 44653e519524SHoward Hinnant __len2 = __len22; 44663e519524SHoward Hinnant } 44673e519524SHoward Hinnant else 44683e519524SHoward Hinnant { 44693e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 44703e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 44713e519524SHoward Hinnant __last = __middle; 44723e519524SHoward Hinnant __middle = __m1; 44733e519524SHoward Hinnant __len1 = __len11; 44743e519524SHoward Hinnant __len2 = __len21; 44753e519524SHoward Hinnant } 44763e519524SHoward Hinnant } 44773e519524SHoward Hinnant} 44783e519524SHoward Hinnant 44793e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 44803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44813e519524SHoward Hinnantvoid 44823e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44833e519524SHoward Hinnant _Compare __comp) 44843e519524SHoward Hinnant{ 44853e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 44863e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4487ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4488ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4489ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 44900b48cf9aSMarshall Clow pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 44910b48cf9aSMarshall Clow unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 44920b48cf9aSMarshall Clow 4493145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44943e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44953e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4496ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 44973e519524SHoward Hinnant __buf.first, __buf.second); 4498145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 44993e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4500ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 45013e519524SHoward Hinnant __buf.first, __buf.second); 4502145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 45033e519524SHoward Hinnant} 45043e519524SHoward Hinnant 45053e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 45063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45073e519524SHoward Hinnantvoid 45083e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 45093e519524SHoward Hinnant{ 4510ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 45113e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 45123e519524SHoward Hinnant} 45133e519524SHoward Hinnant 45143e519524SHoward Hinnant// stable_sort 45153e519524SHoward Hinnant 45163e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 45173e519524SHoward Hinnantvoid 45183e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 45193e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45203e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 45213e519524SHoward Hinnant{ 45223e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 45233e519524SHoward Hinnant __destruct_n __d(0); 45243e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 45253e519524SHoward Hinnant for (; true; ++__result) 45263e519524SHoward Hinnant { 45273e519524SHoward Hinnant if (__first1 == __last1) 45283e519524SHoward Hinnant { 45293e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4530ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45313e519524SHoward Hinnant __h.release(); 45323e519524SHoward Hinnant return; 45333e519524SHoward Hinnant } 45343e519524SHoward Hinnant if (__first2 == __last2) 45353e519524SHoward Hinnant { 45363e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4537ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 45383e519524SHoward Hinnant __h.release(); 45393e519524SHoward Hinnant return; 45403e519524SHoward Hinnant } 45413e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45423e519524SHoward Hinnant { 4543ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45443e519524SHoward Hinnant __d.__incr((value_type*)0); 45453e519524SHoward Hinnant ++__first2; 45463e519524SHoward Hinnant } 45473e519524SHoward Hinnant else 45483e519524SHoward Hinnant { 4549ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 45503e519524SHoward Hinnant __d.__incr((value_type*)0); 45513e519524SHoward Hinnant ++__first1; 45523e519524SHoward Hinnant } 45533e519524SHoward Hinnant } 45543e519524SHoward Hinnant} 45553e519524SHoward Hinnant 45563e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 45573e519524SHoward Hinnantvoid 45583e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 45593e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45603e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 45613e519524SHoward Hinnant{ 45623e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 45633e519524SHoward Hinnant { 45643e519524SHoward Hinnant if (__first2 == __last2) 45653e519524SHoward Hinnant { 45663e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4567ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45683e519524SHoward Hinnant return; 45693e519524SHoward Hinnant } 45703e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45713e519524SHoward Hinnant { 4572ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45733e519524SHoward Hinnant ++__first2; 45743e519524SHoward Hinnant } 45753e519524SHoward Hinnant else 45763e519524SHoward Hinnant { 4577ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45783e519524SHoward Hinnant ++__first1; 45793e519524SHoward Hinnant } 45803e519524SHoward Hinnant } 45813e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4582ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45833e519524SHoward Hinnant} 45843e519524SHoward Hinnant 45853e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45863e519524SHoward Hinnantvoid 45873e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 45883e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45893e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 45903e519524SHoward Hinnant 45913e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45923e519524SHoward Hinnantvoid 45933e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 45943e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45953e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 45963e519524SHoward Hinnant{ 45973e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 45983e519524SHoward Hinnant switch (__len) 45993e519524SHoward Hinnant { 46003e519524SHoward Hinnant case 0: 46013e519524SHoward Hinnant return; 46023e519524SHoward Hinnant case 1: 4603ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46043e519524SHoward Hinnant return; 46053e519524SHoward Hinnant case 2: 46063e519524SHoward Hinnant __destruct_n __d(0); 46073e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 46083e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 46093e519524SHoward Hinnant { 4610ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46113e519524SHoward Hinnant __d.__incr((value_type*)0); 46123e519524SHoward Hinnant ++__first2; 4613ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46143e519524SHoward Hinnant } 46153e519524SHoward Hinnant else 46163e519524SHoward Hinnant { 4617ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46183e519524SHoward Hinnant __d.__incr((value_type*)0); 46193e519524SHoward Hinnant ++__first2; 4620ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46213e519524SHoward Hinnant } 46223e519524SHoward Hinnant __h2.release(); 46233e519524SHoward Hinnant return; 46243e519524SHoward Hinnant } 46253e519524SHoward Hinnant if (__len <= 8) 46263e519524SHoward Hinnant { 46273e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 46283e519524SHoward Hinnant return; 46293e519524SHoward Hinnant } 46303e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46313e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 46323e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 46333e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 46343e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 46353e519524SHoward Hinnant} 46363e519524SHoward Hinnant 46373e519524SHoward Hinnanttemplate <class _Tp> 46383e519524SHoward Hinnantstruct __stable_sort_switch 46393e519524SHoward Hinnant{ 4640ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 46413e519524SHoward Hinnant}; 46423e519524SHoward Hinnant 46433e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46443e519524SHoward Hinnantvoid 46453e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 46463e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46473e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 46483e519524SHoward Hinnant{ 46493e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46503e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46513e519524SHoward Hinnant switch (__len) 46523e519524SHoward Hinnant { 46533e519524SHoward Hinnant case 0: 46543e519524SHoward Hinnant case 1: 46553e519524SHoward Hinnant return; 46563e519524SHoward Hinnant case 2: 46573e519524SHoward Hinnant if (__comp(*--__last, *__first)) 46583e519524SHoward Hinnant swap(*__first, *__last); 46593e519524SHoward Hinnant return; 46603e519524SHoward Hinnant } 46613e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 46623e519524SHoward Hinnant { 46633e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 46643e519524SHoward Hinnant return; 46653e519524SHoward Hinnant } 46663e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46673e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 46683e519524SHoward Hinnant if (__len <= __buff_size) 46693e519524SHoward Hinnant { 46703e519524SHoward Hinnant __destruct_n __d(0); 46713e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 46723e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 46733e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 46743e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 46753e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 46763e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 46773e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 46783e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 46793e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 46803e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 46813e519524SHoward Hinnant// __first, __comp); 46823e519524SHoward Hinnant return; 46833e519524SHoward Hinnant } 46843e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 46853e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 46863e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 46873e519524SHoward Hinnant} 46883e519524SHoward Hinnant 46893e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 46903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46913e519524SHoward Hinnantvoid 46923e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 46933e519524SHoward Hinnant{ 46943e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46953e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46963e519524SHoward Hinnant difference_type __len = __last - __first; 46973e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 46983e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 46993e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 47003e519524SHoward Hinnant { 4701ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 47023e519524SHoward Hinnant __h.reset(__buf.first); 47033e519524SHoward Hinnant } 4704145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 47053e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 47063e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 47073e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4708145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 47093e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 47103e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4711145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 47123e519524SHoward Hinnant} 47133e519524SHoward Hinnant 47143e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 47153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47163e519524SHoward Hinnantvoid 47173e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 47183e519524SHoward Hinnant{ 4719ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47203e519524SHoward Hinnant} 47213e519524SHoward Hinnant 47223e519524SHoward Hinnant// is_heap_until 47233e519524SHoward Hinnant 47243e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 472549c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 47263e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47273e519524SHoward Hinnant{ 4728ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47293e519524SHoward Hinnant difference_type __len = __last - __first; 47303e519524SHoward Hinnant difference_type __p = 0; 47313e519524SHoward Hinnant difference_type __c = 1; 47323e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 47333e519524SHoward Hinnant while (__c < __len) 47343e519524SHoward Hinnant { 47353e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 47363e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47373e519524SHoward Hinnant return __cp; 47383e519524SHoward Hinnant ++__c; 47393e519524SHoward Hinnant ++__cp; 47403e519524SHoward Hinnant if (__c == __len) 47413e519524SHoward Hinnant return __last; 47423e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47433e519524SHoward Hinnant return __cp; 47443e519524SHoward Hinnant ++__p; 47453e519524SHoward Hinnant ++__pp; 47463e519524SHoward Hinnant __c = 2 * __p + 1; 47473e519524SHoward Hinnant } 47483e519524SHoward Hinnant return __last; 47493e519524SHoward Hinnant} 47503e519524SHoward Hinnant 47513e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 475249c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 47533e519524SHoward Hinnant_RandomAccessIterator 47543e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 47553e519524SHoward Hinnant{ 4756ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47573e519524SHoward Hinnant} 47583e519524SHoward Hinnant 47593e519524SHoward Hinnant// is_heap 47603e519524SHoward Hinnant 47613e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 476249c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 47633e519524SHoward Hinnantbool 47643e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47653e519524SHoward Hinnant{ 4766ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 47673e519524SHoward Hinnant} 47683e519524SHoward Hinnant 47693e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 477049c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 47713e519524SHoward Hinnantbool 47723e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 47733e519524SHoward Hinnant{ 4774ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47753e519524SHoward Hinnant} 47763e519524SHoward Hinnant 47773e519524SHoward Hinnant// push_heap 47783e519524SHoward Hinnant 47793e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47803e519524SHoward Hinnantvoid 47818b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47823e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 47833e519524SHoward Hinnant{ 47843e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47853e519524SHoward Hinnant if (__len > 1) 47863e519524SHoward Hinnant { 47873e519524SHoward Hinnant __len = (__len - 2) / 2; 47883e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 47893e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 47903e519524SHoward Hinnant { 4791ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 47923e519524SHoward Hinnant do 47933e519524SHoward Hinnant { 4794ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 47953e519524SHoward Hinnant __last = __ptr; 47963e519524SHoward Hinnant if (__len == 0) 47973e519524SHoward Hinnant break; 47983e519524SHoward Hinnant __len = (__len - 1) / 2; 47993e519524SHoward Hinnant __ptr = __first + __len; 48003e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4801ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 48023e519524SHoward Hinnant } 48033e519524SHoward Hinnant } 48043e519524SHoward Hinnant} 48053e519524SHoward Hinnant 48063e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48083e519524SHoward Hinnantvoid 48093e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48103e519524SHoward Hinnant{ 4811145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48123e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48133e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48148b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __c, __last - __first); 4815145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48163e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48178b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 4818145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48193e519524SHoward Hinnant} 48203e519524SHoward Hinnant 48213e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48233e519524SHoward Hinnantvoid 48243e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48253e519524SHoward Hinnant{ 4826ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48273e519524SHoward Hinnant} 48283e519524SHoward Hinnant 48293e519524SHoward Hinnant// pop_heap 48303e519524SHoward Hinnant 48313e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48328b512602SDavid Majnemervoid 4833fd838227SEric Fiselier__sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/, 4834fd838227SEric Fiselier _Compare __comp, 48358b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 48368b512602SDavid Majnemer _RandomAccessIterator __start) 48378b512602SDavid Majnemer{ 48388b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48398b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48408b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 48418b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 48428b512602SDavid Majnemer difference_type __child = __start - __first; 48438b512602SDavid Majnemer 48448b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 48458b512602SDavid Majnemer return; 48468b512602SDavid Majnemer 48478b512602SDavid Majnemer __child = 2 * __child + 1; 48488b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 48498b512602SDavid Majnemer 48508b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 48518b512602SDavid Majnemer // right-child exists and is greater than left-child 48528b512602SDavid Majnemer ++__child_i; 48538b512602SDavid Majnemer ++__child; 48548b512602SDavid Majnemer } 48558b512602SDavid Majnemer 48568b512602SDavid Majnemer // check if we are in heap-order 48578b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 48588b512602SDavid Majnemer // we are, __start is larger than it's largest child 48598b512602SDavid Majnemer return; 48608b512602SDavid Majnemer 48618b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 48628b512602SDavid Majnemer do 48638b512602SDavid Majnemer { 48648b512602SDavid Majnemer // we are not in heap-order, swap the parent with it's largest child 48658b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 48668b512602SDavid Majnemer __start = __child_i; 48678b512602SDavid Majnemer 48688b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 48698b512602SDavid Majnemer break; 48708b512602SDavid Majnemer 48718b512602SDavid Majnemer // recompute the child based off of the updated parent 48728b512602SDavid Majnemer __child = 2 * __child + 1; 48738b512602SDavid Majnemer __child_i = __first + __child; 48748b512602SDavid Majnemer 48758b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 48768b512602SDavid Majnemer // right-child exists and is greater than left-child 48778b512602SDavid Majnemer ++__child_i; 48788b512602SDavid Majnemer ++__child; 48798b512602SDavid Majnemer } 48808b512602SDavid Majnemer 48818b512602SDavid Majnemer // check if we are in heap-order 48828b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 48838b512602SDavid Majnemer *__start = _VSTD::move(__top); 48848b512602SDavid Majnemer} 48858b512602SDavid Majnemer 48868b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 48873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48883e519524SHoward Hinnantvoid 48893e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48903e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48913e519524SHoward Hinnant{ 48923e519524SHoward Hinnant if (__len > 1) 48933e519524SHoward Hinnant { 48943e519524SHoward Hinnant swap(*__first, *--__last); 48958b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 48963e519524SHoward Hinnant } 48973e519524SHoward Hinnant} 48983e519524SHoward Hinnant 48993e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49013e519524SHoward Hinnantvoid 49023e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49033e519524SHoward Hinnant{ 4904145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49053e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49063e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49073e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 4908145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49093e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49103e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 4911145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49123e519524SHoward Hinnant} 49133e519524SHoward Hinnant 49143e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49163e519524SHoward Hinnantvoid 49173e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49183e519524SHoward Hinnant{ 4919ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49203e519524SHoward Hinnant} 49213e519524SHoward Hinnant 49223e519524SHoward Hinnant// make_heap 49233e519524SHoward Hinnant 49243e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49253e519524SHoward Hinnantvoid 49263e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49273e519524SHoward Hinnant{ 49283e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49293e519524SHoward Hinnant difference_type __n = __last - __first; 49303e519524SHoward Hinnant if (__n > 1) 49313e519524SHoward Hinnant { 49328b512602SDavid Majnemer // start from the first parent, there is no need to consider children 49338b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 49348b512602SDavid Majnemer { 49358b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 49368b512602SDavid Majnemer } 49373e519524SHoward Hinnant } 49383e519524SHoward Hinnant} 49393e519524SHoward Hinnant 49403e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49423e519524SHoward Hinnantvoid 49433e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49443e519524SHoward Hinnant{ 4945145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49463e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49473e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49483e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 4949145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49503e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49513e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 4952145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49533e519524SHoward Hinnant} 49543e519524SHoward Hinnant 49553e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49573e519524SHoward Hinnantvoid 49583e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49593e519524SHoward Hinnant{ 4960ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49613e519524SHoward Hinnant} 49623e519524SHoward Hinnant 49633e519524SHoward Hinnant// sort_heap 49643e519524SHoward Hinnant 49653e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49663e519524SHoward Hinnantvoid 49673e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49683e519524SHoward Hinnant{ 49693e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49703e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 49713e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 49723e519524SHoward Hinnant} 49733e519524SHoward Hinnant 49743e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49763e519524SHoward Hinnantvoid 49773e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49783e519524SHoward Hinnant{ 4979145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49803e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49813e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49823e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 4983145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49843e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49853e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 4986145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49873e519524SHoward Hinnant} 49883e519524SHoward Hinnant 49893e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49913e519524SHoward Hinnantvoid 49923e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49933e519524SHoward Hinnant{ 4994ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49953e519524SHoward Hinnant} 49963e519524SHoward Hinnant 49973e519524SHoward Hinnant// partial_sort 49983e519524SHoward Hinnant 49993e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50003e519524SHoward Hinnantvoid 50013e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 50023e519524SHoward Hinnant _Compare __comp) 50033e519524SHoward Hinnant{ 50043e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 50053e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 50063e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 50073e519524SHoward Hinnant { 50083e519524SHoward Hinnant if (__comp(*__i, *__first)) 50093e519524SHoward Hinnant { 50103e519524SHoward Hinnant swap(*__i, *__first); 50118b512602SDavid Majnemer __sift_down<_Compare>(__first, __middle, __comp, __len, __first); 50123e519524SHoward Hinnant } 50133e519524SHoward Hinnant } 50143e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 50153e519524SHoward Hinnant} 50163e519524SHoward Hinnant 50173e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50193e519524SHoward Hinnantvoid 50203e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 50213e519524SHoward Hinnant _Compare __comp) 50223e519524SHoward Hinnant{ 5023145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50243e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50253e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50263e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 5027145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50283e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50293e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 5030145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50313e519524SHoward Hinnant} 50323e519524SHoward Hinnant 50333e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50353e519524SHoward Hinnantvoid 50363e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 50373e519524SHoward Hinnant{ 5038ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 50393e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50403e519524SHoward Hinnant} 50413e519524SHoward Hinnant 50423e519524SHoward Hinnant// partial_sort_copy 50433e519524SHoward Hinnant 50443e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 50453e519524SHoward Hinnant_RandomAccessIterator 50463e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 50473e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50483e519524SHoward Hinnant{ 50493e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 50503e519524SHoward Hinnant if (__r != __result_last) 50513e519524SHoward Hinnant { 5052910285b2SEric Fiselier for (; __first != __last && __r != __result_last; (void) ++__first, ++__r) 50533e519524SHoward Hinnant *__r = *__first; 50543e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 50558b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 50563e519524SHoward Hinnant for (; __first != __last; ++__first) 50573e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 50583e519524SHoward Hinnant { 50593e519524SHoward Hinnant *__result_first = *__first; 50608b512602SDavid Majnemer __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 50613e519524SHoward Hinnant } 50623e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 50633e519524SHoward Hinnant } 50643e519524SHoward Hinnant return __r; 50653e519524SHoward Hinnant} 50663e519524SHoward Hinnant 50673e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 50683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50693e519524SHoward Hinnant_RandomAccessIterator 50703e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 50713e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50723e519524SHoward Hinnant{ 5073145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50743e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50753e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50763e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5077145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50783e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50793e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5080145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50813e519524SHoward Hinnant} 50823e519524SHoward Hinnant 50833e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 50843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50853e519524SHoward Hinnant_RandomAccessIterator 50863e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 50873e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 50883e519524SHoward Hinnant{ 5089ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 50903e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50913e519524SHoward Hinnant} 50923e519524SHoward Hinnant 50933e519524SHoward Hinnant// nth_element 50943e519524SHoward Hinnant 50953e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50963e519524SHoward Hinnantvoid 50973e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 50983e519524SHoward Hinnant{ 50993e519524SHoward Hinnant // _Compare is known to be a reference type 51003e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 51013e519524SHoward Hinnant const difference_type __limit = 7; 51023e519524SHoward Hinnant while (true) 51033e519524SHoward Hinnant { 51043e519524SHoward Hinnant __restart: 5105b34b4819SHoward Hinnant if (__nth == __last) 5106b34b4819SHoward Hinnant return; 51073e519524SHoward Hinnant difference_type __len = __last - __first; 51083e519524SHoward Hinnant switch (__len) 51093e519524SHoward Hinnant { 51103e519524SHoward Hinnant case 0: 51113e519524SHoward Hinnant case 1: 51123e519524SHoward Hinnant return; 51133e519524SHoward Hinnant case 2: 51143e519524SHoward Hinnant if (__comp(*--__last, *__first)) 51153e519524SHoward Hinnant swap(*__first, *__last); 51163e519524SHoward Hinnant return; 51173e519524SHoward Hinnant case 3: 51183e519524SHoward Hinnant { 51193e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5120ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 51213e519524SHoward Hinnant return; 51223e519524SHoward Hinnant } 51233e519524SHoward Hinnant } 51243e519524SHoward Hinnant if (__len <= __limit) 51253e519524SHoward Hinnant { 51263e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 51273e519524SHoward Hinnant return; 51283e519524SHoward Hinnant } 51293e519524SHoward Hinnant // __len > __limit >= 3 51303e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 51313e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5132ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 51333e519524SHoward Hinnant // *__m is median 51343e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 51353e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 51363e519524SHoward Hinnant _RandomAccessIterator __i = __first; 51373e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 51383e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51393e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 51403e519524SHoward Hinnant // Prime the downward search with a guard. 51413e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 51423e519524SHoward Hinnant { 51433e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 51443e519524SHoward Hinnant // manually guard downward moving __j against __i 51453e519524SHoward Hinnant while (true) 51463e519524SHoward Hinnant { 51473e519524SHoward Hinnant if (__i == --__j) 51483e519524SHoward Hinnant { 51493e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 51503e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 51513e519524SHoward Hinnant ++__i; // __first + 1 51523e519524SHoward Hinnant __j = __last; 51533e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 51543e519524SHoward Hinnant { 51553e519524SHoward Hinnant while (true) 51563e519524SHoward Hinnant { 51573e519524SHoward Hinnant if (__i == __j) 51583e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 51593e519524SHoward Hinnant if (__comp(*__first, *__i)) 51603e519524SHoward Hinnant { 51613e519524SHoward Hinnant swap(*__i, *__j); 51623e519524SHoward Hinnant ++__n_swaps; 51633e519524SHoward Hinnant ++__i; 51643e519524SHoward Hinnant break; 51653e519524SHoward Hinnant } 51663e519524SHoward Hinnant ++__i; 51673e519524SHoward Hinnant } 51683e519524SHoward Hinnant } 51693e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 51703e519524SHoward Hinnant if (__i == __j) 51713e519524SHoward Hinnant return; 51723e519524SHoward Hinnant while (true) 51733e519524SHoward Hinnant { 51743e519524SHoward Hinnant while (!__comp(*__first, *__i)) 51753e519524SHoward Hinnant ++__i; 51763e519524SHoward Hinnant while (__comp(*__first, *--__j)) 51773e519524SHoward Hinnant ; 51783e519524SHoward Hinnant if (__i >= __j) 51793e519524SHoward Hinnant break; 51803e519524SHoward Hinnant swap(*__i, *__j); 51813e519524SHoward Hinnant ++__n_swaps; 51823e519524SHoward Hinnant ++__i; 51833e519524SHoward Hinnant } 51843e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 51853e519524SHoward Hinnant // The first part is sorted, 51863e519524SHoward Hinnant if (__nth < __i) 51873e519524SHoward Hinnant return; 51883e519524SHoward Hinnant // __nth_element the secod part 51893e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 51903e519524SHoward Hinnant __first = __i; 51913e519524SHoward Hinnant goto __restart; 51923e519524SHoward Hinnant } 51933e519524SHoward Hinnant if (__comp(*__j, *__m)) 51943e519524SHoward Hinnant { 51953e519524SHoward Hinnant swap(*__i, *__j); 51963e519524SHoward Hinnant ++__n_swaps; 51973e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 51983e519524SHoward Hinnant } 51993e519524SHoward Hinnant } 52003e519524SHoward Hinnant } 52013e519524SHoward Hinnant ++__i; 52023e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 52033e519524SHoward Hinnant // if not yet partitioned... 52043e519524SHoward Hinnant if (__i < __j) 52053e519524SHoward Hinnant { 52063e519524SHoward Hinnant // known that *(__i - 1) < *__m 52073e519524SHoward Hinnant while (true) 52083e519524SHoward Hinnant { 52093e519524SHoward Hinnant // __m still guards upward moving __i 52103e519524SHoward Hinnant while (__comp(*__i, *__m)) 52113e519524SHoward Hinnant ++__i; 52123e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 52133e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 52143e519524SHoward Hinnant ; 52153e519524SHoward Hinnant if (__i >= __j) 52163e519524SHoward Hinnant break; 52173e519524SHoward Hinnant swap(*__i, *__j); 52183e519524SHoward Hinnant ++__n_swaps; 52193e519524SHoward Hinnant // It is known that __m != __j 52203e519524SHoward Hinnant // If __m just moved, follow it 52213e519524SHoward Hinnant if (__m == __i) 52223e519524SHoward Hinnant __m = __j; 52233e519524SHoward Hinnant ++__i; 52243e519524SHoward Hinnant } 52253e519524SHoward Hinnant } 52263e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 52273e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 52283e519524SHoward Hinnant { 52293e519524SHoward Hinnant swap(*__i, *__m); 52303e519524SHoward Hinnant ++__n_swaps; 52313e519524SHoward Hinnant } 52323e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 52333e519524SHoward Hinnant if (__nth == __i) 52343e519524SHoward Hinnant return; 52353e519524SHoward Hinnant if (__n_swaps == 0) 52363e519524SHoward Hinnant { 52373e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 52383e519524SHoward Hinnant if (__nth < __i) 52393e519524SHoward Hinnant { 52403e519524SHoward Hinnant // Check for [__first, __i) already sorted 52413e519524SHoward Hinnant __j = __m = __first; 52423e519524SHoward Hinnant while (++__j != __i) 52433e519524SHoward Hinnant { 52443e519524SHoward Hinnant if (__comp(*__j, *__m)) 52453e519524SHoward Hinnant // not yet sorted, so sort 52463e519524SHoward Hinnant goto not_sorted; 52473e519524SHoward Hinnant __m = __j; 52483e519524SHoward Hinnant } 52493e519524SHoward Hinnant // [__first, __i) sorted 52503e519524SHoward Hinnant return; 52513e519524SHoward Hinnant } 52523e519524SHoward Hinnant else 52533e519524SHoward Hinnant { 52543e519524SHoward Hinnant // Check for [__i, __last) already sorted 52553e519524SHoward Hinnant __j = __m = __i; 52563e519524SHoward Hinnant while (++__j != __last) 52573e519524SHoward Hinnant { 52583e519524SHoward Hinnant if (__comp(*__j, *__m)) 52593e519524SHoward Hinnant // not yet sorted, so sort 52603e519524SHoward Hinnant goto not_sorted; 52613e519524SHoward Hinnant __m = __j; 52623e519524SHoward Hinnant } 52633e519524SHoward Hinnant // [__i, __last) sorted 52643e519524SHoward Hinnant return; 52653e519524SHoward Hinnant } 52663e519524SHoward Hinnant } 52673e519524SHoward Hinnantnot_sorted: 52683e519524SHoward Hinnant // __nth_element on range containing __nth 52693e519524SHoward Hinnant if (__nth < __i) 52703e519524SHoward Hinnant { 52713e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 52723e519524SHoward Hinnant __last = __i; 52733e519524SHoward Hinnant } 52743e519524SHoward Hinnant else 52753e519524SHoward Hinnant { 52763e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 52773e519524SHoward Hinnant __first = ++__i; 52783e519524SHoward Hinnant } 52793e519524SHoward Hinnant } 52803e519524SHoward Hinnant} 52813e519524SHoward Hinnant 52823e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 52833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52843e519524SHoward Hinnantvoid 52853e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 52863e519524SHoward Hinnant{ 5287145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 52883e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52893e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52903e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5291145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 52923e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52933e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5294145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 52953e519524SHoward Hinnant} 52963e519524SHoward Hinnant 52973e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 52983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52993e519524SHoward Hinnantvoid 53003e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 53013e519524SHoward Hinnant{ 5302ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 53033e519524SHoward Hinnant} 53043e519524SHoward Hinnant 53053e519524SHoward Hinnant// includes 53063e519524SHoward Hinnant 53073e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 53088da1a487SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 53093e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53103e519524SHoward Hinnant _Compare __comp) 53113e519524SHoward Hinnant{ 53123e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 53133e519524SHoward Hinnant { 53143e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 53153e519524SHoward Hinnant return false; 53163e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53173e519524SHoward Hinnant ++__first2; 53183e519524SHoward Hinnant } 53193e519524SHoward Hinnant return true; 53203e519524SHoward Hinnant} 53213e519524SHoward Hinnant 53223e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 53238da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 53243e519524SHoward Hinnantbool 53253e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53263e519524SHoward Hinnant _Compare __comp) 53273e519524SHoward Hinnant{ 5328145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53293e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53303e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53313e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5332145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53333e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53343e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5335145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53363e519524SHoward Hinnant} 53373e519524SHoward Hinnant 53383e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 53398da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 53403e519524SHoward Hinnantbool 53413e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 53423e519524SHoward Hinnant{ 5343ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 53443e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53453e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53463e519524SHoward Hinnant} 53473e519524SHoward Hinnant 53483e519524SHoward Hinnant// set_union 53493e519524SHoward Hinnant 53503e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53513e519524SHoward Hinnant_OutputIterator 53523e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 53533e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53543e519524SHoward Hinnant{ 53553e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 53563e519524SHoward Hinnant { 53573e519524SHoward Hinnant if (__first2 == __last2) 5358ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 53593e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 53603e519524SHoward Hinnant { 53613e519524SHoward Hinnant *__result = *__first2; 53623e519524SHoward Hinnant ++__first2; 53633e519524SHoward Hinnant } 53643e519524SHoward Hinnant else 53653e519524SHoward Hinnant { 53663e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53673e519524SHoward Hinnant ++__first2; 536805da5b02SMarshall Clow *__result = *__first1; 53693e519524SHoward Hinnant ++__first1; 53703e519524SHoward Hinnant } 53713e519524SHoward Hinnant } 5372ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 53733e519524SHoward Hinnant} 53743e519524SHoward Hinnant 53753e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 53763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53773e519524SHoward Hinnant_OutputIterator 53783e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53793e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53803e519524SHoward Hinnant{ 5381145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53823e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53833e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53843e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5385145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53863e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53873e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5388145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53893e519524SHoward Hinnant} 53903e519524SHoward Hinnant 53913e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 53923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53933e519524SHoward Hinnant_OutputIterator 53943e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53953e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 53963e519524SHoward Hinnant{ 5397ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 53983e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53993e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54003e519524SHoward Hinnant} 54013e519524SHoward Hinnant 54023e519524SHoward Hinnant// set_intersection 54033e519524SHoward Hinnant 54043e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54058da1a487SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 54063e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54073e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54083e519524SHoward Hinnant{ 54093e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 54103e519524SHoward Hinnant { 54113e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54123e519524SHoward Hinnant ++__first1; 54133e519524SHoward Hinnant else 54143e519524SHoward Hinnant { 54153e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54163e519524SHoward Hinnant { 54173e519524SHoward Hinnant *__result = *__first1; 54183e519524SHoward Hinnant ++__result; 54193e519524SHoward Hinnant ++__first1; 54203e519524SHoward Hinnant } 54213e519524SHoward Hinnant ++__first2; 54223e519524SHoward Hinnant } 54233e519524SHoward Hinnant } 54243e519524SHoward Hinnant return __result; 54253e519524SHoward Hinnant} 54263e519524SHoward Hinnant 54273e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54288da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 54293e519524SHoward Hinnant_OutputIterator 54303e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54313e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54323e519524SHoward Hinnant{ 5433145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54343e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54353e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54363e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5437145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54383e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54393e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5440145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54413e519524SHoward Hinnant} 54423e519524SHoward Hinnant 54433e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54448da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 54453e519524SHoward Hinnant_OutputIterator 54463e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54473e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54483e519524SHoward Hinnant{ 5449ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 54503e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54513e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54523e519524SHoward Hinnant} 54533e519524SHoward Hinnant 54543e519524SHoward Hinnant// set_difference 54553e519524SHoward Hinnant 54563e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54573e519524SHoward Hinnant_OutputIterator 54583e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54593e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54603e519524SHoward Hinnant{ 54613e519524SHoward Hinnant while (__first1 != __last1) 54623e519524SHoward Hinnant { 54633e519524SHoward Hinnant if (__first2 == __last2) 5464ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54653e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54663e519524SHoward Hinnant { 54673e519524SHoward Hinnant *__result = *__first1; 54683e519524SHoward Hinnant ++__result; 54693e519524SHoward Hinnant ++__first1; 54703e519524SHoward Hinnant } 54713e519524SHoward Hinnant else 54723e519524SHoward Hinnant { 54733e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54743e519524SHoward Hinnant ++__first1; 54753e519524SHoward Hinnant ++__first2; 54763e519524SHoward Hinnant } 54773e519524SHoward Hinnant } 54783e519524SHoward Hinnant return __result; 54793e519524SHoward Hinnant} 54803e519524SHoward Hinnant 54813e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54833e519524SHoward Hinnant_OutputIterator 54843e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54853e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54863e519524SHoward Hinnant{ 5487145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54883e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54893e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54903e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5491145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54923e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54933e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5494145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54953e519524SHoward Hinnant} 54963e519524SHoward Hinnant 54973e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54993e519524SHoward Hinnant_OutputIterator 55003e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55013e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55023e519524SHoward Hinnant{ 5503ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 55043e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55053e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55063e519524SHoward Hinnant} 55073e519524SHoward Hinnant 55083e519524SHoward Hinnant// set_symmetric_difference 55093e519524SHoward Hinnant 55103e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55113e519524SHoward Hinnant_OutputIterator 55123e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55133e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55143e519524SHoward Hinnant{ 55153e519524SHoward Hinnant while (__first1 != __last1) 55163e519524SHoward Hinnant { 55173e519524SHoward Hinnant if (__first2 == __last2) 5518ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55193e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55203e519524SHoward Hinnant { 55213e519524SHoward Hinnant *__result = *__first1; 55223e519524SHoward Hinnant ++__result; 55233e519524SHoward Hinnant ++__first1; 55243e519524SHoward Hinnant } 55253e519524SHoward Hinnant else 55263e519524SHoward Hinnant { 55273e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55283e519524SHoward Hinnant { 55293e519524SHoward Hinnant *__result = *__first2; 55303e519524SHoward Hinnant ++__result; 55313e519524SHoward Hinnant } 55323e519524SHoward Hinnant else 55333e519524SHoward Hinnant ++__first1; 55343e519524SHoward Hinnant ++__first2; 55353e519524SHoward Hinnant } 55363e519524SHoward Hinnant } 5537ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 55383e519524SHoward Hinnant} 55393e519524SHoward Hinnant 55403e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55423e519524SHoward Hinnant_OutputIterator 55433e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55443e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55453e519524SHoward Hinnant{ 5546145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55473e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55483e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55493e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5550145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55513e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55523e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5553145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55543e519524SHoward Hinnant} 55553e519524SHoward Hinnant 55563e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55583e519524SHoward Hinnant_OutputIterator 55593e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55603e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55613e519524SHoward Hinnant{ 5562ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 55633e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55643e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55653e519524SHoward Hinnant} 55663e519524SHoward Hinnant 55673e519524SHoward Hinnant// lexicographical_compare 55683e519524SHoward Hinnant 55693e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 55701b9a4ffdSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 55713e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55723e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55733e519524SHoward Hinnant{ 5574910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 55753e519524SHoward Hinnant { 55763e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 55773e519524SHoward Hinnant return true; 55783e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55793e519524SHoward Hinnant return false; 55803e519524SHoward Hinnant } 55813e519524SHoward Hinnant return false; 55823e519524SHoward Hinnant} 55833e519524SHoward Hinnant 55843e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 55851b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55863e519524SHoward Hinnantbool 55873e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55883e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55893e519524SHoward Hinnant{ 5590145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55913e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55923e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55933e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5594145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55953e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55963e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5597145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55983e519524SHoward Hinnant} 55993e519524SHoward Hinnant 56003e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 56011b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 56023e519524SHoward Hinnantbool 56033e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 56043e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 56053e519524SHoward Hinnant{ 5606ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 56073e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56083e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56093e519524SHoward Hinnant} 56103e519524SHoward Hinnant 56113e519524SHoward Hinnant// next_permutation 56123e519524SHoward Hinnant 56133e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 56143e519524SHoward Hinnantbool 56153e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56163e519524SHoward Hinnant{ 56173e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56183e519524SHoward Hinnant if (__first == __last || __first == --__i) 56193e519524SHoward Hinnant return false; 56203e519524SHoward Hinnant while (true) 56213e519524SHoward Hinnant { 56223e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56233e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 56243e519524SHoward Hinnant { 56253e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56263e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 56273e519524SHoward Hinnant ; 56283e519524SHoward Hinnant swap(*__i, *__j); 5629ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56303e519524SHoward Hinnant return true; 56313e519524SHoward Hinnant } 56323e519524SHoward Hinnant if (__i == __first) 56333e519524SHoward Hinnant { 5634ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56353e519524SHoward Hinnant return false; 56363e519524SHoward Hinnant } 56373e519524SHoward Hinnant } 56383e519524SHoward Hinnant} 56393e519524SHoward Hinnant 56403e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56423e519524SHoward Hinnantbool 56433e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56443e519524SHoward Hinnant{ 5645145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56463e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56473e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56483e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5649145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56503e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56513e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5652145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56533e519524SHoward Hinnant} 56543e519524SHoward Hinnant 56553e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 56563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56573e519524SHoward Hinnantbool 56583e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 56593e519524SHoward Hinnant{ 5660ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 56613e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 56623e519524SHoward Hinnant} 56633e519524SHoward Hinnant 56643e519524SHoward Hinnant// prev_permutation 56653e519524SHoward Hinnant 56663e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 56673e519524SHoward Hinnantbool 56683e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56693e519524SHoward Hinnant{ 56703e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56713e519524SHoward Hinnant if (__first == __last || __first == --__i) 56723e519524SHoward Hinnant return false; 56733e519524SHoward Hinnant while (true) 56743e519524SHoward Hinnant { 56753e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56763e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 56773e519524SHoward Hinnant { 56783e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56793e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 56803e519524SHoward Hinnant ; 56813e519524SHoward Hinnant swap(*__i, *__j); 5682ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56833e519524SHoward Hinnant return true; 56843e519524SHoward Hinnant } 56853e519524SHoward Hinnant if (__i == __first) 56863e519524SHoward Hinnant { 5687ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56883e519524SHoward Hinnant return false; 56893e519524SHoward Hinnant } 56903e519524SHoward Hinnant } 56913e519524SHoward Hinnant} 56923e519524SHoward Hinnant 56933e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56953e519524SHoward Hinnantbool 56963e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56973e519524SHoward Hinnant{ 5698145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56993e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57003e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57013e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5702145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57033e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57043e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5705145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57063e519524SHoward Hinnant} 57073e519524SHoward Hinnant 57083e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 57093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57103e519524SHoward Hinnantbool 57113e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 57123e519524SHoward Hinnant{ 5713ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 57143e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 57153e519524SHoward Hinnant} 57163e519524SHoward Hinnant 57173e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 57183e519524SHoward Hinnant 5719a016efb1SEric Fiselier_LIBCPP_POP_MACROS 5720a016efb1SEric Fiselier 57213e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5722