pub struct BendaHerzNeuron {
pub a: f64,
pub phase: f64,
pub onset_gain: f64,
pub rheobase: f64,
pub adaptation_slope: f64,
pub tau_a: f64,
pub dt: f64,
}Expand description
Deterministic Benda–Herz universal rate-adaptation neuron.
Fields§
§a: f64Adaptation variable.
phase: f64Phase of the deterministic spike generator in [0, 1).
onset_gain: f64Gain of f0(x) = onset_gain * sqrt(max(x-rheobase, 0)).
rheobase: f64Onset-current offset.
adaptation_slope: f64Slope in A_inf(f) = adaptation_slope * f.
tau_a: f64Adaptation time constant in milliseconds.
dt: f64Sample interval in milliseconds.
Implementations§
Trait Implementations§
Source§impl Clone for BendaHerzNeuron
impl Clone for BendaHerzNeuron
Source§impl Debug for BendaHerzNeuron
impl Debug for BendaHerzNeuron
Auto Trait Implementations§
impl Freeze for BendaHerzNeuron
impl RefUnwindSafe for BendaHerzNeuron
impl Send for BendaHerzNeuron
impl Sync for BendaHerzNeuron
impl Unpin for BendaHerzNeuron
impl UnsafeUnpin for BendaHerzNeuron
impl UnwindSafe for BendaHerzNeuron
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.