std::experimental::ranges::Sortable
From cppreference.com
< cpp | experimental | ranges
C++
Experimental
| Technical Specification | ||||
| Filesystem library (filesystem TS) | ||||
| Library fundamentals (library fundamentals TS) | ||||
| Library fundamentals 2 (library fundamentals TS v2) | ||||
| Library fundamentals 3 (library fundamentals TS v3) | ||||
| Extensions for parallelism (parallelism TS) | ||||
| Extensions for parallelism 2 (parallelism TS v2) | ||||
| Extensions for concurrency (concurrency TS) | ||||
| Extensions for concurrency 2 (concurrency TS v2) | ||||
| Concepts (concepts TS) | ||||
| Ranges (ranges TS) | ||||
| Reflection (reflection TS) | ||||
| Mathematical special functions (special functions TR) | ||||
| Experimental Non-TS | ||||
| Pattern Matching | ||||
| Linear Algebra | ||||
| std::execution | ||||
| Contracts | ||||
| 2D Graphics |
Iterators library
| Iterator concepts | ||||||||||||||||||
| Indirect callable concepts | ||||||||||||||||||
| Common algorithm requirements | ||||||||||||||||||
|
||||||||||||||||||
| Concept utilities | ||||||||||||||||||
| Iterator utilities and operations | ||||||||||||||||||
| Iterator traits | ||||||||||||||||||
| Iterator adaptors | ||||||||||||||||||
| Stream iterators | ||||||||||||||||||
|
template
<
class I, class R =
ranges::less
<>, class P =
ranges::identity
>
concept bool Sortable = |
(ranges TS) | |
The Sortable concept specifies the common requirements of algorithms that permute sequences into ordered sequences (for example, ranges::sort