pub struct GenericZeroHomomorphism<S: Module, T: Module<Algebra = S::Algebra>> {
source: Arc<S>,
target: Arc<T>,
degree_shift: i32,
}Fields§
§source: Arc<S>§target: Arc<T>§degree_shift: i32Implementations§
Trait Implementations§
Source§impl<S: Module, T: Module<Algebra = S::Algebra>> ModuleHomomorphism for GenericZeroHomomorphism<S, T>
impl<S: Module, T: Module<Algebra = S::Algebra>> ModuleHomomorphism for GenericZeroHomomorphism<S, T>
type Source = S
type Target = T
fn source(&self) -> Arc<Self::Source>
fn target(&self) -> Arc<Self::Target>
fn degree_shift(&self) -> i32
Source§fn apply_to_basis_element(&self, _: FpSliceMut<'_>, _: u32, _: i32, _: usize)
fn apply_to_basis_element(&self, _: FpSliceMut<'_>, _: u32, _: i32, _: usize)
Calling this function when
input_idx < source().dimension(input_degree) results in
undefined behaviour. Implementations are encouraged to panic when this happens (this is
usually the case because of out-of-bounds errors.fn kernel(&self, degree: i32) -> Option<&Subspace>
fn quasi_inverse(&self, degree: i32) -> Option<&QuasiInverse>
fn image(&self, degree: i32) -> Option<&Subspace>
fn compute_auxiliary_data_through_degree(&self, degree: i32)
fn apply( &self, result: FpSliceMut<'_>, coeff: u32, input_degree: i32, input: FpSlice<'_>, )
fn prime(&self) -> ValidPrime
fn min_degree(&self) -> i32
Source§fn auxiliary_data(&self, degree: i32) -> (Subspace, Subspace, QuasiInverse)
fn auxiliary_data(&self, degree: i32) -> (Subspace, Subspace, QuasiInverse)
Compute the auxiliary data associated to the homomorphism at input degree
degree. Returns
it in the order image, kernel, quasi_inverseSource§fn get_matrix(&self, matrix: MatrixSliceMut<'_>, degree: i32)
fn get_matrix(&self, matrix: MatrixSliceMut<'_>, degree: i32)
Source§fn get_partial_matrix(&self, degree: i32, inputs: &[usize]) -> Matrix
fn get_partial_matrix(&self, degree: i32, inputs: &[usize]) -> Matrix
Get the values of the homomorphism on the specified inputs to
matrix.Source§fn apply_quasi_inverse(
&self,
result: FpSliceMut<'_>,
degree: i32,
input: FpSlice<'_>,
) -> bool
fn apply_quasi_inverse( &self, result: FpSliceMut<'_>, degree: i32, input: FpSlice<'_>, ) -> bool
Attempt to apply quasi inverse to the input. Returns whether the operation was
successful. This is required to either always succeed or always fail for each degree.
Source§impl<S: Module, T: Module<Algebra = S::Algebra>> ZeroHomomorphism<S, T> for GenericZeroHomomorphism<S, T>
impl<S: Module, T: Module<Algebra = S::Algebra>> ZeroHomomorphism<S, T> for GenericZeroHomomorphism<S, T>
Auto Trait Implementations§
impl<S, T> Freeze for GenericZeroHomomorphism<S, T>
impl<S, T> RefUnwindSafe for GenericZeroHomomorphism<S, T>where
S: RefUnwindSafe,
T: RefUnwindSafe,
impl<S, T> Send for GenericZeroHomomorphism<S, T>
impl<S, T> Sync for GenericZeroHomomorphism<S, T>
impl<S, T> Unpin for GenericZeroHomomorphism<S, T>
impl<S, T> UnwindSafe for GenericZeroHomomorphism<S, T>where
S: RefUnwindSafe,
T: 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