std::permutable - cppreference.com

std::permutable - cppreference.com

From cppreference.com


`template< class I > concept permutable = std::forward_iterator<I> && std::indirectly_movable_storable<I, I> && std::indirectly_swappable<I, I>;`		(since C++20)

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

Semantic requirements

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

See also

sortable (C++20)	specifies the common requirements of algorithms that permute sequences into ordered sequences (concept) [edit]
ranges::removeranges::remove_if (C++20)(C++20)	removes elements satisfying specific criteria (algorithm function object)[edit]
ranges::unique (C++20)	removes consecutive duplicate elements in a range (algorithm function object)[edit]
ranges::reverse (C++20)	reverses the order of elements in a range (algorithm function object)[edit]
ranges::rotate (C++20)	rotates the order of elements in a range (algorithm function object)[edit]
ranges::shuffle (C++20)	randomly re-orders elements in a range (algorithm function object)[edit]
ranges::partition (C++20)	divides a range of elements into two groups (algorithm function object)[edit]
ranges::stable_partition (C++20)	divides elements into two groups while preserving their relative order (algorithm function object)[edit]