Struct FiniteGroupMultiplicationTable 

pub struct FiniteGroupMultiplicationTable { /* private fields */ }

Implementations

impl FiniteGroupMultiplicationTable

pub fn generating_set(&self) -> GeneratingSet<'_>

pub fn small_generating_set(&self, attempts: Option<usize>) -> GeneratingSet<'_>

impl FiniteGroupMultiplicationTable

pub fn check_state(&self) -> Result<(), &'static str>

pub fn new( n: usize, ident: usize, inv: Vec<usize>, mul: Vec<Vec<usize>>, ) -> Result<Self, &'static str>

pub fn new_unchecked( n: usize, ident: usize, inv: Vec<usize>, mul: Vec<Vec<usize>>, is_abelian: Option<bool>, is_simple: Option<bool>, ) -> Self

pub fn mul(&self, x: usize, y: usize) -> usize

pub fn inv(&self, x: usize) -> usize

pub fn ident(&self) -> usize

pub fn from_raw_model<T: PartialEq + Eq + Hash + Clone + Debug>( elems: Vec<T>, ident: impl Fn() -> T, inv: impl Fn(T) -> T, mul: impl Fn(T, T) -> T, ) -> Result<Self, &'static str>

pub fn from_raw_model_unchecked<T: PartialEq + Eq + Hash + Clone + Debug>( elems: Vec<T>, ident: impl Fn() -> T, inv: impl Fn(T) -> T, mul: impl Fn(T, T) -> T, is_abelian: Option<bool>, is_simple: Option<bool>, ) -> Self

pub fn size(&self) -> usize

pub fn elems(&self) -> Range<usize>

pub fn mul_many(&self, elems: &Vec<usize>) -> usize

pub fn order(&self, x: usize) -> Result<usize, ()>

pub fn is_abelian(&self) -> bool

pub fn cache_conjugacy_classes(&mut self)

pub fn conjugacy_class(&mut self, x: usize) -> Result<Subset<'_>, ()>

pub fn conjugacy_classes(&self) -> GroupPartition<'_>

pub fn subgroups(&self) -> Vec<(Subgroup<'_>, Subset<'_>)>

pub fn normal_subgroups(&self) -> Vec<(NormalSubgroup<'_>, Subset<'_>)>

Trait Implementations

impl Debug for FiniteGroupMultiplicationTable

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

Formats the value using the given formatter.