permutation.hpp File Reference

Classes
struct	ranges::v3::is_permutation_fn
struct	ranges::v3::next_permutation_fn
struct	ranges::v3::prev_permutation_fn

Namespaces
	ranges
	unstable_remove have O(1) complexity for each element remove, unlike remove O(n) [for worst case] Each erased element overwritten (moved in) with last one.

Typedefs
template<typename I1 , typename I2 , typename C = equal_to, typename P1 = ident, typename P2 = ident>
using	ranges::v3::IsPermutationable = meta::strict_and< ForwardIterator< I1 >, ForwardIterator< I2 >, Comparable< I1, I2, C, P1, P2 > >

Variables
constexpr with_braced_init_args< is_permutation_fn >	ranges::v3::is_permutation {}
constexpr with_braced_init_args< next_permutation_fn >	ranges::v3::next_permutation {}
constexpr with_braced_init_args< prev_permutation_fn >	ranges::v3::prev_permutation {}