Struct Perm

pub struct Perm<S>
where
    S: PermSize,
{ /* private fields */ }

Generic permutation data structure.

Implementations

impl<const SIZE: usize> Perm<Static<SIZE>>

pub fn identity() -> Self

pub fn swap(first: usize, second: usize) -> Option<Self>

pub fn cycle() -> Self

pub fn reverse_cycle() -> Self

pub fn permute_indices(&self, perm: &PermS<SIZE>) -> Self

pub fn conjugate_with(&self, other: &PermS<SIZE>) -> Self

pub fn to_size<const NEW_SIZE: usize>(&self) -> Option<PermS<NEW_SIZE>>

impl Perm<Static<0>>

pub fn empty() -> Self

impl Perm<Static<1>>

pub fn unit() -> Self

impl Perm<Static<2>>

pub fn swap2() -> Self

impl Perm<Dynamic>

pub fn empty() -> Self

pub fn unit() -> Self

pub fn swap(size: usize, first: usize, second: usize) -> Option<Self>

pub fn identity(size: usize) -> Self

pub fn cycle(size: usize) -> Self

pub fn reverse_cycle(size: usize) -> Self

pub fn permute_indices(&self, perm: &PermD) -> Option<Self>

pub fn conjugate_with(&self, other: &PermD) -> Option<Self>

pub fn to_size(&self, new_size: usize) -> Option<PermD>

pub fn into_static<const SIZE: usize>(self) -> Option<PermS<SIZE>>

impl<const SIZE: usize> Perm<Static<SIZE>>

pub fn into_dynamic(self) -> PermD

Trait Implementations

impl<S> Clone for Perm<S>

where S: PermSize + Clone, S::Container: Clone,

fn clone(&self) -> Perm<S>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<S> Debug for Perm<S>

where S: PermSize + Debug, S::Container: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<const SIZE: usize> Distribution<Perm<Static<SIZE>>> for Standard

fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> PermS<SIZE>

Sample an random static permutation.

fn sample_iter<R>(self, rng: R) -> DistIter<Self, R, T>

where R: Rng, Self: Sized,

Create an iterator that generates random values of T, using rng as the source of randomness.

fn map<F, S>(self, func: F) -> DistMap<Self, F, T, S>

where F: Fn(T) -> S, Self: Sized,

Create a distribution of values of ‘S’ by mapping the output of Self through the closure F

impl<S> Hash for Perm<S>

where S: PermSize + Hash, S::Container: Hash,

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Mul<&Perm<Dynamic>> for &PermD

type Output = Perm<Dynamic>

The resulting type after applying the * operator.

fn mul(self, other: &PermD) -> Self::Output

Performs the * operation.

impl<const SIZE: usize> Mul<&Perm<Dynamic>> for &PermS<SIZE>

type Output = Perm<Static<SIZE>>

The resulting type after applying the * operator.

fn mul(self, other: &PermD) -> Self::Output

Performs the * operation.

impl<const SIZE: usize> Mul<&Perm<Static<SIZE>>> for &PermD

type Output = Perm<Static<SIZE>>

The resulting type after applying the * operator.

fn mul(self, other: &PermS<SIZE>) -> Self::Output

Performs the * operation.

impl<const SIZE: usize> Mul<&Perm<Static<SIZE>>> for &PermS<SIZE>

type Output = Perm<Static<SIZE>>

The resulting type after applying the * operator.

fn mul(self, other: &PermS<SIZE>) -> Self::Output

Performs the * operation.

impl<SL, SR> PartialEq<Perm<SR>> for Perm<SL>

where SL: PermSize, SR: PermSize,

fn eq(&self, other: &Perm<SR>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PermProduct<Perm<Dynamic>> for PermD

type Output = Option<Perm<Dynamic>>

fn perm_product(&self, other: &PermD) -> Self::Output

impl<const SIZE: usize> PermProduct<Perm<Dynamic>> for PermS<SIZE>

type Output = Option<Perm<Static<SIZE>>>

fn perm_product(&self, other: &PermD) -> Self::Output

impl<const SIZE: usize> PermProduct<Perm<Static<SIZE>>> for PermD

type Output = Option<Perm<Static<SIZE>>>

fn perm_product(&self, other: &PermS<SIZE>) -> Self::Output

impl<const SIZE: usize> PermProduct<Perm<Static<SIZE>>> for PermS<SIZE>

type Output = Perm<Static<SIZE>>

fn perm_product(&self, other: &PermS<SIZE>) -> Self::Output

impl<'a> Product<&'a Perm<Dynamic>> for Option<PermD>

fn product<I>(iter: I) -> Self

where I: Iterator<Item = &'a PermD>,

Takes an iterator and generates Self from the elements by multiplying the items.

impl<'a, const SIZE: usize> Product<&'a Perm<Dynamic>> for Option<PermS<SIZE>>

fn product<I>(iter: I) -> Self

where I: Iterator<Item = &'a PermD>,

Takes an iterator and generates Self from the elements by multiplying the items.

impl<'a, const SIZE: usize> Product<&'a Perm<Static<SIZE>>> for PermD

fn product<I>(iter: I) -> Self

where I: Iterator<Item = &'a PermS<SIZE>>,

Takes an iterator and generates Self from the elements by multiplying the items.

impl<'a, const SIZE: usize> Product<&'a Perm<Static<SIZE>>> for PermS<SIZE>

fn product<I>(iter: I) -> Self

where I: Iterator<Item = &'a PermS<SIZE>>,

Takes an iterator and generates Self from the elements by multiplying the items.

impl Product<Perm<Dynamic>> for Option<PermD>

fn product<I>(iter: I) -> Self

where I: Iterator<Item = PermD>,

Takes an iterator and generates Self from the elements by multiplying the items.

impl<const SIZE: usize> Product<Perm<Dynamic>> for Option<PermS<SIZE>>

fn product<I>(iter: I) -> Self

where I: Iterator<Item = PermD>,

Takes an iterator and generates Self from the elements by multiplying the items.

impl<const SIZE: usize> Product<Perm<Static<SIZE>>> for PermD

fn product<I>(iter: I) -> Self

where I: Iterator<Item = PermS<SIZE>>,

Takes an iterator and generates Self from the elements by multiplying the items.

impl<S> Eq for Perm<S>

where S: PermSize + Eq, S::Container: Eq,