pub struct FitzHughRinzelNeuron {
pub v: f64,
pub w: f64,
pub y: f64,
pub a: f64,
pub b: f64,
pub c: f64,
pub d: f64,
pub delta: f64,
pub mu: f64,
pub dt: f64,
pub v_threshold: f64,
}Expand description
FitzHugh-Rinzel — 3D extension with slow bursting variable.
Fields§
§v: f64§w: f64§y: f64§a: f64§b: f64§c: f64§d: f64§delta: f64§mu: f64§dt: f64§v_threshold: f64Implementations§
Source§impl FitzHughRinzelNeuron
impl FitzHughRinzelNeuron
pub fn new() -> Self
fn valid_numeric_contract(&self) -> bool
fn derivatives( &self, v: f64, w: f64, y: 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
pub fn reset(&mut self)
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-crossing spike count. Uses the same RK4 candidate path as
step, so the trace is bit-identical to the per-step path and — because the right-hand side is
exact arithmetic (v.powi(3) = v*v*v) — to the Python reference. The
final state is left in self.v / self.w / self.y.
Trait Implementations§
Source§impl Clone for FitzHughRinzelNeuron
impl Clone for FitzHughRinzelNeuron
Source§impl Debug for FitzHughRinzelNeuron
impl Debug for FitzHughRinzelNeuron
Auto Trait Implementations§
impl Freeze for FitzHughRinzelNeuron
impl RefUnwindSafe for FitzHughRinzelNeuron
impl Send for FitzHughRinzelNeuron
impl Sync for FitzHughRinzelNeuron
impl Unpin for FitzHughRinzelNeuron
impl UnsafeUnpin for FitzHughRinzelNeuron
impl UnwindSafe for FitzHughRinzelNeuron
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.