pub struct RallDendriteRust {
pub n_branches: usize,
pub branch_length: usize,
tau: f64,
coupling: f64,
dt: f64,
decay: f64,
dt_over_tau: f64,
attenuation: Vec<f64>,
v: Vec<Vec<f64>>,
pub soma_v: f64,
}Expand description
Rall branching dendrite with configurable topology.
Fields§
§n_branches: usize§branch_length: usize§tau: f64§coupling: f64§dt: f64§decay: f64§dt_over_tau: f64§attenuation: Vec<f64>§v: Vec<Vec<f64>>Compartment voltages: [n_branches][branch_length]
soma_v: f64Implementations§
Source§impl RallDendriteRust
impl RallDendriteRust
pub fn new( n_branches: usize, branch_length: usize, tau: f64, coupling: f64, dt: f64, ) -> Self
Sourcepub fn step(&mut self, branch_inputs: &[f64]) -> f64
pub fn step(&mut self, branch_inputs: &[f64]) -> f64
Advance one timestep. branch_inputs: [n_branches] injected at distal tip.
pub fn reset(&mut self)
pub fn branch_voltages(&self) -> Vec<Vec<f64>>
Auto Trait Implementations§
impl Freeze for RallDendriteRust
impl RefUnwindSafe for RallDendriteRust
impl Send for RallDendriteRust
impl Sync for RallDendriteRust
impl Unpin for RallDendriteRust
impl UnsafeUnpin for RallDendriteRust
impl UnwindSafe for RallDendriteRust
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> 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.