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> 17013c90a57SLouis Dionne constexpr OutputIterator // constexpr in C++20 1713e519524SHoward Hinnant copy(InputIterator first, InputIterator last, OutputIterator result); 1723e519524SHoward Hinnant 1733e519524SHoward Hinnanttemplate<class InputIterator, class OutputIterator, class Predicate> 17413c90a57SLouis Dionne constexpr OutputIterator // constexpr in C++20 1753e519524SHoward Hinnant copy_if(InputIterator first, InputIterator last, 1763e519524SHoward Hinnant OutputIterator result, Predicate pred); 1773e519524SHoward Hinnant 1783e519524SHoward Hinnanttemplate<class InputIterator, class Size, class OutputIterator> 17913c90a57SLouis Dionne constexpr OutputIterator // constexpr in C++20 1803e519524SHoward Hinnant copy_n(InputIterator first, Size n, OutputIterator result); 1813e519524SHoward Hinnant 1823e519524SHoward Hinnanttemplate <class BidirectionalIterator1, class BidirectionalIterator2> 18313c90a57SLouis Dionne constexpr BidirectionalIterator2 // constexpr in C++20 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{ 783aa1cad15SEric Fiselier _Compare &__comp_; 784aa1cad15SEric Fiselier _LIBCPP_CONSTEXPR_AFTER_CXX17 7853e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 786331d2159SEric Fiselier 7873e519524SHoward Hinnant template <class _Tp, class _Up> 7886ab51de0SThomas Anderson _LIBCPP_CONSTEXPR_AFTER_CXX17 7893c3ccc00SThomas Anderson bool operator()(const _Tp& __x, const _Up& __y) 7903c3ccc00SThomas Anderson { 7913c3ccc00SThomas Anderson bool __r = __comp_(__x, __y); 7923c3ccc00SThomas Anderson if (__r) 7933c3ccc00SThomas Anderson __do_compare_assert(0, __y, __x); 7943c3ccc00SThomas Anderson return __r; 7953c3ccc00SThomas Anderson } 7963c3ccc00SThomas Anderson 7973c3ccc00SThomas Anderson template <class _Tp, class _Up> 798aa1cad15SEric Fiselier _LIBCPP_CONSTEXPR_AFTER_CXX17 7996e4ec602SEric Fiselier bool operator()(_Tp& __x, _Up& __y) 8003e519524SHoward Hinnant { 8013e519524SHoward Hinnant bool __r = __comp_(__x, __y); 8023e519524SHoward Hinnant if (__r) 803331d2159SEric Fiselier __do_compare_assert(0, __y, __x); 8043e519524SHoward Hinnant return __r; 8053e519524SHoward Hinnant } 806331d2159SEric Fiselier 807331d2159SEric Fiselier template <class _LHS, class _RHS> 808aa1cad15SEric Fiselier _LIBCPP_CONSTEXPR_AFTER_CXX17 809331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 810331d2159SEric Fiselier decltype((void)_VSTD::declval<_Compare&>()( 8116e4ec602SEric Fiselier _VSTD::declval<_LHS &>(), _VSTD::declval<_RHS &>())) 8126e4ec602SEric Fiselier __do_compare_assert(int, _LHS & __l, _RHS & __r) { 813331d2159SEric Fiselier _LIBCPP_ASSERT(!__comp_(__l, __r), 814331d2159SEric Fiselier "Comparator does not induce a strict weak ordering"); 815331d2159SEric Fiselier } 816331d2159SEric Fiselier 817331d2159SEric Fiselier template <class _LHS, class _RHS> 818aa1cad15SEric Fiselier _LIBCPP_CONSTEXPR_AFTER_CXX17 819331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 8206e4ec602SEric Fiselier void __do_compare_assert(long, _LHS &, _RHS &) {} 8213e519524SHoward Hinnant}; 8223e519524SHoward Hinnant 823145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 8243e519524SHoward Hinnant 825aa1cad15SEric Fiseliertemplate <class _Comp> 826aa1cad15SEric Fiselierstruct __comp_ref_type { 827aa1cad15SEric Fiselier // Pass the comparator by lvalue reference. Or in debug mode, using a 828aa1cad15SEric Fiselier // debugging wrapper that stores a reference. 829aa1cad15SEric Fiselier#ifndef _LIBCPP_DEBUG 830aa1cad15SEric Fiselier typedef typename add_lvalue_reference<_Comp>::type type; 831aa1cad15SEric Fiselier#else 832aa1cad15SEric Fiselier typedef __debug_less<_Comp> type; 833aa1cad15SEric Fiselier#endif 834aa1cad15SEric Fiselier}; 835aa1cad15SEric Fiselier 8363e519524SHoward Hinnant// all_of 8373e519524SHoward Hinnant 8383e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8391362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 8401362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8413e519524SHoward Hinnantbool 8423e519524SHoward Hinnantall_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// any_of 8513e519524SHoward Hinnant 8523e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8531362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 8541362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8553e519524SHoward Hinnantbool 8563e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8573e519524SHoward Hinnant{ 8583e519524SHoward Hinnant for (; __first != __last; ++__first) 8593e519524SHoward Hinnant if (__pred(*__first)) 8603e519524SHoward Hinnant return true; 8613e519524SHoward Hinnant return false; 8623e519524SHoward Hinnant} 8633e519524SHoward Hinnant 8643e519524SHoward Hinnant// none_of 8653e519524SHoward Hinnant 8663e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8671362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 8681362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8693e519524SHoward Hinnantbool 8703e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8713e519524SHoward Hinnant{ 8723e519524SHoward Hinnant for (; __first != __last; ++__first) 8733e519524SHoward Hinnant if (__pred(*__first)) 8743e519524SHoward Hinnant return false; 8753e519524SHoward Hinnant return true; 8763e519524SHoward Hinnant} 8773e519524SHoward Hinnant 8783e519524SHoward Hinnant// for_each 8793e519524SHoward Hinnant 8803e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 8811b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8823e519524SHoward Hinnant_Function 8833e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 8843e519524SHoward Hinnant{ 8853e519524SHoward Hinnant for (; __first != __last; ++__first) 8863e519524SHoward Hinnant __f(*__first); 8871c7fe126SMarshall Clow return __f; 8883e519524SHoward Hinnant} 8893e519524SHoward Hinnant 8901d02996dSMarshall Clow#if _LIBCPP_STD_VER > 14 891d5c65ffaSMarshall Clow// for_each_n 892d5c65ffaSMarshall Clow 893d5c65ffaSMarshall Clowtemplate <class _InputIterator, class _Size, class _Function> 8941b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 895d5c65ffaSMarshall Clow_InputIterator 896d5c65ffaSMarshall Clowfor_each_n(_InputIterator __first, _Size __orig_n, _Function __f) 897d5c65ffaSMarshall Clow{ 898d5c65ffaSMarshall Clow typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 899d5c65ffaSMarshall Clow _IntegralSize __n = __orig_n; 900d5c65ffaSMarshall Clow while (__n > 0) 901d5c65ffaSMarshall Clow { 902d5c65ffaSMarshall Clow __f(*__first); 903d5c65ffaSMarshall Clow ++__first; 904d5c65ffaSMarshall Clow --__n; 905d5c65ffaSMarshall Clow } 906d5c65ffaSMarshall Clow return __first; 907d5c65ffaSMarshall Clow} 9081d02996dSMarshall Clow#endif 909d5c65ffaSMarshall Clow 9103e519524SHoward Hinnant// find 9113e519524SHoward Hinnant 9123e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 9131362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 9141362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9153e519524SHoward Hinnant_InputIterator 916e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 9173e519524SHoward Hinnant{ 9183e519524SHoward Hinnant for (; __first != __last; ++__first) 919e4383379SHoward Hinnant if (*__first == __value_) 9203e519524SHoward Hinnant break; 9213e519524SHoward Hinnant return __first; 9223e519524SHoward Hinnant} 9233e519524SHoward Hinnant 9243e519524SHoward Hinnant// find_if 9253e519524SHoward Hinnant 9263e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 9271362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 9281362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9293e519524SHoward Hinnant_InputIterator 9303e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9313e519524SHoward Hinnant{ 9323e519524SHoward Hinnant for (; __first != __last; ++__first) 9333e519524SHoward Hinnant if (__pred(*__first)) 9343e519524SHoward Hinnant break; 9353e519524SHoward Hinnant return __first; 9363e519524SHoward Hinnant} 9373e519524SHoward Hinnant 9383e519524SHoward Hinnant// find_if_not 9393e519524SHoward Hinnant 9403e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 9411362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 9421362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9433e519524SHoward Hinnant_InputIterator 9443e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9453e519524SHoward Hinnant{ 9463e519524SHoward Hinnant for (; __first != __last; ++__first) 9473e519524SHoward Hinnant if (!__pred(*__first)) 9483e519524SHoward Hinnant break; 9493e519524SHoward Hinnant return __first; 9503e519524SHoward Hinnant} 9513e519524SHoward Hinnant 9523e519524SHoward Hinnant// find_end 9533e519524SHoward Hinnant 9543e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 9558694428eSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator1 9563e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9573e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 9583e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 9593e519524SHoward Hinnant{ 9603e519524SHoward Hinnant // modeled after search algorithm 9613e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 9623e519524SHoward Hinnant if (__first2 == __last2) 9633e519524SHoward Hinnant return __r; 9643e519524SHoward Hinnant while (true) 9653e519524SHoward Hinnant { 9663e519524SHoward Hinnant while (true) 9673e519524SHoward Hinnant { 9683e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 9693e519524SHoward Hinnant return __r; // (or __last1 if never found) 9703e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 9713e519524SHoward Hinnant break; 9723e519524SHoward Hinnant ++__first1; 9733e519524SHoward Hinnant } 9743e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 9753e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 9763e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 9773e519524SHoward Hinnant while (true) 9783e519524SHoward Hinnant { 9793e519524SHoward Hinnant if (++__m2 == __last2) 9803e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 9813e519524SHoward Hinnant __r = __first1; 9823e519524SHoward Hinnant ++__first1; 9833e519524SHoward Hinnant break; 9843e519524SHoward Hinnant } 9853e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 9863e519524SHoward Hinnant return __r; 9873e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 9883e519524SHoward Hinnant { 9893e519524SHoward Hinnant ++__first1; 9903e519524SHoward Hinnant break; 9913e519524SHoward Hinnant } // else there is a match, check next elements 9923e519524SHoward Hinnant } 9933e519524SHoward Hinnant } 9943e519524SHoward Hinnant} 9953e519524SHoward Hinnant 9963e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 9978694428eSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _BidirectionalIterator1 9983e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 9993e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 10003e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 10013e519524SHoward Hinnant{ 10023e519524SHoward Hinnant // modeled after search algorithm (in reverse) 10033e519524SHoward Hinnant if (__first2 == __last2) 10043e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 10053e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 10063e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 10073e519524SHoward Hinnant --__l2; 10083e519524SHoward Hinnant while (true) 10093e519524SHoward Hinnant { 10103e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 10113e519524SHoward Hinnant while (true) 10123e519524SHoward Hinnant { 10133e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 10143e519524SHoward Hinnant return __last1; 10153e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10163e519524SHoward Hinnant break; 10173e519524SHoward Hinnant } 10183e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 10193e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 10203e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 10213e519524SHoward Hinnant while (true) 10223e519524SHoward Hinnant { 10233e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 10243e519524SHoward Hinnant return __m1; 10253e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 10263e519524SHoward Hinnant return __last1; 10273e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 10283e519524SHoward Hinnant { 10293e519524SHoward Hinnant break; 10303e519524SHoward Hinnant } // else there is a match, check next elements 10313e519524SHoward Hinnant } 10323e519524SHoward Hinnant } 10333e519524SHoward Hinnant} 10343e519524SHoward Hinnant 10353e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 10369b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1 10373e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 10383e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 10393e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 10403e519524SHoward Hinnant{ 10413e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 10423e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 10433e519524SHoward Hinnant if (__len2 == 0) 10443e519524SHoward Hinnant return __last1; 10453e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 10463e519524SHoward Hinnant if (__len1 < __len2) 10473e519524SHoward Hinnant return __last1; 10483e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 10493e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 10503e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 10513e519524SHoward Hinnant --__l2; 10523e519524SHoward Hinnant while (true) 10533e519524SHoward Hinnant { 10543e519524SHoward Hinnant while (true) 10553e519524SHoward Hinnant { 10563e519524SHoward Hinnant if (__s == __l1) 10573e519524SHoward Hinnant return __last1; 10583e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10593e519524SHoward Hinnant break; 10603e519524SHoward Hinnant } 10613e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 10623e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 10633e519524SHoward Hinnant while (true) 10643e519524SHoward Hinnant { 10653e519524SHoward Hinnant if (__m2 == __first2) 10663e519524SHoward Hinnant return __m1; 10673e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 10683e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 10693e519524SHoward Hinnant { 10703e519524SHoward Hinnant break; 10713e519524SHoward Hinnant } 10723e519524SHoward Hinnant } 10733e519524SHoward Hinnant } 10743e519524SHoward Hinnant} 10753e519524SHoward Hinnant 10763e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10771362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 10781362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10793e519524SHoward Hinnant_ForwardIterator1 10803e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10813e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10823e519524SHoward Hinnant{ 1083ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 10843e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 10853e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 10863e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 10873e519524SHoward Hinnant} 10883e519524SHoward Hinnant 10893e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10901362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 10911362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10923e519524SHoward Hinnant_ForwardIterator1 10933e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10943e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10953e519524SHoward Hinnant{ 10963e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10973e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1098ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10993e519524SHoward Hinnant} 11003e519524SHoward Hinnant 11013e519524SHoward Hinnant// find_first_of 11023e519524SHoward Hinnant 11033e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11049b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1 11059b0af34dSMarshall Clow__find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11063e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11073e519524SHoward Hinnant{ 11083e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 11093e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 11103e519524SHoward Hinnant if (__pred(*__first1, *__j)) 11113e519524SHoward Hinnant return __first1; 11123e519524SHoward Hinnant return __last1; 11133e519524SHoward Hinnant} 11143e519524SHoward Hinnant 11159b0af34dSMarshall Clow 11169b0af34dSMarshall Clowtemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11171362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 11181362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11199b0af34dSMarshall Clow_ForwardIterator1 11209b0af34dSMarshall Clowfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11219b0af34dSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11229b0af34dSMarshall Clow{ 11239b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); 11249b0af34dSMarshall Clow} 11259b0af34dSMarshall Clow 11263e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 11271362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 11281362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11293e519524SHoward Hinnant_ForwardIterator1 11303e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11313e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 11323e519524SHoward Hinnant{ 11333e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 11343e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 11359b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11363e519524SHoward Hinnant} 11373e519524SHoward Hinnant 11383e519524SHoward Hinnant// adjacent_find 11393e519524SHoward Hinnant 11403e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 11411362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 11421362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11433e519524SHoward Hinnant_ForwardIterator 11443e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 11453e519524SHoward Hinnant{ 11463e519524SHoward Hinnant if (__first != __last) 11473e519524SHoward Hinnant { 11483e519524SHoward Hinnant _ForwardIterator __i = __first; 11493e519524SHoward Hinnant while (++__i != __last) 11503e519524SHoward Hinnant { 11513e519524SHoward Hinnant if (__pred(*__first, *__i)) 11523e519524SHoward Hinnant return __first; 11533e519524SHoward Hinnant __first = __i; 11543e519524SHoward Hinnant } 11553e519524SHoward Hinnant } 11563e519524SHoward Hinnant return __last; 11573e519524SHoward Hinnant} 11583e519524SHoward Hinnant 11593e519524SHoward Hinnanttemplate <class _ForwardIterator> 11601362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 11611362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11623e519524SHoward Hinnant_ForwardIterator 11633e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 11643e519524SHoward Hinnant{ 11653e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1166ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 11673e519524SHoward Hinnant} 11683e519524SHoward Hinnant 11693e519524SHoward Hinnant// count 11703e519524SHoward Hinnant 11713e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 11721362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 11731362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11743e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1175e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 11763e519524SHoward Hinnant{ 11773e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11783e519524SHoward Hinnant for (; __first != __last; ++__first) 1179e4383379SHoward Hinnant if (*__first == __value_) 11803e519524SHoward Hinnant ++__r; 11813e519524SHoward Hinnant return __r; 11823e519524SHoward Hinnant} 11833e519524SHoward Hinnant 11843e519524SHoward Hinnant// count_if 11853e519524SHoward Hinnant 11863e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 11871362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 11881362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11893e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 11903e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 11913e519524SHoward Hinnant{ 11923e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11933e519524SHoward Hinnant for (; __first != __last; ++__first) 11943e519524SHoward Hinnant if (__pred(*__first)) 11953e519524SHoward Hinnant ++__r; 11963e519524SHoward Hinnant return __r; 11973e519524SHoward Hinnant} 11983e519524SHoward Hinnant 11993e519524SHoward Hinnant// mismatch 12003e519524SHoward Hinnant 12013e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12021362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 12031362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12043e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 12053e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12063e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 12073e519524SHoward Hinnant{ 1208bd7c7b55SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__first2) 12093e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12103e519524SHoward Hinnant break; 12113e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 12123e519524SHoward Hinnant} 12133e519524SHoward Hinnant 12143e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 12151362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 12161362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12173e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 12183e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12193e519524SHoward Hinnant{ 12203e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12213e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1222ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12233e519524SHoward Hinnant} 12243e519524SHoward Hinnant 12250b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12260b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12271362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 12281362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12290b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 12300b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12310b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 12320b0bbd2fSMarshall Clow _BinaryPredicate __pred) 12330b0bbd2fSMarshall Clow{ 1234bd7c7b55SMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 12350b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 12360b0bbd2fSMarshall Clow break; 12370b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 12380b0bbd2fSMarshall Clow} 12390b0bbd2fSMarshall Clow 12400b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 12411362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 12421362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12430b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 12440b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12450b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12460b0bbd2fSMarshall Clow{ 12470b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12480b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12490b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 12500b0bbd2fSMarshall Clow} 12510b0bbd2fSMarshall Clow#endif 12520b0bbd2fSMarshall Clow 12533e519524SHoward Hinnant// equal 12543e519524SHoward Hinnant 12553e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12561362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 12571362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12583e519524SHoward Hinnantbool 12593e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 12603e519524SHoward Hinnant{ 1261910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 12623e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12633e519524SHoward Hinnant return false; 12643e519524SHoward Hinnant return true; 12653e519524SHoward Hinnant} 12663e519524SHoward Hinnant 12673e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 12681362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 12691362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12703e519524SHoward Hinnantbool 12713e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12723e519524SHoward Hinnant{ 12733e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12743e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1275ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12763e519524SHoward Hinnant} 12773e519524SHoward Hinnant 12780b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12790b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 12806538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12810b0bbd2fSMarshall Clowbool 12820b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 12830b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 12840b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 12850b0bbd2fSMarshall Clow{ 1286910285b2SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 12870b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 12880b0bbd2fSMarshall Clow return false; 12890b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 12900b0bbd2fSMarshall Clow} 12910b0bbd2fSMarshall Clow 12920b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 12936538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12940b0bbd2fSMarshall Clowbool 12950b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 12960b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 12970b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 12980b0bbd2fSMarshall Clow{ 12990b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 13000b0bbd2fSMarshall Clow return false; 13010b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 13020b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 13030b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 13040b0bbd2fSMarshall Clow} 13050b0bbd2fSMarshall Clow 13060b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 13071362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 13081362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13090b0bbd2fSMarshall Clowbool 13100b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 13110b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 13120b0bbd2fSMarshall Clow{ 13130b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 13140b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 13150b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 13160b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 13170b0bbd2fSMarshall Clow} 13180b0bbd2fSMarshall Clow 13190b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 13201362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 13211362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13220b0bbd2fSMarshall Clowbool 13230b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 13240b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 13250b0bbd2fSMarshall Clow{ 13260b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13270b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 13280b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 13290b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 13300b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 13310b0bbd2fSMarshall Clow} 13320b0bbd2fSMarshall Clow#endif 13330b0bbd2fSMarshall Clow 13343e519524SHoward Hinnant// is_permutation 13353e519524SHoward Hinnant 13363e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 13371362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 bool 13383e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13393e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 13403e519524SHoward Hinnant{ 134149c7643cSMarshall Clow// shorten sequences as much as possible by lopping of any equal prefix 1342910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 13433e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 134449c7643cSMarshall Clow break; 134549c7643cSMarshall Clow if (__first1 == __last1) 13463e519524SHoward Hinnant return true; 134749c7643cSMarshall Clow 13483e519524SHoward Hinnant// __first1 != __last1 && *__first1 != *__first2 13493e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1350ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 13513e519524SHoward Hinnant if (__l1 == _D1(1)) 13523e519524SHoward Hinnant return false; 1353ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 13543e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 13553e519524SHoward Hinnant // equal elements in [f2, l2) 13563e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13573e519524SHoward Hinnant { 13583e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 1359939b1623SPeter Collingbourne _ForwardIterator1 __match = __first1; 1360939b1623SPeter Collingbourne for (; __match != __i; ++__match) 1361939b1623SPeter Collingbourne if (__pred(*__match, *__i)) 1362939b1623SPeter Collingbourne break; 1363939b1623SPeter Collingbourne if (__match == __i) { 13643e519524SHoward Hinnant // Count number of *__i in [f2, l2) 13653e519524SHoward Hinnant _D1 __c2 = 0; 13663e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13673e519524SHoward Hinnant if (__pred(*__i, *__j)) 13683e519524SHoward Hinnant ++__c2; 13693e519524SHoward Hinnant if (__c2 == 0) 13703e519524SHoward Hinnant return false; 13713e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 13723e519524SHoward Hinnant _D1 __c1 = 1; 1373ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13743e519524SHoward Hinnant if (__pred(*__i, *__j)) 13753e519524SHoward Hinnant ++__c1; 13763e519524SHoward Hinnant if (__c1 != __c2) 13773e519524SHoward Hinnant return false; 13783e519524SHoward Hinnant } 13793e519524SHoward Hinnant } 13803e519524SHoward Hinnant return true; 13813e519524SHoward Hinnant} 13823e519524SHoward Hinnant 13833e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 13841362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 13851362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13863e519524SHoward Hinnantbool 13873e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13883e519524SHoward Hinnant _ForwardIterator2 __first2) 13893e519524SHoward Hinnant{ 13903e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 13913e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1392ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 13933e519524SHoward Hinnant} 13943e519524SHoward Hinnant 13950b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 13960b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 139749c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 13980b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13990b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 14000b0bbd2fSMarshall Clow _BinaryPredicate __pred, 14010b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 14020b0bbd2fSMarshall Clow{ 140349c7643cSMarshall Clow// shorten sequences as much as possible by lopping of any equal prefix 1404847ee131SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 14050b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 140649c7643cSMarshall Clow break; 140749c7643cSMarshall Clow if (__first1 == __last1) 140849c7643cSMarshall Clow return __first2 == __last2; 140949c7643cSMarshall Clow else if (__first2 == __last2) 141049c7643cSMarshall Clow return false; 141149c7643cSMarshall Clow 14120b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 14130b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 14140b0bbd2fSMarshall Clow 14150b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1416fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 14170b0bbd2fSMarshall Clow if (__l1 != __l2) 14180b0bbd2fSMarshall Clow return false; 14190b0bbd2fSMarshall Clow 14200b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 14210b0bbd2fSMarshall Clow // equal elements in [f2, l2) 14220b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 14230b0bbd2fSMarshall Clow { 14240b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 1425939b1623SPeter Collingbourne _ForwardIterator1 __match = __first1; 1426939b1623SPeter Collingbourne for (; __match != __i; ++__match) 1427939b1623SPeter Collingbourne if (__pred(*__match, *__i)) 1428939b1623SPeter Collingbourne break; 1429939b1623SPeter Collingbourne if (__match == __i) { 14300b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 14310b0bbd2fSMarshall Clow _D1 __c2 = 0; 14320b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 14330b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 14340b0bbd2fSMarshall Clow ++__c2; 14350b0bbd2fSMarshall Clow if (__c2 == 0) 14360b0bbd2fSMarshall Clow return false; 14370b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 14380b0bbd2fSMarshall Clow _D1 __c1 = 1; 14390b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 14400b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 14410b0bbd2fSMarshall Clow ++__c1; 14420b0bbd2fSMarshall Clow if (__c1 != __c2) 14430b0bbd2fSMarshall Clow return false; 14440b0bbd2fSMarshall Clow } 14450b0bbd2fSMarshall Clow } 14460b0bbd2fSMarshall Clow return true; 14470b0bbd2fSMarshall Clow} 14480b0bbd2fSMarshall Clow 14490b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 145049c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 14510b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 14520b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 14530b0bbd2fSMarshall Clow _BinaryPredicate __pred, 14540b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 14550b0bbd2fSMarshall Clow{ 14560b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 14570b0bbd2fSMarshall Clow return false; 14580b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 14590b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 14600b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 14610b0bbd2fSMarshall Clow} 14620b0bbd2fSMarshall Clow 14630b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 14641362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 14651362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14660b0bbd2fSMarshall Clowbool 14670b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14680b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 14690b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 14700b0bbd2fSMarshall Clow{ 14710b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 14720b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 14730b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 14740b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14750b0bbd2fSMarshall Clow} 14760b0bbd2fSMarshall Clow 14770b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 14781362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 14791362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14800b0bbd2fSMarshall Clowbool 14810b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14820b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 14830b0bbd2fSMarshall Clow{ 14840b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 14850b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 14860b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 14870b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 14880b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 14890b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14900b0bbd2fSMarshall Clow} 14910b0bbd2fSMarshall Clow#endif 14920b0bbd2fSMarshall Clow 14933e519524SHoward Hinnant// search 1494d835e592SMarshall Clow// __search is in <functional> 14953e519524SHoward Hinnant 14963e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 14971362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 14981362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14993e519524SHoward Hinnant_ForwardIterator1 15003e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15013e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 15023e519524SHoward Hinnant{ 1503ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 15043e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 150528cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 150628cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()) 150728cc4ddeSMarshall Clow .first; 15083e519524SHoward Hinnant} 15093e519524SHoward Hinnant 15103e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 15111362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 15121362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 15133e519524SHoward Hinnant_ForwardIterator1 15143e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15153e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15163e519524SHoward Hinnant{ 151728cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 151828cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1519ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 15203e519524SHoward Hinnant} 15213e519524SHoward Hinnant 1522d835e592SMarshall Clow 1523d835e592SMarshall Clow#if _LIBCPP_STD_VER > 14 1524d835e592SMarshall Clowtemplate <class _ForwardIterator, class _Searcher> 15251362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1526d835e592SMarshall Clow_ForwardIterator search(_ForwardIterator __f, _ForwardIterator __l, const _Searcher &__s) 1527d835e592SMarshall Clow{ return __s(__f, __l).first; } 1528d835e592SMarshall Clow#endif 1529d835e592SMarshall Clow 15303e519524SHoward Hinnant// search_n 15313e519524SHoward Hinnant 15323e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 153312f0a779SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 15343e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1535e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 15363e519524SHoward Hinnant{ 15373e519524SHoward Hinnant if (__count <= 0) 15383e519524SHoward Hinnant return __first; 15393e519524SHoward Hinnant while (true) 15403e519524SHoward Hinnant { 1541e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 15423e519524SHoward Hinnant while (true) 15433e519524SHoward Hinnant { 1544e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 15453e519524SHoward Hinnant return __last; 1546e4383379SHoward Hinnant if (__pred(*__first, __value_)) 15473e519524SHoward Hinnant break; 15483e519524SHoward Hinnant ++__first; 15493e519524SHoward Hinnant } 1550e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 15513e519524SHoward Hinnant _ForwardIterator __m = __first; 15523e519524SHoward Hinnant _Size __c(0); 15533e519524SHoward Hinnant while (true) 15543e519524SHoward Hinnant { 15553e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 15563e519524SHoward Hinnant return __first; 15573e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 15583e519524SHoward Hinnant return __last; 1559e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 15603e519524SHoward Hinnant { 15613e519524SHoward Hinnant __first = __m; 15623e519524SHoward Hinnant ++__first; 15633e519524SHoward Hinnant break; 15643e519524SHoward Hinnant } // else there is a match, check next elements 15653e519524SHoward Hinnant } 15663e519524SHoward Hinnant } 15673e519524SHoward Hinnant} 15683e519524SHoward Hinnant 15693e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 157012f0a779SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 15713e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1572e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 15733e519524SHoward Hinnant{ 15743e519524SHoward Hinnant if (__count <= 0) 15753e519524SHoward Hinnant return __first; 15763e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 15773e519524SHoward Hinnant if (__len < __count) 15783e519524SHoward Hinnant return __last; 15793e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 15803e519524SHoward Hinnant while (true) 15813e519524SHoward Hinnant { 1582e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 15833e519524SHoward Hinnant while (true) 15843e519524SHoward Hinnant { 1585b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 15863e519524SHoward Hinnant return __last; 1587e4383379SHoward Hinnant if (__pred(*__first, __value_)) 15883e519524SHoward Hinnant break; 15893e519524SHoward Hinnant ++__first; 15903e519524SHoward Hinnant } 1591e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 15923e519524SHoward Hinnant _RandomAccessIterator __m = __first; 15933e519524SHoward Hinnant _Size __c(0); 15943e519524SHoward Hinnant while (true) 15953e519524SHoward Hinnant { 15963e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 15973e519524SHoward Hinnant return __first; 15983e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1599e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16003e519524SHoward Hinnant { 16013e519524SHoward Hinnant __first = __m; 16023e519524SHoward Hinnant ++__first; 16033e519524SHoward Hinnant break; 16043e519524SHoward Hinnant } // else there is a match, check next elements 16053e519524SHoward Hinnant } 16063e519524SHoward Hinnant } 16073e519524SHoward Hinnant} 16083e519524SHoward Hinnant 16093e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 16101362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 16111362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 16123e519524SHoward Hinnant_ForwardIterator 16133e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1614e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 16153e519524SHoward Hinnant{ 1616ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 161751544023SEric Fiselier (__first, __last, __convert_to_integral(__count), __value_, __pred, 161851544023SEric Fiselier typename iterator_traits<_ForwardIterator>::iterator_category()); 16193e519524SHoward Hinnant} 16203e519524SHoward Hinnant 16213e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 16221362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 16231362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 16243e519524SHoward Hinnant_ForwardIterator 1625e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 16263e519524SHoward Hinnant{ 16273e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 162851544023SEric Fiselier return _VSTD::search_n(__first, __last, __convert_to_integral(__count), 162951544023SEric Fiselier __value_, __equal_to<__v, _Tp>()); 16303e519524SHoward Hinnant} 16313e519524SHoward Hinnant 16323e519524SHoward Hinnant// copy 16333e519524SHoward Hinnanttemplate <class _Iter> 163413c90a57SLouis Dionneinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 16353e519524SHoward Hinnant_Iter 16363e519524SHoward Hinnant__unwrap_iter(_Iter __i) 16373e519524SHoward Hinnant{ 16383e519524SHoward Hinnant return __i; 16393e519524SHoward Hinnant} 16403e519524SHoward Hinnant 16413e519524SHoward Hinnanttemplate <class _Tp> 164213c90a57SLouis Dionneinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 16433e519524SHoward Hinnanttypename enable_if 16443e519524SHoward Hinnant< 1645ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 16463e519524SHoward Hinnant _Tp* 16473e519524SHoward Hinnant>::type 16483e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 16493e519524SHoward Hinnant{ 16503e519524SHoward Hinnant return __i.base(); 16513e519524SHoward Hinnant} 16523e519524SHoward Hinnant 1653fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1654fc88dbd2SHoward Hinnant 16553e519524SHoward Hinnanttemplate <class _Tp> 16569cad5025SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG 16573e519524SHoward Hinnanttypename enable_if 16583e519524SHoward Hinnant< 1659ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 16603e519524SHoward Hinnant _Tp* 16613e519524SHoward Hinnant>::type 16623e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 16633e519524SHoward Hinnant{ 16643e519524SHoward Hinnant return __i.base(); 16653e519524SHoward Hinnant} 16663e519524SHoward Hinnant 1667c8879ab2SMarshall Clowtemplate <class _Tp> 1668c8879ab2SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG 1669c8879ab2SMarshall Clowtypename enable_if 1670c8879ab2SMarshall Clow< 1671c8879ab2SMarshall Clow is_trivially_copy_assignable<_Tp>::value, 1672c8879ab2SMarshall Clow const _Tp* 1673c8879ab2SMarshall Clow>::type 1674c8879ab2SMarshall Clow__unwrap_iter(__wrap_iter<const _Tp*> __i) 1675c8879ab2SMarshall Clow{ 1676c8879ab2SMarshall Clow return __i.base(); 1677c8879ab2SMarshall Clow} 1678c8879ab2SMarshall Clow 167914bd0bf0SEric Fiselier#else 168014bd0bf0SEric Fiselier 168114bd0bf0SEric Fiseliertemplate <class _Tp> 16829cad5025SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG 168314bd0bf0SEric Fiseliertypename enable_if 168414bd0bf0SEric Fiselier< 168514bd0bf0SEric Fiselier is_trivially_copy_assignable<_Tp>::value, 168614bd0bf0SEric Fiselier __wrap_iter<_Tp*> 168714bd0bf0SEric Fiselier>::type 168814bd0bf0SEric Fiselier__unwrap_iter(__wrap_iter<_Tp*> __i) 168914bd0bf0SEric Fiselier{ 169014bd0bf0SEric Fiselier return __i; 169114bd0bf0SEric Fiselier} 169214bd0bf0SEric Fiselier 1693fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1694fc88dbd2SHoward Hinnant 16953e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 169613c90a57SLouis Dionneinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 16973e519524SHoward Hinnant_OutputIterator 169813c90a57SLouis Dionne__copy_constexpr(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 16993e519524SHoward Hinnant{ 1700910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 17013e519524SHoward Hinnant *__result = *__first; 17023e519524SHoward Hinnant return __result; 17033e519524SHoward Hinnant} 17043e519524SHoward Hinnant 170513c90a57SLouis Dionnetemplate <class _InputIterator, class _OutputIterator> 170613c90a57SLouis Dionneinline _LIBCPP_INLINE_VISIBILITY 170713c90a57SLouis Dionne_OutputIterator 170813c90a57SLouis Dionne__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 170913c90a57SLouis Dionne{ 171013c90a57SLouis Dionne return __copy_constexpr(__first, __last, __result); 171113c90a57SLouis Dionne} 171213c90a57SLouis Dionne 17133e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17153e519524SHoward Hinnanttypename enable_if 17163e519524SHoward Hinnant< 17173e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1718ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17193e519524SHoward Hinnant _Up* 17203e519524SHoward Hinnant>::type 17213e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 17223e519524SHoward Hinnant{ 17233e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17245b312052SMarshall Clow if (__n > 0) 1725ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17263e519524SHoward Hinnant return __result + __n; 17273e519524SHoward Hinnant} 17283e519524SHoward Hinnant 17293e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 173083901cbeSLouis Dionneinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17_WITH_IS_CONSTANT_EVALUATED 17313e519524SHoward Hinnant_OutputIterator 17323e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17333e519524SHoward Hinnant{ 173413c90a57SLouis Dionne if (__libcpp_is_constant_evaluated()) { 173513c90a57SLouis Dionne return _VSTD::__copy_constexpr( 173613c90a57SLouis Dionne __unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 173713c90a57SLouis Dionne } else { 173813c90a57SLouis Dionne return _VSTD::__copy( 173913c90a57SLouis Dionne __unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 174013c90a57SLouis Dionne } 17413e519524SHoward Hinnant} 17423e519524SHoward Hinnant 17433e519524SHoward Hinnant// copy_backward 17443e519524SHoward Hinnant 1745d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 174613c90a57SLouis Dionneinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 174713c90a57SLouis Dionne_OutputIterator 174813c90a57SLouis Dionne__copy_backward_constexpr(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 174913c90a57SLouis Dionne{ 175013c90a57SLouis Dionne while (__first != __last) 175113c90a57SLouis Dionne *--__result = *--__last; 175213c90a57SLouis Dionne return __result; 175313c90a57SLouis Dionne} 175413c90a57SLouis Dionne 175513c90a57SLouis Dionnetemplate <class _BidirectionalIterator, class _OutputIterator> 17563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17573e519524SHoward Hinnant_OutputIterator 1758d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 17593e519524SHoward Hinnant{ 176013c90a57SLouis Dionne return __copy_backward_constexpr(__first, __last, __result); 17613e519524SHoward Hinnant} 17623e519524SHoward Hinnant 17633e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17653e519524SHoward Hinnanttypename enable_if 17663e519524SHoward Hinnant< 17673e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1768ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17693e519524SHoward Hinnant _Up* 17703e519524SHoward Hinnant>::type 17713e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 17723e519524SHoward Hinnant{ 17733e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17745b312052SMarshall Clow if (__n > 0) 17755b312052SMarshall Clow { 17763e519524SHoward Hinnant __result -= __n; 1777ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17785b312052SMarshall Clow } 17793e519524SHoward Hinnant return __result; 17803e519524SHoward Hinnant} 17813e519524SHoward Hinnant 17823e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 178383901cbeSLouis Dionneinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17_WITH_IS_CONSTANT_EVALUATED 17843e519524SHoward Hinnant_BidirectionalIterator2 17853e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 17863e519524SHoward Hinnant _BidirectionalIterator2 __result) 17873e519524SHoward Hinnant{ 178813c90a57SLouis Dionne if (__libcpp_is_constant_evaluated()) { 178913c90a57SLouis Dionne return _VSTD::__copy_backward_constexpr(__unwrap_iter(__first), 179013c90a57SLouis Dionne __unwrap_iter(__last), 179113c90a57SLouis Dionne __unwrap_iter(__result)); 179213c90a57SLouis Dionne } else { 1793fd838227SEric Fiselier return _VSTD::__copy_backward(__unwrap_iter(__first), 1794fd838227SEric Fiselier __unwrap_iter(__last), 1795fd838227SEric Fiselier __unwrap_iter(__result)); 17963e519524SHoward Hinnant } 179713c90a57SLouis Dionne} 17983e519524SHoward Hinnant 17993e519524SHoward Hinnant// copy_if 18003e519524SHoward Hinnant 18013e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 180213c90a57SLouis Dionneinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18033e519524SHoward Hinnant_OutputIterator 18043e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 18053e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 18063e519524SHoward Hinnant{ 18073e519524SHoward Hinnant for (; __first != __last; ++__first) 18083e519524SHoward Hinnant { 18093e519524SHoward Hinnant if (__pred(*__first)) 18103e519524SHoward Hinnant { 18113e519524SHoward Hinnant *__result = *__first; 18123e519524SHoward Hinnant ++__result; 18133e519524SHoward Hinnant } 18143e519524SHoward Hinnant } 18153e519524SHoward Hinnant return __result; 18163e519524SHoward Hinnant} 18173e519524SHoward Hinnant 18183e519524SHoward Hinnant// copy_n 18193e519524SHoward Hinnant 18203e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 182183901cbeSLouis Dionneinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17_WITH_IS_CONSTANT_EVALUATED 18223e519524SHoward Hinnanttypename enable_if 18233e519524SHoward Hinnant< 1824*f82dba01SEric Fiselier __is_cpp17_input_iterator<_InputIterator>::value && 1825*f82dba01SEric Fiselier !__is_cpp17_random_access_iterator<_InputIterator>::value, 18263e519524SHoward Hinnant _OutputIterator 18273e519524SHoward Hinnant>::type 182851544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18293e519524SHoward Hinnant{ 183051544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 183151544023SEric Fiselier _IntegralSize __n = __orig_n; 183299847d2bSHoward Hinnant if (__n > 0) 183399847d2bSHoward Hinnant { 18343e519524SHoward Hinnant *__result = *__first; 183599847d2bSHoward Hinnant ++__result; 183699847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 183799847d2bSHoward Hinnant { 183899847d2bSHoward Hinnant ++__first; 183999847d2bSHoward Hinnant *__result = *__first; 184099847d2bSHoward Hinnant ++__result; 184199847d2bSHoward Hinnant } 184299847d2bSHoward Hinnant } 18433e519524SHoward Hinnant return __result; 18443e519524SHoward Hinnant} 18453e519524SHoward Hinnant 18463e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 184783901cbeSLouis Dionneinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17_WITH_IS_CONSTANT_EVALUATED 18483e519524SHoward Hinnanttypename enable_if 18493e519524SHoward Hinnant< 1850*f82dba01SEric Fiselier __is_cpp17_random_access_iterator<_InputIterator>::value, 18513e519524SHoward Hinnant _OutputIterator 18523e519524SHoward Hinnant>::type 185351544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18543e519524SHoward Hinnant{ 185551544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 185651544023SEric Fiselier _IntegralSize __n = __orig_n; 1857ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 18583e519524SHoward Hinnant} 18593e519524SHoward Hinnant 18603e519524SHoward Hinnant// move 18613e519524SHoward Hinnant 18623e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18643e519524SHoward Hinnant_OutputIterator 18653e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18663e519524SHoward Hinnant{ 1867910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1868ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 18693e519524SHoward Hinnant return __result; 18703e519524SHoward Hinnant} 18713e519524SHoward Hinnant 18723e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18743e519524SHoward Hinnanttypename enable_if 18753e519524SHoward Hinnant< 18763e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1877ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18783e519524SHoward Hinnant _Up* 18793e519524SHoward Hinnant>::type 18803e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 18813e519524SHoward Hinnant{ 18823e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18835b312052SMarshall Clow if (__n > 0) 1884ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18853e519524SHoward Hinnant return __result + __n; 18863e519524SHoward Hinnant} 18873e519524SHoward Hinnant 18883e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18903e519524SHoward Hinnant_OutputIterator 18913e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18923e519524SHoward Hinnant{ 1893ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18943e519524SHoward Hinnant} 18953e519524SHoward Hinnant 18963e519524SHoward Hinnant// move_backward 18973e519524SHoward Hinnant 18983e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19003e519524SHoward Hinnant_OutputIterator 19013e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19023e519524SHoward Hinnant{ 19033e519524SHoward Hinnant while (__first != __last) 1904ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 19053e519524SHoward Hinnant return __result; 19063e519524SHoward Hinnant} 19073e519524SHoward Hinnant 19083e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19103e519524SHoward Hinnanttypename enable_if 19113e519524SHoward Hinnant< 19123e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1913ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19143e519524SHoward Hinnant _Up* 19153e519524SHoward Hinnant>::type 19163e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 19173e519524SHoward Hinnant{ 19183e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19195b312052SMarshall Clow if (__n > 0) 19205b312052SMarshall Clow { 19213e519524SHoward Hinnant __result -= __n; 1922ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19235b312052SMarshall Clow } 19243e519524SHoward Hinnant return __result; 19253e519524SHoward Hinnant} 19263e519524SHoward Hinnant 19273e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 19283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19293e519524SHoward Hinnant_BidirectionalIterator2 19303e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 19313e519524SHoward Hinnant _BidirectionalIterator2 __result) 19323e519524SHoward Hinnant{ 1933ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19343e519524SHoward Hinnant} 19353e519524SHoward Hinnant 19363e519524SHoward Hinnant// iter_swap 19373e519524SHoward Hinnant 1938a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 19393e519524SHoward Hinnant 19403e519524SHoward Hinnant// transform 19413e519524SHoward Hinnant 19423e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 194399894b61SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19443e519524SHoward Hinnant_OutputIterator 19453e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 19463e519524SHoward Hinnant{ 1947910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19483e519524SHoward Hinnant *__result = __op(*__first); 19493e519524SHoward Hinnant return __result; 19503e519524SHoward Hinnant} 19513e519524SHoward Hinnant 19523e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 195399894b61SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19543e519524SHoward Hinnant_OutputIterator 19553e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 19563e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 19573e519524SHoward Hinnant{ 1958910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 19593e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 19603e519524SHoward Hinnant return __result; 19613e519524SHoward Hinnant} 19623e519524SHoward Hinnant 19633e519524SHoward Hinnant// replace 19643e519524SHoward Hinnant 19653e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 196612c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19673e519524SHoward Hinnantvoid 19683e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 19693e519524SHoward Hinnant{ 19703e519524SHoward Hinnant for (; __first != __last; ++__first) 19713e519524SHoward Hinnant if (*__first == __old_value) 19723e519524SHoward Hinnant *__first = __new_value; 19733e519524SHoward Hinnant} 19743e519524SHoward Hinnant 19753e519524SHoward Hinnant// replace_if 19763e519524SHoward Hinnant 19773e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 197812c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19793e519524SHoward Hinnantvoid 19803e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 19813e519524SHoward Hinnant{ 19823e519524SHoward Hinnant for (; __first != __last; ++__first) 19833e519524SHoward Hinnant if (__pred(*__first)) 19843e519524SHoward Hinnant *__first = __new_value; 19853e519524SHoward Hinnant} 19863e519524SHoward Hinnant 19873e519524SHoward Hinnant// replace_copy 19883e519524SHoward Hinnant 19893e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 199012c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19913e519524SHoward Hinnant_OutputIterator 19923e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19933e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 19943e519524SHoward Hinnant{ 1995910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19963e519524SHoward Hinnant if (*__first == __old_value) 19973e519524SHoward Hinnant *__result = __new_value; 19983e519524SHoward Hinnant else 19993e519524SHoward Hinnant *__result = *__first; 20003e519524SHoward Hinnant return __result; 20013e519524SHoward Hinnant} 20023e519524SHoward Hinnant 20033e519524SHoward Hinnant// replace_copy_if 20043e519524SHoward Hinnant 20053e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 200612c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20073e519524SHoward Hinnant_OutputIterator 20083e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20093e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 20103e519524SHoward Hinnant{ 2011910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20123e519524SHoward Hinnant if (__pred(*__first)) 20133e519524SHoward Hinnant *__result = __new_value; 20143e519524SHoward Hinnant else 20153e519524SHoward Hinnant *__result = *__first; 20163e519524SHoward Hinnant return __result; 20173e519524SHoward Hinnant} 20183e519524SHoward Hinnant 20193e519524SHoward Hinnant// fill_n 20203e519524SHoward Hinnant 20213e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20224bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20233e519524SHoward Hinnant_OutputIterator 20240f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20253e519524SHoward Hinnant{ 2026910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 2027e4383379SHoward Hinnant *__first = __value_; 20283e519524SHoward Hinnant return __first; 20293e519524SHoward Hinnant} 20303e519524SHoward Hinnant 20313e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20324bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20333e519524SHoward Hinnant_OutputIterator 2034e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20353e519524SHoward Hinnant{ 203651544023SEric Fiselier return _VSTD::__fill_n(__first, __convert_to_integral(__n), __value_); 20373e519524SHoward Hinnant} 20383e519524SHoward Hinnant 20393e519524SHoward Hinnant// fill 20403e519524SHoward Hinnant 20413e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20424bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20433e519524SHoward Hinnantvoid 2044e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 20453e519524SHoward Hinnant{ 20463e519524SHoward Hinnant for (; __first != __last; ++__first) 2047e4383379SHoward Hinnant *__first = __value_; 20483e519524SHoward Hinnant} 20493e519524SHoward Hinnant 20503e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 20514bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20523e519524SHoward Hinnantvoid 2053e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 20543e519524SHoward Hinnant{ 2055e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 20563e519524SHoward Hinnant} 20573e519524SHoward Hinnant 20583e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20594bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20603e519524SHoward Hinnantvoid 2061e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20623e519524SHoward Hinnant{ 2063e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 20643e519524SHoward Hinnant} 20653e519524SHoward Hinnant 20663e519524SHoward Hinnant// generate 20673e519524SHoward Hinnant 20683e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 20694bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20703e519524SHoward Hinnantvoid 20713e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 20723e519524SHoward Hinnant{ 20733e519524SHoward Hinnant for (; __first != __last; ++__first) 20743e519524SHoward Hinnant *__first = __gen(); 20753e519524SHoward Hinnant} 20763e519524SHoward Hinnant 20773e519524SHoward Hinnant// generate_n 20783e519524SHoward Hinnant 20793e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 20804bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20813e519524SHoward Hinnant_OutputIterator 208251544023SEric Fiseliergenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 20833e519524SHoward Hinnant{ 208451544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 208551544023SEric Fiselier _IntegralSize __n = __orig_n; 2086910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 20873e519524SHoward Hinnant *__first = __gen(); 20883e519524SHoward Hinnant return __first; 20893e519524SHoward Hinnant} 20903e519524SHoward Hinnant 20913e519524SHoward Hinnant// remove 20923e519524SHoward Hinnant 20933e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20941362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 2095e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20963e519524SHoward Hinnant{ 2097e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 20983e519524SHoward Hinnant if (__first != __last) 20993e519524SHoward Hinnant { 21003e519524SHoward Hinnant _ForwardIterator __i = __first; 21013e519524SHoward Hinnant while (++__i != __last) 21023e519524SHoward Hinnant { 2103e4383379SHoward Hinnant if (!(*__i == __value_)) 21043e519524SHoward Hinnant { 2105ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21063e519524SHoward Hinnant ++__first; 21073e519524SHoward Hinnant } 21083e519524SHoward Hinnant } 21093e519524SHoward Hinnant } 21103e519524SHoward Hinnant return __first; 21113e519524SHoward Hinnant} 21123e519524SHoward Hinnant 21133e519524SHoward Hinnant// remove_if 21143e519524SHoward Hinnant 21153e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 21161362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 21173e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 21183e519524SHoward Hinnant{ 2119ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 21203e519524SHoward Hinnant (__first, __last, __pred); 21213e519524SHoward Hinnant if (__first != __last) 21223e519524SHoward Hinnant { 21233e519524SHoward Hinnant _ForwardIterator __i = __first; 21243e519524SHoward Hinnant while (++__i != __last) 21253e519524SHoward Hinnant { 21263e519524SHoward Hinnant if (!__pred(*__i)) 21273e519524SHoward Hinnant { 2128ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21293e519524SHoward Hinnant ++__first; 21303e519524SHoward Hinnant } 21313e519524SHoward Hinnant } 21323e519524SHoward Hinnant } 21333e519524SHoward Hinnant return __first; 21343e519524SHoward Hinnant} 21353e519524SHoward Hinnant 21363e519524SHoward Hinnant// remove_copy 21373e519524SHoward Hinnant 21383e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 2139e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21403e519524SHoward Hinnant_OutputIterator 2141e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 21423e519524SHoward Hinnant{ 21433e519524SHoward Hinnant for (; __first != __last; ++__first) 21443e519524SHoward Hinnant { 2145e4383379SHoward Hinnant if (!(*__first == __value_)) 21463e519524SHoward Hinnant { 21473e519524SHoward Hinnant *__result = *__first; 21483e519524SHoward Hinnant ++__result; 21493e519524SHoward Hinnant } 21503e519524SHoward Hinnant } 21513e519524SHoward Hinnant return __result; 21523e519524SHoward Hinnant} 21533e519524SHoward Hinnant 21543e519524SHoward Hinnant// remove_copy_if 21553e519524SHoward Hinnant 21563e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 2157e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21583e519524SHoward Hinnant_OutputIterator 21593e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 21603e519524SHoward Hinnant{ 21613e519524SHoward Hinnant for (; __first != __last; ++__first) 21623e519524SHoward Hinnant { 21633e519524SHoward Hinnant if (!__pred(*__first)) 21643e519524SHoward Hinnant { 21653e519524SHoward Hinnant *__result = *__first; 21663e519524SHoward Hinnant ++__result; 21673e519524SHoward Hinnant } 21683e519524SHoward Hinnant } 21693e519524SHoward Hinnant return __result; 21703e519524SHoward Hinnant} 21713e519524SHoward Hinnant 21723e519524SHoward Hinnant// unique 21733e519524SHoward Hinnant 21743e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 21751362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 21763e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 21773e519524SHoward Hinnant{ 2178ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 21793e519524SHoward Hinnant (__first, __last, __pred); 21803e519524SHoward Hinnant if (__first != __last) 21813e519524SHoward Hinnant { 21823e519524SHoward Hinnant // ... a a ? ... 21833e519524SHoward Hinnant // f i 21843e519524SHoward Hinnant _ForwardIterator __i = __first; 21853e519524SHoward Hinnant for (++__i; ++__i != __last;) 21863e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2187ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 21883e519524SHoward Hinnant ++__first; 21893e519524SHoward Hinnant } 21903e519524SHoward Hinnant return __first; 21913e519524SHoward Hinnant} 21923e519524SHoward Hinnant 21933e519524SHoward Hinnanttemplate <class _ForwardIterator> 21941362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 21951362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21963e519524SHoward Hinnant_ForwardIterator 21973e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 21983e519524SHoward Hinnant{ 21993e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2200ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 22013e519524SHoward Hinnant} 22023e519524SHoward Hinnant 22033e519524SHoward Hinnant// unique_copy 22043e519524SHoward Hinnant 22053e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 22064bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 22073e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22083e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 22093e519524SHoward Hinnant{ 22103e519524SHoward Hinnant if (__first != __last) 22113e519524SHoward Hinnant { 22123e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 22133e519524SHoward Hinnant *__result = __t; 22143e519524SHoward Hinnant ++__result; 22153e519524SHoward Hinnant while (++__first != __last) 22163e519524SHoward Hinnant { 22173e519524SHoward Hinnant if (!__pred(__t, *__first)) 22183e519524SHoward Hinnant { 22193e519524SHoward Hinnant __t = *__first; 22203e519524SHoward Hinnant *__result = __t; 22213e519524SHoward Hinnant ++__result; 22223e519524SHoward Hinnant } 22233e519524SHoward Hinnant } 22243e519524SHoward Hinnant } 22253e519524SHoward Hinnant return __result; 22263e519524SHoward Hinnant} 22273e519524SHoward Hinnant 22283e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 22294bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 22303e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22313e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 22323e519524SHoward Hinnant{ 22333e519524SHoward Hinnant if (__first != __last) 22343e519524SHoward Hinnant { 22353e519524SHoward Hinnant _ForwardIterator __i = __first; 22363e519524SHoward Hinnant *__result = *__i; 22373e519524SHoward Hinnant ++__result; 22383e519524SHoward Hinnant while (++__first != __last) 22393e519524SHoward Hinnant { 22403e519524SHoward Hinnant if (!__pred(*__i, *__first)) 22413e519524SHoward Hinnant { 22423e519524SHoward Hinnant *__result = *__first; 22433e519524SHoward Hinnant ++__result; 22443e519524SHoward Hinnant __i = __first; 22453e519524SHoward Hinnant } 22463e519524SHoward Hinnant } 22473e519524SHoward Hinnant } 22483e519524SHoward Hinnant return __result; 22493e519524SHoward Hinnant} 22503e519524SHoward Hinnant 22513e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 22524bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 22533e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 22543e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 22553e519524SHoward Hinnant{ 22563e519524SHoward Hinnant if (__first != __last) 22573e519524SHoward Hinnant { 22583e519524SHoward Hinnant *__result = *__first; 22593e519524SHoward Hinnant while (++__first != __last) 22603e519524SHoward Hinnant if (!__pred(*__result, *__first)) 22613e519524SHoward Hinnant *++__result = *__first; 22623e519524SHoward Hinnant ++__result; 22633e519524SHoward Hinnant } 22643e519524SHoward Hinnant return __result; 22653e519524SHoward Hinnant} 22663e519524SHoward Hinnant 22673e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 22684bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 22693e519524SHoward Hinnant_OutputIterator 22703e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 22713e519524SHoward Hinnant{ 2272ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 22733e519524SHoward Hinnant (__first, __last, __result, __pred, 22743e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 22753e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 22763e519524SHoward Hinnant} 22773e519524SHoward Hinnant 22783e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 22794bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 22803e519524SHoward Hinnant_OutputIterator 22813e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 22823e519524SHoward Hinnant{ 22833e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2284ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 22853e519524SHoward Hinnant} 22863e519524SHoward Hinnant 22873e519524SHoward Hinnant// reverse 22883e519524SHoward Hinnant 22893e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 22903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22913e519524SHoward Hinnantvoid 22923e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 22933e519524SHoward Hinnant{ 22943e519524SHoward Hinnant while (__first != __last) 22953e519524SHoward Hinnant { 22963e519524SHoward Hinnant if (__first == --__last) 22973e519524SHoward Hinnant break; 2298def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 22993e519524SHoward Hinnant ++__first; 23003e519524SHoward Hinnant } 23013e519524SHoward Hinnant} 23023e519524SHoward Hinnant 23033e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 23043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23053e519524SHoward Hinnantvoid 23063e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 23073e519524SHoward Hinnant{ 23083e519524SHoward Hinnant if (__first != __last) 23093e519524SHoward Hinnant for (; __first < --__last; ++__first) 2310def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23113e519524SHoward Hinnant} 23123e519524SHoward Hinnant 23133e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23153e519524SHoward Hinnantvoid 23163e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 23173e519524SHoward Hinnant{ 2318ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 23193e519524SHoward Hinnant} 23203e519524SHoward Hinnant 23213e519524SHoward Hinnant// reverse_copy 23223e519524SHoward Hinnant 23233e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 2324e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 23253e519524SHoward Hinnant_OutputIterator 23263e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 23273e519524SHoward Hinnant{ 23283e519524SHoward Hinnant for (; __first != __last; ++__result) 23293e519524SHoward Hinnant *__result = *--__last; 23303e519524SHoward Hinnant return __result; 23313e519524SHoward Hinnant} 23323e519524SHoward Hinnant 23333e519524SHoward Hinnant// rotate 23343e519524SHoward Hinnant 23353e519524SHoward Hinnanttemplate <class _ForwardIterator> 23363e519524SHoward Hinnant_ForwardIterator 2337aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 23383e519524SHoward Hinnant{ 2339aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2340aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2341aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2342aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2343aca09de3SHoward Hinnant return __lm1; 2344aca09de3SHoward Hinnant} 2345aca09de3SHoward Hinnant 2346aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2347aca09de3SHoward Hinnant_BidirectionalIterator 2348aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2349aca09de3SHoward Hinnant{ 2350aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2351aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2352aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2353aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2354aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2355aca09de3SHoward Hinnant return __fp1; 2356aca09de3SHoward Hinnant} 2357aca09de3SHoward Hinnant 2358aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2359aca09de3SHoward Hinnant_ForwardIterator 2360aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2361aca09de3SHoward Hinnant{ 23623e519524SHoward Hinnant _ForwardIterator __i = __middle; 23633e519524SHoward Hinnant while (true) 23643e519524SHoward Hinnant { 23653e519524SHoward Hinnant swap(*__first, *__i); 23663e519524SHoward Hinnant ++__first; 23673e519524SHoward Hinnant if (++__i == __last) 23683e519524SHoward Hinnant break; 23693e519524SHoward Hinnant if (__first == __middle) 23703e519524SHoward Hinnant __middle = __i; 23713e519524SHoward Hinnant } 23723e519524SHoward Hinnant _ForwardIterator __r = __first; 23733e519524SHoward Hinnant if (__first != __middle) 23743e519524SHoward Hinnant { 23753e519524SHoward Hinnant __i = __middle; 23763e519524SHoward Hinnant while (true) 23773e519524SHoward Hinnant { 23783e519524SHoward Hinnant swap(*__first, *__i); 23793e519524SHoward Hinnant ++__first; 23803e519524SHoward Hinnant if (++__i == __last) 23813e519524SHoward Hinnant { 23823e519524SHoward Hinnant if (__first == __middle) 23833e519524SHoward Hinnant break; 23843e519524SHoward Hinnant __i = __middle; 23853e519524SHoward Hinnant } 23863e519524SHoward Hinnant else if (__first == __middle) 23873e519524SHoward Hinnant __middle = __i; 23883e519524SHoward Hinnant } 23893e519524SHoward Hinnant } 23903e519524SHoward Hinnant return __r; 23913e519524SHoward Hinnant} 23923e519524SHoward Hinnant 23933e519524SHoward Hinnanttemplate<typename _Integral> 23943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23953e519524SHoward Hinnant_Integral 239619b4035fSMarshall Clow__algo_gcd(_Integral __x, _Integral __y) 23973e519524SHoward Hinnant{ 23983e519524SHoward Hinnant do 23993e519524SHoward Hinnant { 24003e519524SHoward Hinnant _Integral __t = __x % __y; 24013e519524SHoward Hinnant __x = __y; 24023e519524SHoward Hinnant __y = __t; 24033e519524SHoward Hinnant } while (__y); 24043e519524SHoward Hinnant return __x; 24053e519524SHoward Hinnant} 24063e519524SHoward Hinnant 24073e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 24083e519524SHoward Hinnant_RandomAccessIterator 2409aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 24103e519524SHoward Hinnant{ 24113e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 24123e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 24133e519524SHoward Hinnant 24143e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 24153e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 24163e519524SHoward Hinnant if (__m1 == __m2) 24173e519524SHoward Hinnant { 2418ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 24193e519524SHoward Hinnant return __middle; 24203e519524SHoward Hinnant } 242119b4035fSMarshall Clow const difference_type __g = _VSTD::__algo_gcd(__m1, __m2); 24223e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 24233e519524SHoward Hinnant { 2424aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 24253e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 24263e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 24273e519524SHoward Hinnant do 24283e519524SHoward Hinnant { 2429aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 24303e519524SHoward Hinnant __p1 = __p2; 24313e519524SHoward Hinnant const difference_type __d = __last - __p2; 24323e519524SHoward Hinnant if (__m1 < __d) 24333e519524SHoward Hinnant __p2 += __m1; 24343e519524SHoward Hinnant else 24353e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 24363e519524SHoward Hinnant } while (__p2 != __p); 2437aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 24383e519524SHoward Hinnant } 24393e519524SHoward Hinnant return __first + __m2; 24403e519524SHoward Hinnant} 24413e519524SHoward Hinnant 24423e519524SHoward Hinnanttemplate <class _ForwardIterator> 24433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24443e519524SHoward Hinnant_ForwardIterator 2445aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2446aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2447aca09de3SHoward Hinnant{ 2448aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2449aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2450aca09de3SHoward Hinnant { 2451aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2452aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2453aca09de3SHoward Hinnant } 2454aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2455aca09de3SHoward Hinnant} 2456aca09de3SHoward Hinnant 2457aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2458aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2459aca09de3SHoward Hinnant_BidirectionalIterator 2460aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2461aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2462aca09de3SHoward Hinnant{ 2463aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2464aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2465aca09de3SHoward Hinnant { 2466aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2467aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2468aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2469aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2470aca09de3SHoward Hinnant } 2471aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2472aca09de3SHoward Hinnant} 2473aca09de3SHoward Hinnant 2474aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2475aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2476aca09de3SHoward Hinnant_RandomAccessIterator 2477aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2478aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2479aca09de3SHoward Hinnant{ 2480aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2481aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2482aca09de3SHoward Hinnant { 2483aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2484aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2485aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2486aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2487aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2488aca09de3SHoward Hinnant } 2489aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2490aca09de3SHoward Hinnant} 2491aca09de3SHoward Hinnant 2492aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2493aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2494aca09de3SHoward Hinnant_ForwardIterator 24953e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 24963e519524SHoward Hinnant{ 2497aca09de3SHoward Hinnant if (__first == __middle) 2498aca09de3SHoward Hinnant return __last; 2499aca09de3SHoward Hinnant if (__middle == __last) 2500aca09de3SHoward Hinnant return __first; 2501ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2502aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 25033e519524SHoward Hinnant} 25043e519524SHoward Hinnant 25053e519524SHoward Hinnant// rotate_copy 25063e519524SHoward Hinnant 25073e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 25083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25093e519524SHoward Hinnant_OutputIterator 25103e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 25113e519524SHoward Hinnant{ 2512ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 25133e519524SHoward Hinnant} 25143e519524SHoward Hinnant 25153e519524SHoward Hinnant// min_element 25163e519524SHoward Hinnant 25173e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25181362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25191362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25203e519524SHoward Hinnant_ForwardIterator 25210b0671aeSMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25223e519524SHoward Hinnant{ 2523*f82dba01SEric Fiselier static_assert(__is_cpp17_forward_iterator<_ForwardIterator>::value, 2524a60d7facSEric Fiselier "std::min_element requires a ForwardIterator"); 25253e519524SHoward Hinnant if (__first != __last) 25263e519524SHoward Hinnant { 25273e519524SHoward Hinnant _ForwardIterator __i = __first; 25283e519524SHoward Hinnant while (++__i != __last) 25293e519524SHoward Hinnant if (__comp(*__i, *__first)) 25303e519524SHoward Hinnant __first = __i; 25313e519524SHoward Hinnant } 25323e519524SHoward Hinnant return __first; 25333e519524SHoward Hinnant} 25343e519524SHoward Hinnant 25353e519524SHoward Hinnanttemplate <class _ForwardIterator> 25361362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25371362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25383e519524SHoward Hinnant_ForwardIterator 25393e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 25403e519524SHoward Hinnant{ 25410b0671aeSMarshall Clow return _VSTD::min_element(__first, __last, 25424eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25434eb27b79SHoward Hinnant} 25444eb27b79SHoward Hinnant 25454eb27b79SHoward Hinnant// min 25464eb27b79SHoward Hinnant 25474eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25481362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25491362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25504eb27b79SHoward Hinnantconst _Tp& 25514eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 25524eb27b79SHoward Hinnant{ 25534eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 25544eb27b79SHoward Hinnant} 25554eb27b79SHoward Hinnant 25564eb27b79SHoward Hinnanttemplate <class _Tp> 25571362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25581362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25594eb27b79SHoward Hinnantconst _Tp& 25604eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 25614eb27b79SHoward Hinnant{ 2562ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 25634eb27b79SHoward Hinnant} 25644eb27b79SHoward Hinnant 2565ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 256654976f26SHoward Hinnant 25674eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 25681362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25691362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25704eb27b79SHoward Hinnant_Tp 25714eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 25724eb27b79SHoward Hinnant{ 25730b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 25744eb27b79SHoward Hinnant} 25754eb27b79SHoward Hinnant 25764eb27b79SHoward Hinnanttemplate<class _Tp> 25771362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25781362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25794eb27b79SHoward Hinnant_Tp 25804eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 25814eb27b79SHoward Hinnant{ 25820b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 25833e519524SHoward Hinnant} 25843e519524SHoward Hinnant 2585ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 258654976f26SHoward Hinnant 25873e519524SHoward Hinnant// max_element 25883e519524SHoward Hinnant 25893e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25901362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25911362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25923e519524SHoward Hinnant_ForwardIterator 25930b0671aeSMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25943e519524SHoward Hinnant{ 2595*f82dba01SEric Fiselier static_assert(__is_cpp17_forward_iterator<_ForwardIterator>::value, 2596a60d7facSEric Fiselier "std::max_element requires a ForwardIterator"); 25973e519524SHoward Hinnant if (__first != __last) 25983e519524SHoward Hinnant { 25993e519524SHoward Hinnant _ForwardIterator __i = __first; 26003e519524SHoward Hinnant while (++__i != __last) 26013e519524SHoward Hinnant if (__comp(*__first, *__i)) 26023e519524SHoward Hinnant __first = __i; 26033e519524SHoward Hinnant } 26043e519524SHoward Hinnant return __first; 26053e519524SHoward Hinnant} 26063e519524SHoward Hinnant 26079d67c6d5SMarshall Clow 26083e519524SHoward Hinnanttemplate <class _ForwardIterator> 26091362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26101362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26113e519524SHoward Hinnant_ForwardIterator 26123e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 26133e519524SHoward Hinnant{ 26140b0671aeSMarshall Clow return _VSTD::max_element(__first, __last, 26154eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26164eb27b79SHoward Hinnant} 26174eb27b79SHoward Hinnant 26184eb27b79SHoward Hinnant// max 26194eb27b79SHoward Hinnant 26204eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 26211362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26221362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26234eb27b79SHoward Hinnantconst _Tp& 26244eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26254eb27b79SHoward Hinnant{ 26264eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 26274eb27b79SHoward Hinnant} 26284eb27b79SHoward Hinnant 26294eb27b79SHoward Hinnanttemplate <class _Tp> 26301362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26311362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26324eb27b79SHoward Hinnantconst _Tp& 26334eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 26344eb27b79SHoward Hinnant{ 2635ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 26364eb27b79SHoward Hinnant} 26374eb27b79SHoward Hinnant 2638ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 263954976f26SHoward Hinnant 26404eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26411362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26421362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26434eb27b79SHoward Hinnant_Tp 26444eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 26454eb27b79SHoward Hinnant{ 26460b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 26474eb27b79SHoward Hinnant} 26484eb27b79SHoward Hinnant 26494eb27b79SHoward Hinnanttemplate<class _Tp> 26501362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26511362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26524eb27b79SHoward Hinnant_Tp 26534eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 26544eb27b79SHoward Hinnant{ 26550b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); 26563e519524SHoward Hinnant} 26573e519524SHoward Hinnant 2658ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 265954976f26SHoward Hinnant 2660146c14acSMarshall Clow#if _LIBCPP_STD_VER > 14 2661146c14acSMarshall Clow// clamp 2662146c14acSMarshall Clowtemplate<class _Tp, class _Compare> 26631362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26641362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2665146c14acSMarshall Clowconst _Tp& 2666146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) 2667146c14acSMarshall Clow{ 2668146c14acSMarshall Clow _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); 2669146c14acSMarshall Clow return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; 2670146c14acSMarshall Clow 2671146c14acSMarshall Clow} 2672146c14acSMarshall Clow 2673146c14acSMarshall Clowtemplate<class _Tp> 26741362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26751362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2676146c14acSMarshall Clowconst _Tp& 2677146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi) 2678146c14acSMarshall Clow{ 2679146c14acSMarshall Clow return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); 2680146c14acSMarshall Clow} 2681146c14acSMarshall Clow#endif 2682146c14acSMarshall Clow 26833e519524SHoward Hinnant// minmax_element 26843e519524SHoward Hinnant 26853e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26861362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX11 26873e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26883e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26893e519524SHoward Hinnant{ 2690*f82dba01SEric Fiselier static_assert(__is_cpp17_forward_iterator<_ForwardIterator>::value, 2691a60d7facSEric Fiselier "std::minmax_element requires a ForwardIterator"); 26923e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 26933e519524SHoward Hinnant if (__first != __last) 26943e519524SHoward Hinnant { 26953e519524SHoward Hinnant if (++__first != __last) 26963e519524SHoward Hinnant { 26973e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26983e519524SHoward Hinnant __result.first = __first; 26993e519524SHoward Hinnant else 27003e519524SHoward Hinnant __result.second = __first; 27013e519524SHoward Hinnant while (++__first != __last) 27023e519524SHoward Hinnant { 27033e519524SHoward Hinnant _ForwardIterator __i = __first; 27043e519524SHoward Hinnant if (++__first == __last) 27053e519524SHoward Hinnant { 27063e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27073e519524SHoward Hinnant __result.first = __i; 27083e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 27093e519524SHoward Hinnant __result.second = __i; 27103e519524SHoward Hinnant break; 27113e519524SHoward Hinnant } 27123e519524SHoward Hinnant else 27133e519524SHoward Hinnant { 27143e519524SHoward Hinnant if (__comp(*__first, *__i)) 27153e519524SHoward Hinnant { 27163e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27173e519524SHoward Hinnant __result.first = __first; 27183e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 27193e519524SHoward Hinnant __result.second = __i; 27203e519524SHoward Hinnant } 27213e519524SHoward Hinnant else 27223e519524SHoward Hinnant { 27233e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27243e519524SHoward Hinnant __result.first = __i; 27253e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 27263e519524SHoward Hinnant __result.second = __first; 27273e519524SHoward Hinnant } 27283e519524SHoward Hinnant } 27293e519524SHoward Hinnant } 27303e519524SHoward Hinnant } 27313e519524SHoward Hinnant } 27323e519524SHoward Hinnant return __result; 27333e519524SHoward Hinnant} 27343e519524SHoward Hinnant 27353e519524SHoward Hinnanttemplate <class _ForwardIterator> 27361362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 27371362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27383e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 27393e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 27403e519524SHoward Hinnant{ 27419d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 27429d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 27433e519524SHoward Hinnant} 27443e519524SHoward Hinnant 27454eb27b79SHoward Hinnant// minmax 27464eb27b79SHoward Hinnant 27474eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27481362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 27491362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27504eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27514eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 27524eb27b79SHoward Hinnant{ 27534eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 27544eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 27554eb27b79SHoward Hinnant} 27564eb27b79SHoward Hinnant 27574eb27b79SHoward Hinnanttemplate<class _Tp> 27581362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 27591362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27604eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27614eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 27624eb27b79SHoward Hinnant{ 2763ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 27644eb27b79SHoward Hinnant} 27654eb27b79SHoward Hinnant 2766ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 276754976f26SHoward Hinnant 27684eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27691362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 27701362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27714eb27b79SHoward Hinnantpair<_Tp, _Tp> 27724eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 27734eb27b79SHoward Hinnant{ 27749d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 27759d67c6d5SMarshall Clow _Iter __first = __t.begin(); 27769d67c6d5SMarshall Clow _Iter __last = __t.end(); 27779d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result(*__first, *__first); 27789d67c6d5SMarshall Clow 27799d67c6d5SMarshall Clow ++__first; 27809d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 27819d67c6d5SMarshall Clow { 27829d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 27839d67c6d5SMarshall Clow __result.first = *__first; 27849d67c6d5SMarshall Clow else 27859d67c6d5SMarshall Clow __result.second = *__first; 27869d67c6d5SMarshall Clow ++__first; 27879d67c6d5SMarshall Clow } 27889d67c6d5SMarshall Clow 27899d67c6d5SMarshall Clow while (__first != __last) 27909d67c6d5SMarshall Clow { 27919d67c6d5SMarshall Clow _Tp __prev = *__first++; 2792002144f6SMarshall Clow if (__comp(*__first, __prev)) { 2793002144f6SMarshall Clow if ( __comp(*__first, __result.first)) __result.first = *__first; 2794002144f6SMarshall Clow if (!__comp(__prev, __result.second)) __result.second = __prev; 27959d67c6d5SMarshall Clow } 27969d67c6d5SMarshall Clow else { 2797002144f6SMarshall Clow if ( __comp(__prev, __result.first)) __result.first = __prev; 2798002144f6SMarshall Clow if (!__comp(*__first, __result.second)) __result.second = *__first; 27999d67c6d5SMarshall Clow } 28009d67c6d5SMarshall Clow 28019d67c6d5SMarshall Clow __first++; 28029d67c6d5SMarshall Clow } 28039d67c6d5SMarshall Clow return __result; 28049d67c6d5SMarshall Clow} 28059d67c6d5SMarshall Clow 28069d67c6d5SMarshall Clowtemplate<class _Tp> 28071362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 28081362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28099d67c6d5SMarshall Clowpair<_Tp, _Tp> 28109d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 28119d67c6d5SMarshall Clow{ 28129d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 28134eb27b79SHoward Hinnant} 28144eb27b79SHoward Hinnant 2815ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 281654976f26SHoward Hinnant 28173e519524SHoward Hinnant// random_shuffle 28183e519524SHoward Hinnant 2819f9d540b0SHoward Hinnant// __independent_bits_engine 2820f9d540b0SHoward Hinnant 2821c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2822f9d540b0SHoward Hinnantstruct __log2_imp 28233e519524SHoward Hinnant{ 2824c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2825c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 28263e519524SHoward Hinnant}; 28273e519524SHoward Hinnant 2828c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2829c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 28303e519524SHoward Hinnant{ 2831f9d540b0SHoward Hinnant static const size_t value = 0; 28323e519524SHoward Hinnant}; 28333e519524SHoward Hinnant 2834c003db1fSHoward Hinnanttemplate <size_t _Rp> 2835c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 28363e519524SHoward Hinnant{ 2837c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 28383e519524SHoward Hinnant}; 28393e519524SHoward Hinnant 284089918caaSEric Fiseliertemplate <class _UIntType, _UIntType _Xp> 2841f9d540b0SHoward Hinnantstruct __log2 28423e519524SHoward Hinnant{ 2843c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 284489918caaSEric Fiselier sizeof(_UIntType) * __CHAR_BIT__ - 1>::value; 28453e519524SHoward Hinnant}; 28463e519524SHoward Hinnant 2847f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2848f9d540b0SHoward Hinnantclass __independent_bits_engine 28493e519524SHoward Hinnant{ 2850f9d540b0SHoward Hinnantpublic: 2851f9d540b0SHoward Hinnant // types 2852f9d540b0SHoward Hinnant typedef _UIntType result_type; 2853f9d540b0SHoward Hinnant 2854f9d540b0SHoward Hinnantprivate: 2855f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2856f9d540b0SHoward Hinnant typedef typename conditional 2857f9d540b0SHoward Hinnant < 2858f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2859f9d540b0SHoward Hinnant result_type, 2860f9d540b0SHoward Hinnant _Engine_result_type 2861f9d540b0SHoward Hinnant >::type _Working_result_type; 2862f9d540b0SHoward Hinnant 2863f9d540b0SHoward Hinnant _Engine& __e_; 2864f9d540b0SHoward Hinnant size_t __w_; 2865f9d540b0SHoward Hinnant size_t __w0_; 2866f9d540b0SHoward Hinnant size_t __n_; 2867f9d540b0SHoward Hinnant size_t __n0_; 2868f9d540b0SHoward Hinnant _Working_result_type __y0_; 2869f9d540b0SHoward Hinnant _Working_result_type __y1_; 2870f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2871f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2872f9d540b0SHoward Hinnant 2873ddda456aSEric Fiselier#ifdef _LIBCPP_CXX03_LANG 2874c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2875f9d540b0SHoward Hinnant + _Working_result_type(1); 2876e386b7b3SHoward Hinnant#else 2877e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2878e386b7b3SHoward Hinnant + _Working_result_type(1); 2879e386b7b3SHoward Hinnant#endif 2880e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2881e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2882e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2883f9d540b0SHoward Hinnant 2884f9d540b0SHoward Hinnantpublic: 2885f9d540b0SHoward Hinnant // constructors and seeding functions 2886f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2887f9d540b0SHoward Hinnant 2888f9d540b0SHoward Hinnant // generating functions 2889c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2890f9d540b0SHoward Hinnant 2891f9d540b0SHoward Hinnantprivate: 289208bba64aSMarshall Clow result_type __eval(false_type); 289308bba64aSMarshall Clow result_type __eval(true_type); 2894f9d540b0SHoward Hinnant}; 2895f9d540b0SHoward Hinnant 2896f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2897f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2898f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2899f9d540b0SHoward Hinnant : __e_(__e), 2900f9d540b0SHoward Hinnant __w_(__w) 2901f9d540b0SHoward Hinnant{ 2902f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2903f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2904c003db1fSHoward Hinnant if (_Rp == 0) 2905c003db1fSHoward Hinnant __y0_ = _Rp; 2906f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2907c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2908f9d540b0SHoward Hinnant else 2909f9d540b0SHoward Hinnant __y0_ = 0; 2910c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2911f9d540b0SHoward Hinnant { 2912f9d540b0SHoward Hinnant ++__n_; 2913f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2914f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2915c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2916f9d540b0SHoward Hinnant else 2917f9d540b0SHoward Hinnant __y0_ = 0; 2918f9d540b0SHoward Hinnant } 2919f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2920f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2921c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2922f9d540b0SHoward Hinnant else 2923f9d540b0SHoward Hinnant __y1_ = 0; 2924f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2925f9d540b0SHoward Hinnant _Engine_result_type(0); 2926f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2927f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2928f9d540b0SHoward Hinnant _Engine_result_type(~0); 29293e519524SHoward Hinnant} 29303e519524SHoward Hinnant 2931f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2932f9d540b0SHoward Hinnantinline 2933f9d540b0SHoward Hinnant_UIntType 293408bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 29353e519524SHoward Hinnant{ 2936f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 29373e519524SHoward Hinnant} 29383e519524SHoward Hinnant 2939f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2940f9d540b0SHoward Hinnant_UIntType 294108bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 29423e519524SHoward Hinnant{ 29435beb2c3aSMarshall Clow const size_t _WRt = numeric_limits<result_type>::digits; 2944c003db1fSHoward Hinnant result_type _Sp = 0; 2945f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2946f9d540b0SHoward Hinnant { 2947f9d540b0SHoward Hinnant _Engine_result_type __u; 29483e519524SHoward Hinnant do 2949f9d540b0SHoward Hinnant { 2950f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2951f9d540b0SHoward Hinnant } while (__u >= __y0_); 29525beb2c3aSMarshall Clow if (__w0_ < _WRt) 2953c003db1fSHoward Hinnant _Sp <<= __w0_; 2954f9d540b0SHoward Hinnant else 2955c003db1fSHoward Hinnant _Sp = 0; 2956c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2957f9d540b0SHoward Hinnant } 2958f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2959f9d540b0SHoward Hinnant { 2960f9d540b0SHoward Hinnant _Engine_result_type __u; 2961f9d540b0SHoward Hinnant do 2962f9d540b0SHoward Hinnant { 2963f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2964f9d540b0SHoward Hinnant } while (__u >= __y1_); 29655beb2c3aSMarshall Clow if (__w0_ < _WRt - 1) 2966c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2967f9d540b0SHoward Hinnant else 2968c003db1fSHoward Hinnant _Sp = 0; 2969c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2970f9d540b0SHoward Hinnant } 2971c003db1fSHoward Hinnant return _Sp; 29723e519524SHoward Hinnant} 29733e519524SHoward Hinnant 2974f9d540b0SHoward Hinnant// uniform_int_distribution 29753e519524SHoward Hinnant 2976f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2977f9d540b0SHoward Hinnantclass uniform_int_distribution 29783e519524SHoward Hinnant{ 2979f9d540b0SHoward Hinnantpublic: 2980f9d540b0SHoward Hinnant // types 2981f9d540b0SHoward Hinnant typedef _IntType result_type; 2982f9d540b0SHoward Hinnant 2983f9d540b0SHoward Hinnant class param_type 2984f9d540b0SHoward Hinnant { 2985f9d540b0SHoward Hinnant result_type __a_; 2986f9d540b0SHoward Hinnant result_type __b_; 2987f9d540b0SHoward Hinnant public: 2988f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2989f9d540b0SHoward Hinnant 2990f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2991f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2992f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2993f9d540b0SHoward Hinnant 2994f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2995f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2996f9d540b0SHoward Hinnant 2997f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2998f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2999f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 3000f9d540b0SHoward Hinnant {return !(__x == __y);} 30013e519524SHoward Hinnant }; 30023e519524SHoward Hinnant 3003f9d540b0SHoward Hinnantprivate: 3004f9d540b0SHoward Hinnant param_type __p_; 30053e519524SHoward Hinnant 3006f9d540b0SHoward Hinnantpublic: 3007f9d540b0SHoward Hinnant // constructors and reset functions 3008f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 3009f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 3010f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 3011f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 3012f9d540b0SHoward Hinnant void reset() {} 3013f9d540b0SHoward Hinnant 3014f9d540b0SHoward Hinnant // generating functions 3015f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 3016f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 3017f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 3018f9d540b0SHoward Hinnant 3019f9d540b0SHoward Hinnant // property functions 3020f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 3021f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 3022f9d540b0SHoward Hinnant 3023f9d540b0SHoward Hinnant param_type param() const {return __p_;} 3024f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 3025f9d540b0SHoward Hinnant 3026f9d540b0SHoward Hinnant result_type min() const {return a();} 3027f9d540b0SHoward Hinnant result_type max() const {return b();} 3028f9d540b0SHoward Hinnant 3029f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 3030f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3031f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 3032f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 3033f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3034f9d540b0SHoward Hinnant {return !(__x == __y);} 30353e519524SHoward Hinnant}; 30363e519524SHoward Hinnant 3037f9d540b0SHoward Hinnanttemplate<class _IntType> 3038f9d540b0SHoward Hinnanttemplate<class _URNG> 3039f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 3040f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 30412dd53352SMarshall Clow_LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK 30423e519524SHoward Hinnant{ 3043f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 3044f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 30452dd53352SMarshall Clow const _UIntType _Rp = _UIntType(__p.b()) - _UIntType(__p.a()) + _UIntType(1); 3046c003db1fSHoward Hinnant if (_Rp == 1) 3047f9d540b0SHoward Hinnant return __p.a(); 3048f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 3049f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 3050c003db1fSHoward Hinnant if (_Rp == 0) 3051f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 3052f3b851f0SMarshall Clow size_t __w = _Dt - __libcpp_clz(_Rp) - 1; 3053a6438ca1SMarshall Clow if ((_Rp & (std::numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0) 3054f9d540b0SHoward Hinnant ++__w; 3055f9d540b0SHoward Hinnant _Eng __e(__g, __w); 3056f9d540b0SHoward Hinnant _UIntType __u; 3057f9d540b0SHoward Hinnant do 30583e519524SHoward Hinnant { 3059f9d540b0SHoward Hinnant __u = __e(); 3060c003db1fSHoward Hinnant } while (__u >= _Rp); 3061f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 30623e519524SHoward Hinnant} 3063f9d540b0SHoward Hinnant 306466f1ec46SEric Fiselier#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_RANDOM_SHUFFLE) \ 306566f1ec46SEric Fiselier || defined(_LIBCPP_BUILDING_LIBRARY) 3066f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 3067f9d540b0SHoward Hinnant 3068f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3069f9d540b0SHoward Hinnant 3070f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 30713e519524SHoward Hinnant{ 3072f9d540b0SHoward Hinnant static unsigned __c_; 3073f9d540b0SHoward Hinnant 3074f9d540b0SHoward Hinnant __rs_default(); 3075f9d540b0SHoward Hinnantpublic: 3076b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 3077f9d540b0SHoward Hinnant 3078f9d540b0SHoward Hinnant static const result_type _Min = 0; 3079f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 3080f9d540b0SHoward Hinnant 3081f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 3082f9d540b0SHoward Hinnant ~__rs_default(); 3083f9d540b0SHoward Hinnant 3084f9d540b0SHoward Hinnant result_type operator()(); 3085f9d540b0SHoward Hinnant 3086788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 3087788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3088f9d540b0SHoward Hinnant 3089f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3090f9d540b0SHoward Hinnant}; 3091f9d540b0SHoward Hinnant 3092f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 30933e519524SHoward Hinnant 30943e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 3095ea5cd3b4SLouis Dionne_LIBCPP_DEPRECATED_IN_CXX14 void 30963e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 30973e519524SHoward Hinnant{ 30983e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3099c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3100c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 31013e519524SHoward Hinnant difference_type __d = __last - __first; 31023e519524SHoward Hinnant if (__d > 1) 31033e519524SHoward Hinnant { 3104c003db1fSHoward Hinnant _Dp __uid; 3105f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 31065a8525e0SMarshall Clow for (--__last, (void) --__d; __first < __last; ++__first, (void) --__d) 3107007b26beSHoward Hinnant { 3108c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3109007b26beSHoward Hinnant if (__i != difference_type(0)) 3110007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3111007b26beSHoward Hinnant } 31123e519524SHoward Hinnant } 31133e519524SHoward Hinnant} 31143e519524SHoward Hinnant 31153e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 3116ea5cd3b4SLouis Dionne_LIBCPP_DEPRECATED_IN_CXX14 void 31173e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3118ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 31193e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 31203e519524SHoward Hinnant#else 31213e519524SHoward Hinnant _RandomNumberGenerator& __rand) 31223e519524SHoward Hinnant#endif 31233e519524SHoward Hinnant{ 31243e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 31253e519524SHoward Hinnant difference_type __d = __last - __first; 31263e519524SHoward Hinnant if (__d > 1) 31273e519524SHoward Hinnant { 31285a8525e0SMarshall Clow for (--__last; __first < __last; ++__first, (void) --__d) 3129007b26beSHoward Hinnant { 3130007b26beSHoward Hinnant difference_type __i = __rand(__d); 3131e9cc5451SMarshall Clow if (__i != difference_type(0)) 3132007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3133007b26beSHoward Hinnant } 31343e519524SHoward Hinnant } 31353e519524SHoward Hinnant} 31360f37a410SMarshall Clow#endif 31373e519524SHoward Hinnant 3138e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3139e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3140e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3141e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 314242bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3143e7154709SEric Fiselier _Distance __n, 3144e7154709SEric Fiselier _UniformRandomNumberGenerator & __g, 3145e7154709SEric Fiselier input_iterator_tag) { 3146e7154709SEric Fiselier 3147e7154709SEric Fiselier _Distance __k = 0; 3148e7154709SEric Fiselier for (; __first != __last && __k < __n; ++__first, (void) ++__k) 314942bfedd9SAlexander Richardson __output_iter[__k] = *__first; 3150e7154709SEric Fiselier _Distance __sz = __k; 3151e7154709SEric Fiselier for (; __first != __last; ++__first, (void) ++__k) { 3152e7154709SEric Fiselier _Distance __r = _VSTD::uniform_int_distribution<_Distance>(0, __k)(__g); 3153e7154709SEric Fiselier if (__r < __sz) 315442bfedd9SAlexander Richardson __output_iter[__r] = *__first; 3155e7154709SEric Fiselier } 315642bfedd9SAlexander Richardson return __output_iter + _VSTD::min(__n, __k); 3157e7154709SEric Fiselier} 3158e7154709SEric Fiselier 3159e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3160e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3161e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3162e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 316342bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3164e7154709SEric Fiselier _Distance __n, 3165e7154709SEric Fiselier _UniformRandomNumberGenerator& __g, 3166e7154709SEric Fiselier forward_iterator_tag) { 3167e7154709SEric Fiselier _Distance __unsampled_sz = _VSTD::distance(__first, __last); 3168e7154709SEric Fiselier for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) { 3169e7154709SEric Fiselier _Distance __r = 3170e7154709SEric Fiselier _VSTD::uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g); 3171e7154709SEric Fiselier if (__r < __n) { 317242bfedd9SAlexander Richardson *__output_iter++ = *__first; 3173e7154709SEric Fiselier --__n; 3174e7154709SEric Fiselier } 3175e7154709SEric Fiselier } 317642bfedd9SAlexander Richardson return __output_iter; 3177e7154709SEric Fiselier} 3178e7154709SEric Fiselier 3179e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3180e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3181e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3182e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 318342bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3184e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator& __g) { 3185e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::iterator_category 3186e7154709SEric Fiselier _PopCategory; 3187e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::difference_type 3188e7154709SEric Fiselier _Difference; 3189*f82dba01SEric Fiselier static_assert(__is_cpp17_forward_iterator<_PopulationIterator>::value || 3190*f82dba01SEric Fiselier __is_cpp17_random_access_iterator<_SampleIterator>::value, 3191e7154709SEric Fiselier "SampleIterator must meet the requirements of RandomAccessIterator"); 3192e7154709SEric Fiselier typedef typename common_type<_Distance, _Difference>::type _CommonType; 3193e7154709SEric Fiselier _LIBCPP_ASSERT(__n >= 0, "N must be a positive number."); 3194e7154709SEric Fiselier return _VSTD::__sample( 319542bfedd9SAlexander Richardson __first, __last, __output_iter, _CommonType(__n), 3196e7154709SEric Fiselier __g, _PopCategory()); 3197e7154709SEric Fiselier} 3198e7154709SEric Fiselier 3199e7154709SEric Fiselier#if _LIBCPP_STD_VER > 14 3200e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3201e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3202e7154709SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY 3203e7154709SEric Fiselier_SampleIterator sample(_PopulationIterator __first, 320442bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3205e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator&& __g) { 320642bfedd9SAlexander Richardson return _VSTD::__sample(__first, __last, __output_iter, __n, __g); 3207e7154709SEric Fiselier} 3208e7154709SEric Fiselier#endif // _LIBCPP_STD_VER > 14 3209e7154709SEric Fiselier 3210f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3211f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3212fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3213f9d540b0SHoward Hinnant{ 3214f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3215c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3216c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3217f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3218f9d540b0SHoward Hinnant if (__d > 1) 3219f9d540b0SHoward Hinnant { 3220c003db1fSHoward Hinnant _Dp __uid; 32217fa68653SMarshall Clow for (--__last, (void) --__d; __first < __last; ++__first, (void) --__d) 3222007b26beSHoward Hinnant { 3223c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3224007b26beSHoward Hinnant if (__i != difference_type(0)) 3225007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3226007b26beSHoward Hinnant } 3227f9d540b0SHoward Hinnant } 3228f9d540b0SHoward Hinnant} 3229f9d540b0SHoward Hinnant 32303e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 32311362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 bool 32323e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 32333e519524SHoward Hinnant{ 32343e519524SHoward Hinnant for (; __first != __last; ++__first) 32353e519524SHoward Hinnant if (!__pred(*__first)) 32363e519524SHoward Hinnant break; 3237b9595b79SMarshall Clow if ( __first == __last ) 3238b9595b79SMarshall Clow return true; 3239b9595b79SMarshall Clow ++__first; 32403e519524SHoward Hinnant for (; __first != __last; ++__first) 32413e519524SHoward Hinnant if (__pred(*__first)) 32423e519524SHoward Hinnant return false; 32433e519524SHoward Hinnant return true; 32443e519524SHoward Hinnant} 32453e519524SHoward Hinnant 32463e519524SHoward Hinnant// partition 32473e519524SHoward Hinnant 32483e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 32493e519524SHoward Hinnant_ForwardIterator 32503e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 32513e519524SHoward Hinnant{ 32523e519524SHoward Hinnant while (true) 32533e519524SHoward Hinnant { 32543e519524SHoward Hinnant if (__first == __last) 32553e519524SHoward Hinnant return __first; 32563e519524SHoward Hinnant if (!__pred(*__first)) 32573e519524SHoward Hinnant break; 32583e519524SHoward Hinnant ++__first; 32593e519524SHoward Hinnant } 32603e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 32613e519524SHoward Hinnant { 32623e519524SHoward Hinnant if (__pred(*__p)) 32633e519524SHoward Hinnant { 32643e519524SHoward Hinnant swap(*__first, *__p); 32653e519524SHoward Hinnant ++__first; 32663e519524SHoward Hinnant } 32673e519524SHoward Hinnant } 32683e519524SHoward Hinnant return __first; 32693e519524SHoward Hinnant} 32703e519524SHoward Hinnant 32713e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 32723e519524SHoward Hinnant_BidirectionalIterator 32733e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 32743e519524SHoward Hinnant bidirectional_iterator_tag) 32753e519524SHoward Hinnant{ 32763e519524SHoward Hinnant while (true) 32773e519524SHoward Hinnant { 32783e519524SHoward Hinnant while (true) 32793e519524SHoward Hinnant { 32803e519524SHoward Hinnant if (__first == __last) 32813e519524SHoward Hinnant return __first; 32823e519524SHoward Hinnant if (!__pred(*__first)) 32833e519524SHoward Hinnant break; 32843e519524SHoward Hinnant ++__first; 32853e519524SHoward Hinnant } 32863e519524SHoward Hinnant do 32873e519524SHoward Hinnant { 32883e519524SHoward Hinnant if (__first == --__last) 32893e519524SHoward Hinnant return __first; 32903e519524SHoward Hinnant } while (!__pred(*__last)); 32913e519524SHoward Hinnant swap(*__first, *__last); 32923e519524SHoward Hinnant ++__first; 32933e519524SHoward Hinnant } 32943e519524SHoward Hinnant} 32953e519524SHoward Hinnant 32963e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 32973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 32983e519524SHoward Hinnant_ForwardIterator 32993e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 33003e519524SHoward Hinnant{ 3301ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 33023e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 33033e519524SHoward Hinnant} 33043e519524SHoward Hinnant 33053e519524SHoward Hinnant// partition_copy 33063e519524SHoward Hinnant 33073e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 33083e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 33091b9a4ffdSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_OutputIterator1, _OutputIterator2> 33103e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 33113e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 33123e519524SHoward Hinnant _Predicate __pred) 33133e519524SHoward Hinnant{ 33143e519524SHoward Hinnant for (; __first != __last; ++__first) 33153e519524SHoward Hinnant { 33163e519524SHoward Hinnant if (__pred(*__first)) 33173e519524SHoward Hinnant { 33183e519524SHoward Hinnant *__out_true = *__first; 33193e519524SHoward Hinnant ++__out_true; 33203e519524SHoward Hinnant } 33213e519524SHoward Hinnant else 33223e519524SHoward Hinnant { 33233e519524SHoward Hinnant *__out_false = *__first; 33243e519524SHoward Hinnant ++__out_false; 33253e519524SHoward Hinnant } 33263e519524SHoward Hinnant } 33273e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 33283e519524SHoward Hinnant} 33293e519524SHoward Hinnant 33303e519524SHoward Hinnant// partition_point 33313e519524SHoward Hinnant 33323e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 3333674f9128SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 33343e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 33353e519524SHoward Hinnant{ 33363e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3337ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 33383e519524SHoward Hinnant while (__len != 0) 33393e519524SHoward Hinnant { 334004695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 33413e519524SHoward Hinnant _ForwardIterator __m = __first; 3342ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 33433e519524SHoward Hinnant if (__pred(*__m)) 33443e519524SHoward Hinnant { 33453e519524SHoward Hinnant __first = ++__m; 33463e519524SHoward Hinnant __len -= __l2 + 1; 33473e519524SHoward Hinnant } 33483e519524SHoward Hinnant else 33493e519524SHoward Hinnant __len = __l2; 33503e519524SHoward Hinnant } 33513e519524SHoward Hinnant return __first; 33523e519524SHoward Hinnant} 33533e519524SHoward Hinnant 33543e519524SHoward Hinnant// stable_partition 33553e519524SHoward Hinnant 33563e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 33573e519524SHoward Hinnant_ForwardIterator 33583e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 33593e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 33603e519524SHoward Hinnant{ 33613e519524SHoward Hinnant // *__first is known to be false 33623e519524SHoward Hinnant // __len >= 1 33633e519524SHoward Hinnant if (__len == 1) 33643e519524SHoward Hinnant return __first; 33653e519524SHoward Hinnant if (__len == 2) 33663e519524SHoward Hinnant { 33673e519524SHoward Hinnant _ForwardIterator __m = __first; 33683e519524SHoward Hinnant if (__pred(*++__m)) 33693e519524SHoward Hinnant { 33703e519524SHoward Hinnant swap(*__first, *__m); 33713e519524SHoward Hinnant return __m; 33723e519524SHoward Hinnant } 33733e519524SHoward Hinnant return __first; 33743e519524SHoward Hinnant } 33753e519524SHoward Hinnant if (__len <= __p.second) 33763e519524SHoward Hinnant { // The buffer is big enough to use 33773e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 33783e519524SHoward Hinnant __destruct_n __d(0); 33793e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 33803e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 33813e519524SHoward Hinnant // Update __first to always point to the end of the trues 33823e519524SHoward Hinnant value_type* __t = __p.first; 3383ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 33843e519524SHoward Hinnant __d.__incr((value_type*)0); 33853e519524SHoward Hinnant ++__t; 33863e519524SHoward Hinnant _ForwardIterator __i = __first; 33873e519524SHoward Hinnant while (++__i != __last) 33883e519524SHoward Hinnant { 33893e519524SHoward Hinnant if (__pred(*__i)) 33903e519524SHoward Hinnant { 3391ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 33923e519524SHoward Hinnant ++__first; 33933e519524SHoward Hinnant } 33943e519524SHoward Hinnant else 33953e519524SHoward Hinnant { 3396ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 33973e519524SHoward Hinnant __d.__incr((value_type*)0); 33983e519524SHoward Hinnant ++__t; 33993e519524SHoward Hinnant } 34003e519524SHoward Hinnant } 34013e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 34023e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 34033e519524SHoward Hinnant __i = __first; 34047fa68653SMarshall Clow for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, (void) ++__i) 3405ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 34063e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 34073e519524SHoward Hinnant return __first; 34083e519524SHoward Hinnant } 34093e519524SHoward Hinnant // Else not enough buffer, do in place 34103e519524SHoward Hinnant // __len >= 3 34113e519524SHoward Hinnant _ForwardIterator __m = __first; 34123e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3413ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 34143e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 34153e519524SHoward Hinnant // F????????????????? 34163e519524SHoward Hinnant // f m l 34173e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 34183e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 34193e519524SHoward Hinnant // TTTFFFFF?????????? 34203e519524SHoward Hinnant // f ff m l 34213e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 34223e519524SHoward Hinnant _ForwardIterator __m1 = __m; 34233e519524SHoward Hinnant _ForwardIterator __second_false = __last; 34243e519524SHoward Hinnant _Distance __len_half = __len - __len2; 34253e519524SHoward Hinnant while (__pred(*__m1)) 34263e519524SHoward Hinnant { 34273e519524SHoward Hinnant if (++__m1 == __last) 34283e519524SHoward Hinnant goto __second_half_done; 34293e519524SHoward Hinnant --__len_half; 34303e519524SHoward Hinnant } 34313e519524SHoward Hinnant // TTTFFFFFTTTF?????? 34323e519524SHoward Hinnant // f ff m m1 l 34333e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 34343e519524SHoward Hinnant__second_half_done: 34353e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 34363e519524SHoward Hinnant // f ff m sf l 3437ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 34383e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 34393e519524SHoward Hinnant // | 34403e519524SHoward Hinnant} 34413e519524SHoward Hinnant 34423e519524SHoward Hinnantstruct __return_temporary_buffer 34433e519524SHoward Hinnant{ 34443e519524SHoward Hinnant template <class _Tp> 3445ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 34463e519524SHoward Hinnant}; 34473e519524SHoward Hinnant 34483e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 34493e519524SHoward Hinnant_ForwardIterator 34503e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 34513e519524SHoward Hinnant forward_iterator_tag) 34523e519524SHoward Hinnant{ 34533e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 34543e519524SHoward Hinnant // Either prove all true and return __first or point to first false 34553e519524SHoward Hinnant while (true) 34563e519524SHoward Hinnant { 34573e519524SHoward Hinnant if (__first == __last) 34583e519524SHoward Hinnant return __first; 34593e519524SHoward Hinnant if (!__pred(*__first)) 34603e519524SHoward Hinnant break; 34613e519524SHoward Hinnant ++__first; 34623e519524SHoward Hinnant } 34633e519524SHoward Hinnant // We now have a reduced range [__first, __last) 34643e519524SHoward Hinnant // *__first is known to be false 34653e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 34663e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3467ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 34683e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 34693e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 34703e519524SHoward Hinnant if (__len >= __alloc_limit) 34713e519524SHoward Hinnant { 3472ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 34733e519524SHoward Hinnant __h.reset(__p.first); 34743e519524SHoward Hinnant } 34753e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 34763e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 34773e519524SHoward Hinnant} 34783e519524SHoward Hinnant 34793e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 34803e519524SHoward Hinnant_BidirectionalIterator 34813e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34823e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 34833e519524SHoward Hinnant{ 34843e519524SHoward Hinnant // *__first is known to be false 34853e519524SHoward Hinnant // *__last is known to be true 34863e519524SHoward Hinnant // __len >= 2 34873e519524SHoward Hinnant if (__len == 2) 34883e519524SHoward Hinnant { 34893e519524SHoward Hinnant swap(*__first, *__last); 34903e519524SHoward Hinnant return __last; 34913e519524SHoward Hinnant } 34923e519524SHoward Hinnant if (__len == 3) 34933e519524SHoward Hinnant { 34943e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34953e519524SHoward Hinnant if (__pred(*++__m)) 34963e519524SHoward Hinnant { 34973e519524SHoward Hinnant swap(*__first, *__m); 34983e519524SHoward Hinnant swap(*__m, *__last); 34993e519524SHoward Hinnant return __last; 35003e519524SHoward Hinnant } 35013e519524SHoward Hinnant swap(*__m, *__last); 35023e519524SHoward Hinnant swap(*__first, *__m); 35033e519524SHoward Hinnant return __m; 35043e519524SHoward Hinnant } 35053e519524SHoward Hinnant if (__len <= __p.second) 35063e519524SHoward Hinnant { // The buffer is big enough to use 35073e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 35083e519524SHoward Hinnant __destruct_n __d(0); 35093e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 35103e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 35113e519524SHoward Hinnant // Update __first to always point to the end of the trues 35123e519524SHoward Hinnant value_type* __t = __p.first; 3513ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 35143e519524SHoward Hinnant __d.__incr((value_type*)0); 35153e519524SHoward Hinnant ++__t; 35163e519524SHoward Hinnant _BidirectionalIterator __i = __first; 35173e519524SHoward Hinnant while (++__i != __last) 35183e519524SHoward Hinnant { 35193e519524SHoward Hinnant if (__pred(*__i)) 35203e519524SHoward Hinnant { 3521ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 35223e519524SHoward Hinnant ++__first; 35233e519524SHoward Hinnant } 35243e519524SHoward Hinnant else 35253e519524SHoward Hinnant { 3526ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 35273e519524SHoward Hinnant __d.__incr((value_type*)0); 35283e519524SHoward Hinnant ++__t; 35293e519524SHoward Hinnant } 35303e519524SHoward Hinnant } 35313e519524SHoward Hinnant // move *__last, known to be true 3532ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 35333e519524SHoward Hinnant __i = ++__first; 35343e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 35353e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 35367fa68653SMarshall Clow for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, (void) ++__i) 3537ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 35383e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 35393e519524SHoward Hinnant return __first; 35403e519524SHoward Hinnant } 35413e519524SHoward Hinnant // Else not enough buffer, do in place 35423e519524SHoward Hinnant // __len >= 4 35433e519524SHoward Hinnant _BidirectionalIterator __m = __first; 35443e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3545ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 35463e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 35473e519524SHoward Hinnant // F????????????????T 35483e519524SHoward Hinnant // f m l 35493e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 35503e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 35513e519524SHoward Hinnant _Distance __len_half = __len2; 35523e519524SHoward Hinnant while (!__pred(*--__m1)) 35533e519524SHoward Hinnant { 35543e519524SHoward Hinnant if (__m1 == __first) 35553e519524SHoward Hinnant goto __first_half_done; 35563e519524SHoward Hinnant --__len_half; 35573e519524SHoward Hinnant } 35583e519524SHoward Hinnant // F???TFFF?????????T 35593e519524SHoward Hinnant // f m1 m l 35603e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 35613e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 35623e519524SHoward Hinnant__first_half_done: 35633e519524SHoward Hinnant // TTTFFFFF?????????T 35643e519524SHoward Hinnant // f ff m l 35653e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 35663e519524SHoward Hinnant __m1 = __m; 35673e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 35683e519524SHoward Hinnant ++__second_false; 35693e519524SHoward Hinnant __len_half = __len - __len2; 35703e519524SHoward Hinnant while (__pred(*__m1)) 35713e519524SHoward Hinnant { 35723e519524SHoward Hinnant if (++__m1 == __last) 35733e519524SHoward Hinnant goto __second_half_done; 35743e519524SHoward Hinnant --__len_half; 35753e519524SHoward Hinnant } 35763e519524SHoward Hinnant // TTTFFFFFTTTF?????T 35773e519524SHoward Hinnant // f ff m m1 l 35783e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 35793e519524SHoward Hinnant__second_half_done: 35803e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 35813e519524SHoward Hinnant // f ff m sf l 3582ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 35833e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 35843e519524SHoward Hinnant // | 35853e519524SHoward Hinnant} 35863e519524SHoward Hinnant 35873e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 35883e519524SHoward Hinnant_BidirectionalIterator 35893e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 35903e519524SHoward Hinnant bidirectional_iterator_tag) 35913e519524SHoward Hinnant{ 35923e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 35933e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 35943e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 35953e519524SHoward Hinnant // Either prove all true and return __first or point to first false 35963e519524SHoward Hinnant while (true) 35973e519524SHoward Hinnant { 35983e519524SHoward Hinnant if (__first == __last) 35993e519524SHoward Hinnant return __first; 36003e519524SHoward Hinnant if (!__pred(*__first)) 36013e519524SHoward Hinnant break; 36023e519524SHoward Hinnant ++__first; 36033e519524SHoward Hinnant } 36043e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 36053e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 36063e519524SHoward Hinnant do 36073e519524SHoward Hinnant { 36083e519524SHoward Hinnant if (__first == --__last) 36093e519524SHoward Hinnant return __first; 36103e519524SHoward Hinnant } while (!__pred(*__last)); 36113e519524SHoward Hinnant // We now have a reduced range [__first, __last] 36123e519524SHoward Hinnant // *__first is known to be false 36133e519524SHoward Hinnant // *__last is known to be true 36143e519524SHoward Hinnant // __len >= 2 3615ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 36163e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 36173e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 36183e519524SHoward Hinnant if (__len >= __alloc_limit) 36193e519524SHoward Hinnant { 3620ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 36213e519524SHoward Hinnant __h.reset(__p.first); 36223e519524SHoward Hinnant } 36233e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 36243e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 36253e519524SHoward Hinnant} 36263e519524SHoward Hinnant 36273e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 36283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36293e519524SHoward Hinnant_ForwardIterator 36303e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 36313e519524SHoward Hinnant{ 36323e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 36333e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 36343e519524SHoward Hinnant} 36353e519524SHoward Hinnant 36363e519524SHoward Hinnant// is_sorted_until 36373e519524SHoward Hinnant 36383e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 36391362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 36403e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 36413e519524SHoward Hinnant{ 36423e519524SHoward Hinnant if (__first != __last) 36433e519524SHoward Hinnant { 36443e519524SHoward Hinnant _ForwardIterator __i = __first; 36453e519524SHoward Hinnant while (++__i != __last) 36463e519524SHoward Hinnant { 36473e519524SHoward Hinnant if (__comp(*__i, *__first)) 36483e519524SHoward Hinnant return __i; 36493e519524SHoward Hinnant __first = __i; 36503e519524SHoward Hinnant } 36513e519524SHoward Hinnant } 36523e519524SHoward Hinnant return __last; 36533e519524SHoward Hinnant} 36543e519524SHoward Hinnant 36553e519524SHoward Hinnanttemplate<class _ForwardIterator> 36561362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 36571362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 36583e519524SHoward Hinnant_ForwardIterator 36593e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 36603e519524SHoward Hinnant{ 3661ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 36623e519524SHoward Hinnant} 36633e519524SHoward Hinnant 36643e519524SHoward Hinnant// is_sorted 36653e519524SHoward Hinnant 36663e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 36671362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 36681362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 36693e519524SHoward Hinnantbool 36703e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 36713e519524SHoward Hinnant{ 3672ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 36733e519524SHoward Hinnant} 36743e519524SHoward Hinnant 36753e519524SHoward Hinnanttemplate<class _ForwardIterator> 36761362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 36771362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 36783e519524SHoward Hinnantbool 36793e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 36803e519524SHoward Hinnant{ 3681ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 36823e519524SHoward Hinnant} 36833e519524SHoward Hinnant 36843e519524SHoward Hinnant// sort 36853e519524SHoward Hinnant 36863e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 36873e519524SHoward Hinnant 36883e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36893e519524SHoward Hinnantunsigned 36903e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 36913e519524SHoward Hinnant{ 36923e519524SHoward Hinnant unsigned __r = 0; 36933e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 36943e519524SHoward Hinnant { 36953e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 36963e519524SHoward Hinnant return __r; // x <= y && y <= z 36973e519524SHoward Hinnant // x <= y && y > z 36983e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 36993e519524SHoward Hinnant __r = 1; 37003e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 37013e519524SHoward Hinnant { 37023e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 37033e519524SHoward Hinnant __r = 2; 37043e519524SHoward Hinnant } 37053e519524SHoward Hinnant return __r; // x <= y && y < z 37063e519524SHoward Hinnant } 37073e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 37083e519524SHoward Hinnant { 37093e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 37103e519524SHoward Hinnant __r = 1; 37113e519524SHoward Hinnant return __r; 37123e519524SHoward Hinnant } 37133e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 37143e519524SHoward Hinnant __r = 1; // x < y && x <= z 37153e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 37163e519524SHoward Hinnant { 37173e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 37183e519524SHoward Hinnant __r = 2; 37193e519524SHoward Hinnant } 37203e519524SHoward Hinnant return __r; 37213e519524SHoward Hinnant} // x <= y && y <= z 37223e519524SHoward Hinnant 37233e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 37243e519524SHoward Hinnant 37253e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37263e519524SHoward Hinnantunsigned 37273e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 37283e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 37293e519524SHoward Hinnant{ 37303e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 37313e519524SHoward Hinnant if (__c(*__x4, *__x3)) 37323e519524SHoward Hinnant { 37333e519524SHoward Hinnant swap(*__x3, *__x4); 37343e519524SHoward Hinnant ++__r; 37353e519524SHoward Hinnant if (__c(*__x3, *__x2)) 37363e519524SHoward Hinnant { 37373e519524SHoward Hinnant swap(*__x2, *__x3); 37383e519524SHoward Hinnant ++__r; 37393e519524SHoward Hinnant if (__c(*__x2, *__x1)) 37403e519524SHoward Hinnant { 37413e519524SHoward Hinnant swap(*__x1, *__x2); 37423e519524SHoward Hinnant ++__r; 37433e519524SHoward Hinnant } 37443e519524SHoward Hinnant } 37453e519524SHoward Hinnant } 37463e519524SHoward Hinnant return __r; 37473e519524SHoward Hinnant} 37483e519524SHoward Hinnant 37493e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 37503e519524SHoward Hinnant 37513e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 3752835140a4SLouis Dionne_LIBCPP_HIDDEN 37533e519524SHoward Hinnantunsigned 37543e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 37553e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 37563e519524SHoward Hinnant{ 37573e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 37583e519524SHoward Hinnant if (__c(*__x5, *__x4)) 37593e519524SHoward Hinnant { 37603e519524SHoward Hinnant swap(*__x4, *__x5); 37613e519524SHoward Hinnant ++__r; 37623e519524SHoward Hinnant if (__c(*__x4, *__x3)) 37633e519524SHoward Hinnant { 37643e519524SHoward Hinnant swap(*__x3, *__x4); 37653e519524SHoward Hinnant ++__r; 37663e519524SHoward Hinnant if (__c(*__x3, *__x2)) 37673e519524SHoward Hinnant { 37683e519524SHoward Hinnant swap(*__x2, *__x3); 37693e519524SHoward Hinnant ++__r; 37703e519524SHoward Hinnant if (__c(*__x2, *__x1)) 37713e519524SHoward Hinnant { 37723e519524SHoward Hinnant swap(*__x1, *__x2); 37733e519524SHoward Hinnant ++__r; 37743e519524SHoward Hinnant } 37753e519524SHoward Hinnant } 37763e519524SHoward Hinnant } 37773e519524SHoward Hinnant } 37783e519524SHoward Hinnant return __r; 37793e519524SHoward Hinnant} 37803e519524SHoward Hinnant 37813e519524SHoward Hinnant// Assumes size > 0 37823e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37833e519524SHoward Hinnantvoid 37843e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 37853e519524SHoward Hinnant{ 37863e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 37873e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 37883e519524SHoward Hinnant { 3789ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 37903e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 37913e519524SHoward Hinnant (__first, __last, __comp); 37923e519524SHoward Hinnant if (__i != __first) 37933e519524SHoward Hinnant swap(*__first, *__i); 37943e519524SHoward Hinnant } 37953e519524SHoward Hinnant} 37963e519524SHoward Hinnant 37973e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37983e519524SHoward Hinnantvoid 37993e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 38003e519524SHoward Hinnant{ 38013e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 38023e519524SHoward Hinnant if (__first != __last) 38033e519524SHoward Hinnant { 38043e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 38053e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 38063e519524SHoward Hinnant { 38073e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3808ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 38093e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3810ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3811ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38123e519524SHoward Hinnant } 38133e519524SHoward Hinnant } 38143e519524SHoward Hinnant} 38153e519524SHoward Hinnant 38163e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38173e519524SHoward Hinnantvoid 38183e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38193e519524SHoward Hinnant{ 38203e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 38213e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 38223e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 38233e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 38243e519524SHoward Hinnant { 38253e519524SHoward Hinnant if (__comp(*__i, *__j)) 38263e519524SHoward Hinnant { 3827ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 38283e519524SHoward Hinnant _RandomAccessIterator __k = __j; 38293e519524SHoward Hinnant __j = __i; 38303e519524SHoward Hinnant do 38313e519524SHoward Hinnant { 3832ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 38333e519524SHoward Hinnant __j = __k; 38343e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3835ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38363e519524SHoward Hinnant } 38373e519524SHoward Hinnant __j = __i; 38383e519524SHoward Hinnant } 38393e519524SHoward Hinnant} 38403e519524SHoward Hinnant 38413e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38423e519524SHoward Hinnantbool 38433e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38443e519524SHoward Hinnant{ 38453e519524SHoward Hinnant switch (__last - __first) 38463e519524SHoward Hinnant { 38473e519524SHoward Hinnant case 0: 38483e519524SHoward Hinnant case 1: 38493e519524SHoward Hinnant return true; 38503e519524SHoward Hinnant case 2: 38513e519524SHoward Hinnant if (__comp(*--__last, *__first)) 38523e519524SHoward Hinnant swap(*__first, *__last); 38533e519524SHoward Hinnant return true; 38543e519524SHoward Hinnant case 3: 3855ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 38563e519524SHoward Hinnant return true; 38573e519524SHoward Hinnant case 4: 3858ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 38593e519524SHoward Hinnant return true; 38603e519524SHoward Hinnant case 5: 3861ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 38623e519524SHoward Hinnant return true; 38633e519524SHoward Hinnant } 38643e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 38653e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 38663e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 38673e519524SHoward Hinnant const unsigned __limit = 8; 38683e519524SHoward Hinnant unsigned __count = 0; 38693e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 38703e519524SHoward Hinnant { 38713e519524SHoward Hinnant if (__comp(*__i, *__j)) 38723e519524SHoward Hinnant { 3873ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 38743e519524SHoward Hinnant _RandomAccessIterator __k = __j; 38753e519524SHoward Hinnant __j = __i; 38763e519524SHoward Hinnant do 38773e519524SHoward Hinnant { 3878ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 38793e519524SHoward Hinnant __j = __k; 38803e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3881ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38823e519524SHoward Hinnant if (++__count == __limit) 38833e519524SHoward Hinnant return ++__i == __last; 38843e519524SHoward Hinnant } 38853e519524SHoward Hinnant __j = __i; 38863e519524SHoward Hinnant } 38873e519524SHoward Hinnant return true; 38883e519524SHoward Hinnant} 38893e519524SHoward Hinnant 38903e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 38913e519524SHoward Hinnantvoid 38923e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 38933e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 38943e519524SHoward Hinnant{ 38953e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 38963e519524SHoward Hinnant if (__first1 != __last1) 38973e519524SHoward Hinnant { 38983e519524SHoward Hinnant __destruct_n __d(0); 38993e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 39003e519524SHoward Hinnant value_type* __last2 = __first2; 3901ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 39023e519524SHoward Hinnant __d.__incr((value_type*)0); 39033e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 39043e519524SHoward Hinnant { 39053e519524SHoward Hinnant value_type* __j2 = __last2; 39063e519524SHoward Hinnant value_type* __i2 = __j2; 39073e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 39083e519524SHoward Hinnant { 3909ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 39103e519524SHoward Hinnant __d.__incr((value_type*)0); 39113e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3912ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3913ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 39143e519524SHoward Hinnant } 39153e519524SHoward Hinnant else 39163e519524SHoward Hinnant { 3917ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 39183e519524SHoward Hinnant __d.__incr((value_type*)0); 39193e519524SHoward Hinnant } 39203e519524SHoward Hinnant } 39213e519524SHoward Hinnant __h.release(); 39223e519524SHoward Hinnant } 39233e519524SHoward Hinnant} 39243e519524SHoward Hinnant 39253e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 39263e519524SHoward Hinnantvoid 39273e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39283e519524SHoward Hinnant{ 39293e519524SHoward Hinnant // _Compare is known to be a reference type 39303e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 39313e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3932ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3933ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 39343e519524SHoward Hinnant while (true) 39353e519524SHoward Hinnant { 39363e519524SHoward Hinnant __restart: 39373e519524SHoward Hinnant difference_type __len = __last - __first; 39383e519524SHoward Hinnant switch (__len) 39393e519524SHoward Hinnant { 39403e519524SHoward Hinnant case 0: 39413e519524SHoward Hinnant case 1: 39423e519524SHoward Hinnant return; 39433e519524SHoward Hinnant case 2: 39443e519524SHoward Hinnant if (__comp(*--__last, *__first)) 39453e519524SHoward Hinnant swap(*__first, *__last); 39463e519524SHoward Hinnant return; 39473e519524SHoward Hinnant case 3: 3948ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 39493e519524SHoward Hinnant return; 39503e519524SHoward Hinnant case 4: 3951ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 39523e519524SHoward Hinnant return; 39533e519524SHoward Hinnant case 5: 3954ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 39553e519524SHoward Hinnant return; 39563e519524SHoward Hinnant } 39573e519524SHoward Hinnant if (__len <= __limit) 39583e519524SHoward Hinnant { 3959ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 39603e519524SHoward Hinnant return; 39613e519524SHoward Hinnant } 39623e519524SHoward Hinnant // __len > 5 39633e519524SHoward Hinnant _RandomAccessIterator __m = __first; 39643e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 39653e519524SHoward Hinnant --__lm1; 39663e519524SHoward Hinnant unsigned __n_swaps; 39673e519524SHoward Hinnant { 39683e519524SHoward Hinnant difference_type __delta; 39693e519524SHoward Hinnant if (__len >= 1000) 39703e519524SHoward Hinnant { 39713e519524SHoward Hinnant __delta = __len/2; 39723e519524SHoward Hinnant __m += __delta; 39733e519524SHoward Hinnant __delta /= 2; 3974ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 39753e519524SHoward Hinnant } 39763e519524SHoward Hinnant else 39773e519524SHoward Hinnant { 39783e519524SHoward Hinnant __delta = __len/2; 39793e519524SHoward Hinnant __m += __delta; 3980ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 39813e519524SHoward Hinnant } 39823e519524SHoward Hinnant } 39833e519524SHoward Hinnant // *__m is median 39843e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 39853e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 39863e519524SHoward Hinnant _RandomAccessIterator __i = __first; 39873e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 39883e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 39893e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 39903e519524SHoward Hinnant // Prime the downward search with a guard. 39913e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 39923e519524SHoward Hinnant { 39933e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 39943e519524SHoward Hinnant // manually guard downward moving __j against __i 39953e519524SHoward Hinnant while (true) 39963e519524SHoward Hinnant { 39973e519524SHoward Hinnant if (__i == --__j) 39983e519524SHoward Hinnant { 39993e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 40003e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 40013e519524SHoward Hinnant ++__i; // __first + 1 40023e519524SHoward Hinnant __j = __last; 40033e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 40043e519524SHoward Hinnant { 40053e519524SHoward Hinnant while (true) 40063e519524SHoward Hinnant { 40073e519524SHoward Hinnant if (__i == __j) 40083e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 40093e519524SHoward Hinnant if (__comp(*__first, *__i)) 40103e519524SHoward Hinnant { 40113e519524SHoward Hinnant swap(*__i, *__j); 40123e519524SHoward Hinnant ++__n_swaps; 40133e519524SHoward Hinnant ++__i; 40143e519524SHoward Hinnant break; 40153e519524SHoward Hinnant } 40163e519524SHoward Hinnant ++__i; 40173e519524SHoward Hinnant } 40183e519524SHoward Hinnant } 40193e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 40203e519524SHoward Hinnant if (__i == __j) 40213e519524SHoward Hinnant return; 40223e519524SHoward Hinnant while (true) 40233e519524SHoward Hinnant { 40243e519524SHoward Hinnant while (!__comp(*__first, *__i)) 40253e519524SHoward Hinnant ++__i; 40263e519524SHoward Hinnant while (__comp(*__first, *--__j)) 40273e519524SHoward Hinnant ; 40283e519524SHoward Hinnant if (__i >= __j) 40293e519524SHoward Hinnant break; 40303e519524SHoward Hinnant swap(*__i, *__j); 40313e519524SHoward Hinnant ++__n_swaps; 40323e519524SHoward Hinnant ++__i; 40333e519524SHoward Hinnant } 40343e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 40353e519524SHoward Hinnant // The first part is sorted, sort the secod part 4036ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 40373e519524SHoward Hinnant __first = __i; 40383e519524SHoward Hinnant goto __restart; 40393e519524SHoward Hinnant } 40403e519524SHoward Hinnant if (__comp(*__j, *__m)) 40413e519524SHoward Hinnant { 40423e519524SHoward Hinnant swap(*__i, *__j); 40433e519524SHoward Hinnant ++__n_swaps; 40443e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 40453e519524SHoward Hinnant } 40463e519524SHoward Hinnant } 40473e519524SHoward Hinnant } 40483e519524SHoward Hinnant // It is known that *__i < *__m 40493e519524SHoward Hinnant ++__i; 40503e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 40513e519524SHoward Hinnant // if not yet partitioned... 40523e519524SHoward Hinnant if (__i < __j) 40533e519524SHoward Hinnant { 40543e519524SHoward Hinnant // known that *(__i - 1) < *__m 40553e519524SHoward Hinnant // known that __i <= __m 40563e519524SHoward Hinnant while (true) 40573e519524SHoward Hinnant { 40583e519524SHoward Hinnant // __m still guards upward moving __i 40593e519524SHoward Hinnant while (__comp(*__i, *__m)) 40603e519524SHoward Hinnant ++__i; 40613e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 40623e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 40633e519524SHoward Hinnant ; 40643e519524SHoward Hinnant if (__i > __j) 40653e519524SHoward Hinnant break; 40663e519524SHoward Hinnant swap(*__i, *__j); 40673e519524SHoward Hinnant ++__n_swaps; 40683e519524SHoward Hinnant // It is known that __m != __j 40693e519524SHoward Hinnant // If __m just moved, follow it 40703e519524SHoward Hinnant if (__m == __i) 40713e519524SHoward Hinnant __m = __j; 40723e519524SHoward Hinnant ++__i; 40733e519524SHoward Hinnant } 40743e519524SHoward Hinnant } 40753e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 40763e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 40773e519524SHoward Hinnant { 40783e519524SHoward Hinnant swap(*__i, *__m); 40793e519524SHoward Hinnant ++__n_swaps; 40803e519524SHoward Hinnant } 40813e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 40823e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 40833e519524SHoward Hinnant if (__n_swaps == 0) 40843e519524SHoward Hinnant { 4085ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 4086ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 40873e519524SHoward Hinnant { 40883e519524SHoward Hinnant if (__fs) 40893e519524SHoward Hinnant return; 40903e519524SHoward Hinnant __last = __i; 40913e519524SHoward Hinnant continue; 40923e519524SHoward Hinnant } 40933e519524SHoward Hinnant else 40943e519524SHoward Hinnant { 40953e519524SHoward Hinnant if (__fs) 40963e519524SHoward Hinnant { 40973e519524SHoward Hinnant __first = ++__i; 40983e519524SHoward Hinnant continue; 40993e519524SHoward Hinnant } 41003e519524SHoward Hinnant } 41013e519524SHoward Hinnant } 41023e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 41033e519524SHoward Hinnant if (__i - __first < __last - __i) 41043e519524SHoward Hinnant { 4105ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 4106ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 41073e519524SHoward Hinnant __first = ++__i; 41083e519524SHoward Hinnant } 41093e519524SHoward Hinnant else 41103e519524SHoward Hinnant { 4111ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4112ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 41133e519524SHoward Hinnant __last = __i; 41143e519524SHoward Hinnant } 41153e519524SHoward Hinnant } 41163e519524SHoward Hinnant} 41173e519524SHoward Hinnant 41183e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 41193e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 41203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41213e519524SHoward Hinnantvoid 41223e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 41233e519524SHoward Hinnant{ 4124aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4125aa1cad15SEric Fiselier _VSTD::__sort<_Comp_ref>(__first, __last, _Comp_ref(__comp)); 41263e519524SHoward Hinnant} 41273e519524SHoward Hinnant 41283e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 41293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41303e519524SHoward Hinnantvoid 41313e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 41323e519524SHoward Hinnant{ 4133ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 41343e519524SHoward Hinnant} 41353e519524SHoward Hinnant 41363e519524SHoward Hinnanttemplate <class _Tp> 41373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41383e519524SHoward Hinnantvoid 41393e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 41403e519524SHoward Hinnant{ 4141ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 41423e519524SHoward Hinnant} 41433e519524SHoward Hinnant 41443e519524SHoward Hinnanttemplate <class _Tp> 41453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41463e519524SHoward Hinnantvoid 41473e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 41483e519524SHoward Hinnant{ 4149ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 41503e519524SHoward Hinnant} 41513e519524SHoward Hinnant 4152f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4153f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4154f554add5SHoward Hinnantvoid 4155f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4156f554add5SHoward Hinnant{ 4157f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4158f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4159f554add5SHoward Hinnant} 4160f554add5SHoward Hinnant 4161f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4162f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4163f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4164f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4165f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4166f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4167f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4168f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4169f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4170f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4171f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4172f0544c20SHoward 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>&)) 4173f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4174f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4175f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 41763e519524SHoward Hinnant 4177f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4178f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4179f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4180f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4181f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4182f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4183f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4184f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4185f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4186f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4187f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4188f0544c20SHoward 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>&)) 4189f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4190f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4191f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 41923e519524SHoward Hinnant 4193f0544c20SHoward 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>&)) 41943e519524SHoward Hinnant 41953e519524SHoward Hinnant// lower_bound 41963e519524SHoward Hinnant 41973e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4198d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 4199e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42003e519524SHoward Hinnant{ 42013e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4202ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42033e519524SHoward Hinnant while (__len != 0) 42043e519524SHoward Hinnant { 420504695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 42063e519524SHoward Hinnant _ForwardIterator __m = __first; 4207ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4208e4383379SHoward Hinnant if (__comp(*__m, __value_)) 42093e519524SHoward Hinnant { 42103e519524SHoward Hinnant __first = ++__m; 42113e519524SHoward Hinnant __len -= __l2 + 1; 42123e519524SHoward Hinnant } 42133e519524SHoward Hinnant else 42143e519524SHoward Hinnant __len = __l2; 42153e519524SHoward Hinnant } 42163e519524SHoward Hinnant return __first; 42173e519524SHoward Hinnant} 42183e519524SHoward Hinnant 42193e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42201362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 42211362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42223e519524SHoward Hinnant_ForwardIterator 4223e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42243e519524SHoward Hinnant{ 42253e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4226e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 42273e519524SHoward Hinnant} 42283e519524SHoward Hinnant 42293e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42301362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 42311362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42323e519524SHoward Hinnant_ForwardIterator 4233e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42343e519524SHoward Hinnant{ 4235e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 42363e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42373e519524SHoward Hinnant} 42383e519524SHoward Hinnant 42393e519524SHoward Hinnant// upper_bound 42403e519524SHoward Hinnant 42413e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4242d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 4243e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42443e519524SHoward Hinnant{ 42453e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4246ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42473e519524SHoward Hinnant while (__len != 0) 42483e519524SHoward Hinnant { 424904695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 42503e519524SHoward Hinnant _ForwardIterator __m = __first; 4251ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4252e4383379SHoward Hinnant if (__comp(__value_, *__m)) 42533e519524SHoward Hinnant __len = __l2; 42543e519524SHoward Hinnant else 42553e519524SHoward Hinnant { 42563e519524SHoward Hinnant __first = ++__m; 42573e519524SHoward Hinnant __len -= __l2 + 1; 42583e519524SHoward Hinnant } 42593e519524SHoward Hinnant } 42603e519524SHoward Hinnant return __first; 42613e519524SHoward Hinnant} 42623e519524SHoward Hinnant 42633e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42641362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 42651362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42663e519524SHoward Hinnant_ForwardIterator 4267e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42683e519524SHoward Hinnant{ 42693e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4270e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 42713e519524SHoward Hinnant} 42723e519524SHoward Hinnant 42733e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42741362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 42751362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42763e519524SHoward Hinnant_ForwardIterator 4277e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42783e519524SHoward Hinnant{ 4279e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 42803e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 42813e519524SHoward Hinnant} 42823e519524SHoward Hinnant 42833e519524SHoward Hinnant// equal_range 42843e519524SHoward Hinnant 42853e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4286d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_ForwardIterator, _ForwardIterator> 4287e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42883e519524SHoward Hinnant{ 42893e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4290ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42913e519524SHoward Hinnant while (__len != 0) 42923e519524SHoward Hinnant { 429304695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 42943e519524SHoward Hinnant _ForwardIterator __m = __first; 4295ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4296e4383379SHoward Hinnant if (__comp(*__m, __value_)) 42973e519524SHoward Hinnant { 42983e519524SHoward Hinnant __first = ++__m; 42993e519524SHoward Hinnant __len -= __l2 + 1; 43003e519524SHoward Hinnant } 4301e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 43023e519524SHoward Hinnant { 43033e519524SHoward Hinnant __last = __m; 43043e519524SHoward Hinnant __len = __l2; 43053e519524SHoward Hinnant } 43063e519524SHoward Hinnant else 43073e519524SHoward Hinnant { 43083e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 43093e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 43103e519524SHoward Hinnant ( 4311e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4312e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 43133e519524SHoward Hinnant ); 43143e519524SHoward Hinnant } 43153e519524SHoward Hinnant } 43163e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 43173e519524SHoward Hinnant} 43183e519524SHoward Hinnant 43193e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 43201362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 43211362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 43223e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4323e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43243e519524SHoward Hinnant{ 4325aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4326e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 43273e519524SHoward Hinnant} 43283e519524SHoward Hinnant 43293e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43301362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 43311362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 43323e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4333e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43343e519524SHoward Hinnant{ 4335e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 43363e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43373e519524SHoward Hinnant} 43383e519524SHoward Hinnant 43393e519524SHoward Hinnant// binary_search 43403e519524SHoward Hinnant 43413e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4342d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 43433e519524SHoward Hinnantbool 4344e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43453e519524SHoward Hinnant{ 4346e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4347e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 43483e519524SHoward Hinnant} 43493e519524SHoward Hinnant 43503e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 43511362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 43521362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 43533e519524SHoward Hinnantbool 4354e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43553e519524SHoward Hinnant{ 4356aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4357e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 43583e519524SHoward Hinnant} 43593e519524SHoward Hinnant 43603e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43611362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 43621362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 43633e519524SHoward Hinnantbool 4364e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43653e519524SHoward Hinnant{ 4366e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 43673e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43683e519524SHoward Hinnant} 43693e519524SHoward Hinnant 43703e519524SHoward Hinnant// merge 43713e519524SHoward Hinnant 43723e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 43733e519524SHoward Hinnant_OutputIterator 43743e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 43753e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 43763e519524SHoward Hinnant{ 43773e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 43783e519524SHoward Hinnant { 43793e519524SHoward Hinnant if (__first2 == __last2) 4380ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 43813e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 43823e519524SHoward Hinnant { 43833e519524SHoward Hinnant *__result = *__first2; 43843e519524SHoward Hinnant ++__first2; 43853e519524SHoward Hinnant } 43863e519524SHoward Hinnant else 43873e519524SHoward Hinnant { 43883e519524SHoward Hinnant *__result = *__first1; 43893e519524SHoward Hinnant ++__first1; 43903e519524SHoward Hinnant } 43913e519524SHoward Hinnant } 4392ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 43933e519524SHoward Hinnant} 43943e519524SHoward Hinnant 43953e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 43963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43973e519524SHoward Hinnant_OutputIterator 43983e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43993e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 44003e519524SHoward Hinnant{ 4401aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4402ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 44033e519524SHoward Hinnant} 44043e519524SHoward Hinnant 44053e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 44063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44073e519524SHoward Hinnant_OutputIterator 44083e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 44093e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 44103e519524SHoward Hinnant{ 44113e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 44123e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 44134f41779cSMarshall Clow return _VSTD::merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 44143e519524SHoward Hinnant} 44153e519524SHoward Hinnant 44163e519524SHoward Hinnant// inplace_merge 44173e519524SHoward Hinnant 4418adfdae18SMarshall Clowtemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4419adfdae18SMarshall Clow class _OutputIterator> 4420adfdae18SMarshall Clowvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4421adfdae18SMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 4422adfdae18SMarshall Clow _OutputIterator __result, _Compare __comp) 4423adfdae18SMarshall Clow{ 4424adfdae18SMarshall Clow for (; __first1 != __last1; ++__result) 4425adfdae18SMarshall Clow { 4426adfdae18SMarshall Clow if (__first2 == __last2) 4427adfdae18SMarshall Clow { 4428adfdae18SMarshall Clow _VSTD::move(__first1, __last1, __result); 4429adfdae18SMarshall Clow return; 4430adfdae18SMarshall Clow } 4431adfdae18SMarshall Clow 4432adfdae18SMarshall Clow if (__comp(*__first2, *__first1)) 4433adfdae18SMarshall Clow { 4434adfdae18SMarshall Clow *__result = _VSTD::move(*__first2); 4435adfdae18SMarshall Clow ++__first2; 4436adfdae18SMarshall Clow } 4437adfdae18SMarshall Clow else 4438adfdae18SMarshall Clow { 4439adfdae18SMarshall Clow *__result = _VSTD::move(*__first1); 4440adfdae18SMarshall Clow ++__first1; 4441adfdae18SMarshall Clow } 4442adfdae18SMarshall Clow } 4443adfdae18SMarshall Clow // __first2 through __last2 are already in the right spot. 4444adfdae18SMarshall Clow} 4445adfdae18SMarshall Clow 44463e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 44473e519524SHoward Hinnantvoid 44483e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44493e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 44503e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 44513e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 44523e519524SHoward Hinnant{ 44533e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 44543e519524SHoward Hinnant __destruct_n __d(0); 44553e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 44563e519524SHoward Hinnant if (__len1 <= __len2) 44573e519524SHoward Hinnant { 44583e519524SHoward Hinnant value_type* __p = __buff; 44597fa68653SMarshall Clow for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, (void) ++__p) 4460ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 4461adfdae18SMarshall Clow __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp); 44623e519524SHoward Hinnant } 44633e519524SHoward Hinnant else 44643e519524SHoward Hinnant { 44653e519524SHoward Hinnant value_type* __p = __buff; 44667fa68653SMarshall Clow for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, (void) ++__p) 4467ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 44683e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 44693e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 4470adfdae18SMarshall Clow __half_inplace_merge(_Rv(__p), _Rv(__buff), 4471adfdae18SMarshall Clow _RBi(__middle), _RBi(__first), 4472a763b36fSMarshall Clow _RBi(__last), __invert<_Compare>(__comp)); 44733e519524SHoward Hinnant } 44743e519524SHoward Hinnant} 44753e519524SHoward Hinnant 44763e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 44773e519524SHoward Hinnantvoid 44783e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44793e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 44803e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 44813e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 44823e519524SHoward Hinnant{ 44833e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 44843e519524SHoward Hinnant while (true) 44853e519524SHoward Hinnant { 44863e519524SHoward Hinnant // if __middle == __last, we're done 44873e519524SHoward Hinnant if (__len2 == 0) 44883e519524SHoward Hinnant return; 4489526e0929SMarshall Clow if (__len1 <= __buff_size || __len2 <= __buff_size) 4490526e0929SMarshall Clow return __buffered_inplace_merge<_Compare> 4491526e0929SMarshall Clow (__first, __middle, __last, __comp, __len1, __len2, __buff); 44923e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4493910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 44943e519524SHoward Hinnant { 44953e519524SHoward Hinnant if (__len1 == 0) 44963e519524SHoward Hinnant return; 44973e519524SHoward Hinnant if (__comp(*__middle, *__first)) 44983e519524SHoward Hinnant break; 44993e519524SHoward Hinnant } 45003e519524SHoward Hinnant // __first < __middle < __last 45013e519524SHoward Hinnant // *__first > *__middle 45023e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 45033e519524SHoward Hinnant // all elements in: 45043e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 45053e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 45063e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 45073e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 45083e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 45093e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 45103e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 45113e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 45123e519524SHoward Hinnant // binary search smaller range 45133e519524SHoward Hinnant if (__len1 < __len2) 45143e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 45153e519524SHoward Hinnant __len21 = __len2 / 2; 45163e519524SHoward Hinnant __m2 = __middle; 4517ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 45183e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4519ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 45203e519524SHoward Hinnant } 45213e519524SHoward Hinnant else 45223e519524SHoward Hinnant { 45233e519524SHoward Hinnant if (__len1 == 1) 45243e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 45253e519524SHoward Hinnant // It is known *__first > *__middle 45263e519524SHoward Hinnant swap(*__first, *__middle); 45273e519524SHoward Hinnant return; 45283e519524SHoward Hinnant } 45293e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 45303e519524SHoward Hinnant __len11 = __len1 / 2; 45313e519524SHoward Hinnant __m1 = __first; 4532ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 45333e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4534ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 45353e519524SHoward Hinnant } 45363e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 45373e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 45383e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 45393e519524SHoward Hinnant // swap middle two partitions 4540ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 45413e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 45423e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 45433e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 45443e519524SHoward Hinnant { 45453e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 45463e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 45473e519524SHoward Hinnant __first = __middle; 45483e519524SHoward Hinnant __middle = __m2; 45493e519524SHoward Hinnant __len1 = __len12; 45503e519524SHoward Hinnant __len2 = __len22; 45513e519524SHoward Hinnant } 45523e519524SHoward Hinnant else 45533e519524SHoward Hinnant { 45543e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 45553e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 45563e519524SHoward Hinnant __last = __middle; 45573e519524SHoward Hinnant __middle = __m1; 45583e519524SHoward Hinnant __len1 = __len11; 45593e519524SHoward Hinnant __len2 = __len21; 45603e519524SHoward Hinnant } 45613e519524SHoward Hinnant } 45623e519524SHoward Hinnant} 45633e519524SHoward Hinnant 45643e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 45653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45663e519524SHoward Hinnantvoid 45673e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45683e519524SHoward Hinnant _Compare __comp) 45693e519524SHoward Hinnant{ 45703e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 45713e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4572ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4573ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4574ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 45750b48cf9aSMarshall Clow pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 45760b48cf9aSMarshall Clow unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 4577aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4578ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 45793e519524SHoward Hinnant __buf.first, __buf.second); 45803e519524SHoward Hinnant} 45813e519524SHoward Hinnant 45823e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 45833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45843e519524SHoward Hinnantvoid 45853e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 45863e519524SHoward Hinnant{ 4587ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 45883e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 45893e519524SHoward Hinnant} 45903e519524SHoward Hinnant 45913e519524SHoward Hinnant// stable_sort 45923e519524SHoward Hinnant 45933e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 45943e519524SHoward Hinnantvoid 45953e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 45963e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45973e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 45983e519524SHoward Hinnant{ 45993e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 46003e519524SHoward Hinnant __destruct_n __d(0); 46013e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 46023e519524SHoward Hinnant for (; true; ++__result) 46033e519524SHoward Hinnant { 46043e519524SHoward Hinnant if (__first1 == __last1) 46053e519524SHoward Hinnant { 46067fa68653SMarshall Clow for (; __first2 != __last2; ++__first2, ++__result, (void) __d.__incr((value_type*)0)) 4607ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 46083e519524SHoward Hinnant __h.release(); 46093e519524SHoward Hinnant return; 46103e519524SHoward Hinnant } 46113e519524SHoward Hinnant if (__first2 == __last2) 46123e519524SHoward Hinnant { 46137fa68653SMarshall Clow for (; __first1 != __last1; ++__first1, ++__result, (void) __d.__incr((value_type*)0)) 4614ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 46153e519524SHoward Hinnant __h.release(); 46163e519524SHoward Hinnant return; 46173e519524SHoward Hinnant } 46183e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 46193e519524SHoward Hinnant { 4620ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 46213e519524SHoward Hinnant __d.__incr((value_type*)0); 46223e519524SHoward Hinnant ++__first2; 46233e519524SHoward Hinnant } 46243e519524SHoward Hinnant else 46253e519524SHoward Hinnant { 4626ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 46273e519524SHoward Hinnant __d.__incr((value_type*)0); 46283e519524SHoward Hinnant ++__first1; 46293e519524SHoward Hinnant } 46303e519524SHoward Hinnant } 46313e519524SHoward Hinnant} 46323e519524SHoward Hinnant 46333e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 46343e519524SHoward Hinnantvoid 46353e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 46363e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 46373e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 46383e519524SHoward Hinnant{ 46393e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 46403e519524SHoward Hinnant { 46413e519524SHoward Hinnant if (__first2 == __last2) 46423e519524SHoward Hinnant { 46437fa68653SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__result) 4644ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 46453e519524SHoward Hinnant return; 46463e519524SHoward Hinnant } 46473e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 46483e519524SHoward Hinnant { 4649ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 46503e519524SHoward Hinnant ++__first2; 46513e519524SHoward Hinnant } 46523e519524SHoward Hinnant else 46533e519524SHoward Hinnant { 4654ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 46553e519524SHoward Hinnant ++__first1; 46563e519524SHoward Hinnant } 46573e519524SHoward Hinnant } 46587fa68653SMarshall Clow for (; __first2 != __last2; ++__first2, (void) ++__result) 4659ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 46603e519524SHoward Hinnant} 46613e519524SHoward Hinnant 46623e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46633e519524SHoward Hinnantvoid 46643e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 46653e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46663e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 46673e519524SHoward Hinnant 46683e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46693e519524SHoward Hinnantvoid 46703e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 46713e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46723e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 46733e519524SHoward Hinnant{ 46743e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46753e519524SHoward Hinnant switch (__len) 46763e519524SHoward Hinnant { 46773e519524SHoward Hinnant case 0: 46783e519524SHoward Hinnant return; 46793e519524SHoward Hinnant case 1: 4680ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46813e519524SHoward Hinnant return; 46823e519524SHoward Hinnant case 2: 46833e519524SHoward Hinnant __destruct_n __d(0); 46843e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 46853e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 46863e519524SHoward Hinnant { 4687ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46883e519524SHoward Hinnant __d.__incr((value_type*)0); 46893e519524SHoward Hinnant ++__first2; 4690ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46913e519524SHoward Hinnant } 46923e519524SHoward Hinnant else 46933e519524SHoward Hinnant { 4694ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46953e519524SHoward Hinnant __d.__incr((value_type*)0); 46963e519524SHoward Hinnant ++__first2; 4697ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46983e519524SHoward Hinnant } 46993e519524SHoward Hinnant __h2.release(); 47003e519524SHoward Hinnant return; 47013e519524SHoward Hinnant } 47023e519524SHoward Hinnant if (__len <= 8) 47033e519524SHoward Hinnant { 47043e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 47053e519524SHoward Hinnant return; 47063e519524SHoward Hinnant } 47073e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 47083e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 47093e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 47103e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 47113e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 47123e519524SHoward Hinnant} 47133e519524SHoward Hinnant 47143e519524SHoward Hinnanttemplate <class _Tp> 47153e519524SHoward Hinnantstruct __stable_sort_switch 47163e519524SHoward Hinnant{ 4717ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 47183e519524SHoward Hinnant}; 47193e519524SHoward Hinnant 47203e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47213e519524SHoward Hinnantvoid 47223e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47233e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47243e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 47253e519524SHoward Hinnant{ 47263e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47273e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47283e519524SHoward Hinnant switch (__len) 47293e519524SHoward Hinnant { 47303e519524SHoward Hinnant case 0: 47313e519524SHoward Hinnant case 1: 47323e519524SHoward Hinnant return; 47333e519524SHoward Hinnant case 2: 47343e519524SHoward Hinnant if (__comp(*--__last, *__first)) 47353e519524SHoward Hinnant swap(*__first, *__last); 47363e519524SHoward Hinnant return; 47373e519524SHoward Hinnant } 47383e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 47393e519524SHoward Hinnant { 47403e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 47413e519524SHoward Hinnant return; 47423e519524SHoward Hinnant } 47433e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 47443e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 47453e519524SHoward Hinnant if (__len <= __buff_size) 47463e519524SHoward Hinnant { 47473e519524SHoward Hinnant __destruct_n __d(0); 47483e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 47493e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 47503e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 47513e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 47523e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 47533e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 47543e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 47553e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 47563e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 47573e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 47583e519524SHoward Hinnant// __first, __comp); 47593e519524SHoward Hinnant return; 47603e519524SHoward Hinnant } 47613e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 47623e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 47633e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 47643e519524SHoward Hinnant} 47653e519524SHoward Hinnant 47663e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47683e519524SHoward Hinnantvoid 47693e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47703e519524SHoward Hinnant{ 47713e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47723e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47733e519524SHoward Hinnant difference_type __len = __last - __first; 47743e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 47753e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 47763e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 47773e519524SHoward Hinnant { 4778ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 47793e519524SHoward Hinnant __h.reset(__buf.first); 47803e519524SHoward Hinnant } 4781aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 47823e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 47833e519524SHoward Hinnant} 47843e519524SHoward Hinnant 47853e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 47863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47873e519524SHoward Hinnantvoid 47883e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 47893e519524SHoward Hinnant{ 4790ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47913e519524SHoward Hinnant} 47923e519524SHoward Hinnant 47933e519524SHoward Hinnant// is_heap_until 47943e519524SHoward Hinnant 47953e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47961362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 47973e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47983e519524SHoward Hinnant{ 4799ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48003e519524SHoward Hinnant difference_type __len = __last - __first; 48013e519524SHoward Hinnant difference_type __p = 0; 48023e519524SHoward Hinnant difference_type __c = 1; 48033e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 48043e519524SHoward Hinnant while (__c < __len) 48053e519524SHoward Hinnant { 48063e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 48073e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 48083e519524SHoward Hinnant return __cp; 48093e519524SHoward Hinnant ++__c; 48103e519524SHoward Hinnant ++__cp; 48113e519524SHoward Hinnant if (__c == __len) 48123e519524SHoward Hinnant return __last; 48133e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 48143e519524SHoward Hinnant return __cp; 48153e519524SHoward Hinnant ++__p; 48163e519524SHoward Hinnant ++__pp; 48173e519524SHoward Hinnant __c = 2 * __p + 1; 48183e519524SHoward Hinnant } 48193e519524SHoward Hinnant return __last; 48203e519524SHoward Hinnant} 48213e519524SHoward Hinnant 48223e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 48231362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 48241362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 48253e519524SHoward Hinnant_RandomAccessIterator 48263e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 48273e519524SHoward Hinnant{ 4828ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48293e519524SHoward Hinnant} 48303e519524SHoward Hinnant 48313e519524SHoward Hinnant// is_heap 48323e519524SHoward Hinnant 48333e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48341362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 48351362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 48363e519524SHoward Hinnantbool 48373e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48383e519524SHoward Hinnant{ 4839ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 48403e519524SHoward Hinnant} 48413e519524SHoward Hinnant 48423e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 48431362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 48441362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 48453e519524SHoward Hinnantbool 48463e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48473e519524SHoward Hinnant{ 4848ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48493e519524SHoward Hinnant} 48503e519524SHoward Hinnant 48513e519524SHoward Hinnant// push_heap 48523e519524SHoward Hinnant 48533e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48543e519524SHoward Hinnantvoid 48558b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48563e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48573e519524SHoward Hinnant{ 48583e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48593e519524SHoward Hinnant if (__len > 1) 48603e519524SHoward Hinnant { 48613e519524SHoward Hinnant __len = (__len - 2) / 2; 48623e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 48633e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 48643e519524SHoward Hinnant { 4865ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 48663e519524SHoward Hinnant do 48673e519524SHoward Hinnant { 4868ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 48693e519524SHoward Hinnant __last = __ptr; 48703e519524SHoward Hinnant if (__len == 0) 48713e519524SHoward Hinnant break; 48723e519524SHoward Hinnant __len = (__len - 1) / 2; 48733e519524SHoward Hinnant __ptr = __first + __len; 48743e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4875ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 48763e519524SHoward Hinnant } 48773e519524SHoward Hinnant } 48783e519524SHoward Hinnant} 48793e519524SHoward Hinnant 48803e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48823e519524SHoward Hinnantvoid 48833e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48843e519524SHoward Hinnant{ 4885aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 48868b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 48873e519524SHoward Hinnant} 48883e519524SHoward Hinnant 48893e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48913e519524SHoward Hinnantvoid 48923e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48933e519524SHoward Hinnant{ 4894ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48953e519524SHoward Hinnant} 48963e519524SHoward Hinnant 48973e519524SHoward Hinnant// pop_heap 48983e519524SHoward Hinnant 48993e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49008b512602SDavid Majnemervoid 4901fd838227SEric Fiselier__sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/, 4902fd838227SEric Fiselier _Compare __comp, 49038b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 49048b512602SDavid Majnemer _RandomAccessIterator __start) 49058b512602SDavid Majnemer{ 49068b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49078b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 49088b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 49098b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 49108b512602SDavid Majnemer difference_type __child = __start - __first; 49118b512602SDavid Majnemer 49128b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 49138b512602SDavid Majnemer return; 49148b512602SDavid Majnemer 49158b512602SDavid Majnemer __child = 2 * __child + 1; 49168b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 49178b512602SDavid Majnemer 49188b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 49198b512602SDavid Majnemer // right-child exists and is greater than left-child 49208b512602SDavid Majnemer ++__child_i; 49218b512602SDavid Majnemer ++__child; 49228b512602SDavid Majnemer } 49238b512602SDavid Majnemer 49248b512602SDavid Majnemer // check if we are in heap-order 49258b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 49268b512602SDavid Majnemer // we are, __start is larger than it's largest child 49278b512602SDavid Majnemer return; 49288b512602SDavid Majnemer 49298b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 49308b512602SDavid Majnemer do 49318b512602SDavid Majnemer { 49328b512602SDavid Majnemer // we are not in heap-order, swap the parent with it's largest child 49338b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 49348b512602SDavid Majnemer __start = __child_i; 49358b512602SDavid Majnemer 49368b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 49378b512602SDavid Majnemer break; 49388b512602SDavid Majnemer 49398b512602SDavid Majnemer // recompute the child based off of the updated parent 49408b512602SDavid Majnemer __child = 2 * __child + 1; 49418b512602SDavid Majnemer __child_i = __first + __child; 49428b512602SDavid Majnemer 49438b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 49448b512602SDavid Majnemer // right-child exists and is greater than left-child 49458b512602SDavid Majnemer ++__child_i; 49468b512602SDavid Majnemer ++__child; 49478b512602SDavid Majnemer } 49488b512602SDavid Majnemer 49498b512602SDavid Majnemer // check if we are in heap-order 49508b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 49518b512602SDavid Majnemer *__start = _VSTD::move(__top); 49528b512602SDavid Majnemer} 49538b512602SDavid Majnemer 49548b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 49553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49563e519524SHoward Hinnantvoid 49573e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 49583e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 49593e519524SHoward Hinnant{ 49603e519524SHoward Hinnant if (__len > 1) 49613e519524SHoward Hinnant { 49623e519524SHoward Hinnant swap(*__first, *--__last); 49638b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 49643e519524SHoward Hinnant } 49653e519524SHoward Hinnant} 49663e519524SHoward Hinnant 49673e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49693e519524SHoward Hinnantvoid 49703e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49713e519524SHoward Hinnant{ 4972aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 49733e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 49743e519524SHoward Hinnant} 49753e519524SHoward Hinnant 49763e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49783e519524SHoward Hinnantvoid 49793e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49803e519524SHoward Hinnant{ 4981ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49823e519524SHoward Hinnant} 49833e519524SHoward Hinnant 49843e519524SHoward Hinnant// make_heap 49853e519524SHoward Hinnant 49863e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49873e519524SHoward Hinnantvoid 49883e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49893e519524SHoward Hinnant{ 49903e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49913e519524SHoward Hinnant difference_type __n = __last - __first; 49923e519524SHoward Hinnant if (__n > 1) 49933e519524SHoward Hinnant { 49948b512602SDavid Majnemer // start from the first parent, there is no need to consider children 49958b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 49968b512602SDavid Majnemer { 49978b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 49988b512602SDavid Majnemer } 49993e519524SHoward Hinnant } 50003e519524SHoward Hinnant} 50013e519524SHoward Hinnant 50023e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50043e519524SHoward Hinnantvoid 50053e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50063e519524SHoward Hinnant{ 5007aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 50083e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 50093e519524SHoward Hinnant} 50103e519524SHoward Hinnant 50113e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50133e519524SHoward Hinnantvoid 50143e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50153e519524SHoward Hinnant{ 5016ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50173e519524SHoward Hinnant} 50183e519524SHoward Hinnant 50193e519524SHoward Hinnant// sort_heap 50203e519524SHoward Hinnant 50213e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50223e519524SHoward Hinnantvoid 50233e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50243e519524SHoward Hinnant{ 50253e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50267fa68653SMarshall Clow for (difference_type __n = __last - __first; __n > 1; --__last, (void) --__n) 50273e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 50283e519524SHoward Hinnant} 50293e519524SHoward Hinnant 50303e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50323e519524SHoward Hinnantvoid 50333e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50343e519524SHoward Hinnant{ 5035aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 50363e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 50373e519524SHoward Hinnant} 50383e519524SHoward Hinnant 50393e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50413e519524SHoward Hinnantvoid 50423e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50433e519524SHoward Hinnant{ 5044ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50453e519524SHoward Hinnant} 50463e519524SHoward Hinnant 50473e519524SHoward Hinnant// partial_sort 50483e519524SHoward Hinnant 50493e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50503e519524SHoward Hinnantvoid 50513e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 50523e519524SHoward Hinnant _Compare __comp) 50533e519524SHoward Hinnant{ 50543e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 50553e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 50563e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 50573e519524SHoward Hinnant { 50583e519524SHoward Hinnant if (__comp(*__i, *__first)) 50593e519524SHoward Hinnant { 50603e519524SHoward Hinnant swap(*__i, *__first); 50618b512602SDavid Majnemer __sift_down<_Compare>(__first, __middle, __comp, __len, __first); 50623e519524SHoward Hinnant } 50633e519524SHoward Hinnant } 50643e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 50653e519524SHoward Hinnant} 50663e519524SHoward Hinnant 50673e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50693e519524SHoward Hinnantvoid 50703e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 50713e519524SHoward Hinnant _Compare __comp) 50723e519524SHoward Hinnant{ 5073aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 50743e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 50753e519524SHoward Hinnant} 50763e519524SHoward Hinnant 50773e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50793e519524SHoward Hinnantvoid 50803e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 50813e519524SHoward Hinnant{ 5082ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 50833e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50843e519524SHoward Hinnant} 50853e519524SHoward Hinnant 50863e519524SHoward Hinnant// partial_sort_copy 50873e519524SHoward Hinnant 50883e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 50893e519524SHoward Hinnant_RandomAccessIterator 50903e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 50913e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50923e519524SHoward Hinnant{ 50933e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 50943e519524SHoward Hinnant if (__r != __result_last) 50953e519524SHoward Hinnant { 50967fa68653SMarshall Clow for (; __first != __last && __r != __result_last; ++__first, (void) ++__r) 50973e519524SHoward Hinnant *__r = *__first; 50983e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 50998b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 51003e519524SHoward Hinnant for (; __first != __last; ++__first) 51013e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 51023e519524SHoward Hinnant { 51033e519524SHoward Hinnant *__result_first = *__first; 51048b512602SDavid Majnemer __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 51053e519524SHoward Hinnant } 51063e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 51073e519524SHoward Hinnant } 51083e519524SHoward Hinnant return __r; 51093e519524SHoward Hinnant} 51103e519524SHoward Hinnant 51113e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 51123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51133e519524SHoward Hinnant_RandomAccessIterator 51143e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 51153e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 51163e519524SHoward Hinnant{ 5117aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 51183e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 51193e519524SHoward Hinnant} 51203e519524SHoward Hinnant 51213e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 51223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51233e519524SHoward Hinnant_RandomAccessIterator 51243e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 51253e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 51263e519524SHoward Hinnant{ 5127ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 51283e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51293e519524SHoward Hinnant} 51303e519524SHoward Hinnant 51313e519524SHoward Hinnant// nth_element 51323e519524SHoward Hinnant 51333e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51343e519524SHoward Hinnantvoid 51353e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 51363e519524SHoward Hinnant{ 51373e519524SHoward Hinnant // _Compare is known to be a reference type 51383e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 51393e519524SHoward Hinnant const difference_type __limit = 7; 51403e519524SHoward Hinnant while (true) 51413e519524SHoward Hinnant { 51423e519524SHoward Hinnant __restart: 5143b34b4819SHoward Hinnant if (__nth == __last) 5144b34b4819SHoward Hinnant return; 51453e519524SHoward Hinnant difference_type __len = __last - __first; 51463e519524SHoward Hinnant switch (__len) 51473e519524SHoward Hinnant { 51483e519524SHoward Hinnant case 0: 51493e519524SHoward Hinnant case 1: 51503e519524SHoward Hinnant return; 51513e519524SHoward Hinnant case 2: 51523e519524SHoward Hinnant if (__comp(*--__last, *__first)) 51533e519524SHoward Hinnant swap(*__first, *__last); 51543e519524SHoward Hinnant return; 51553e519524SHoward Hinnant case 3: 51563e519524SHoward Hinnant { 51573e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5158ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 51593e519524SHoward Hinnant return; 51603e519524SHoward Hinnant } 51613e519524SHoward Hinnant } 51623e519524SHoward Hinnant if (__len <= __limit) 51633e519524SHoward Hinnant { 51643e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 51653e519524SHoward Hinnant return; 51663e519524SHoward Hinnant } 51673e519524SHoward Hinnant // __len > __limit >= 3 51683e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 51693e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5170ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 51713e519524SHoward Hinnant // *__m is median 51723e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 51733e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 51743e519524SHoward Hinnant _RandomAccessIterator __i = __first; 51753e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 51763e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51773e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 51783e519524SHoward Hinnant // Prime the downward search with a guard. 51793e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 51803e519524SHoward Hinnant { 51813e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 51823e519524SHoward Hinnant // manually guard downward moving __j against __i 51833e519524SHoward Hinnant while (true) 51843e519524SHoward Hinnant { 51853e519524SHoward Hinnant if (__i == --__j) 51863e519524SHoward Hinnant { 51873e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 51883e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 51893e519524SHoward Hinnant ++__i; // __first + 1 51903e519524SHoward Hinnant __j = __last; 51913e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 51923e519524SHoward Hinnant { 51933e519524SHoward Hinnant while (true) 51943e519524SHoward Hinnant { 51953e519524SHoward Hinnant if (__i == __j) 51963e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 51973e519524SHoward Hinnant if (__comp(*__first, *__i)) 51983e519524SHoward Hinnant { 51993e519524SHoward Hinnant swap(*__i, *__j); 52003e519524SHoward Hinnant ++__n_swaps; 52013e519524SHoward Hinnant ++__i; 52023e519524SHoward Hinnant break; 52033e519524SHoward Hinnant } 52043e519524SHoward Hinnant ++__i; 52053e519524SHoward Hinnant } 52063e519524SHoward Hinnant } 52073e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 52083e519524SHoward Hinnant if (__i == __j) 52093e519524SHoward Hinnant return; 52103e519524SHoward Hinnant while (true) 52113e519524SHoward Hinnant { 52123e519524SHoward Hinnant while (!__comp(*__first, *__i)) 52133e519524SHoward Hinnant ++__i; 52143e519524SHoward Hinnant while (__comp(*__first, *--__j)) 52153e519524SHoward Hinnant ; 52163e519524SHoward Hinnant if (__i >= __j) 52173e519524SHoward Hinnant break; 52183e519524SHoward Hinnant swap(*__i, *__j); 52193e519524SHoward Hinnant ++__n_swaps; 52203e519524SHoward Hinnant ++__i; 52213e519524SHoward Hinnant } 52223e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 52233e519524SHoward Hinnant // The first part is sorted, 52243e519524SHoward Hinnant if (__nth < __i) 52253e519524SHoward Hinnant return; 52263e519524SHoward Hinnant // __nth_element the secod part 52273e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 52283e519524SHoward Hinnant __first = __i; 52293e519524SHoward Hinnant goto __restart; 52303e519524SHoward Hinnant } 52313e519524SHoward Hinnant if (__comp(*__j, *__m)) 52323e519524SHoward Hinnant { 52333e519524SHoward Hinnant swap(*__i, *__j); 52343e519524SHoward Hinnant ++__n_swaps; 52353e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 52363e519524SHoward Hinnant } 52373e519524SHoward Hinnant } 52383e519524SHoward Hinnant } 52393e519524SHoward Hinnant ++__i; 52403e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 52413e519524SHoward Hinnant // if not yet partitioned... 52423e519524SHoward Hinnant if (__i < __j) 52433e519524SHoward Hinnant { 52443e519524SHoward Hinnant // known that *(__i - 1) < *__m 52453e519524SHoward Hinnant while (true) 52463e519524SHoward Hinnant { 52473e519524SHoward Hinnant // __m still guards upward moving __i 52483e519524SHoward Hinnant while (__comp(*__i, *__m)) 52493e519524SHoward Hinnant ++__i; 52503e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 52513e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 52523e519524SHoward Hinnant ; 52533e519524SHoward Hinnant if (__i >= __j) 52543e519524SHoward Hinnant break; 52553e519524SHoward Hinnant swap(*__i, *__j); 52563e519524SHoward Hinnant ++__n_swaps; 52573e519524SHoward Hinnant // It is known that __m != __j 52583e519524SHoward Hinnant // If __m just moved, follow it 52593e519524SHoward Hinnant if (__m == __i) 52603e519524SHoward Hinnant __m = __j; 52613e519524SHoward Hinnant ++__i; 52623e519524SHoward Hinnant } 52633e519524SHoward Hinnant } 52643e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 52653e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 52663e519524SHoward Hinnant { 52673e519524SHoward Hinnant swap(*__i, *__m); 52683e519524SHoward Hinnant ++__n_swaps; 52693e519524SHoward Hinnant } 52703e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 52713e519524SHoward Hinnant if (__nth == __i) 52723e519524SHoward Hinnant return; 52733e519524SHoward Hinnant if (__n_swaps == 0) 52743e519524SHoward Hinnant { 52753e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 52763e519524SHoward Hinnant if (__nth < __i) 52773e519524SHoward Hinnant { 52783e519524SHoward Hinnant // Check for [__first, __i) already sorted 52793e519524SHoward Hinnant __j = __m = __first; 52803e519524SHoward Hinnant while (++__j != __i) 52813e519524SHoward Hinnant { 52823e519524SHoward Hinnant if (__comp(*__j, *__m)) 52833e519524SHoward Hinnant // not yet sorted, so sort 52843e519524SHoward Hinnant goto not_sorted; 52853e519524SHoward Hinnant __m = __j; 52863e519524SHoward Hinnant } 52873e519524SHoward Hinnant // [__first, __i) sorted 52883e519524SHoward Hinnant return; 52893e519524SHoward Hinnant } 52903e519524SHoward Hinnant else 52913e519524SHoward Hinnant { 52923e519524SHoward Hinnant // Check for [__i, __last) already sorted 52933e519524SHoward Hinnant __j = __m = __i; 52943e519524SHoward Hinnant while (++__j != __last) 52953e519524SHoward Hinnant { 52963e519524SHoward Hinnant if (__comp(*__j, *__m)) 52973e519524SHoward Hinnant // not yet sorted, so sort 52983e519524SHoward Hinnant goto not_sorted; 52993e519524SHoward Hinnant __m = __j; 53003e519524SHoward Hinnant } 53013e519524SHoward Hinnant // [__i, __last) sorted 53023e519524SHoward Hinnant return; 53033e519524SHoward Hinnant } 53043e519524SHoward Hinnant } 53053e519524SHoward Hinnantnot_sorted: 53063e519524SHoward Hinnant // __nth_element on range containing __nth 53073e519524SHoward Hinnant if (__nth < __i) 53083e519524SHoward Hinnant { 53093e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 53103e519524SHoward Hinnant __last = __i; 53113e519524SHoward Hinnant } 53123e519524SHoward Hinnant else 53133e519524SHoward Hinnant { 53143e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 53153e519524SHoward Hinnant __first = ++__i; 53163e519524SHoward Hinnant } 53173e519524SHoward Hinnant } 53183e519524SHoward Hinnant} 53193e519524SHoward Hinnant 53203e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 53213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53223e519524SHoward Hinnantvoid 53233e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 53243e519524SHoward Hinnant{ 5325aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 53263e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 53273e519524SHoward Hinnant} 53283e519524SHoward Hinnant 53293e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 53303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53313e519524SHoward Hinnantvoid 53323e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 53333e519524SHoward Hinnant{ 5334ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 53353e519524SHoward Hinnant} 53363e519524SHoward Hinnant 53373e519524SHoward Hinnant// includes 53383e519524SHoward Hinnant 53393e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 53408da1a487SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 53413e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53423e519524SHoward Hinnant _Compare __comp) 53433e519524SHoward Hinnant{ 53443e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 53453e519524SHoward Hinnant { 53463e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 53473e519524SHoward Hinnant return false; 53483e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53493e519524SHoward Hinnant ++__first2; 53503e519524SHoward Hinnant } 53513e519524SHoward Hinnant return true; 53523e519524SHoward Hinnant} 53533e519524SHoward Hinnant 53543e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 53551362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 53561362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 53573e519524SHoward Hinnantbool 53583e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53593e519524SHoward Hinnant _Compare __comp) 53603e519524SHoward Hinnant{ 5361aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 53623e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 53633e519524SHoward Hinnant} 53643e519524SHoward Hinnant 53653e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 53661362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 53671362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 53683e519524SHoward Hinnantbool 53693e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 53703e519524SHoward Hinnant{ 5371ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 53723e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53733e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53743e519524SHoward Hinnant} 53753e519524SHoward Hinnant 53763e519524SHoward Hinnant// set_union 53773e519524SHoward Hinnant 53783e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53793e519524SHoward Hinnant_OutputIterator 53803e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 53813e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53823e519524SHoward Hinnant{ 53833e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 53843e519524SHoward Hinnant { 53853e519524SHoward Hinnant if (__first2 == __last2) 5386ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 53873e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 53883e519524SHoward Hinnant { 53893e519524SHoward Hinnant *__result = *__first2; 53903e519524SHoward Hinnant ++__first2; 53913e519524SHoward Hinnant } 53923e519524SHoward Hinnant else 53933e519524SHoward Hinnant { 53943e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53953e519524SHoward Hinnant ++__first2; 539605da5b02SMarshall Clow *__result = *__first1; 53973e519524SHoward Hinnant ++__first1; 53983e519524SHoward Hinnant } 53993e519524SHoward Hinnant } 5400ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 54013e519524SHoward Hinnant} 54023e519524SHoward Hinnant 54033e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54053e519524SHoward Hinnant_OutputIterator 54063e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 54073e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54083e519524SHoward Hinnant{ 5409aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 54103e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 54113e519524SHoward Hinnant} 54123e519524SHoward Hinnant 54133e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54153e519524SHoward Hinnant_OutputIterator 54163e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 54173e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54183e519524SHoward Hinnant{ 5419ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 54203e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54213e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54223e519524SHoward Hinnant} 54233e519524SHoward Hinnant 54243e519524SHoward Hinnant// set_intersection 54253e519524SHoward Hinnant 54263e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54278da1a487SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 54283e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54293e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54303e519524SHoward Hinnant{ 54313e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 54323e519524SHoward Hinnant { 54333e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54343e519524SHoward Hinnant ++__first1; 54353e519524SHoward Hinnant else 54363e519524SHoward Hinnant { 54373e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54383e519524SHoward Hinnant { 54393e519524SHoward Hinnant *__result = *__first1; 54403e519524SHoward Hinnant ++__result; 54413e519524SHoward Hinnant ++__first1; 54423e519524SHoward Hinnant } 54433e519524SHoward Hinnant ++__first2; 54443e519524SHoward Hinnant } 54453e519524SHoward Hinnant } 54463e519524SHoward Hinnant return __result; 54473e519524SHoward Hinnant} 54483e519524SHoward Hinnant 54493e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54508da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 54513e519524SHoward Hinnant_OutputIterator 54523e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54533e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54543e519524SHoward Hinnant{ 5455aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 54563e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 54573e519524SHoward Hinnant} 54583e519524SHoward Hinnant 54593e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54608da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 54613e519524SHoward Hinnant_OutputIterator 54623e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54633e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54643e519524SHoward Hinnant{ 5465ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 54663e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54673e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54683e519524SHoward Hinnant} 54693e519524SHoward Hinnant 54703e519524SHoward Hinnant// set_difference 54713e519524SHoward Hinnant 54723e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54733e519524SHoward Hinnant_OutputIterator 54743e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54753e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54763e519524SHoward Hinnant{ 54773e519524SHoward Hinnant while (__first1 != __last1) 54783e519524SHoward Hinnant { 54793e519524SHoward Hinnant if (__first2 == __last2) 5480ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54813e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54823e519524SHoward Hinnant { 54833e519524SHoward Hinnant *__result = *__first1; 54843e519524SHoward Hinnant ++__result; 54853e519524SHoward Hinnant ++__first1; 54863e519524SHoward Hinnant } 54873e519524SHoward Hinnant else 54883e519524SHoward Hinnant { 54893e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54903e519524SHoward Hinnant ++__first1; 54913e519524SHoward Hinnant ++__first2; 54923e519524SHoward Hinnant } 54933e519524SHoward Hinnant } 54943e519524SHoward Hinnant return __result; 54953e519524SHoward Hinnant} 54963e519524SHoward Hinnant 54973e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54993e519524SHoward Hinnant_OutputIterator 55003e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55013e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55023e519524SHoward Hinnant{ 5503aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 55043e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 55053e519524SHoward Hinnant} 55063e519524SHoward Hinnant 55073e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55093e519524SHoward Hinnant_OutputIterator 55103e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55113e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55123e519524SHoward Hinnant{ 5513ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 55143e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55153e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55163e519524SHoward Hinnant} 55173e519524SHoward Hinnant 55183e519524SHoward Hinnant// set_symmetric_difference 55193e519524SHoward Hinnant 55203e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55213e519524SHoward Hinnant_OutputIterator 55223e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55233e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55243e519524SHoward Hinnant{ 55253e519524SHoward Hinnant while (__first1 != __last1) 55263e519524SHoward Hinnant { 55273e519524SHoward Hinnant if (__first2 == __last2) 5528ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55293e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55303e519524SHoward Hinnant { 55313e519524SHoward Hinnant *__result = *__first1; 55323e519524SHoward Hinnant ++__result; 55333e519524SHoward Hinnant ++__first1; 55343e519524SHoward Hinnant } 55353e519524SHoward Hinnant else 55363e519524SHoward Hinnant { 55373e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55383e519524SHoward Hinnant { 55393e519524SHoward Hinnant *__result = *__first2; 55403e519524SHoward Hinnant ++__result; 55413e519524SHoward Hinnant } 55423e519524SHoward Hinnant else 55433e519524SHoward Hinnant ++__first1; 55443e519524SHoward Hinnant ++__first2; 55453e519524SHoward Hinnant } 55463e519524SHoward Hinnant } 5547ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 55483e519524SHoward Hinnant} 55493e519524SHoward Hinnant 55503e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55523e519524SHoward Hinnant_OutputIterator 55533e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55543e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55553e519524SHoward Hinnant{ 5556aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 55573e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 55583e519524SHoward Hinnant} 55593e519524SHoward Hinnant 55603e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55623e519524SHoward Hinnant_OutputIterator 55633e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55643e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55653e519524SHoward Hinnant{ 5566ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 55673e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55683e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55693e519524SHoward Hinnant} 55703e519524SHoward Hinnant 55713e519524SHoward Hinnant// lexicographical_compare 55723e519524SHoward Hinnant 55733e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 55741b9a4ffdSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 55753e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55763e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55773e519524SHoward Hinnant{ 5578910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 55793e519524SHoward Hinnant { 55803e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 55813e519524SHoward Hinnant return true; 55823e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55833e519524SHoward Hinnant return false; 55843e519524SHoward Hinnant } 55853e519524SHoward Hinnant return false; 55863e519524SHoward Hinnant} 55873e519524SHoward Hinnant 55883e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 55891362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 55901362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55913e519524SHoward Hinnantbool 55923e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55933e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55943e519524SHoward Hinnant{ 5595aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 55963e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 55973e519524SHoward Hinnant} 55983e519524SHoward Hinnant 55993e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 56001362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 56011362d7efSNico Weber_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{ 5645aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 56463e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 56473e519524SHoward Hinnant} 56483e519524SHoward Hinnant 56493e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 56503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56513e519524SHoward Hinnantbool 56523e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 56533e519524SHoward Hinnant{ 5654ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 56553e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 56563e519524SHoward Hinnant} 56573e519524SHoward Hinnant 56583e519524SHoward Hinnant// prev_permutation 56593e519524SHoward Hinnant 56603e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 56613e519524SHoward Hinnantbool 56623e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56633e519524SHoward Hinnant{ 56643e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56653e519524SHoward Hinnant if (__first == __last || __first == --__i) 56663e519524SHoward Hinnant return false; 56673e519524SHoward Hinnant while (true) 56683e519524SHoward Hinnant { 56693e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56703e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 56713e519524SHoward Hinnant { 56723e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56733e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 56743e519524SHoward Hinnant ; 56753e519524SHoward Hinnant swap(*__i, *__j); 5676ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56773e519524SHoward Hinnant return true; 56783e519524SHoward Hinnant } 56793e519524SHoward Hinnant if (__i == __first) 56803e519524SHoward Hinnant { 5681ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56823e519524SHoward Hinnant return false; 56833e519524SHoward Hinnant } 56843e519524SHoward Hinnant } 56853e519524SHoward Hinnant} 56863e519524SHoward Hinnant 56873e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56893e519524SHoward Hinnantbool 56903e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56913e519524SHoward Hinnant{ 5692aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 56933e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 56943e519524SHoward Hinnant} 56953e519524SHoward Hinnant 56963e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 56973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56983e519524SHoward Hinnantbool 56993e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 57003e519524SHoward Hinnant{ 5701ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 57023e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 57033e519524SHoward Hinnant} 57043e519524SHoward Hinnant 57053e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 57063e519524SHoward Hinnant 5707a016efb1SEric Fiselier_LIBCPP_POP_MACROS 5708a016efb1SEric Fiselier 57090a06eb91SLouis Dionne#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17 571095689243SLouis Dionne# include <__pstl_algorithm> 57110a06eb91SLouis Dionne#endif 57120a06eb91SLouis Dionne 57133e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5714