pub struct CazellesMapNeuron {
pub x: f64,
pub y: f64,
pub a: f64,
pub epsilon: f64,
pub sigma: f64,
pub x_threshold: f64,
}Expand description
Cazelles logistic map neuron — coupled 2D logistic with slow variable.
Fields§
§x: f64§y: f64§a: f64§epsilon: f64§sigma: f64§x_threshold: f64Implementations§
Source§impl CazellesMapNeuron
impl CazellesMapNeuron
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 x trace and the
spike count. Reuses step so the trace is bit-identical to the
per-step path and to the Python reference. The final state is left in
self.x / self.y.
pub fn reset(&mut self)
Trait Implementations§
Source§impl Clone for CazellesMapNeuron
impl Clone for CazellesMapNeuron
Source§fn clone(&self) -> CazellesMapNeuron
fn clone(&self) -> CazellesMapNeuron
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 CazellesMapNeuron
impl Debug for CazellesMapNeuron
Auto Trait Implementations§
impl Freeze for CazellesMapNeuron
impl RefUnwindSafe for CazellesMapNeuron
impl Send for CazellesMapNeuron
impl Sync for CazellesMapNeuron
impl Unpin for CazellesMapNeuron
impl UnsafeUnpin for CazellesMapNeuron
impl UnwindSafe for CazellesMapNeuron
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.