Struct PermutationCanonicalStructure 

pub struct PermutationCanonicalStructure {}

Trait Implementations

impl AssociativeCompositionSignature for PermutationCanonicalStructure

fn compose_nonempty_list( &self, elems: Vec<impl Borrow<Self::Set>>, ) -> Option<Self::Set>

Returns None if the list is empty.

impl Clone for PermutationCanonicalStructure

fn clone(&self) -> PermutationCanonicalStructure

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl CompositionSignature for PermutationCanonicalStructure

fn compose(&self, a: &Self::Set, b: &Self::Set) -> Self::Set

fn compose_mut(&self, a: &mut Self::Set, b: &Self::Set)

impl Debug for PermutationCanonicalStructure

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

Formats the value using the given formatter.

impl EqSignature for PermutationCanonicalStructure

where Permutation: Eq,

fn equal(&self, a: &Self::Set, b: &Self::Set) -> bool

impl GroupSignature for PermutationCanonicalStructure

fn inverse(&self, a: &Self::Set) -> Self::Set

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

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

where Self::Set: Hash + Eq,

fn generated_finite_subgroup( &self, gens: Vec<Self::Set>, ) -> FiniteSubgroup<Self::Set>

where Self::Set: Hash + Eq,

impl IdentitySignature for PermutationCanonicalStructure

fn identity(&self) -> Self::Set

Returns the identity element e.

impl LeftCancellativeCompositionSignature for PermutationCanonicalStructure

fn try_left_difference(&self, a: &Self::Set, b: &Self::Set) -> Option<Self::Set>

Try to find x such that a = compose(b, x).

impl MonoidSignature for PermutationCanonicalStructure

fn compose_list(&self, elems: Vec<impl Borrow<Self::Set>>) -> Self::Set

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

impl PartialEq for PermutationCanonicalStructure

fn eq(&self, other: &PermutationCanonicalStructure) -> 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 RightCancellativeCompositionSignature for PermutationCanonicalStructure

fn try_right_difference( &self, a: &Self::Set, b: &Self::Set, ) -> Option<Self::Set>

Try to find x such that a = compose(x, b).

impl SetSignature for PermutationCanonicalStructure

type Set = Permutation

fn is_element(&self, _x: &Self::Set) -> Result<(), String>

Some instances of Self::Set may not be valid to represent elements of this set. Return true if x is a valid element and false if not.

impl TryInverseSignature for PermutationCanonicalStructure

fn try_inverse(&self, a: &Self::Set) -> Option<Self::Set>

Return x such that compose(x, a) = compose(a, x) = e or None if no such x exists.

impl TryLeftInverseSignature for PermutationCanonicalStructure

fn try_left_inverse(&self, a: &Self::Set) -> Option<Self::Set>

Return x such that compose(x, a) = e or None if no such x exists.

impl TryRightInverseSignature for PermutationCanonicalStructure

fn try_right_inverse(&self, a: &Self::Set) -> Option<Self::Set>

Return x such that compose(a, x) = e or None if no such x exists.

impl Eq for PermutationCanonicalStructure

impl Signature for PermutationCanonicalStructure

impl StructuralPartialEq for PermutationCanonicalStructure