std::experimental::ranges:: Permutable
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 |
Iterator concepts | ||||
Indirect callable concepts | ||||
Common algorithm requirements | ||||
Concept utilities | ||||
Iterator utilities and operations | ||||
Iterator traits | ||||
Iterator adaptors | ||||
Stream iterators | ||||
template
<
class
I
>
concept
bool
Permutable
=
|
(ranges TS) | |
The
Permutable
concept specifies the common requirements of algorithms that reorder elements in place by moving or swapping them (for example,
ranges::rotate
).