Skip to main content

MainenSejnowskiNeuron

sc_neurocore_engine::neurons::biophysical

Struct MainenSejnowskiNeuron 

Source 
pub struct MainenSejnowskiNeuron {
Show 17 fields
    pub vs: f64,
    pub va: f64,
    pub m: f64,
    pub h: f64,
    pub n: f64,
    pub kappa: f64,
    pub g_na: f64,
    pub g_k: f64,
    pub g_l: f64,
    pub e_na: f64,
    pub e_k: f64,
    pub e_l: f64,
    pub c_s: f64,
    pub c_a: f64,
    pub dt: f64,
    pub v_threshold: f64,
    pub legacy_sequential: bool,

}
Expand description

Mainen-Sejnowski — two-compartment (soma + axon). Mainen & Sejnowski 1996.

Fields§

§vs: f64§va: f64§m: f64§h: f64§n: f64§kappa: f64§g_na: f64§g_k: f64§g_l: f64§e_na: f64§e_k: f64§e_l: f64§c_s: f64§c_a: f64§dt: f64§v_threshold: f64§legacy_sequential: bool

Legacy engine configuration: update the soma voltage first and let the axon derivative consume the already-updated soma value (Gauss-Seidel ordering). The canonical reference uses the Python Jacobi ordering (both derivatives from pre-update values).

Implementations§

Source§

impl MainenSejnowskiNeuron

Source

pub fn new() -> Self

Source

pub fn new_legacy_sequential() -> Self

Reconstruct the original engine ordering (soma committed before the axon derivative is evaluated). This is a legacy configuration of the same model, not a separate catalogue identity.

Source

fn valid(&self) -> bool

Source

fn linoid(x: f64, k: f64) -> f64

Evaluate x / (1 - exp(-x / k)) with its analytic limit k at 0.

Source

pub fn try_step(&mut self, current: f64) -> Result<i32, &'static str>

Advance one step after validating the drive and configuration.

Computes the whole update on a candidate clone and commits only on success: a non-finite current, a configuration outside the public bounds, or a non-finite candidate returns Err with the pre-step state preserved exactly.

Source

fn canonical_substep(candidate: &mut Self, current: f64)

Canonical reference sub-step: Jacobi compartment ordering with analytically exact removable-singularity rate limits.

Source

fn legacy_sequential_substep(candidate: &mut Self, current: f64)

Legacy engine sub-step preserved verbatim: Gauss-Seidel ordering (the axon derivative consumes the already-updated soma voltage) with the original |x| < 1e-6 analytic-limit branches and additive 1e-12 regularisation elsewhere.

Source

pub fn step(&mut self, current: f64) -> i32

Fail-closed wrapper for legacy callers: returns 0 on any rejected input without mutating state.

Source

pub fn reset(&mut self)

Restore the dynamic state to its initial values, preserving every configuration parameter.

Trait Implementations§

Source§

impl Clone for MainenSejnowskiNeuron

Source§

fn clone(&self) -> Self

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for MainenSejnowskiNeuron

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl Default for MainenSejnowskiNeuron

Source§

fn default() -> Self

Returns the “default value” for a type. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

§

impl<T, A> IntoAst<A> for T
where T: Into<A>, A: Ast,

§

fn into_ast(self, _a: &A) -> A

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
where F: FnOnce(&Self) -> bool,

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

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

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

Checks if self is actually part of its subset T (and can be converted to it).
§

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

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<T> Ungil for T
where T: Send,

§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V