ta-statistics 0.2.6

Rolling statistics for technical analysis in backtesting and live trading systems.
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
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
use ahash::RandomState;
use hashbrown::{HashMap, HashSet};
use num_traits::Float;
use ordered_float::{OrderedFloat, PrimitiveFloat};

use alloc::vec::Vec;

/// A structure that tracks the mode (most frequent value) with push/pop calls from a rolling window.
///
/// This structure efficiently maintains frequency counts for values in a rolling window
/// and provides O(1) lookup time for the current mode. It uses hash maps to track:
/// - The frequency of each value
/// - The set of values for each frequency
///
/// - Insertion time complexity: O(1) amortized
/// - Removal time complexity: O(1) amortized
/// - Mode lookup time complexity: O(1)
///
/// This implementation is optimized for financial time-series analysis where identifying
/// the most common values can reveal important price levels and market tendencies.

#[derive(Debug, Clone)]
pub struct RollingMode<T> {
    /// Maps each value to its frequency count
    freq: HashMap<OrderedFloat<T>, usize, RandomState>,
    /// Maps each frequency to the set of values that occur that many times
    freq_bucket: HashMap<usize, HashSet<OrderedFloat<T>, RandomState>, RandomState>,
    /// The current mode (most frequent value)
    mode: Option<OrderedFloat<T>>,
    /// The frequency of the current mode
    mode_freq: usize,
}

impl<T> RollingMode<T>
where
    T: Float + PrimitiveFloat,
{
    /// Creates a new instance of the `RollingMode` structure.
    ///
    /// Returns an empty `RollingMode` with no values tracked yet.
    /// The structure is initialized with a default random state for hash maps.
    ///
    /// # Returns
    ///
    /// * `Self` - The rolling mode object
    pub fn new() -> Self {
        let hasher = RandomState::default();
        let freq = HashMap::with_hasher(hasher.clone());
        let freq_bucket = HashMap::with_hasher(hasher);
        Self {
            freq,
            freq_bucket,
            mode: None,
            mode_freq: 0,
        }
    }

    /// Adds a new value to the frequency tracking system
    ///
    /// This method updates the internal frequency counters when a new value enters the rolling window.
    /// It maintains the frequency maps and updates the current mode if necessary.
    ///
    /// # Arguments
    ///
    /// * `value` - The value to add to the window
    ///
    /// # Returns
    ///
    /// * `&mut Self` - The rolling mode object
    pub fn push(&mut self, value: T) {
        let value = OrderedFloat(value);
        let old_freq = self.freq.get(&value).copied().unwrap_or(0);
        let new_freq = old_freq + 1;

        self.freq.insert(value, new_freq);

        self.update_freq_buckets(value, old_freq, new_freq);

        if new_freq > self.mode_freq {
            self.mode = Some(value);
            self.mode_freq = new_freq;
        } else if new_freq == self.mode_freq && (self.mode.is_none() || Some(value) < self.mode) {
            self.mode = Some(value);
        }
    }

    /// This method updates the internal frequency counters when a value leaves the rolling window.
    /// It maintains the frequency maps and updates the current mode if necessary.
    ///
    /// # Arguments
    ///
    /// * `value` - The value to remove from the window
    ///
    /// # Returns
    ///
    /// * `&mut Self` - The rolling mode object
    pub fn pop(&mut self, value: T) {
        let value = OrderedFloat(value);
        if let Some(&old_freq) = self.freq.get(&value) {
            let new_freq = old_freq - 1;

            if new_freq == 0 {
                self.freq.remove(&value);
            } else {
                self.freq.insert(value, new_freq);
            }

            self.update_freq_buckets(value, old_freq, new_freq);

            let should_recalculate = self.mode == Some(value) || old_freq == self.mode_freq;
            if should_recalculate {
                self.recalculate_mode();
            }
        }
    }

    /// Returns the mode (most frequent value) if any
    ///
    /// # Returns
    ///
    /// * `Option<T>` - The mode of values in the window, or `None` if the window is not full
    pub fn mode(&self) -> Option<T> {
        self.mode.map(|x| x.0)
    }

    /// Returns all values that have the maximum frequency
    ///
    /// # Returns
    ///
    /// * `Vec<T>` - A vector of values that have the maximum frequency in the window
    #[allow(dead_code)]
    pub fn modes(&self) -> Vec<T> {
        if self.mode_freq == 0 {
            return Vec::new();
        }

        self.freq_bucket
            .get(&self.mode_freq)
            .map_or_else(Vec::new, |values| values.iter().map(|&v| v.0).collect())
    }

    /// Clears all data
    ///
    /// # Returns
    ///
    /// * `&mut Self` - The rolling mode object
    pub fn reset(&mut self) {
        self.freq.clear();
        self.freq_bucket.clear();
        self.mode = None;
        self.mode_freq = 0;
    }

    /// Helper method to update frequency buckets when a value's frequency changes
    fn update_freq_buckets(&mut self, value: OrderedFloat<T>, old_freq: usize, new_freq: usize) {
        if old_freq > 0 {
            if let Some(bucket) = self.freq_bucket.get_mut(&old_freq) {
                bucket.remove(&value);

                if bucket.is_empty() {
                    self.freq_bucket.remove(&old_freq);
                }
            }
        }

        if new_freq > 0 {
            self.freq_bucket.entry(new_freq).or_default().insert(value);
        }
    }

    /// Recalculates the mode when the current mode's frequency changes
    fn recalculate_mode(&mut self) {
        if self.freq.is_empty() {
            self.mode = None;
            self.mode_freq = 0;
            return;
        }

        self.mode_freq = *self.freq_bucket.keys().max().unwrap_or(&0);

        if self.mode_freq > 0 {
            if let Some(values) = self.freq_bucket.get(&self.mode_freq) {
                self.mode = values.iter().min().copied();
            } else {
                self.mode = None;
            }
        } else {
            self.mode = None;
        }
    }

    /// Returns the current maximum frequency
    ///
    /// # Returns
    ///
    /// * `usize` - The maximum frequency of values in the window
    #[allow(dead_code)]
    pub fn max_frequency(&self) -> usize {
        self.mode_freq
    }

    /// Returns the frequency of a specific value
    ///
    /// # Arguments
    ///
    /// * `value` - The value to get the frequency of
    ///
    /// # Returns
    ///
    /// * `usize` - The frequency of the value in the window
    #[allow(dead_code)]
    pub fn frequency_of(&self, value: T) -> usize {
        self.freq.get(&OrderedFloat(value)).copied().unwrap_or(0)
    }

    /// Returns the number of unique values being tracked
    ///
    /// # Returns
    ///
    /// * `usize` - The number of unique values being tracked
    #[allow(dead_code)]
    pub fn unique_count(&self) -> usize {
        self.freq.len()
    }

    /// Returns whether the tracker is empty
    ///
    /// # Returns
    ///
    /// * `bool` - Whether the tracker is empty
    #[allow(dead_code)]
    pub fn is_empty(&self) -> bool {
        self.freq.is_empty()
    }
}

#[cfg(test)]
#[allow(clippy::unwrap_used)]
mod tests {
    use super::*;
    use alloc::vec;

    #[test]
    fn test_empty() {
        let tracker: RollingMode<f64> = RollingMode::new();
        assert_eq!(tracker.mode(), None);
        assert_eq!(tracker.modes(), Vec::<f64>::new());
        assert_eq!(tracker.max_frequency(), 0);
        assert_eq!(tracker.unique_count(), 0);
        assert!(tracker.is_empty());
    }

    #[test]
    fn test_single_value() {
        let mut tracker = RollingMode::new();
        tracker.push(42.0);

        assert_eq!(tracker.mode(), Some(42.0));
        assert_eq!(tracker.modes(), vec![42.0]);
        assert_eq!(tracker.max_frequency(), 1);
        assert_eq!(tracker.unique_count(), 1);
        assert!(!tracker.is_empty());
    }

    #[test]
    fn test_multiple_values() {
        let mut tracker = RollingMode::new();
        tracker.push(1.5);
        tracker.push(2.5);
        tracker.push(1.5);
        tracker.push(3.5);

        assert_eq!(tracker.mode(), Some(1.5));
        assert_eq!(tracker.modes(), vec![1.5]);
        assert_eq!(tracker.max_frequency(), 2);
        assert_eq!(tracker.unique_count(), 3);
        assert_eq!(tracker.frequency_of(1.5), 2);
        assert_eq!(tracker.frequency_of(2.5), 1);
        assert_eq!(tracker.frequency_of(3.5), 1);
        assert_eq!(tracker.frequency_of(4.5), 0);
    }

    #[test]
    fn test_numerical_order_tie_breaking() {
        let mut tracker = RollingMode::new();

        tracker.push(3.0);
        tracker.push(1.0);
        tracker.push(2.0);

        assert_eq!(tracker.mode(), Some(1.0));

        tracker.push(2.0);
        tracker.push(1.0);
        tracker.push(3.0);

        assert_eq!(tracker.mode(), Some(1.0));

        tracker.pop(1.0);

        assert_eq!(tracker.mode(), Some(2.0));
    }

    #[test]
    fn test_reset() {
        let mut tracker = RollingMode::new();
        tracker.push(1.5);
        tracker.push(2.5);
        tracker.push(1.5);

        assert_eq!(tracker.mode(), Some(1.5));
        assert_eq!(tracker.max_frequency(), 2);

        tracker.reset();

        assert_eq!(tracker.mode(), None);
        assert_eq!(tracker.modes(), Vec::<f64>::new());
        assert_eq!(tracker.max_frequency(), 0);
        assert_eq!(tracker.unique_count(), 0);
        assert!(tracker.is_empty());
    }

    #[test]
    fn test_nan_handling() {
        let mut tracker = RollingMode::new();
        tracker.push(1.0);
        tracker.push(f64::NAN);
        tracker.push(f64::NAN);

        assert!(tracker.mode().unwrap().is_nan());
        assert_eq!(tracker.max_frequency(), 2);

        tracker.pop(f64::NAN);

        assert_eq!(tracker.mode(), Some(1.0));
        assert_eq!(tracker.max_frequency(), 1);
    }

    #[test]
    fn test_rolling_window_scenario() {
        let mut tracker = RollingMode::new();
        let inputs = [1.0, 2.0, 1.0, 2.0, 3.0, 3.0, 3.0, 2.0, 2.0, 1.0];

        let mut window = Vec::new();

        for &value in inputs.iter() {
            window.push(value);
            tracker.push(value);

            if window.len() > 3 {
                let oldest = window.remove(0);
                tracker.pop(oldest);
            }
        }

        assert_eq!(tracker.mode(), Some(2.0));
    }

    #[test]
    fn test_multiple_ties() {
        let mut tracker = RollingMode::new();

        tracker.push(3.0);
        tracker.push(1.0);
        tracker.push(2.0);

        assert_eq!(tracker.mode(), Some(1.0));
        assert_eq!(tracker.modes().len(), 3);

        tracker.pop(1.0);

        assert_eq!(tracker.mode(), Some(2.0));
        assert_eq!(tracker.modes().len(), 2);
    }

    #[test]
    fn test_special_floating_point_values() {
        let mut tracker = RollingMode::new();

        tracker.push(10.0);
        tracker.push(20.0);
        assert_eq!(tracker.mode(), Some(10.0));

        tracker.push(20.0);
        assert_eq!(tracker.mode(), Some(20.0));

        tracker.reset();
        tracker.push(0.0);
        tracker.push(-0.0);

        assert_eq!(tracker.unique_count(), 1);
        assert_eq!(tracker.frequency_of(0.0), 2);
        assert_eq!(tracker.frequency_of(-0.0), 2);

        tracker.reset();
        for i in 0..5 {
            tracker.push(i as f64);
        }
        assert_eq!(tracker.mode(), Some(0.0));

        tracker.push(3.0);
        assert_eq!(tracker.mode(), Some(3.0));
    }

    #[test]
    fn test_removing_nonexistent_value() {
        let mut tracker = RollingMode::new();

        tracker.push(1.0);
        tracker.push(2.0);

        tracker.pop(3.0);

        assert_eq!(tracker.unique_count(), 2);
        assert_eq!(tracker.mode(), Some(1.0));
    }

    #[test]
    fn test_repeated_values() {
        let mut tracker = RollingMode::new();

        for _ in 0..100 {
            tracker.push(42.0);
        }

        assert_eq!(tracker.mode(), Some(42.0));
        assert_eq!(tracker.max_frequency(), 100);

        for i in 0..100 {
            tracker.pop(42.0);
            assert_eq!(tracker.max_frequency(), 100 - i - 1);
        }

        assert_eq!(tracker.mode(), None);
        assert!(tracker.is_empty());
    }

    #[test]
    fn test_reset_behavior() {
        let mut tracker = RollingMode::new();

        tracker.push(1.0);
        tracker.push(2.0);
        tracker.push(1.0);

        assert_eq!(tracker.mode(), Some(1.0));

        tracker.reset();

        assert!(tracker.is_empty());
        assert_eq!(tracker.mode(), None);
        assert_eq!(tracker.max_frequency(), 0);
        assert_eq!(tracker.unique_count(), 0);
        assert_eq!(tracker.frequency_of(1.0), 0);

        tracker.push(3.0);
        assert_eq!(tracker.mode(), Some(3.0));
    }

    #[test]
    fn test_pushing_many_unique_values() {
        let mut tracker = RollingMode::new();

        for i in 0..1000 {
            tracker.push(i as f64);
        }

        assert_eq!(tracker.max_frequency(), 1);
        assert_eq!(tracker.unique_count(), 1000);

        assert_eq!(tracker.mode(), Some(0.0));

        tracker.push(42.0);
        assert_eq!(tracker.mode(), Some(42.0));
        assert_eq!(tracker.max_frequency(), 2);
    }
}