RingRef

ark_feanor

Struct RingRef 

Source 
pub struct RingRef<'a, R>
where
    R: RingBase + ?Sized,
{ /* private fields */ }
Expand description

The second most basic crate::ring::RingStore. Similarly to crate::ring::RingValue it is just a no-op container.

§Why do we need this in addition to crate::ring::RingValue?

Before RingValue::from_ref() was added, this was important to allow using a reference to a RingBase as RingStore. Since then, it indeed has only a marginal importance, but note that it is currently the only way of working with unsized rings (an admittedly pretty exotic case).

Implementations§

Source§

impl<'a, R> RingRef<'a, R>
where R: RingBase + ?Sized,

Source

pub const fn new(value: &'a R) -> RingRef<'a, R>

Creates a new RingRef from a reference to a RingBase.

Source

pub fn into(self) -> &'a R

Returns the stored reference to the RingBase.

This is almost the same as RingStore::get_ring(), except for that the lifetime of the returned reference is not bounded to the lifetime of the RingRef.

Trait Implementations§

Source§

impl<'a, R> Clone for RingRef<'a, R>
where R: RingBase + ?Sized,

Source§

fn clone(&self) -> RingRef<'a, R>

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl<'a, R> Debug for RingRef<'a, R>
where R: Debug + RingBase + ?Sized,

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<'a, R> RingStore for RingRef<'a, R>
where R: RingBase + ?Sized,

Source§

type Type = R

The type of the stored ring.
Source§

fn get_ring(&self) -> &R

Returns a reference to the stored ring.
Source§

fn clone_el( &self, val: &<Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

See RingBase::clone_el()
Source§

fn add_assign_ref( &self, lhs: &mut <Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, )

See RingBase::add_assign_ref()
Source§

fn add_assign( &self, lhs: &mut <Self::Type as RingBase>::Element, rhs: <Self::Type as RingBase>::Element, )

See RingBase::add_assign()
Source§

fn sub_assign_ref( &self, lhs: &mut <Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, )

See RingBase::sub_assign_ref()
Source§

fn sub_self_assign( &self, lhs: &mut <Self::Type as RingBase>::Element, rhs: <Self::Type as RingBase>::Element, )

See RingBase::sub_self_assign()
Source§

fn sub_self_assign_ref( &self, lhs: &mut <Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, )

See RingBase::sub_self_assign_ref()
Source§

fn negate_inplace(&self, lhs: &mut <Self::Type as RingBase>::Element)

See RingBase::negate_inplace()
Source§

fn mul_assign( &self, lhs: &mut <Self::Type as RingBase>::Element, rhs: <Self::Type as RingBase>::Element, )

See RingBase::mul_assign()
Source§

fn mul_assign_ref( &self, lhs: &mut <Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, )

See RingBase::mul_assign_ref()
Source§

fn zero(&self) -> <Self::Type as RingBase>::Element

See RingBase::zero()
Source§

fn one(&self) -> <Self::Type as RingBase>::Element

See RingBase::one()
Source§

fn neg_one(&self) -> <Self::Type as RingBase>::Element

See RingBase::neg_one()
Source§

fn eq_el( &self, lhs: &<Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, ) -> bool

See RingBase::eq_el()
Source§

fn is_zero(&self, value: &<Self::Type as RingBase>::Element) -> bool

See RingBase::is_zero()
Source§

fn is_one(&self, value: &<Self::Type as RingBase>::Element) -> bool

See RingBase::is_one()
Source§

fn is_neg_one(&self, value: &<Self::Type as RingBase>::Element) -> bool

See RingBase::is_neg_one()
Source§

fn is_commutative(&self) -> bool

See RingBase::is_commutative()
Source§

fn is_noetherian(&self) -> bool

See RingBase::is_noetherian()
Source§

fn negate( &self, value: <Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

See RingBase::negate()
Source§

fn sub_assign( &self, lhs: &mut <Self::Type as RingBase>::Element, rhs: <Self::Type as RingBase>::Element, )

See RingBase::sub_assign()
Source§

fn add_ref( &self, lhs: &<Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

See RingBase::add_ref()
Source§

fn add_ref_fst( &self, lhs: &<Self::Type as RingBase>::Element, rhs: <Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

See RingBase::add_ref_fst()
Source§

fn add_ref_snd( &self, lhs: <Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

See RingBase::add_ref_snd()
Source§

fn add( &self, lhs: <Self::Type as RingBase>::Element, rhs: <Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

See RingBase::add()
Source§

fn sub_ref( &self, lhs: &<Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

See RingBase::sub_ref()
Source§

fn sub_ref_fst( &self, lhs: &<Self::Type as RingBase>::Element, rhs: <Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

See RingBase::sub_ref_fst()
Source§

fn sub_ref_snd( &self, lhs: <Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

See RingBase::sub_ref_snd()
Source§

fn sub( &self, lhs: <Self::Type as RingBase>::Element, rhs: <Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

See RingBase::sub()
Source§

fn mul_ref( &self, lhs: &<Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

See RingBase::mul_ref()
Source§

fn mul_ref_fst( &self, lhs: &<Self::Type as RingBase>::Element, rhs: <Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

See RingBase::mul_ref_fst()
Source§

fn mul_ref_snd( &self, lhs: <Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

See RingBase::mul_ref_snd()
Source§

fn mul( &self, lhs: <Self::Type as RingBase>::Element, rhs: <Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

See RingBase::mul()
Source§

fn square(&self, value: &mut <Self::Type as RingBase>::Element)

See RingBase::square()
Source§

fn fma( &self, lhs: &<Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, summand: <Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

See RingBase::fma()
Source§

fn coerce<S>( &self, from: &S, el: <<S as RingStore>::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element
where S: RingStore, Self::Type: CanHomFrom<<S as RingStore>::Type>,

Tries to map the given element into this ring. Read more
Source§

fn into_identity(self) -> Identity<Self>

Returns the identity map self -> self.
Source§

fn identity<'a>(&'a self) -> Identity<&'a Self>

Returns the identity map self -> self.
Source§

fn into_can_hom<S>(self, from: S) -> Result<CanHom<S, Self>, (S, Self)>
where Self: Sized, S: RingStore, Self::Type: CanHomFrom<<S as RingStore>::Type>,

Returns the canonical homomorphism from -> self, if it exists, moving both rings into the CanHom object.
Source§

fn into_can_iso<S>(self, from: S) -> Result<CanIso<S, Self>, (S, Self)>
where Self: Sized, S: RingStore, Self::Type: CanIsoFromTo<<S as RingStore>::Type>,

Returns the canonical isomorphism from -> self, if it exists, moving both rings into the CanHom object.
Source§

fn can_hom<'a, S>(&'a self, from: &'a S) -> Option<CanHom<&'a S, &'a Self>>
where S: RingStore, Self::Type: CanHomFrom<<S as RingStore>::Type>,

Returns the canonical homomorphism from -> self, if it exists.
Source§

fn can_iso<'a, S>(&'a self, from: &'a S) -> Option<CanIso<&'a S, &'a Self>>
where S: RingStore, Self::Type: CanIsoFromTo<<S as RingStore>::Type>,

Returns the canonical isomorphism from -> self, if it exists.
Source§

fn into_int_hom(self) -> IntHom<Self>

Returns the homomorphism Z -> self that exists for any ring.
Source§

fn int_hom<'a>(&'a self) -> IntHom<&'a Self>

Returns the homomorphism Z -> self that exists for any ring.
Source§

fn sum<I>(&self, els: I) -> <Self::Type as RingBase>::Element
where I: IntoIterator<Item = <Self::Type as RingBase>::Element>,

Computes the sum of all elements returned by the iterator. Read more
Source§

fn try_sum<I, E>(&self, els: I) -> Result<<Self::Type as RingBase>::Element, E>
where I: IntoIterator<Item = Result<<Self::Type as RingBase>::Element, E>>,

Equivalent of RingStore::sum() if the producer of the ring elements can fail, in which case summation is aborted and the error returned.
Source§

fn prod<I>(&self, els: I) -> <Self::Type as RingBase>::Element
where I: IntoIterator<Item = <Self::Type as RingBase>::Element>,

Computes the product of all elements returned by the iterator. Read more
Source§

fn pow( &self, x: <Self::Type as RingBase>::Element, power: usize, ) -> <Self::Type as RingBase>::Element

Raises the given element to the given power.
Source§

fn pow_gen<R>( &self, x: <Self::Type as RingBase>::Element, power: &<<R as RingStore>::Type as RingBase>::Element, integers: R, ) -> <Self::Type as RingBase>::Element
where R: RingStore, <R as RingStore>::Type: IntegerRing,

Raises the given element to the given power, which should be a positive integer belonging to an arbitrary IntegerRing. Read more
Source§

fn format<'a>( &'a self, value: &'a <Self::Type as RingBase>::Element, ) -> RingElementDisplayWrapper<'a, Self>

Returns an object that represents the given ring element and implements std::fmt::Display, to use as formatting parameter. Read more
Source§

fn format_within<'a>( &'a self, value: &'a <Self::Type as RingBase>::Element, within: EnvBindingStrength, ) -> RingElementDisplayWrapper<'a, Self>

Returns an object that represents the given ring element and implements std::fmt::Display, to use as formatting parameter. As opposed to RingStore::format(), this function takes an additional argument to specify the context the result is printed in, which is used to determine whether to put the value in parenthesis or not. Read more
Source§

fn println(&self, value: &<Self::Type as RingBase>::Element)

Prints the given element. Use for quick & dirty debugging.
Source§

fn characteristic<I>( &self, ZZ: I, ) -> Option<<<I as RingStore>::Type as RingBase>::Element>
where I: RingStore + Copy, <I as RingStore>::Type: IntegerRing,

See RingBase::characteristic().
Source§

impl<'a, R> Copy for RingRef<'a, R>
where R: RingBase + ?Sized,

Auto Trait Implementations§

§

impl<'a, R> Freeze for RingRef<'a, R>
where R: ?Sized,

§

impl<'a, R> RefUnwindSafe for RingRef<'a, R>
where R: RefUnwindSafe + ?Sized,

§

impl<'a, R> Send for RingRef<'a, R>
where R: Sync + ?Sized,

§

impl<'a, R> Sync for RingRef<'a, R>
where R: Sync + ?Sized,

§

impl<'a, R> Unpin for RingRef<'a, R>
where R: ?Sized,

§

impl<'a, R> UnwindSafe for RingRef<'a, R>
where R: RefUnwindSafe + ?Sized,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<R> DivisibilityRingStore for R
where R: RingStore, <R as RingStore>::Type: DivisibilityRing,

Source§

fn checked_left_div( &self, lhs: &<Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, ) -> Option<<Self::Type as RingBase>::Element>

See DivisibilityRing::checked_left_div()
Source§

fn divides_left( &self, lhs: &<Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, ) -> bool

See DivisibilityRing::divides_left()
Source§

fn is_unit(&self, x: &<Self::Type as RingBase>::Element) -> bool

See DivisibilityRing::is_unit()
Source§

fn checked_div( &self, lhs: &<Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, ) -> Option<<Self::Type as RingBase>::Element>

See DivisibilityRing::checked_div()
Source§

fn divides( &self, lhs: &<Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, ) -> bool

See DivisibilityRing::divides()
Source§

fn invert( &self, lhs: &<Self::Type as RingBase>::Element, ) -> Option<<Self::Type as RingBase>::Element>

See DivisibilityRing::invert()
Source§

impl<R> EuclideanRingStore for R
where R: RingStore, <R as RingStore>::Type: EuclideanRing,

Source§

fn euclidean_div_rem( &self, lhs: <Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, ) -> (<Self::Type as RingBase>::Element, <Self::Type as RingBase>::Element)

See EuclideanRing::euclidean_div_rem()
Source§

fn euclidean_div( &self, lhs: <Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

See EuclideanRing::euclidean_div()
Source§

fn euclidean_rem( &self, lhs: <Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

See EuclideanRing::euclidean_rem()
Source§

fn euclidean_deg( &self, val: &<Self::Type as RingBase>::Element, ) -> Option<usize>

See EuclideanRing::euclidean_deg()
Source§

impl<R> FiniteRingStore for R
where R: RingStore, <R as RingStore>::Type: FiniteRing,

Source§

fn elements<'a>(&'a self) -> <Self::Type as FiniteRing>::ElementsIter<'a>

See FiniteRing::elements().
Source§

fn random_element<G>(&self, rng: G) -> <Self::Type as RingBase>::Element
where G: FnMut() -> u64,

See FiniteRing::random_element().
Source§

fn size<I>( &self, ZZ: I, ) -> Option<<<I as RingStore>::Type as RingBase>::Element>
where I: IntegerRingStore + Copy, <I as RingStore>::Type: IntegerRing,

See FiniteRing::size().
Source§

impl<R> FreeAlgebraStore for R
where R: RingStore, <R as RingStore>::Type: FreeAlgebra,

Source§

fn canonical_gen(&self) -> <Self::Type as RingBase>::Element

See FreeAlgebra::canonical_gen()
Source§

fn rank(&self) -> usize

See FreeAlgebra::rank()
Source§

fn trace( &self, el: <Self::Type as RingBase>::Element, ) -> <<<Self::Type as RingExtension>::BaseRing as RingStore>::Type as RingBase>::Element

See FreeAlgebra::trace()
Source§

fn wrt_canonical_basis<'a>( &'a self, el: &'a <Self::Type as RingBase>::Element, ) -> <Self::Type as FreeAlgebra>::VectorRepresentation<'a>

See FreeAlgebra::wrt_canonical_basis().
Source§

fn from_canonical_basis<V>(&self, vec: V) -> <Self::Type as RingBase>::Element
where V: IntoIterator<Item = <<<Self::Type as RingExtension>::BaseRing as RingStore>::Type as RingBase>::Element>, <V as IntoIterator>::IntoIter: DoubleEndedIterator,

See FreeAlgebra::from_canonical_basis().
Source§

fn from_canonical_basis_extended<V>( &self, vec: V, ) -> <Self::Type as RingBase>::Element
where V: IntoIterator<Item = <<<Self::Type as RingExtension>::BaseRing as RingStore>::Type as RingBase>::Element>,

See FreeAlgebra::from_canonical_basis_extended().
Source§

fn generating_poly<P, H>( &self, poly_ring: P, hom: H, ) -> <<P as RingStore>::Type as RingBase>::Element
where P: PolyRingStore, <P as RingStore>::Type: PolyRing, H: Homomorphism<<<Self::Type as RingExtension>::BaseRing as RingStore>::Type, <<<P as RingStore>::Type as RingExtension>::BaseRing as RingStore>::Type>,

Returns the generating polynomial of this ring, i.e. the monic polynomial f(X) such that this ring is isomorphic to R[X]/(f(X)), where R is the base ring.
Source§

fn as_field(self) -> Result<RingValue<AsFieldBase<Self>>, Self>
where Self::Type: DivisibilityRing, <<Self::Type as RingExtension>::BaseRing as RingStore>::Type: Field + FactorPolyField,

If this ring is a field, returns a wrapper around this ring that implements crate::field::FieldStore. Read more
Source§

fn poly_repr<P, H>( &self, to: P, el: &<Self::Type as RingBase>::Element, hom: H, ) -> <<P as RingStore>::Type as RingBase>::Element
where P: PolyRingStore, <P as RingStore>::Type: PolyRing, H: Homomorphism<<<Self::Type as RingExtension>::BaseRing as RingStore>::Type, <<<P as RingStore>::Type as RingExtension>::BaseRing as RingStore>::Type>,

Returns the polynomial representation of the given element y, i.e. the polynomial f(X) of degree at most FreeAlgebraStore::rank() such that f(x) = y, where y is the canonical generator of this ring, as given by FreeAlgebraStore::canonical_gen().
Source§

fn discriminant( &self, ) -> <<<Self::Type as RingExtension>::BaseRing as RingStore>::Type as RingBase>::Element
where <<Self::Type as RingExtension>::BaseRing as RingStore>::Type: PrincipalIdealRing,

Computes the discriminant of the canonical basis of this ring extension, which is defined as the determinant of the trace matrix (Tr(a^(i + j))), where a is the canonical generator of this ring extension. Read more
Source§

fn charpoly<P, H>( &self, el: &<Self::Type as RingBase>::Element, poly_ring: P, hom: H, ) -> <<P as RingStore>::Type as RingBase>::Element
where P: RingStore, <P as RingStore>::Type: PolyRing, <<<P as RingStore>::Type as RingExtension>::BaseRing as RingStore>::Type: LinSolveRing, H: Homomorphism<<<Self::Type as RingExtension>::BaseRing as RingStore>::Type, <<<P as RingStore>::Type as RingExtension>::BaseRing as RingStore>::Type>,

See also FreeAlgebra::charpoly().
Source§

fn with_wrapped_generator<'a, F, const M: usize>( &'a self, f: F, ) -> [<Self::Type as RingBase>::Element; M]
where F: FnOnce(&RingElementWrapper<&'a Self>) -> [RingElementWrapper<&'a Self>; M],

Temporarily wraps the canonical generator in a RingElementWrapper, for more natural creation of ring elements.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<R> HashableElRingStore for R
where R: RingStore, <R as RingStore>::Type: HashableElRing,

Source§

fn hash<H>(&self, el: &<Self::Type as RingBase>::Element, h: &mut H)
where H: Hasher,

See HashableElRing::hash().
Source§

fn default_hash(&self, el: &<Self::Type as RingBase>::Element) -> u64

Computes a hash of the given element using some default hasher. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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
Source§

impl<R> LinSolveRingStore for R
where R: RingStore, <R as RingStore>::Type: LinSolveRing,

Source§

fn solve_right<V1, V2, V3>( &self, lhs: SubmatrixMut<'_, V1, <Self::Type as RingBase>::Element>, rhs: SubmatrixMut<'_, V2, <Self::Type as RingBase>::Element>, out: SubmatrixMut<'_, V3, <Self::Type as RingBase>::Element>, ) -> SolveResult
where V1: AsPointerToSlice<<Self::Type as RingBase>::Element>, V2: AsPointerToSlice<<Self::Type as RingBase>::Element>, V3: AsPointerToSlice<<Self::Type as RingBase>::Element>,

Solves a linear system lhs * X = rhs. Read more
Source§

fn solve_right_with<V1, V2, V3, A>( &self, lhs: SubmatrixMut<'_, V1, <Self::Type as RingBase>::Element>, rhs: SubmatrixMut<'_, V2, <Self::Type as RingBase>::Element>, out: SubmatrixMut<'_, V3, <Self::Type as RingBase>::Element>, allocator: A, ) -> SolveResult
where V1: AsPointerToSlice<<Self::Type as RingBase>::Element>, V2: AsPointerToSlice<<Self::Type as RingBase>::Element>, V3: AsPointerToSlice<<Self::Type as RingBase>::Element>, A: Allocator,

Solves a linear system lhs * X = rhs. Read more
Source§

impl<R> PrincipalIdealRingStore for R
where R: RingStore, <R as RingStore>::Type: PrincipalIdealRing,

Source§

fn checked_div_min( &self, lhs: &<Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, ) -> Option<<Self::Type as RingBase>::Element>

See PrincipalIdealRing::checked_div_min()
Source§

fn extended_ideal_gen( &self, lhs: &<Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, ) -> (<Self::Type as RingBase>::Element, <Self::Type as RingBase>::Element, <Self::Type as RingBase>::Element)

See PrincipalIdealRing::extended_ideal_gen()
Source§

fn ideal_gen( &self, lhs: &<Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

See PrincipalIdealRing::ideal_gen()
Source§

fn annihilator( &self, val: &<Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

See PrincipalIdealRing::annihilator()
Source§

fn lcm( &self, lhs: &<Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

See PrincipalIdealRing::lcm()
Source§

fn gcd( &self, lhs: &<Self::Type as RingBase>::Element, rhs: &<Self::Type as RingBase>::Element, ) -> <Self::Type as RingBase>::Element

Alias for PrincipalIdealRingStore::ideal_gen().
Source§

impl<R> RingExtensionStore for R
where R: RingStore, <R as RingStore>::Type: RingExtension,

Source§

fn base_ring(&self) -> &<Self::Type as RingExtension>::BaseRing

See RingExtension::base_ring()
Source§

fn into_inclusion(self) -> Inclusion<Self>

Returns the inclusion map of the base ring R -> self.
Source§

fn inclusion<'a>(&'a self) -> Inclusion<&'a Self>

Returns the inclusion map of the base ring R -> self.
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<R> ZnRingStore for R
where R: RingStore, <R as RingStore>::Type: ZnRing,

Source§

fn integer_ring(&self) -> &<Self::Type as ZnRing>::IntegerRing

See ZnRing::integer_ring()
Source§

fn modulus( &self, ) -> &<<<Self::Type as ZnRing>::IntegerRing as RingStore>::Type as RingBase>::Element

See ZnRing::modulus()
Source§

fn smallest_positive_lift( &self, el: <Self::Type as RingBase>::Element, ) -> <<<Self::Type as ZnRing>::IntegerRing as RingStore>::Type as RingBase>::Element

See ZnRing::smallest_positive_lift()
Source§

fn smallest_lift( &self, el: <Self::Type as RingBase>::Element, ) -> <<<Self::Type as ZnRing>::IntegerRing as RingStore>::Type as RingBase>::Element

See ZnRing::smallest_lift()
Source§

fn any_lift( &self, el: <Self::Type as RingBase>::Element, ) -> <<<Self::Type as ZnRing>::IntegerRing as RingStore>::Type as RingBase>::Element

See ZnRing::any_lift()
Source§

fn is_field(&self) -> bool

See ZnRing::is_field()
Source§

fn as_field(self) -> Result<RingValue<AsFieldBase<Self>>, Self>
where Self: Sized,