Skip to main content

wickra_core/indicators/
step_trailing_stop.rs

1//! Step Trailing Stop.
2
3use crate::error::{Error, Result};
4use crate::traits::Indicator;
5
6/// Step Trailing Stop — a stop that ratchets in fixed-size discrete steps and
7/// flips to the opposite side on a close-through.
8///
9/// ```text
10/// long:   target = close − step_size
11///         stop_t = max(stop_{t−1}, floor(target / step_size) · step_size)
12///                  while close ≥ stop_{t−1}
13/// short:  target = close + step_size
14///         stop_t = min(stop_{t−1}, ceil(target / step_size) · step_size)
15///                  while close ≤ stop_{t−1}
16/// flip-to-long  on close > prev short-stop -> stop = floor((close − step) / step) · step
17/// flip-to-short on close < prev long-stop  -> stop = ceil((close + step) / step) · step
18/// ```
19///
20/// Quantising the stop to a multiple of `step_size` keeps the level on a
21/// round-number grid, which mirrors how many discretionary traders move stops
22/// by hand (in $0.50, $1, or 10-pip increments). The first input seeds a long
23/// stop one step below the snapped close.
24///
25/// # Example
26///
27/// ```
28/// use wickra_core::{Indicator, StepTrailingStop};
29///
30/// let mut indicator = StepTrailingStop::new(1.0).unwrap();
31/// let mut last = None;
32/// for i in 0..20 {
33///     last = indicator.update(100.0 + f64::from(i));
34/// }
35/// assert!(last.is_some());
36/// ```
37#[derive(Debug, Clone)]
38pub struct StepTrailingStop {
39    step_size: f64,
40    prev_stop: Option<f64>,
41    long: bool,
42}
43
44impl StepTrailingStop {
45    /// Construct a Step Trailing Stop with an explicit step size.
46    ///
47    /// # Errors
48    /// Returns [`Error::NonPositiveMultiplier`] if `step_size` is not strictly
49    /// positive and finite.
50    pub fn new(step_size: f64) -> Result<Self> {
51        if !step_size.is_finite() || step_size <= 0.0 {
52            return Err(Error::NonPositiveMultiplier);
53        }
54        Ok(Self {
55            step_size,
56            prev_stop: None,
57            long: true,
58        })
59    }
60
61    /// A common configuration: a `1.0` step size.
62    pub fn classic() -> Self {
63        Self::new(1.0).expect("classic step is valid")
64    }
65
66    /// Configured step size.
67    pub const fn step_size(&self) -> f64 {
68        self.step_size
69    }
70
71    /// Snap `value` down to the nearest `step_size`-grid line below it.
72    fn snap_long(&self, close: f64) -> f64 {
73        ((close - self.step_size) / self.step_size).floor() * self.step_size
74    }
75
76    /// Snap `value` up to the nearest `step_size`-grid line above it.
77    fn snap_short(&self, close: f64) -> f64 {
78        ((close + self.step_size) / self.step_size).ceil() * self.step_size
79    }
80}
81
82impl Indicator for StepTrailingStop {
83    type Input = f64;
84    type Output = f64;
85
86    fn update(&mut self, close: f64) -> Option<f64> {
87        let stop = match self.prev_stop {
88            Some(prev) => {
89                if self.long {
90                    if close < prev {
91                        self.long = false;
92                        self.snap_short(close)
93                    } else {
94                        prev.max(self.snap_long(close))
95                    }
96                } else if close > prev {
97                    self.long = true;
98                    self.snap_long(close)
99                } else {
100                    prev.min(self.snap_short(close))
101                }
102            }
103            None => self.snap_long(close),
104        };
105        self.prev_stop = Some(stop);
106        Some(stop)
107    }
108
109    fn reset(&mut self) {
110        self.prev_stop = None;
111        self.long = true;
112    }
113
114    fn warmup_period(&self) -> usize {
115        1
116    }
117
118    fn is_ready(&self) -> bool {
119        self.prev_stop.is_some()
120    }
121
122    fn name(&self) -> &'static str {
123        "StepTrailingStop"
124    }
125}
126
127#[cfg(test)]
128mod tests {
129    use super::*;
130    use crate::traits::BatchExt;
131    use approx::assert_relative_eq;
132
133    #[test]
134    fn rejects_invalid_step() {
135        assert!(StepTrailingStop::new(0.0).is_err());
136        assert!(StepTrailingStop::new(-1.0).is_err());
137        assert!(StepTrailingStop::new(f64::NAN).is_err());
138    }
139
140    #[test]
141    fn accessors_and_metadata() {
142        let s = StepTrailingStop::classic();
143        assert_relative_eq!(s.step_size(), 1.0, epsilon = 1e-12);
144        assert_eq!(s.name(), "StepTrailingStop");
145        assert_eq!(s.warmup_period(), 1);
146    }
147
148    #[test]
149    fn first_value_snaps_below_price() {
150        let mut s = StepTrailingStop::new(1.0).unwrap();
151        // floor((100.4 - 1) / 1) · 1 = 99.
152        assert_relative_eq!(s.update(100.4).unwrap(), 99.0, epsilon = 1e-12);
153    }
154
155    #[test]
156    fn long_stop_ratchets_in_discrete_steps() {
157        let mut s = StepTrailingStop::new(1.0).unwrap();
158        let out: Vec<f64> = [100.0, 100.5, 101.0, 102.0, 103.5]
159            .iter()
160            .map(|&p| s.update(p).unwrap())
161            .collect();
162        // 100 -> 99, 100.5 -> 99 (no advance), 101 -> 100, 102 -> 101, 103.5 -> 102.
163        assert_relative_eq!(out[0], 99.0, epsilon = 1e-9);
164        assert_relative_eq!(out[1], 99.0, epsilon = 1e-9);
165        assert_relative_eq!(out[2], 100.0, epsilon = 1e-9);
166        assert_relative_eq!(out[3], 101.0, epsilon = 1e-9);
167        assert_relative_eq!(out[4], 102.0, epsilon = 1e-9);
168    }
169
170    #[test]
171    fn flips_to_short_on_close_through_and_back() {
172        let mut s = StepTrailingStop::new(1.0).unwrap();
173        s.update(100.0); // 99
174        s.update(105.0); // 104
175        let flipped = s.update(50.0).unwrap();
176        // ceil((50+1)/1)·1 = 51.
177        assert_relative_eq!(flipped, 51.0, epsilon = 1e-9);
178        // Rally back through 51 -> flip long at 99.
179        let back = s.update(100.0).unwrap();
180        assert_relative_eq!(back, 99.0, epsilon = 1e-9);
181    }
182
183    #[test]
184    fn short_stop_ratchets_down() {
185        let mut s = StepTrailingStop::new(1.0).unwrap();
186        s.update(100.0);
187        s.update(50.0); // short at 51
188        let v = s.update(40.0).unwrap();
189        // ceil((40+1)/1)·1 = 41 -> min(51, 41) = 41.
190        assert_relative_eq!(v, 41.0, epsilon = 1e-9);
191    }
192
193    #[test]
194    fn constant_series_holds_stop() {
195        let mut s = StepTrailingStop::new(1.0).unwrap();
196        let out = s.batch(&[100.0; 30]);
197        for v in out.into_iter().flatten() {
198            assert_relative_eq!(v, 99.0, epsilon = 1e-12);
199        }
200    }
201
202    #[test]
203    fn reset_clears_state() {
204        let mut s = StepTrailingStop::new(1.0).unwrap();
205        s.update(100.0);
206        s.update(50.0);
207        assert!(s.is_ready());
208        s.reset();
209        assert!(!s.is_ready());
210        assert_relative_eq!(s.update(200.0).unwrap(), 199.0, epsilon = 1e-12);
211    }
212
213    #[test]
214    fn batch_equals_streaming() {
215        let prices: Vec<f64> = (0..80)
216            .map(|i| 100.0 + (f64::from(i) * 0.3).sin() * 8.0)
217            .collect();
218        let mut a = StepTrailingStop::classic();
219        let mut b = StepTrailingStop::classic();
220        assert_eq!(
221            a.batch(&prices),
222            prices.iter().map(|x| b.update(*x)).collect::<Vec<_>>()
223        );
224    }
225}