Struct PermutationClassSymbol 

pub struct PermutationClassSymbol<T: PermutationRank> { /* private fields */ }

Structure to handle conjugacy class symbols.

Implementations

impl<T: PermutationRank> PermutationClassSymbol<T>

pub fn builder() -> PermutationClassSymbolBuilder<T>

pub fn new( symstr: &str, reps: Option<Vec<Permutation<T>>>, ) -> Result<Self, GenericSymbolParsingError>

Creates a class symbol from a string and a representative element.

Some possible conjugacy class symbols:

"1||(5)(2)(1)||"
"1||(4)(1)|^(2)|"
"12||(2)(2)(1)|^(5)|"

Note that the prefactor is required.

Arguments

• symstr - A string to be parsed to give a class symbol.
• rep - An optional representative element for this class.

Returns

A Result wrapping the constructed class symbol.

Panics

Panics when unable to construct a class symbol from the specified string.

Errors

Errors when the string contains no parsable class size prefactor, or when the string cannot be parsed as a generic symbol.

Trait Implementations

impl<T: Clone + PermutationRank> Clone for PermutationClassSymbol<T>

fn clone(&self) -> PermutationClassSymbol<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: PermutationRank> CollectionSymbol for PermutationClassSymbol<T>

type CollectionElement = Permutation<T>

The type of the elements in the collection.

fn from_reps( symstr: &str, reps: Option<Vec<Self::CollectionElement>>, ) -> Result<Self, GenericSymbolParsingError>

Constructs a collection symbol from a string and one or more representative collection elements.

fn representative(&self) -> Option<&Self::CollectionElement>

The first representative element of the collection.

fn representatives(&self) -> Option<&Vec<Self::CollectionElement>>

All representative elements of the collection.

fn size(&self) -> usize

The size of the collection which is given by the number of representative elements multiplied by the multiplicity of the symbol. If no representative elements exist, then the size is taken to be the multiplicity of the symbol itself.

impl<T: Debug + PermutationRank> Debug for PermutationClassSymbol<T>

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

Formats the value using the given formatter.

impl<'de, T> Deserialize<'de> for PermutationClassSymbol<T>

where T: Deserialize<'de> + PermutationRank,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: PermutationRank> Display for PermutationClassSymbol<T>

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

Formats the value using the given formatter.

impl<T: PermutationRank> Hash for PermutationClassSymbol<T>

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<T: PermutationRank> MathematicalSymbol for PermutationClassSymbol<T>

fn main(&self) -> String

The main part of the symbol, which denotes the cycle pattern of the class.

fn presuper(&self) -> String

The pre-superscript part of the symbol, which is empty.

fn presub(&self) -> String

The pre-subscript part of the symbol, which is empty.

fn postsuper(&self) -> String

The post-superscript part of the symbol, which is empty.

fn postsub(&self) -> String

The post-subscript part of the symbol, which is empty.

fn prefactor(&self) -> String

The prefactor part of the symbol, which denotes the size of the class.

fn postfactor(&self) -> String

The postfactor part of the symbol, which is empty.

fn multiplicity(&self) -> Option<usize>

The number of times the representative elements are ‘duplicated’ to give the size of the class.

impl<T: PermutationRank> PartialEq for PermutationClassSymbol<T>

fn eq(&self, other: &Self) -> 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<T> Serialize for PermutationClassSymbol<T>

where T: Serialize + PermutationRank,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: PermutationRank> Eq for PermutationClassSymbol<T>