Namespaces
Variants
Views
Actions

std::permutable

From cppreference.com
< cpp‎ | iterator
 
 
Iterator library
Iterator concepts
Iterator primitives
Algorithm concepts and utilities
Indirect callable concepts
Common algorithm requirements
permutable
(C++20)
(C++20)
(C++20)
Utilities
Iterator adaptors
Stream iterators
Iterator customization points
Iterator operations
(C++11)
(C++11)
Range access
(C++11)(C++14)
(C++11)(C++14)
(C++17)(C++20)
(C++14)(C++14)
(C++14)(C++14)
(C++17)
(C++17)
 
Defined in header <iterator>
template< class I >

concept permutable =
    std::forward_iterator<I> &&
    std::indirectly_movable_storable<I> &&

    std::indirectly_swappable<I>;
(since C++20)

The concept permutable refines std::forward_iterator by adding requirements for reordering through moves and swaps.

[edit] Semantic requirements

I models permutable only if all concepts it subsumes are modeled.

[edit] See also

(C++20)
specifies the common requirements of algorithms that permute sequences into ordered sequences
(concept) [edit]
removes elements satisfying specific criteria
(niebloid) [edit]
removes consecutive duplicate elements in a range
(niebloid) [edit]
reverses the order of elements in a range
(niebloid) [edit]
rotates the order of elements in a range
(niebloid) [edit]
randomly re-orders elements in a range
(niebloid) [edit]
divides a range of elements into two groups
(niebloid) [edit]
divides elements into two groups while preserving their relative order
(niebloid) [edit]