pub struct QuotientModule<M: Module> {
pub module: Arc<M>,
pub subspaces: BiVec<Subspace>,
pub basis_list: BiVec<Vec<usize>>,
pub truncation: i32,
}Expand description
A quotient of a module truncated below a fix degree.
Fields§
§module: Arc<M>The underlying module
subspaces: BiVec<Subspace>The subspaces that we quotient out by
basis_list: BiVec<Vec<usize>>For each degree d, basis_list[d] is a list of basis elements of self.module that
generates the quotient.
truncation: i32Everything above this degree is quotiented out.
Implementations§
Source§impl<M: Module> QuotientModule<M>
impl<M: Module> QuotientModule<M>
pub fn new(module: Arc<M>, truncation: i32) -> Self
pub fn quotient(&mut self, degree: i32, element: FpSlice<'_>)
pub fn quotient_basis_elements( &mut self, degree: i32, elements: impl Iterator<Item = usize>, )
Sourcepub fn quotient_vectors(
&mut self,
degree: i32,
vecs: impl for<'a> FnMut(FpSliceMut<'a>) -> Option<()>,
)
pub fn quotient_vectors( &mut self, degree: i32, vecs: impl for<'a> FnMut(FpSliceMut<'a>) -> Option<()>, )
§Arguments
degree: The degree to quotient invecs: SeeSubspace::add_vectors
fn flush(&mut self, degree: i32)
pub fn quotient_all(&mut self, degree: i32)
pub fn act_on_original_basis( &self, result: FpSliceMut<'_>, coeff: u32, op_degree: i32, op_index: usize, mod_degree: i32, mod_index: usize, )
pub fn reduce(&self, degree: i32, vec: FpSliceMut<'_>)
pub fn old_basis_to_new( &self, degree: i32, new: FpSliceMut<'_>, old: FpSlice<'_>, )
Trait Implementations§
Source§impl<M: Module> Display for QuotientModule<M>
impl<M: Module> Display for QuotientModule<M>
Source§impl<M: Module> Module for QuotientModule<M>
impl<M: Module> Module for QuotientModule<M>
type Algebra = <M as Module>::Algebra
Source§fn min_degree(&self) -> i32
fn min_degree(&self) -> i32
The minimum degree of the module, which is required to be bounded below
Source§fn max_computed_degree(&self) -> i32
fn max_computed_degree(&self) -> i32
The maximum
t for which the module is fully defined at t. See Module documentation
for more details.fn act_on_basis( &self, result: FpSliceMut<'_>, coeff: u32, op_degree: i32, op_index: usize, mod_degree: i32, mod_index: usize, )
Source§fn basis_element_to_string(&self, degree: i32, idx: usize) -> String
fn basis_element_to_string(&self, degree: i32, idx: usize) -> String
The name of a basis element. This is useful for debugging and printing results.
Source§fn max_degree(&self) -> Option<i32>
fn max_degree(&self) -> Option<i32>
max_degree is the a degree such that if t > max_degree, then self.dimension(t) = 0.Source§fn compute_basis(&self, degree: i32)
fn compute_basis(&self, degree: i32)
Compute internal data of the module so that we can query information up to degree
degree.
This should be run by the user whenever they want to query such information. Read moreSource§fn prime(&self) -> ValidPrime
fn prime(&self) -> ValidPrime
The prime the module is over, which should be equal to the prime of the algebra.
Source§fn max_generator_degree(&self) -> Option<i32>
fn max_generator_degree(&self) -> Option<i32>
Maximum degree of a generator under the Steenrod action. Every element in higher degree
must be obtainable from applying a Steenrod action to a lower degree element.
fn total_dimension(&self) -> usize
Source§fn act(
&self,
result: FpSliceMut<'_>,
coeff: u32,
op_degree: i32,
op_index: usize,
input_degree: i32,
input: FpSlice<'_>,
)
fn act( &self, result: FpSliceMut<'_>, coeff: u32, op_degree: i32, op_index: usize, input_degree: i32, input: FpSlice<'_>, )
The length of
input need not be equal to the dimension of the module in said degree.
Missing entries are interpreted to be 0, while extra entries must be zero. Read morefn act_by_element( &self, result: FpSliceMut<'_>, coeff: u32, op_degree: i32, op: FpSlice<'_>, input_degree: i32, input: FpSlice<'_>, )
fn act_by_element_on_basis( &self, result: FpSliceMut<'_>, coeff: u32, op_degree: i32, op: FpSlice<'_>, input_degree: i32, input_index: usize, )
Source§fn element_to_string(&self, degree: i32, element: FpSlice<'_>) -> String
fn element_to_string(&self, degree: i32, element: FpSlice<'_>) -> String
Gives the name of an element. The default implementation is derived from
Module::basis_element_to_string in the obvious way.Source§impl<M: ZeroModule> ZeroModule for QuotientModule<M>
impl<M: ZeroModule> ZeroModule for QuotientModule<M>
Auto Trait Implementations§
impl<M> Freeze for QuotientModule<M>
impl<M> RefUnwindSafe for QuotientModule<M>where
M: RefUnwindSafe,
impl<M> Send for QuotientModule<M>
impl<M> Sync for QuotientModule<M>
impl<M> Unpin for QuotientModule<M>
impl<M> UnwindSafe for QuotientModule<M>where
M: RefUnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more