Struct RingHomomorphismRangeModuleStructure 

pub struct RingHomomorphismRangeModuleStructure<'h, Domain: RingSignature, Range: RingSignature, Hom: RingHomomorphism<Domain, Range>> { /* private fields */ }

Implementations

impl<'h, Domain: RingSignature, Range: RingSignature, Hom: RingHomomorphism<Domain, Range>> RingHomomorphismRangeModuleStructure<'h, Domain, Range, Hom>

pub fn module(&self) -> &Range

pub fn homomorphism(&'h self) -> &'h Hom

Trait Implementations

impl<'h, Domain: RingSignature, Range: RingSignature, Hom: RingHomomorphism<Domain, Range>> AdditionSignature for RingHomomorphismRangeModuleStructure<'h, Domain, Range, Hom>

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

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

impl<'h, Domain: RingSignature, Range: RingSignature, Hom: RingHomomorphism<Domain, Range>> AdditiveGroupSignature for RingHomomorphismRangeModuleStructure<'h, Domain, Range, Hom>

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

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

impl<'h, Domain: RingSignature, Range: RingSignature, Hom: RingHomomorphism<Domain, Range>> AdditiveMonoidSignature for RingHomomorphismRangeModuleStructure<'h, Domain, Range, Hom>

fn sum(&self, vals: Vec<impl Borrow<Self::Set>>) -> Self::Set

impl<'h, Domain: RingSignature, Range: RingSignature, Hom: RingHomomorphism<Domain, Range>> CancellativeAdditionSignature for RingHomomorphismRangeModuleStructure<'h, Domain, Range, Hom>

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

Return the unique x such that a = b + x, or None if no such x exists.

impl<'h, Domain: Clone + RingSignature, Range: Clone + RingSignature, Hom: Clone + RingHomomorphism<Domain, Range>> Clone for RingHomomorphismRangeModuleStructure<'h, Domain, Range, Hom>

fn clone(&self) -> RingHomomorphismRangeModuleStructure<'h, Domain, Range, Hom>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'h, Domain: RingSignature + FiniteSetSignature, Range: RingSignature, Hom: FiniteRankFreeRingExtension<Domain, Range>> CountableSetSignature for RingHomomorphismRangeModuleStructure<'h, Domain, Range, Hom>

fn generate_all_elements(&self) -> impl Iterator<Item = Self::Set> + Clone

Yield distinct elements of the set such that every element eventually appears. Always yields elements in the same order.

impl<'h, Domain: Debug + RingSignature, Range: Debug + RingSignature, Hom: Debug + RingHomomorphism<Domain, Range>> Debug for RingHomomorphismRangeModuleStructure<'h, Domain, Range, Hom>

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

Formats the value using the given formatter.

impl<'h, Domain: RingSignature, Range: RingEqSignature, Hom: RingHomomorphism<Domain, Range>> EqSignature for RingHomomorphismRangeModuleStructure<'h, Domain, Range, Hom>

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

impl<'h, Domain: RingSignature + FiniteSetSignature, Range: RingSignature, Hom: FiniteRankFreeRingExtension<Domain, Range>> FiniteSetSignature for RingHomomorphismRangeModuleStructure<'h, Domain, Range, Hom>

fn list_all_elements(&self) -> Vec<Self::Set>

A list of all elements in the set. Always returns elements in the same order.

fn size(&self) -> usize

fn generate_random_elements( &self, seed: u64, ) -> impl Iterator<Item = Self::Set> + Clone

impl<'h, Field: FieldSignature, FieldB: BorrowedStructure<Field>, FieldPolyB: BorrowedStructure<PolynomialStructure<Field, FieldB>>, const IS_FIELD: bool> FreeModuleSignature<Field> for RingHomomorphismRangeModuleStructure<'h, Field, PolynomialQuotientRingStructure<Field, FieldB, FieldPolyB, IS_FIELD>, PolynomialQuotientRingExtension<Field, FieldB, FieldPolyB, IS_FIELD>>

type Basis = EnumeratedFiniteSetStructure

fn basis_set(&self) -> impl Borrow<Self::Basis>

fn to_component<'a>( &self, b: &usize, v: &'a Polynomial<Field::Set>, ) -> Cow<'a, Field::Set>

fn from_component(&self, b: &usize, r: &Field::Set) -> Polynomial<Field::Set>

impl<'h, B: BorrowedStructure<AlgebraicNumberFieldPolynomialQuotientStructure>> FreeModuleSignature<RationalCanonicalStructure> for RingHomomorphismRangeModuleStructure<'h, RationalCanonicalStructure, AlgebraicNumberFieldPolynomialQuotientStructure, PrincipalRationalMap<AlgebraicNumberFieldPolynomialQuotientStructure, B>>

type Basis = EnumeratedFiniteSetStructure

fn basis_set(&self) -> impl Borrow<Self::Basis>

fn to_component<'a>( &self, b: &usize, v: &'a Polynomial<Rational>, ) -> Cow<'a, Rational>

fn from_component(&self, b: &usize, r: &Rational) -> Polynomial<Rational>

impl<'h, D: BorrowedSet<Integer>, B: BorrowedStructure<QuadraticNumberFieldStructure<D>>> FreeModuleSignature<RationalCanonicalStructure> for RingHomomorphismRangeModuleStructure<'h, RationalCanonicalStructure, QuadraticNumberFieldStructure<D>, PrincipalRationalMap<QuadraticNumberFieldStructure<D>, B>>

type Basis = QuadraticNumberFieldBasisCanonicalStructure

fn basis_set(&self) -> impl Borrow<Self::Basis>

fn to_component<'a>( &self, b: &QuadraticNumberFieldBasis, v: &'a QuadraticNumberFieldElement, ) -> Cow<'a, Rational>

fn from_component( &self, b: &QuadraticNumberFieldBasis, r: &Rational, ) -> Self::Set

impl<'h, B: BorrowedStructure<RationalCanonicalStructure>> FreeModuleSignature<RationalCanonicalStructure> for RingHomomorphismRangeModuleStructure<'h, RationalCanonicalStructure, RationalCanonicalStructure, PrincipalRationalMap<RationalCanonicalStructure, B>>

type Basis = SingletonSetStructure

fn basis_set(&self) -> impl Borrow<Self::Basis>

fn to_component<'a>(&self, _: &(), v: &'a Rational) -> Cow<'a, Rational>

fn from_component(&self, _: &(), r: &Rational) -> Rational

impl<'h, Domain: RingSignature, Range: RingSignature, Hom: RingHomomorphism<Domain, Range>> PartialEq for RingHomomorphismRangeModuleStructure<'h, Domain, Range, Hom>

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<'h, Domain: RingSignature, Range: RingSignature, Hom: RingHomomorphism<Domain, Range>> RinglikeSpecializationSignature for RingHomomorphismRangeModuleStructure<'h, Domain, Range, Hom>

fn try_ring_restructure( &self, ) -> Option<impl EqSignature<Set = Self::Set> + RingSignature>

fn try_char_zero_ring_restructure( &self, ) -> Option<impl EqSignature<Set = Self::Set> + CharZeroRingSignature>

impl<'h, Domain: RingSignature, Range: RingSignature, Hom: RingHomomorphism<Domain, Range>> SemiModuleSignature<Domain> for RingHomomorphismRangeModuleStructure<'h, Domain, Range, Hom>

fn ring(&self) -> &Domain

fn scalar_mul(&self, a: &Self::Set, x: &Domain::Set) -> Self::Set

impl<'h, Domain: RingSignature, Range: RingSignature, Hom: RingHomomorphism<Domain, Range>> SetSignature for RingHomomorphismRangeModuleStructure<'h, Domain, Range, Hom>

type Set = <Range as SetSignature>::Set

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<'h, Domain: RingSignature, Range: RingSignature, Hom: RingHomomorphism<Domain, Range>> TryNegateSignature for RingHomomorphismRangeModuleStructure<'h, Domain, Range, Hom>

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

impl<'h, Domain: RingSignature, Range: RingSignature, Hom: RingHomomorphism<Domain, Range>> ZeroSignature for RingHomomorphismRangeModuleStructure<'h, Domain, Range, Hom>

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

impl<'h, Domain: RingSignature, Range: RingSignature, Hom: RingHomomorphism<Domain, Range>> Eq for RingHomomorphismRangeModuleStructure<'h, Domain, Range, Hom>

impl<'h, Domain: RingSignature, Range: RingSignature, Hom: RingHomomorphism<Domain, Range>> Signature for RingHomomorphismRangeModuleStructure<'h, Domain, Range, Hom>