pub struct NMDANeuron {Show 24 fields
pub v: f64,
pub x_nmda: f64,
pub s_nmda: f64,
pub ca: f64,
pub refractory_remaining: f64,
pub c_m: f64,
pub g_l: f64,
pub v_l: f64,
pub g_nmda: f64,
pub e_nmda: f64,
pub mg_conc: f64,
pub alpha_x: f64,
pub tau_x: f64,
pub alpha_s: f64,
pub tau_s: f64,
pub kinetic_scale: f64,
pub g_ahp: f64,
pub v_k: f64,
pub alpha_ca: f64,
pub tau_ca: f64,
pub dt: f64,
pub v_threshold: f64,
pub v_reset: f64,
pub refractory_period: f64,
}Expand description
Wang (1999) pyramidal LIF neuron with two-stage NMDA-autapse kinetics.
Fields§
§v: f64§x_nmda: f64§s_nmda: f64§ca: f64§refractory_remaining: f64§c_m: f64§g_l: f64§v_l: f64§g_nmda: f64§e_nmda: f64§mg_conc: f64§alpha_x: f64§tau_x: f64§alpha_s: f64§tau_s: f64§kinetic_scale: f64§g_ahp: f64§v_k: f64§alpha_ca: f64§tau_ca: f64§dt: f64§v_threshold: f64§v_reset: f64§refractory_period: f64Implementations§
Source§impl NMDANeuron
impl NMDANeuron
pub fn new() -> Self
fn valid(&self) -> bool
fn derivatives( &self, v: f64, x_nmda: f64, s_nmda: f64, ca: f64, current: f64, ) -> [f64; 4]
fn rk2_candidate(&self, v: f64, current: f64) -> [f64; 4]
Sourcepub fn try_step(&mut self, current: f64) -> Result<i32, &'static str>
pub fn try_step(&mut self, current: f64) -> Result<i32, &'static str>
Advance one source-grid step atomically.
pub fn reset(&mut self)
Trait Implementations§
Source§impl Clone for NMDANeuron
impl Clone for NMDANeuron
Source§impl Debug for NMDANeuron
impl Debug for NMDANeuron
Auto Trait Implementations§
impl Freeze for NMDANeuron
impl RefUnwindSafe for NMDANeuron
impl Send for NMDANeuron
impl Sync for NMDANeuron
impl Unpin for NMDANeuron
impl UnsafeUnpin for NMDANeuron
impl UnwindSafe for NMDANeuron
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.