ferro_ta_core 1.1.3

Pure Rust core indicator library — no PyO3, no numpy dependency
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154

//! Rolling math operators — O(n) sliding window implementations.
//!
//! - `rolling_sum`      — rolling sum over `timeperiod` bars (prefix-sum based)
//! - `rolling_max`      — rolling maximum (O(n) monotonic deque)
//! - `rolling_min`      — rolling minimum (O(n) monotonic deque)
//! - `rolling_maxindex` — index of rolling maximum
//! - `rolling_minindex` — index of rolling minimum

use std::collections::VecDeque;

/// Rolling sum over `timeperiod` bars using a prefix-sum array.
/// Leading `timeperiod - 1` values are NaN.
pub fn rolling_sum(real: &[f64], timeperiod: usize) -> Vec<f64> {
    let n = real.len();
    let mut result = vec![f64::NAN; n];
    if timeperiod == 0 || n < timeperiod {
        return result;
    }
    let mut cs = vec![0.0f64; n + 1];
    for i in 0..n {
        cs[i + 1] = cs[i] + real[i];
    }
    for i in (timeperiod - 1)..n {
        result[i] = cs[i + 1] - cs[i + 1 - timeperiod];
    }
    result
}

/// Rolling maximum over `timeperiod` bars (O(n) monotonic deque).
/// Delegates to `math::sliding_max`.
pub fn rolling_max(real: &[f64], timeperiod: usize) -> Vec<f64> {
    crate::math::sliding_max(real, timeperiod)
}

/// Rolling minimum over `timeperiod` bars (O(n) monotonic deque).
/// Delegates to `math::sliding_min`.
pub fn rolling_min(real: &[f64], timeperiod: usize) -> Vec<f64> {
    crate::math::sliding_min(real, timeperiod)
}

/// Index of rolling maximum over `timeperiod` bars.
/// Returns 0-based index. During warmup the value is `-1`.
pub fn rolling_maxindex(real: &[f64], timeperiod: usize) -> Vec<i64> {
    let n = real.len();
    let mut result = vec![-1i64; n];
    if timeperiod == 0 || n < timeperiod {
        return result;
    }
    let mut dq: VecDeque<usize> = VecDeque::new();
    for i in 0..n {
        while dq.front().map(|&j| j + timeperiod <= i).unwrap_or(false) {
            dq.pop_front();
        }
        while dq.back().map(|&j| real[j] <= real[i]).unwrap_or(false) {
            dq.pop_back();
        }
        dq.push_back(i);
        if i + 1 >= timeperiod {
            result[i] = *dq.front().unwrap() as i64;
        }
    }
    result
}

/// Index of rolling minimum over `timeperiod` bars.
/// Returns 0-based index. During warmup the value is `-1`.
pub fn rolling_minindex(real: &[f64], timeperiod: usize) -> Vec<i64> {
    let n = real.len();
    let mut result = vec![-1i64; n];
    if timeperiod == 0 || n < timeperiod {
        return result;
    }
    let mut dq: VecDeque<usize> = VecDeque::new();
    for i in 0..n {
        while dq.front().map(|&j| j + timeperiod <= i).unwrap_or(false) {
            dq.pop_front();
        }
        while dq.back().map(|&j| real[j] >= real[i]).unwrap_or(false) {
            dq.pop_back();
        }
        dq.push_back(i);
        if i + 1 >= timeperiod {
            result[i] = *dq.front().unwrap() as i64;
        }
    }
    result
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_rolling_sum() {
        let data = vec![1.0, 2.0, 3.0, 4.0, 5.0];
        let result = rolling_sum(&data, 3);
        assert!(result[0].is_nan());
        assert!(result[1].is_nan());
        assert!((result[2] - 6.0).abs() < 1e-10); // 1+2+3
        assert!((result[3] - 9.0).abs() < 1e-10); // 2+3+4
        assert!((result[4] - 12.0).abs() < 1e-10); // 3+4+5
    }

    #[test]
    fn test_rolling_max() {
        let data = vec![1.0, 3.0, 2.0, 5.0, 4.0];
        let result = rolling_max(&data, 3);
        assert!(result[0].is_nan());
        assert!(result[1].is_nan());
        assert!((result[2] - 3.0).abs() < 1e-10);
        assert!((result[3] - 5.0).abs() < 1e-10);
        assert!((result[4] - 5.0).abs() < 1e-10);
    }

    #[test]
    fn test_rolling_min() {
        let data = vec![5.0, 3.0, 4.0, 1.0, 2.0];
        let result = rolling_min(&data, 3);
        assert!(result[0].is_nan());
        assert!(result[1].is_nan());
        assert!((result[2] - 3.0).abs() < 1e-10);
        assert!((result[3] - 1.0).abs() < 1e-10);
        assert!((result[4] - 1.0).abs() < 1e-10);
    }

    #[test]
    fn test_rolling_maxindex() {
        let data = vec![1.0, 3.0, 2.0, 5.0, 4.0];
        let result = rolling_maxindex(&data, 3);
        assert_eq!(result[0], -1);
        assert_eq!(result[1], -1);
        assert_eq!(result[2], 1); // max(1,3,2) at index 1
        assert_eq!(result[3], 3); // max(3,2,5) at index 3
        assert_eq!(result[4], 3); // max(2,5,4) at index 3
    }

    #[test]
    fn test_rolling_minindex() {
        let data = vec![5.0, 3.0, 4.0, 1.0, 2.0];
        let result = rolling_minindex(&data, 3);
        assert_eq!(result[0], -1);
        assert_eq!(result[1], -1);
        assert_eq!(result[2], 1); // min(5,3,4) at index 1
        assert_eq!(result[3], 3); // min(3,4,1) at index 3
        assert_eq!(result[4], 3); // min(4,1,2) at index 3
    }

    #[test]
    fn test_short_input() {
        let data = vec![1.0, 2.0];
        let result = rolling_sum(&data, 5);
        assert!(result.iter().all(|v| v.is_nan()));
    }
}