Showing content from https://en.cppreference.com/w/cpp/algorithm/ranges/../../iterator/sortable.html below:
std::sortable - cppreference.com
The sortable concept specifies the requirements for algorithms that permute a range into an ordered range according to Comp.
std::sortable<I, Comp, Proj> is modeled only if all concepts it subsumes are modeled.
sorts a range into ascending order
(algorithm function object)[edit] sorts a range of elements while preserving order between equal elements
(algorithm function object)[edit] sorts the first N elements of a range
(algorithm function object)[edit] partially sorts the given range making sure that it is partitioned by the given element
(algorithm function object)[edit] merges two ordered ranges in-place
(algorithm function object)[edit] adds an element to a max heap
(algorithm function object)[edit] removes the largest element from a max heap
(algorithm function object)[edit] creates a max heap out of a range of elements
(algorithm function object)[edit] turns a max heap into a range of elements sorted in ascending order
(algorithm function object)[edit] generates the next greater lexicographic permutation of a range of elements
(algorithm function object)[edit] generates the next smaller lexicographic permutation of a range of elements
(algorithm function object)[edit]
RetroSearch is an open source project built by @garambo
| Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4