pub struct PernarowskiNeuron {
pub v: f64,
pub w: f64,
pub z: f64,
pub alpha: f64,
pub beta: f64,
pub eps1: f64,
pub eps2: f64,
pub gamma: f64,
pub dt: f64,
pub v_threshold: f64,
}Expand description
Pernarowski 1994 three-state pancreatic beta-cell burster.
Fields§
§v: f64§w: f64§z: f64§alpha: f64§beta: f64§eps1: f64§eps2: f64§gamma: f64§dt: f64§v_threshold: f64Implementations§
Source§impl PernarowskiNeuron
impl PernarowskiNeuron
pub fn new() -> Self
fn is_valid(&self) -> bool
fn derivatives( &self, v: f64, w: f64, z: f64, current: f64, ) -> Option<(f64, f64, f64)>
fn rk4_candidate(&self, current: f64) -> Option<(f64, f64, f64)>
fn try_step(&mut self, current: f64) -> Option<i32>
pub fn step(&mut self, current: f64) -> i32
Sourcepub fn simulate(&mut self, n_steps: usize, current: f64) -> (Vec<f64>, i64)
pub fn simulate(&mut self, n_steps: usize, current: f64) -> (Vec<f64>, i64)
Run n_steps RK4 updates under a constant input, returning the v trace
and the upward-v_threshold-crossing spike count. Uses the same RK4
candidate path as step, so the
trace is bit-identical to the per-step path and to the Python reference
(the cubic uses v.powi(3) = v*v*v, matching the Python v*v*v; no
transcendental functions). The final state is left in self.v / self.w
/ self.z.
Sourcepub fn try_simulate(
&mut self,
n_steps: usize,
current: f64,
) -> Option<(Vec<f64>, i64)>
pub fn try_simulate( &mut self, n_steps: usize, current: f64, ) -> Option<(Vec<f64>, i64)>
Run one failure-atomic batch, returning None on any invalid stage.
pub fn reset(&mut self)
Trait Implementations§
Source§impl Clone for PernarowskiNeuron
impl Clone for PernarowskiNeuron
Source§impl Debug for PernarowskiNeuron
impl Debug for PernarowskiNeuron
Auto Trait Implementations§
impl Freeze for PernarowskiNeuron
impl RefUnwindSafe for PernarowskiNeuron
impl Send for PernarowskiNeuron
impl Sync for PernarowskiNeuron
impl Unpin for PernarowskiNeuron
impl UnsafeUnpin for PernarowskiNeuron
impl UnwindSafe for PernarowskiNeuron
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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<T> Pointable for T
impl<T> Pointable 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>
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.