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        if !close.is_finite() {
88            return None;
89        }
90        let stop = match self.prev_stop {
91            Some(prev) => {
92                if self.long {
93                    if close < prev {
94                        self.long = false;
95                        self.snap_short(close)
96                    } else {
97                        prev.max(self.snap_long(close))
98                    }
99                } else if close > prev {
100                    self.long = true;
101                    self.snap_long(close)
102                } else {
103                    prev.min(self.snap_short(close))
104                }
105            }
106            None => self.snap_long(close),
107        };
108        self.prev_stop = Some(stop);
109        Some(stop)
110    }
111
112    fn reset(&mut self) {
113        self.prev_stop = None;
114        self.long = true;
115    }
116
117    fn warmup_period(&self) -> usize {
118        1
119    }
120
121    fn is_ready(&self) -> bool {
122        self.prev_stop.is_some()
123    }
124
125    fn name(&self) -> &'static str {
126        "StepTrailingStop"
127    }
128}
129
130#[cfg(test)]
131mod tests {
132    use super::*;
133    use crate::traits::BatchExt;
134    use approx::assert_relative_eq;
135
136    #[test]
137    fn rejects_invalid_step() {
138        assert!(StepTrailingStop::new(0.0).is_err());
139        assert!(StepTrailingStop::new(-1.0).is_err());
140        assert!(StepTrailingStop::new(f64::NAN).is_err());
141    }
142
143    #[test]
144    fn accessors_and_metadata() {
145        let s = StepTrailingStop::classic();
146        assert_relative_eq!(s.step_size(), 1.0, epsilon = 1e-12);
147        assert_eq!(s.name(), "StepTrailingStop");
148        assert_eq!(s.warmup_period(), 1);
149    }
150
151    #[test]
152    fn first_value_snaps_below_price() {
153        let mut s = StepTrailingStop::new(1.0).unwrap();
154        // floor((100.4 - 1) / 1) · 1 = 99.
155        assert_relative_eq!(s.update(100.4).unwrap(), 99.0, epsilon = 1e-12);
156    }
157
158    #[test]
159    fn long_stop_ratchets_in_discrete_steps() {
160        let mut s = StepTrailingStop::new(1.0).unwrap();
161        let out: Vec<f64> = [100.0, 100.5, 101.0, 102.0, 103.5]
162            .iter()
163            .map(|&p| s.update(p).unwrap())
164            .collect();
165        // 100 -> 99, 100.5 -> 99 (no advance), 101 -> 100, 102 -> 101, 103.5 -> 102.
166        assert_relative_eq!(out[0], 99.0, epsilon = 1e-9);
167        assert_relative_eq!(out[1], 99.0, epsilon = 1e-9);
168        assert_relative_eq!(out[2], 100.0, epsilon = 1e-9);
169        assert_relative_eq!(out[3], 101.0, epsilon = 1e-9);
170        assert_relative_eq!(out[4], 102.0, epsilon = 1e-9);
171    }
172
173    #[test]
174    fn flips_to_short_on_close_through_and_back() {
175        let mut s = StepTrailingStop::new(1.0).unwrap();
176        s.update(100.0); // 99
177        s.update(105.0); // 104
178        let flipped = s.update(50.0).unwrap();
179        // ceil((50+1)/1)·1 = 51.
180        assert_relative_eq!(flipped, 51.0, epsilon = 1e-9);
181        // Rally back through 51 -> flip long at 99.
182        let back = s.update(100.0).unwrap();
183        assert_relative_eq!(back, 99.0, epsilon = 1e-9);
184    }
185
186    #[test]
187    fn short_stop_ratchets_down() {
188        let mut s = StepTrailingStop::new(1.0).unwrap();
189        s.update(100.0);
190        s.update(50.0); // short at 51
191        let v = s.update(40.0).unwrap();
192        // ceil((40+1)/1)·1 = 41 -> min(51, 41) = 41.
193        assert_relative_eq!(v, 41.0, epsilon = 1e-9);
194    }
195
196    #[test]
197    fn constant_series_holds_stop() {
198        let mut s = StepTrailingStop::new(1.0).unwrap();
199        let out = s.batch(&[100.0; 30]);
200        for v in out.into_iter().flatten() {
201            assert_relative_eq!(v, 99.0, epsilon = 1e-12);
202        }
203    }
204
205    #[test]
206    fn reset_clears_state() {
207        let mut s = StepTrailingStop::new(1.0).unwrap();
208        s.update(100.0);
209        s.update(50.0);
210        assert!(s.is_ready());
211        s.reset();
212        assert!(!s.is_ready());
213        assert_relative_eq!(s.update(200.0).unwrap(), 199.0, epsilon = 1e-12);
214    }
215
216    #[test]
217    fn batch_equals_streaming() {
218        let prices: Vec<f64> = (0..80)
219            .map(|i| 100.0 + (f64::from(i) * 0.3).sin() * 8.0)
220            .collect();
221        let mut a = StepTrailingStop::classic();
222        let mut b = StepTrailingStop::classic();
223        assert_eq!(
224            a.batch(&prices),
225            prices.iter().map(|x| b.update(*x)).collect::<Vec<_>>()
226        );
227    }
228}