std::ranges::sort - cppreference.com

en.cppreference.com/w/cpp/algorithm/ranges/sort     2025-02-12T00:00:00.0000000
Sorts the elements in the range [first, last) in non-descending order. The order of equivalent elements is not guaranteed to be preserved. A sequence is sorted with respect to a comparator comp if for any iterator it pointing to the sequence and any non-negative integer n such that it + n is a valid iterator pointing to an element of the sequence, std:: invoke (comp, std:: invoke (proj, * (it ...

std::sort - cppreference.com

en.cppreference.com/w/cpp/algorithm/sort     2024-04-01T00:00:00.0000000
first, last - the pair of iterators defining the range of elements to sort : policy - the execution policy to use : comp - comparison function object (i.e. an object that satisfies the requirements of Compare) which returns true if the first argument is less than (i.e. is ordered before) the second.. The signature of the comparison function should be equivalent to the following:

Constrained algorithms (since C++20) - cppreference.com

en.cppreference.com/w/cpp/algorithm/ranges     2024-11-27T00:00:00.0000000
C++20 provides constrained versions of most algorithms in the namespace std::ranges.In these algorithms, a range can be specified as either an iterator-sentinel pair or as a single range argument, and projections and pointer-to-member callables are supported. Additionally, the return types of most algorithms have been changed to return all potentially useful information computed during the ...

std::experimental::ranges::sort - cppreference.com

en.cppreference.com/w/cpp/experimental/ranges/algorithm/sort
2) Sorts the elements in the range r, as if by return ranges:: sort (ranges:: begin (r), ranges:: end (r), comp, proj);. Notwithstanding the declarations depicted above, the actual number and order of template parameters for algorithm declarations is unspecified.

Algorithms library - cppreference.com

en.cppreference.com/w/cpp/algorithm     2024-05-20T00:00:00.0000000
Constrained algorithms (since C++20) C++20 provides constrained versions of most algorithms in the namespace std::ranges.In these algorithms, a range can be specified as either an iterator-sentinel pair or as a single range argument, and projections and pointer-to-member callables are supported. Additionally, the return types of most algorithms have been changed to return all potentially ...

std::ranges::sort_heap - cppreference.com

en.cppreference.com/w/cpp/algorithm/ranges/sort_heap     2025-03-23T00:00:00.0000000
If the specified range is not a heap with respect to comp and proj, the behavior is undefined.. The function-like entities described on this page are algorithm function objects (informally known as niebloids), that is: . Explicit template argument lists cannot be specified when calling any of them.

Ranges library (since C++20) - cppreference.com

en.cppreference.com/w/cpp/ranges     2024-12-12T00:00:00.0000000
All algorithms that take iterator pairs now have overloads that accept ranges (e.g. ranges::sort) begin + [ 0 , size ) - counted sequences, e.g. range returned by views::counted [ begin , predicate ) - conditionally-terminated sequences, e.g. range returned by views::take_while

std::ranges:: is_sorted_until - Reference

en.cppreference.com/w/cpp/algorithm/ranges/is_sorted_until     2025-02-12T00:00:00.0000000
Examines the range [first, last) and finds the largest range beginning at first in which the elements are sorted in non-descending order.. A sequence is sorted with respect to a comparator comp if for any iterator it pointing to the sequence and any non-negative integer n such that it + n is a valid iterator pointing to an element of the sequence, std:: invoke (comp, std:: invoke (proj, * (it ...

std::ranges::partial_sort - cppreference.com

en.cppreference.com/w/cpp/algorithm/ranges/partial_sort     2025-02-12T00:00:00.0000000
The function-like entities described on this page are algorithm function objects (informally known as niebloids), that is: . Explicit template argument lists cannot be specified when calling any of them. None of them are visible to argument-dependent lookup.; When any of them are found by normal unqualified lookup as the name to the left of the function-call operator, argument-dependent lookup ...

std::ranges:: partial_sort_copy, std::ranges:: partial_sort_copy_result

en.cppreference.com/w/cpp/algorithm/ranges/partial_sort_copy     2025-02-12T00:00:00.0000000
The function-like entities described on this page are algorithm function objects (informally known as niebloids), that is: . Explicit template argument lists cannot be specified when calling any of them. None of them are visible to argument-dependent lookup.; When any of them are found by normal unqualified lookup as the name to the left of the function-call operator, argument-dependent lookup ...
Feedback