pub struct StockFlowMassActionAnalysis {
pub stock_ob_type: TabObType<Ustr, Ustr>,
pub flow_mor_type: TabMorType<Ustr, Ustr>,
pub link_mor_type: TabMorType<Ustr, Ustr>,
}Expand description
Mass-action ODE analysis for stock-flow models.
Mass action dynamics TODO
Fields§
§stock_ob_type: TabObType<Ustr, Ustr>Object type for stocks.
flow_mor_type: TabMorType<Ustr, Ustr>Morphism types for flows between stocks.
link_mor_type: TabMorType<Ustr, Ustr>Morphism types for links for stocks to flows.
Implementations§
Source§impl StockFlowMassActionAnalysis
impl StockFlowMassActionAnalysis
Sourcepub fn create_system<Id: Eq + Clone + Hash + Ord>(
&self,
model: &DiscreteTabModel<Id, Ustr, BuildHasherDefault<IdentityHasher>>,
) -> PolynomialSystem<Id, Polynomial<Id, f32, u8>, u8>
pub fn create_system<Id: Eq + Clone + Hash + Ord>( &self, model: &DiscreteTabModel<Id, Ustr, BuildHasherDefault<IdentityHasher>>, ) -> PolynomialSystem<Id, Polynomial<Id, f32, u8>, u8>
Creates a mass-action system from a model.
The resulting system has symbolic rate coefficients.
Sourcepub fn create_numerical_system<Id: Eq + Clone + Hash + Ord>(
&self,
model: &DiscreteTabModel<Id, Ustr, BuildHasherDefault<IdentityHasher>>,
data: MassActionProblemData<Id>,
) -> ODEAnalysis<Id, NumericalPolynomialSystem<u8>>
pub fn create_numerical_system<Id: Eq + Clone + Hash + Ord>( &self, model: &DiscreteTabModel<Id, Ustr, BuildHasherDefault<IdentityHasher>>, data: MassActionProblemData<Id>, ) -> ODEAnalysis<Id, NumericalPolynomialSystem<u8>>
Creates a numerical mass-action system from a model.
The resulting system has numerical rate coefficients and is ready to solve.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for StockFlowMassActionAnalysis
impl RefUnwindSafe for StockFlowMassActionAnalysis
impl Send for StockFlowMassActionAnalysis
impl Sync for StockFlowMassActionAnalysis
impl Unpin for StockFlowMassActionAnalysis
impl UnwindSafe for StockFlowMassActionAnalysis
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.