pub struct LotkaVolterraAnalysis { /* private fields */ }Expand description
Lotka-Volterra ODE analysis for models of a double theory.
The main situation we have in mind is the Lotka-Volterra ODE semantics for regulatory networks (signed graphs) described in our Compositionality paper.
Implementations§
Source§impl LotkaVolterraAnalysis
impl LotkaVolterraAnalysis
Sourcepub fn new(var_ob_type: Ustr) -> Self
pub fn new(var_ob_type: Ustr) -> Self
Creates a new Lotka-Volterra analysis for the given object type.
Sourcepub fn add_positive(self, mor_type: FinMor<Ustr, Ustr>) -> Self
pub fn add_positive(self, mor_type: FinMor<Ustr, Ustr>) -> Self
Adds a morphism type defining a positive interaction between objects.
Sourcepub fn add_negative(self, mor_type: FinMor<Ustr, Ustr>) -> Self
pub fn add_negative(self, mor_type: FinMor<Ustr, Ustr>) -> Self
Adds a morphism type defining a negative interaction between objects.
Sourcepub fn create_system<Id: Eq + Clone + Hash + Ord>(
&self,
model: &DiscreteDblModel<Id, UstrFinCategory>,
data: LotkaVolterraProblemData<Id>,
) -> ODEAnalysis<Id, LotkaVolterraSystem>
pub fn create_system<Id: Eq + Clone + Hash + Ord>( &self, model: &DiscreteDblModel<Id, UstrFinCategory>, data: LotkaVolterraProblemData<Id>, ) -> ODEAnalysis<Id, LotkaVolterraSystem>
Creates a Lotka-Volterra system from a model.
Auto Trait Implementations§
impl Freeze for LotkaVolterraAnalysis
impl RefUnwindSafe for LotkaVolterraAnalysis
impl Send for LotkaVolterraAnalysis
impl Sync for LotkaVolterraAnalysis
impl Unpin for LotkaVolterraAnalysis
impl UnwindSafe for LotkaVolterraAnalysis
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.