pub struct HindmarshRoseNeuron {
pub x: f64,
pub y: f64,
pub z: f64,
pub b: f64,
pub r: f64,
pub s: f64,
pub x_rest: f64,
pub dt: f64,
pub x_threshold: f64,
}Expand description
Hindmarsh-Rose 1984 — 3D chaotic bursting model.
Fields§
§x: f64§y: f64§z: f64§b: f64§r: f64§s: f64§x_rest: f64§dt: f64§x_threshold: f64Implementations§
Source§impl HindmarshRoseNeuron
impl HindmarshRoseNeuron
pub fn new() -> Self
fn valid_state(&self) -> bool
fn derivatives( &self, x: f64, y: f64, z: f64, current: f64, ) -> Option<(f64, f64, f64)>
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 x trace
and the upward-crossing spike count. Reuses step (RK4) so the trace is
bit-identical to the per-step path and — because the right-hand side is
exact arithmetic (x.powi(3) = x*x*x, x.powi(2) = x*x) — to the
Python reference, even though the bursting dynamics are chaotic. The
final state is left in self.x / self.y / self.z.
Trait Implementations§
Source§impl Clone for HindmarshRoseNeuron
impl Clone for HindmarshRoseNeuron
Source§fn clone(&self) -> HindmarshRoseNeuron
fn clone(&self) -> HindmarshRoseNeuron
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for HindmarshRoseNeuron
impl Debug for HindmarshRoseNeuron
Auto Trait Implementations§
impl Freeze for HindmarshRoseNeuron
impl RefUnwindSafe for HindmarshRoseNeuron
impl Send for HindmarshRoseNeuron
impl Sync for HindmarshRoseNeuron
impl Unpin for HindmarshRoseNeuron
impl UnsafeUnpin for HindmarshRoseNeuron
impl UnwindSafe for HindmarshRoseNeuron
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.