pub struct SCTriangularMcKeanNeuron {
pub v: f64,
pub w: f64,
pub a: f64,
pub epsilon: f64,
pub gamma: f64,
pub dt: f64,
pub v_peak: f64,
}Expand description
Retained SC triangular piecewise-linear FHN-like recurrence.
Fields§
§v: f64§w: f64§a: f64§epsilon: f64§gamma: f64§dt: f64§v_peak: f64Implementations§
Source§impl SCTriangularMcKeanNeuron
impl SCTriangularMcKeanNeuron
fn f_v(&self, v: f64) -> f64
fn valid_numeric_contract(&self) -> bool
fn derivatives(&self, v: f64, w: f64, current: f64) -> Option<(f64, f64)>
fn rk4_candidate(&self, current: f64) -> Option<(f64, f64)>
Sourcepub fn step(&mut self, current: f64) -> i32
pub fn step(&mut self, current: f64) -> i32
Advance one RK4 sample and report an upward v_peak crossing.
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_peak-crossing spike count. Reuses step, so the trace
is bit-identical to the per-step path and to the Python reference (the
piecewise-linear RHS is exact arithmetic — no transcendental functions).
The final state is left in self.v / self.w.
Trait Implementations§
Source§impl Clone for SCTriangularMcKeanNeuron
impl Clone for SCTriangularMcKeanNeuron
Source§impl Debug for SCTriangularMcKeanNeuron
impl Debug for SCTriangularMcKeanNeuron
Auto Trait Implementations§
impl Freeze for SCTriangularMcKeanNeuron
impl RefUnwindSafe for SCTriangularMcKeanNeuron
impl Send for SCTriangularMcKeanNeuron
impl Sync for SCTriangularMcKeanNeuron
impl Unpin for SCTriangularMcKeanNeuron
impl UnsafeUnpin for SCTriangularMcKeanNeuron
impl UnwindSafe for SCTriangularMcKeanNeuron
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.