Struct Permutation

pub struct Permutation<const N: usize> { /* private fields */ }

Implementations

impl<const N: usize> Permutation<N>

pub fn new(perm: [usize; N]) -> Result<Self, &'static str>

pub fn new_from_cycles(cycles: Vec<Vec<usize>>) -> Result<Self, &'static str>

pub fn call(&self, x: usize) -> Result<usize, &'static str>

pub fn sign(&self) -> C2

pub fn disjoint_cycles(&self) -> Vec<Cycle<N>>

pub fn cycle_shape(&self) -> Vec<usize>

pub fn all_permutations() -> impl Iterator<Item = Self>

pub fn symmetric_composition_table() -> (FiniteGroupMultiplicationTable, Vec<Self>, HashMap<Self, usize>)

pub fn alternating_composition_table() -> (FiniteGroupMultiplicationTable, Vec<Self>, HashMap<Self, usize>)

Trait Implementations

impl<const N: usize> Clone for Permutation<N>

fn clone(&self) -> Permutation<N>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<const N: usize> Debug for Permutation<N>

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

Formats the value using the given formatter.

impl<const N: usize> Display for Permutation<N>

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

Formats the value using the given formatter.

impl<const N: usize> From<Cycle<N>> for Permutation<N>

fn from(cyc: Cycle<N>) -> Self

Converts to this type from the input type.

impl<const N: usize> From<Permutation<N>> for Permutation

fn from(value: Permutation<N>) -> Self

Converts to this type from the input type.

impl<const N: usize> Group for Permutation<N>

fn identity() -> Self

fn inverse(self) -> Self

fn compose_refs(a: &Self, b: &Self) -> Self

fn compose_mut(&mut self, other: &Self)

fn inverse_ref(&self) -> Self

fn compose(a: Self, b: Self) -> Self

fn compose_lref(a: &Self, b: Self) -> Self

fn compose_rref(a: Self, b: &Self) -> Self

fn compose_list(elems: Vec<impl Borrow<Self>>) -> Self

fn nat_pow(&self, n: &Natural) -> Self

fn int_pow(&self, n: &Integer) -> Self

fn generated_finite_subgroup_table( generators: Vec<Self>, ) -> (FiniteGroupMultiplicationTable, Vec<Self>, HashMap<Self, usize>)

where Self: Hash,

fn generated_finite_subgroup(gens: Vec<Self>) -> FiniteSubgroup<Self>

where Self: Hash,

impl<const N: usize> Hash for Permutation<N>

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<const N: usize> PartialEq for Permutation<N>

fn eq(&self, other: &Permutation<N>) -> 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<const N: usize> TryFrom<Permutation> for Permutation<N>

type Error = ()

The type returned in the event of a conversion error.

fn try_from(value: Permutation) -> Result<Self, Self::Error>

Performs the conversion.

impl<const N: usize> Eq for Permutation<N>

impl<const N: usize> StructuralPartialEq for Permutation<N>