std::experimental::ranges::Permutable
From cppreference.com
< cpp | experimental | ranges
C++
Technical specifications
Filesystem library (filesystem TS) | ||||
Library fundamentals (library fundamentals TS) | ||||
Library fundamentals 2 (library fundamentals 2 TS) | ||||
Extensions for parallelism (parallelism TS) | ||||
Extensions for parallelism 2 (parallelism TS v2) | ||||
Extensions for concurrency (concurrency TS) | ||||
Concepts (concepts TS) | ||||
Ranges (ranges TS) | ||||
Special mathematical functions (special math TR) |
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> 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).