Enum CalculusNode
pub enum CalculusNode {
Show 16 variants
Require {
condition: CalculusNodeId,
value: CalculusNodeId,
},
Rational {
value: ExactRational,
dimension: DimExponents,
},
Boolean(bool),
Compare(ComparisonOp, CalculusNodeId, CalculusNodeId),
Not(CalculusNodeId),
And(CalculusNodeId, CalculusNodeId),
Or(CalculusNodeId, CalculusNodeId),
Select {
condition: CalculusNodeId,
then_value: CalculusNodeId,
else_value: CalculusNodeId,
},
UnaryMath(UnaryMathFunction, CalculusNodeId),
FormalComponent {
formal: u16,
axes: Box<[ComponentIndex]>,
},
KroneckerDelta(ComponentIndex, ComponentIndex),
BoundInput(CalculusNodeId),
Differentiated {
value: CalculusNodeId,
source: CalculusNodeId,
wrt: CalculusNodeId,
},
Neg(CalculusNodeId),
Add(CalculusNodeId, CalculusNodeId),
Mul(CalculusNodeId, CalculusNodeId),
}Description
Closed component calculus with exact arithmetic.
It has no calls, name lookup, callbacks, or opaque opcodes, so every definition is capture-free and non-recursive by construction.
Variants§
Require
Demand a Boolean domain condition before evaluating a complete scalar value.
Rational
Exact rational literal.
Boolean(bool)
Logical value used only by a checked scalar condition.
Compare(ComparisonOp, CalculusNodeId, CalculusNodeId)
Typed scalar comparison.
Not(CalculusNodeId)
Boolean negation.
And(CalculusNodeId, CalculusNodeId)
Short-circuit Boolean conjunction.
Or(CalculusNodeId, CalculusNodeId)
Short-circuit Boolean disjunction.
Select
Lazy selection between two complete scalar values.
UnaryMath(UnaryMathFunction, CalculusNodeId)
Checked real scalar function; only square root is supported.
FormalComponent
One formal component addressed by explicit result or fixed coordinates.
Fields
axes: Box<[ComponentIndex]>Component axis mapping, empty for a scalar formal.
KroneckerDelta(ComponentIndex, ComponentIndex)
Kronecker delta over two explicit coordinates.
BoundInput(CalculusNodeId)
One local formal occurrence bound to a caller expression during composition. Distinct formals retain distinct identities even when their values alias.
Differentiated
A differentiated value that keeps its source and the input it was taken with
respect to. Execution reads value; source and wrt record the
differentiation order.
Neg(CalculusNodeId)
Exact negation.
Add(CalculusNodeId, CalculusNodeId)
Exact addition.
Mul(CalculusNodeId, CalculusNodeId)
Exact multiplication.
Trait Implementations§
§impl Clone for CalculusNode
impl Clone for CalculusNode
§impl Debug for CalculusNode
impl Debug for CalculusNode
§impl PartialEq for CalculusNode
impl PartialEq for CalculusNode
§fn eq(&self, other: &CalculusNode) -> bool
fn eq(&self, other: &CalculusNode) -> bool
self and other values to be equal, and is used by ==.impl Eq for CalculusNode
impl StructuralPartialEq for CalculusNode
Auto Trait Implementations§
impl Freeze for CalculusNode
impl RefUnwindSafe for CalculusNode
impl Send for CalculusNode
impl Sync for CalculusNode
impl Unpin for CalculusNode
impl UnsafeUnpin for CalculusNode
impl UnwindSafe for CalculusNode
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.