Struct ExactPolynomial
pub struct ExactPolynomial<A> { /* private fields */ }Description
Canonical commutative polynomial over ordered semantic atoms, with exact coefficients.
Zero coefficients are omitted; each monomial keeps its repeated atoms sorted. This type classifies mathematical expressions. It never permits floating-point reassociation and does not build executable derivatives.
Implementations§
§impl<A> ExactPolynomial<A>where
A: Clone + Ord,
impl<A> ExactPolynomial<A>where
A: Clone + Ord,
pub fn constant(value: ExactRational) -> ExactPolynomial<A>
pub fn constant(value: ExactRational) -> ExactPolynomial<A>
A constant polynomial; zero is the empty polynomial.
pub fn atom(atom: A) -> ExactPolynomial<A>
pub fn atom(atom: A) -> ExactPolynomial<A>
One semantic indeterminate.
pub fn terms(&self) -> impl ExactSizeIterator
pub fn terms(&self) -> impl ExactSizeIterator
Canonical monomials in lexicographic atom order.
pub fn checked_neg(&self) -> Result<ExactPolynomial<A>, ExactPolynomialError>
pub fn checked_neg(&self) -> Result<ExactPolynomial<A>, ExactPolynomialError>
Coefficient negation.
pub fn checked_add(
&self,
other: &ExactPolynomial<A>,
) -> Result<ExactPolynomial<A>, ExactPolynomialError>
pub fn checked_add( &self, other: &ExactPolynomial<A>, ) -> Result<ExactPolynomial<A>, ExactPolynomialError>
Sum, collecting like monomials.
pub fn checked_mul(
&self,
other: &ExactPolynomial<A>,
) -> Result<ExactPolynomial<A>, ExactPolynomialError>
pub fn checked_mul( &self, other: &ExactPolynomial<A>, ) -> Result<ExactPolynomial<A>, ExactPolynomialError>
Distributive product. The work limit is checked before allocating the product terms.
pub fn substitute<E>(
definition: &PureOperatorDefinition,
arguments: &[&ExactPolynomial<A>],
charge: impl FnMut(&ExactPolynomial<A>) -> Result<(), E>,
) -> Result<Option<ExactPolynomial<A>>, E>where
E: From<ExactPolynomialError>,
pub fn substitute<E>(
definition: &PureOperatorDefinition,
arguments: &[&ExactPolynomial<A>],
charge: impl FnMut(&ExactPolynomial<A>) -> Result<(), E>,
) -> Result<Option<ExactPolynomial<A>>, E>where
E: From<ExactPolynomialError>,
Substitute polynomials into a scalar polynomial operator definition.
Returns None for a definition outside this classification profile. This does
not reassociate executable arithmetic or differentiate anything.
The caller charges each intermediate result against its cumulative budget.
§Errors
Returns exact arithmetic failures or the caller’s budget failure.
Trait Implementations§
§impl<A> Clone for ExactPolynomial<A>where
A: Clone,
impl<A> Clone for ExactPolynomial<A>where
A: Clone,
§impl<A> Debug for ExactPolynomial<A>where
A: Debug,
impl<A> Debug for ExactPolynomial<A>where
A: Debug,
§impl<A> PartialEq for ExactPolynomial<A>where
A: PartialEq,
impl<A> PartialEq for ExactPolynomial<A>where
A: PartialEq,
§fn eq(&self, other: &ExactPolynomial<A>) -> bool
fn eq(&self, other: &ExactPolynomial<A>) -> bool
self and other values to be equal, and is used by ==.impl<A> Eq for ExactPolynomial<A>where
A: Eq,
impl<A> StructuralPartialEq for ExactPolynomial<A>
Auto Trait Implementations§
impl<A> Freeze for ExactPolynomial<A>
impl<A> RefUnwindSafe for ExactPolynomial<A>where
A: RefUnwindSafe,
impl<A> Send for ExactPolynomial<A>where
A: Send,
impl<A> Sync for ExactPolynomial<A>where
A: Sync,
impl<A> Unpin for ExactPolynomial<A>
impl<A> UnsafeUnpin for ExactPolynomial<A>
impl<A> UnwindSafe for ExactPolynomial<A>where
A: RefUnwindSafe,
Blanket Implementations§
Source§impl<T> Any for Twhere
T: 'static + ?Sized,
impl<T> Any for Twhere
T: 'static + ?Sized,
§impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
§fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
§impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
§type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
§fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
Source§impl<T> Borrow<T> for Twhere
T: ?Sized,
impl<T> Borrow<T> for Twhere
T: ?Sized,
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T, Dst> ConvAsUtil<Dst> for T
impl<T, Dst> ConvAsUtil<Dst> for T
§fn approx(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
fn approx(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
§impl<T> ConvUtil for T
impl<T> ConvUtil for T
§fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
§fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst, Scheme>,
Scheme: ApproxScheme,
fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst, Scheme>,
Scheme: ApproxScheme,
§fn into_as<Dst>(self) -> Dstwhere
Self: Sized + Into<Dst>,
fn into_as<Dst>(self) -> Dstwhere
Self: Sized + Into<Dst>,
§fn try_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + TryInto<Dst>,
fn try_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + TryInto<Dst>,
§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> Twhere
Self: Distribution<T>,
§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Source§impl<T> From<T> for T
impl<T> From<T> for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T, U> Into<U> for Twhere
U: From<T>,
impl<T, U> Into<U> for Twhere
U: From<T>,
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>
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>where
F: FnOnce(&Self) -> bool,
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where
F: FnOnce(&Self) -> bool,
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§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> Same for T
impl<T> Same for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.