Back to Eqiora docs Skip to main content

RelationDef

Struct RelationDef 

pub struct RelationDef { /* private fields */ }
Description

Ordered mathematical conditions together with their authored operands. How the conditions are enforced numerically is not part of the Model definition.

Implementations§

§

impl RelationDef

pub const fn is_probability_law(&self) -> bool

Whether this Relation defines an immutable probability measure rather than an activated equation or evolution law.

pub fn probability_mass( id: Id<Relation>, expression: ExprDag, outcomes: Id<Enum>, weights: ExprId, ) -> Result<RelationDef, Diagnostic>

Define normalized mass on an exact ordered declaration of named outcomes.

The retained weights are proportional masses: normalization is part of this law’s meaning, not a clipping or repair step. Whole-Model admission requires one dimensionless nonnegative real weight per outcome and positive total mass.

pub fn probability_density( id: Id<Relation>, expression: ExprDag, domain: Id<Domain>, measure: ObservableMeasure, density: ExprId, ) -> Result<RelationDef, Diagnostic>

Define normalized probability relative to one explicit continuous measure.

The retained density has inverse-measure units. Its finite positive normalizing integral belongs to the law. Admission must prove this integral and nonnegativity; a quadrature sample alone is not that proof.

§

impl RelationDef

pub fn new( id: Id<Relation>, expression: ExprDag, ) -> Result<RelationDef, Diagnostic>

Define equalities from consecutive left/right expression root pairs.

§Errors

Rejects an odd number of roots.

pub fn with_conditions( id: Id<Relation>, expression: ExprDag, conditions: Vec<RelationConditionKind>, ) -> Result<RelationDef, Diagnostic>

Define typed mathematical conditions with one descriptor per root pair. Complementarity implies that both operands are nonnegative. Units, real order, and support are checked by semantic admission.

§Errors

Rejects unpaired roots or a mismatched descriptor count.

pub fn initial( id: Id<Relation>, expression: ExprDag, ) -> Result<RelationDef, Diagnostic>

Define simultaneous equalities used only for fresh initialization.

§Errors

Rejects an odd number of roots.

pub const fn is_initial(&self) -> bool

Whether these conditions apply only to fresh initialization.

pub const fn id(&self) -> Id<Relation>

Relation identity.

pub const fn expression(&self) -> &ExprDag

Expression arena holding all condition operands.

pub fn conditions(&self) -> Option<&[RelationConditionKind]>

Mathematical condition descriptors in authored order, when this is a condition Relation.

pub const fn meaning(&self) -> &RelationMeaning

Mathematical meaning, including the terms of a physical Law.

pub fn conservation( id: Id<Relation>, expression: ExprDag, terms: ConservationTerms, ) -> Result<RelationDef, Diagnostic>

Define a physical conservation Law from its balance operands.

§Errors

Rejects a term descriptor that does not name exactly the balance roots.

pub fn noise( id: Id<Relation>, expression: ExprDag, process: NoiseProcess, parameter: ExprId, independent: bool, ) -> Result<RelationDef, Diagnostic>

Define a nominal process Law from its exact parameter root.

pub fn stochastic( id: Id<Relation>, expression: ExprDag, target: Id<Field>, calculus: Option<StochasticCalculus>, drift: Option<ExprId>, diffusions: Vec<(Id<Relation>, ExprId)>, jumps: Vec<(Id<Relation>, ExprId)>, ) -> Result<RelationDef, Diagnostic>

Define stochastic evolution; coefficients are values, never equation sides.

pub fn has_constraints(&self) -> bool

Whether a numerical realization must explicitly enforce constraints.

pub fn equation_sides(&self) -> Result<impl ExactSizeIterator, Diagnostic>

Operand pairs in order. Check conditions() before forming residuals: an inequality or complementarity pair is not an equality to subtract.

§Errors

Process and stochastic evolution Laws have no equality residual projection.

§

impl RelationDef

pub fn validate_conditions<I>( &self, typed: &TypedResidual<I>, support: Option<&SpatialSupport<I>>, ) -> Result<(), TypeViolation<I>>
where I: Clone + Eq,

Check the conditions against independently inferred operand types. The caller must infer the complete DAG first.

§Errors

Rejects incompatible equality/inequality types, non-real ordered values, unsupported frames, and distinct complementarity supports.

Trait Implementations§

§

impl Clone for RelationDef

§

fn clone(&self) -> RelationDef

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
§

impl Debug for RelationDef

§

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

Formats the value using the given formatter. Read more
§

impl From<RelationDef> for KernelNode

§

fn from(value: RelationDef) -> KernelNode

Converts to this type from the input type.
§

impl PartialEq for RelationDef

§

fn eq(&self, other: &RelationDef) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 (const: unstable) · Source§

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 StructuralPartialEq for RelationDef

Auto Trait Implementations§

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
§

impl<Src, Scheme> ApproxFrom<Src, Scheme> for Src
where Scheme: ApproxScheme,

§

type Err = NoError

The error type produced by a failed conversion.
§

fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>

Convert the given value into an approximately equivalent representation.
§

impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Src
where Dst: ApproxFrom<Src, Scheme>, Scheme: ApproxScheme,

§

type Err = <Dst as ApproxFrom<Src, Scheme>>::Err

The error type produced by a failed conversion.
§

fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>

Convert the subject into an approximately equivalent representation.
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
§

impl<T> ByRef<T> for T

§

fn by_ref(&self) -> &T

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
§

impl<T, Dst> ConvAsUtil<Dst> for T

§

fn approx(self) -> Result<Dst, Self::Err>
where Self: Sized + ApproxInto<Dst>,

Approximate the subject with the default scheme.
§

fn approx_by<Scheme>(self) -> Result<Dst, Self::Err>
where Self: Sized + ApproxInto<Dst, Scheme>, Scheme: ApproxScheme,

Approximate the subject with a specific scheme.
§

impl<T> ConvUtil for T

§

fn approx_as<Dst>(self) -> Result<Dst, Self::Err>
where Self: Sized + ApproxInto<Dst>,

Approximate the subject to a given type with the default scheme.
§

fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>
where Self: Sized + ApproxInto<Dst, Scheme>, Scheme: ApproxScheme,

Approximate the subject to a given type with a specific scheme.
§

fn into_as<Dst>(self) -> Dst
where Self: Sized + Into<Dst>,

Convert the subject to a given type.
§

fn try_as<Dst>(self) -> Result<Dst, Self::Err>
where Self: Sized + TryInto<Dst>,

Attempt to convert the subject to a given type.
§

fn value_as<Dst>(self) -> Result<Dst, Self::Err>
where Self: Sized + ValueInto<Dst>,

Attempt a value conversion of the subject to a given type.
§

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

§

fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> T
where Self: Distribution<T>,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided [Span], returning an Instrumented wrapper. Read more
§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. 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
§

impl<T> Pointable for T

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
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
§

impl<Src> TryFrom<Src> for Src

§

type Err = NoError

The error type produced by a failed conversion.
§

fn try_from(src: Src) -> Result<Src, <Src as TryFrom<Src>>::Err>

Convert the given value into the subject type.
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.
§

impl<Src, Dst> TryInto<Dst> for Src
where Dst: TryFrom<Src>,

§

type Err = <Dst as TryFrom<Src>>::Err

The error type produced by a failed conversion.
§

fn try_into(self) -> Result<Dst, <Src as TryInto<Dst>>::Err>

Convert the subject into the destination type.
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.
§

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

§

fn vzip(self) -> V

§

impl<Src> ValueFrom<Src> for Src

§

type Err = NoError

The error type produced by a failed conversion.
§

fn value_from(src: Src) -> Result<Src, <Src as ValueFrom<Src>>::Err>

Convert the given value into an exactly equivalent representation.
§

impl<Src, Dst> ValueInto<Dst> for Src
where Dst: ValueFrom<Src>,

§

type Err = <Dst as ValueFrom<Src>>::Err

The error type produced by a failed conversion.
§

fn value_into(self) -> Result<Dst, <Src as ValueInto<Dst>>::Err>

Convert the subject into an exactly equivalent representation.
§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,

§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Scalar for T
where T: 'static + Clone + PartialEq + Debug,