pub struct ErmentroutKopellMapNeuron {
pub theta: f64,
pub dt: f64,
pub gain: f64,
pub theta_threshold: f64,
}Expand description
Ermentrout-Kopell canonical Type I — theta neuron in map form.
The canonical model for Type I (saddle-node) excitability. theta(n+1) = theta(n) + dt * (1 - cos(theta)) + (1 + cos(theta)) * I Spike when theta crosses pi.
Ermentrout & Kopell, SIAM J Appl Math 46:233, 1986.
Fields§
§theta: f64§dt: f64§gain: f64§theta_threshold: f64Implementations§
Source§impl ErmentroutKopellMapNeuron
impl ErmentroutKopellMapNeuron
pub fn new() -> Self
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 under a constant input, returning the theta trace
(wrapped to [0, 2*pi)) and the upward-crossing spike count. Reuses
step so the trace matches the per-step path; on a shared libm it also
matches the Python reference bit-for-bit (the only transcendental is
cos, and the non-chaotic phase flow does not amplify ULP differences).
The final state is left in self.theta.
pub fn reset(&mut self)
Trait Implementations§
Source§impl Clone for ErmentroutKopellMapNeuron
impl Clone for ErmentroutKopellMapNeuron
Source§fn clone(&self) -> ErmentroutKopellMapNeuron
fn clone(&self) -> ErmentroutKopellMapNeuron
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 ErmentroutKopellMapNeuron
impl Debug for ErmentroutKopellMapNeuron
Auto Trait Implementations§
impl Freeze for ErmentroutKopellMapNeuron
impl RefUnwindSafe for ErmentroutKopellMapNeuron
impl Send for ErmentroutKopellMapNeuron
impl Sync for ErmentroutKopellMapNeuron
impl Unpin for ErmentroutKopellMapNeuron
impl UnsafeUnpin for ErmentroutKopellMapNeuron
impl UnwindSafe for ErmentroutKopellMapNeuron
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.