pub struct LinearODEAnalysis { /* private fields */ }
Expand description
Linear ODE analysis for models of a double theory.
This analysis is somewhat subordinate to the more general case of linear ODE analysis for extended causal loop diagrams, but it can hopefully act as a simple/naive semantics for causal loop diagrams that is useful for building toy models for demonstration purposes.
Implementations§
Source§impl LinearODEAnalysis
impl LinearODEAnalysis
Sourcepub fn new(var_ob_type: Ustr) -> Self
pub fn new(var_ob_type: Ustr) -> Self
Creates a new LinearODE analysis for the given object type.
Sourcepub fn add_positive(self, mor_type: Path<Ustr, Ustr>) -> Self
pub fn add_positive(self, mor_type: Path<Ustr, Ustr>) -> Self
Adds a morphism type defining a positive interaction between objects.
Sourcepub fn add_negative(self, mor_type: Path<Ustr, Ustr>) -> Self
pub fn add_negative(self, mor_type: Path<Ustr, Ustr>) -> Self
Adds a morphism type defining a negative interaction between objects.
Sourcepub fn create_system<Id>(
&self,
model: &DiscreteDblModel<Id, UstrFpCategory>,
data: LinearODEProblemData<Id>,
) -> ODEAnalysis<Id, LinearODESystem>
pub fn create_system<Id>( &self, model: &DiscreteDblModel<Id, UstrFpCategory>, data: LinearODEProblemData<Id>, ) -> ODEAnalysis<Id, LinearODESystem>
Creates a LinearODE system from a model.
Auto Trait Implementations§
impl Freeze for LinearODEAnalysis
impl RefUnwindSafe for LinearODEAnalysis
impl Send for LinearODEAnalysis
impl Sync for LinearODEAnalysis
impl Unpin for LinearODEAnalysis
impl UnwindSafe for LinearODEAnalysis
Blanket Implementations§
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
Mutably borrows from an owned value. Read more
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>
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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<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>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
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
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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.