use super::{rk4, DynamicalSystem};
pub struct HindmarshRose {
state: Vec<f64>, pub a: f64,
pub b: f64,
pub c: f64,
pub d: f64,
pub s: f64,
pub x_rest: f64,
pub r: f64, pub current_i: f64, speed: f64,
}
impl HindmarshRose {
pub fn new(current_i: f64, r: f64) -> Self {
Self {
state: vec![0.0, -8.0, -1.6],
a: 1.0,
b: 3.0,
c: 1.0,
d: 5.0,
s: 4.0,
x_rest: -1.6,
r,
current_i,
speed: 0.0,
}
}
#[allow(clippy::similar_names, clippy::many_single_char_names)]
fn deriv(
s: &[f64],
a: f64,
b: f64,
c: f64,
d: f64,
r_: f64,
sr: f64,
x_rest: f64,
i: f64,
) -> Vec<f64> {
let x = s[0];
let y = s[1];
let z = s[2];
vec![
y - a * x * x * x + b * x * x + i - z,
c - d * x * x - y,
r_ * (sr * (x - x_rest) - z),
]
}
}
impl DynamicalSystem for HindmarshRose {
fn state(&self) -> &[f64] {
&self.state
}
fn dimension(&self) -> usize {
3
}
fn name(&self) -> &str {
"Hindmarsh-Rose"
}
fn speed(&self) -> f64 {
self.speed
}
fn deriv_at(&self, state: &[f64]) -> Vec<f64> {
Self::deriv(
state,
self.a,
self.b,
self.c,
self.d,
self.r,
self.s,
self.x_rest,
self.current_i,
)
}
fn set_state(&mut self, s: &[f64]) {
let n = self.state.len().min(s.len());
for i in 0..n {
if s[i].is_finite() {
self.state[i] = s[i];
}
}
}
#[allow(clippy::similar_names, clippy::many_single_char_names)]
fn step(&mut self, dt: f64) {
let (a, b, c, d, r, s, x_rest, i) = (
self.a,
self.b,
self.c,
self.d,
self.r,
self.s,
self.x_rest,
self.current_i,
);
let prev = self.state.clone();
rk4(&mut self.state, dt, |st| {
Self::deriv(st, a, b, c, d, r, s, x_rest, i)
});
self.state[0] = self.state[0].clamp(-5.0, 5.0);
self.state[1] = self.state[1].clamp(-20.0, 20.0);
self.state[2] = self.state[2].clamp(-5.0, 5.0);
let ds: f64 = self
.state
.iter()
.zip(prev.iter())
.map(|(a, b)| (a - b).powi(2))
.sum::<f64>()
.sqrt();
self.speed = ds / dt;
}
}
#[cfg(test)]
mod tests {
use super::*;
use crate::systems::DynamicalSystem;
#[test]
fn test_hindmarsh_rose_initial_state() {
let sys = HindmarshRose::new(2.0, 0.01);
let s = sys.state();
assert_eq!(s.len(), 3);
assert!((s[0] - 0.0).abs() < 1e-15);
assert!((s[1] - (-8.0)).abs() < 1e-15);
assert!((s[2] - (-1.6)).abs() < 1e-15);
assert_eq!(sys.name(), "Hindmarsh-Rose");
assert_eq!(sys.dimension(), 3);
}
#[test]
fn test_hindmarsh_rose_step_changes_state() {
let mut sys = HindmarshRose::new(2.0, 0.01);
let before: Vec<f64> = sys.state().to_vec();
sys.step(0.01);
let after = sys.state();
assert!(
before.iter().zip(after.iter()).any(|(a, b)| (a - b).abs() > 1e-15),
"State did not change after step"
);
}
#[test]
fn test_hindmarsh_rose_deterministic() {
let mut sys1 = HindmarshRose::new(2.0, 0.01);
let mut sys2 = HindmarshRose::new(2.0, 0.01);
for _ in 0..500 {
sys1.step(0.01);
sys2.step(0.01);
}
for (a, b) in sys1.state().iter().zip(sys2.state().iter()) {
assert!((a - b).abs() < 1e-15, "Non-deterministic: {} vs {}", a, b);
}
}
#[test]
fn test_hindmarsh_rose_state_stays_finite() {
let mut sys = HindmarshRose::new(2.0, 0.01);
for _ in 0..1000 {
sys.step(0.01);
}
for v in sys.state().iter() {
assert!(v.is_finite(), "State became non-finite: {}", v);
}
}
#[test]
fn test_hindmarsh_rose_set_state() {
let mut sys = HindmarshRose::new(2.0, 0.01);
sys.set_state(&[1.0, -5.0, -1.0]);
let s = sys.state();
assert!((s[0] - 1.0).abs() < 1e-15);
assert!((s[1] - (-5.0)).abs() < 1e-15);
assert!((s[2] - (-1.0)).abs() < 1e-15);
}
#[test]
fn test_hindmarsh_rose_speed_positive_after_step() {
let mut sys = HindmarshRose::new(2.0, 0.01);
sys.step(0.01);
assert!(sys.speed() > 0.0, "speed should be positive: {}", sys.speed());
}
#[test]
fn test_hindmarsh_rose_different_i_affects_spiking() {
let mut sys_low = HindmarshRose::new(1.0, 0.01);
let mut sys_high = HindmarshRose::new(4.0, 0.01);
for _ in 0..1000 {
sys_low.step(0.01);
sys_high.step(0.01);
}
let x_low = sys_low.state()[0];
let x_high = sys_high.state()[0];
assert!(
(x_low - x_high).abs() > 0.01,
"Different I should give different membrane voltage: I=1 → {}, I=4 → {}",
x_low, x_high
);
}
}