anofox-forecast 0.4.1

Time series forecasting library - Rust port of anofox-time
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
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
//! SIMD-accelerated primitives via Trueno (f32 internal).
//!
//! This module provides high-performance vector operations using CPU SIMD
//! instructions (AVX2/SSE2/NEON). Functions accept `f64` slices (matching
//! the library's public API), convert internally to `f32` for SIMD computation,
//! and return `f64` results.
//!
//! # Example
//!
//! ```
//! use anofox_forecast::simd;
//!
//! let data = vec![1.0, 2.0, 3.0, 4.0, 5.0];
//!
//! // Basic operations
//! let total = simd::sum(&data);
//! let avg = simd::mean(&data);
//! let var = simd::variance(&data);
//!
//! // Distance calculations
//! let a = vec![1.0, 2.0, 3.0];
//! let b = vec![4.0, 5.0, 6.0];
//! let dist = simd::squared_distance(&a, &b).sqrt();
//! ```
//!
//! # Precision
//!
//! Using f32 internally provides ~7 decimal digits of precision, which is
//! sufficient for statistical aggregates. For precision-critical operations
//! (p-values, convergence checks), use the standard f64 implementations.

use trueno::Vector;

// ============================================================================
// Internal Helpers
// ============================================================================

/// Convert f64 slice to f32 Vec for SIMD processing
#[inline]
fn to_f32(data: &[f64]) -> Vec<f32> {
    data.iter().map(|&x| x as f32).collect()
}

/// Convert f32 slice to f64 Vec for output
#[inline]
fn to_f64(data: &[f32]) -> Vec<f64> {
    data.iter().map(|&x| x as f64).collect()
}

// ============================================================================
// Reduction Operations
// ============================================================================

/// Sum of all elements.
///
/// # Example
///
/// ```
/// use anofox_forecast::simd::sum;
/// assert!((sum(&[1.0, 2.0, 3.0, 4.0]) - 10.0).abs() < 1e-6);
/// ```
#[inline]
pub fn sum(data: &[f64]) -> f64 {
    if data.is_empty() {
        return 0.0;
    }
    let f32_data = to_f32(data);
    Vector::from_slice(&f32_data)
        .sum()
        .map(|s| s as f64)
        .unwrap_or_else(|_| data.iter().sum())
}

/// Sum of squared elements (x·x).
///
/// Equivalent to the dot product of a vector with itself.
///
/// # Example
///
/// ```
/// use anofox_forecast::simd::sum_of_squares;
/// assert!((sum_of_squares(&[1.0, 2.0, 3.0]) - 14.0).abs() < 1e-6); // 1 + 4 + 9
/// ```
#[inline]
pub fn sum_of_squares(data: &[f64]) -> f64 {
    if data.is_empty() {
        return 0.0;
    }
    let f32_data = to_f32(data);
    Vector::from_slice(&f32_data)
        .sum_of_squares()
        .map(|s| s as f64)
        .unwrap_or_else(|_| data.iter().map(|x| x * x).sum())
}

/// Dot product of two vectors.
///
/// Returns the sum of element-wise products: Σ(a\[i\] * b\[i\]).
///
/// # Panics
///
/// Panics if the vectors have different lengths.
///
/// # Example
///
/// ```
/// use anofox_forecast::simd::dot;
/// assert!((dot(&[1.0, 2.0, 3.0], &[4.0, 5.0, 6.0]) - 32.0).abs() < 1e-5); // 4 + 10 + 18
/// ```
#[inline]
pub fn dot(a: &[f64], b: &[f64]) -> f64 {
    assert_eq!(
        a.len(),
        b.len(),
        "vectors must have same length for dot product"
    );
    if a.is_empty() {
        return 0.0;
    }
    let a_f32 = to_f32(a);
    let b_f32 = to_f32(b);
    let va = Vector::from_slice(&a_f32);
    let vb = Vector::from_slice(&b_f32);
    va.dot(&vb)
        .map(|s| s as f64)
        .unwrap_or_else(|_| a.iter().zip(b.iter()).map(|(x, y)| x * y).sum())
}

/// Mean (average) of all elements.
///
/// # Example
///
/// ```
/// use anofox_forecast::simd::mean;
/// assert!((mean(&[1.0, 2.0, 3.0, 4.0, 5.0]) - 3.0).abs() < 1e-6);
/// ```
#[inline]
pub fn mean(data: &[f64]) -> f64 {
    if data.is_empty() {
        return f64::NAN;
    }
    let f32_data = to_f32(data);
    Vector::from_slice(&f32_data)
        .mean()
        .map(|s| s as f64)
        .unwrap_or_else(|_| data.iter().sum::<f64>() / data.len() as f64)
}

/// Population variance.
///
/// Computes Σ(x - μ)² / n where μ is the mean.
///
/// # Example
///
/// ```
/// use anofox_forecast::simd::variance;
/// let data = vec![2.0, 4.0, 4.0, 4.0, 5.0, 5.0, 7.0, 9.0];
/// let var = variance(&data);
/// assert!((var - 4.0).abs() < 1e-5);
/// ```
#[inline]
pub fn variance(data: &[f64]) -> f64 {
    if data.len() < 2 {
        return f64::NAN;
    }
    let f32_data = to_f32(data);
    Vector::from_slice(&f32_data)
        .variance()
        .map(|s| s as f64)
        .unwrap_or_else(|_| {
            let m = data.iter().sum::<f64>() / data.len() as f64;
            data.iter().map(|x| (x - m).powi(2)).sum::<f64>() / data.len() as f64
        })
}

/// Sample variance (with Bessel's correction).
///
/// Computes Σ(x - μ)² / (n-1) where μ is the mean.
#[inline]
pub fn variance_sample(data: &[f64]) -> f64 {
    if data.len() < 2 {
        return f64::NAN;
    }
    let n = data.len() as f64;
    variance(data) * n / (n - 1.0)
}

/// Population standard deviation.
#[inline]
pub fn stddev(data: &[f64]) -> f64 {
    variance(data).sqrt()
}

/// Find the maximum value.
///
/// # Example
///
/// ```
/// use anofox_forecast::simd::max;
/// assert!((max(&[1.0, 5.0, 3.0, 2.0]) - 5.0).abs() < 1e-6);
/// ```
#[inline]
pub fn max(data: &[f64]) -> f64 {
    if data.is_empty() {
        return f64::NEG_INFINITY;
    }
    let f32_data = to_f32(data);
    Vector::from_slice(&f32_data)
        .max()
        .map(|s| s as f64)
        .unwrap_or_else(|_| data.iter().cloned().fold(f64::NEG_INFINITY, f64::max))
}

/// Find the minimum value.
///
/// # Example
///
/// ```
/// use anofox_forecast::simd::min;
/// assert!((min(&[1.0, 5.0, 3.0, 2.0]) - 1.0).abs() < 1e-6);
/// ```
#[inline]
pub fn min(data: &[f64]) -> f64 {
    if data.is_empty() {
        return f64::INFINITY;
    }
    let f32_data = to_f32(data);
    Vector::from_slice(&f32_data)
        .min()
        .map(|s| s as f64)
        .unwrap_or_else(|_| data.iter().cloned().fold(f64::INFINITY, f64::min))
}

// ============================================================================
// Distance Operations
// ============================================================================

/// Squared Euclidean distance: Σ(a\[i\] - b\[i\])².
///
/// Use `.sqrt()` on the result for actual Euclidean distance.
///
/// Note: This uses scalar f64 implementation because the overhead of converting
/// two vectors from f64→f32 exceeds the SIMD performance gains.
///
/// # Panics
///
/// Panics if the vectors have different lengths.
///
/// # Example
///
/// ```
/// use anofox_forecast::simd::squared_distance;
/// let dist = squared_distance(&[0.0, 0.0], &[3.0, 4.0]);
/// assert!((dist - 25.0).abs() < 1e-5); // 9 + 16
/// assert!((dist.sqrt() - 5.0).abs() < 1e-5);
/// ```
#[inline]
pub fn squared_distance(a: &[f64], b: &[f64]) -> f64 {
    assert_eq!(
        a.len(),
        b.len(),
        "vectors must have same length for distance"
    );
    // Use scalar f64 - conversion overhead for two vectors exceeds SIMD gains
    a.iter().zip(b.iter()).map(|(x, y)| (x - y).powi(2)).sum()
}

/// Manhattan (L1) distance: Σ|a\[i\] - b\[i\]|.
///
/// Note: This uses scalar f64 implementation because the overhead of converting
/// two vectors from f64→f32 exceeds the SIMD performance gains.
///
/// # Panics
///
/// Panics if the vectors have different lengths.
///
/// # Example
///
/// ```
/// use anofox_forecast::simd::l1_distance;
/// let dist = l1_distance(&[0.0, 0.0], &[3.0, 4.0]);
/// assert!((dist - 7.0).abs() < 1e-5); // 3 + 4
/// ```
#[inline]
pub fn l1_distance(a: &[f64], b: &[f64]) -> f64 {
    assert_eq!(
        a.len(),
        b.len(),
        "vectors must have same length for distance"
    );
    // Use scalar f64 - conversion overhead for two vectors exceeds SIMD gains
    a.iter().zip(b.iter()).map(|(x, y)| (x - y).abs()).sum()
}

// ============================================================================
// Element-wise Operations
// ============================================================================

/// Element-wise subtraction: a\[i\] - b\[i\].
///
/// # Panics
///
/// Panics if the vectors have different lengths.
///
/// # Example
///
/// ```
/// use anofox_forecast::simd::sub;
/// let result = sub(&[5.0, 4.0, 3.0], &[1.0, 2.0, 3.0]);
/// assert!((result[0] - 4.0).abs() < 1e-6);
/// assert!((result[1] - 2.0).abs() < 1e-6);
/// assert!((result[2] - 0.0).abs() < 1e-6);
/// ```
#[inline]
pub fn sub(a: &[f64], b: &[f64]) -> Vec<f64> {
    assert_eq!(a.len(), b.len(), "vectors must have same length");
    if a.is_empty() {
        return Vec::new();
    }
    let a_f32 = to_f32(a);
    let b_f32 = to_f32(b);
    let va = Vector::from_slice(&a_f32);
    let vb = Vector::from_slice(&b_f32);
    va.sub(&vb)
        .map(|v| to_f64(v.as_slice()))
        .unwrap_or_else(|_| a.iter().zip(b.iter()).map(|(x, y)| x - y).collect())
}

/// Element-wise multiplication: a\[i\] * b\[i\].
///
/// # Panics
///
/// Panics if the vectors have different lengths.
///
/// # Example
///
/// ```
/// use anofox_forecast::simd::mul;
/// let result = mul(&[2.0, 3.0, 4.0], &[5.0, 6.0, 7.0]);
/// assert!((result[0] - 10.0).abs() < 1e-5);
/// assert!((result[1] - 18.0).abs() < 1e-5);
/// assert!((result[2] - 28.0).abs() < 1e-5);
/// ```
#[inline]
pub fn mul(a: &[f64], b: &[f64]) -> Vec<f64> {
    assert_eq!(a.len(), b.len(), "vectors must have same length");
    if a.is_empty() {
        return Vec::new();
    }
    let a_f32 = to_f32(a);
    let b_f32 = to_f32(b);
    let va = Vector::from_slice(&a_f32);
    let vb = Vector::from_slice(&b_f32);
    va.mul(&vb)
        .map(|v| to_f64(v.as_slice()))
        .unwrap_or_else(|_| a.iter().zip(b.iter()).map(|(x, y)| x * y).collect())
}

/// Element-wise division: a\[i\] / b\[i\].
///
/// # Panics
///
/// Panics if the vectors have different lengths.
///
/// # Example
///
/// ```
/// use anofox_forecast::simd::div;
/// let result = div(&[10.0, 18.0, 28.0], &[2.0, 3.0, 4.0]);
/// assert!((result[0] - 5.0).abs() < 1e-5);
/// assert!((result[1] - 6.0).abs() < 1e-5);
/// assert!((result[2] - 7.0).abs() < 1e-5);
/// ```
#[inline]
pub fn div(a: &[f64], b: &[f64]) -> Vec<f64> {
    assert_eq!(a.len(), b.len(), "vectors must have same length");
    if a.is_empty() {
        return Vec::new();
    }
    let a_f32 = to_f32(a);
    let b_f32 = to_f32(b);
    let va = Vector::from_slice(&a_f32);
    let vb = Vector::from_slice(&b_f32);
    va.div(&vb)
        .map(|v| to_f64(v.as_slice()))
        .unwrap_or_else(|_| a.iter().zip(b.iter()).map(|(x, y)| x / y).collect())
}

/// Element-wise addition: a\[i\] + b\[i\].
///
/// # Panics
///
/// Panics if the vectors have different lengths.
///
/// # Example
///
/// ```
/// use anofox_forecast::simd::add;
/// let result = add(&[1.0, 2.0, 3.0], &[4.0, 5.0, 6.0]);
/// assert!((result[0] - 5.0).abs() < 1e-6);
/// assert!((result[1] - 7.0).abs() < 1e-6);
/// assert!((result[2] - 9.0).abs() < 1e-6);
/// ```
#[inline]
pub fn add(a: &[f64], b: &[f64]) -> Vec<f64> {
    assert_eq!(a.len(), b.len(), "vectors must have same length");
    if a.is_empty() {
        return Vec::new();
    }
    let a_f32 = to_f32(a);
    let b_f32 = to_f32(b);
    let va = Vector::from_slice(&a_f32);
    let vb = Vector::from_slice(&b_f32);
    va.add(&vb)
        .map(|v| to_f64(v.as_slice()))
        .unwrap_or_else(|_| a.iter().zip(b.iter()).map(|(x, y)| x + y).collect())
}

/// Scale all elements by a constant: data\[i\] * scalar.
///
/// # Example
///
/// ```
/// use anofox_forecast::simd::scale;
/// let result = scale(&[1.0, 2.0, 3.0], 2.0);
/// assert!((result[0] - 2.0).abs() < 1e-6);
/// assert!((result[1] - 4.0).abs() < 1e-6);
/// assert!((result[2] - 6.0).abs() < 1e-6);
/// ```
#[inline]
pub fn scale(data: &[f64], scalar: f64) -> Vec<f64> {
    if data.is_empty() {
        return Vec::new();
    }
    let f32_data = to_f32(data);
    let scalar_f32 = scalar as f32;
    Vector::from_slice(&f32_data)
        .scale(scalar_f32)
        .map(|v| to_f64(v.as_slice()))
        .unwrap_or_else(|_| data.iter().map(|x| x * scalar).collect())
}

// ============================================================================
// Normalization Operations
// ============================================================================

/// Z-score normalization (standardization).
///
/// Transforms data to have mean 0 and standard deviation 1.
///
/// # Example
///
/// ```
/// use anofox_forecast::simd::zscore;
/// let data = vec![1.0, 2.0, 3.0, 4.0, 5.0];
/// let normalized = zscore(&data);
/// // Mean should be ~0
/// let mean: f64 = normalized.iter().sum::<f64>() / normalized.len() as f64;
/// assert!(mean.abs() < 1e-5);
/// ```
#[inline]
pub fn zscore(data: &[f64]) -> Vec<f64> {
    if data.len() < 2 {
        return data.to_vec();
    }
    let f32_data = to_f32(data);
    Vector::from_slice(&f32_data)
        .zscore()
        .map(|v| to_f64(v.as_slice()))
        .unwrap_or_else(|_| {
            let m = mean(data);
            let s = stddev(data);
            if s.abs() < f64::EPSILON {
                data.to_vec()
            } else {
                data.iter().map(|x| (x - m) / s).collect()
            }
        })
}

/// Min-max normalization to [0, 1] range.
///
/// # Example
///
/// ```
/// use anofox_forecast::simd::minmax_normalize;
/// let data = vec![0.0, 50.0, 100.0];
/// let normalized = minmax_normalize(&data);
/// assert!((normalized[0] - 0.0).abs() < 1e-6);
/// assert!((normalized[1] - 0.5).abs() < 1e-5);
/// assert!((normalized[2] - 1.0).abs() < 1e-6);
/// ```
#[inline]
pub fn minmax_normalize(data: &[f64]) -> Vec<f64> {
    if data.is_empty() {
        return Vec::new();
    }
    let f32_data = to_f32(data);
    Vector::from_slice(&f32_data)
        .minmax_normalize()
        .map(|v| to_f64(v.as_slice()))
        .unwrap_or_else(|_| {
            let min_val = min(data);
            let max_val = max(data);
            let range = max_val - min_val;
            if range.abs() < f64::EPSILON {
                vec![0.0; data.len()]
            } else {
                data.iter().map(|x| (x - min_val) / range).collect()
            }
        })
}

// ============================================================================
// Tests
// ============================================================================

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

    // Use looser tolerance for f32 conversions
    const EPSILON: f64 = 1e-5;

    fn assert_close(a: f64, b: f64, msg: &str) {
        assert!(
            (a - b).abs() < EPSILON,
            "{}: expected {}, got {}, diff = {}",
            msg,
            b,
            a,
            (a - b).abs()
        );
    }

    #[test]
    fn test_sum() {
        assert_close(sum(&[1.0, 2.0, 3.0, 4.0]), 10.0, "sum");
        assert_close(sum(&[]), 0.0, "empty sum");
        assert_close(sum(&[5.0]), 5.0, "single element");
        // Test with more elements
        let large: Vec<f64> = (1..=100).map(|x| x as f64).collect();
        assert_close(sum(&large), 5050.0, "large sum");
    }

    #[test]
    fn test_sum_of_squares() {
        assert_close(sum_of_squares(&[1.0, 2.0, 3.0]), 14.0, "sum_of_squares");
        assert_close(sum_of_squares(&[]), 0.0, "empty");
        assert_close(sum_of_squares(&[1.0, 2.0, 3.0, 4.0, 5.0]), 55.0, "larger");
    }

    #[test]
    fn test_dot() {
        assert_close(dot(&[1.0, 2.0, 3.0], &[4.0, 5.0, 6.0]), 32.0, "dot");
        assert_close(dot(&[], &[]), 0.0, "empty dot");
    }

    #[test]
    fn test_mean() {
        assert_close(mean(&[1.0, 2.0, 3.0, 4.0, 5.0]), 3.0, "mean");
        assert!(mean(&[]).is_nan(), "empty mean should be NaN");
    }

    #[test]
    fn test_variance() {
        let data = vec![2.0, 4.0, 4.0, 4.0, 5.0, 5.0, 7.0, 9.0];
        assert_close(variance(&data), 4.0, "variance");
        assert!(variance(&[]).is_nan(), "empty variance");
        assert!(variance(&[1.0]).is_nan(), "single element variance");
    }

    #[test]
    fn test_squared_distance() {
        assert_close(
            squared_distance(&[0.0, 0.0], &[3.0, 4.0]),
            25.0,
            "squared_distance",
        );
        assert_close(squared_distance(&[], &[]), 0.0, "empty distance");
    }

    #[test]
    fn test_l1_distance() {
        assert_close(l1_distance(&[0.0, 0.0], &[3.0, 4.0]), 7.0, "l1_distance");
    }

    #[test]
    fn test_sub() {
        let result = sub(&[5.0, 4.0, 3.0], &[1.0, 2.0, 3.0]);
        assert_eq!(result.len(), 3);
        assert_close(result[0], 4.0, "sub[0]");
        assert_close(result[1], 2.0, "sub[1]");
        assert_close(result[2], 0.0, "sub[2]");
    }

    #[test]
    fn test_mul() {
        let result = mul(&[2.0, 3.0, 4.0], &[5.0, 6.0, 7.0]);
        assert_close(result[0], 10.0, "mul[0]");
        assert_close(result[1], 18.0, "mul[1]");
        assert_close(result[2], 28.0, "mul[2]");
    }

    #[test]
    fn test_div() {
        let result = div(&[10.0, 18.0, 28.0], &[2.0, 3.0, 4.0]);
        assert_close(result[0], 5.0, "div[0]");
        assert_close(result[1], 6.0, "div[1]");
        assert_close(result[2], 7.0, "div[2]");
    }

    #[test]
    fn test_scale() {
        let result = scale(&[1.0, 2.0, 3.0], 2.0);
        assert_close(result[0], 2.0, "scale[0]");
        assert_close(result[1], 4.0, "scale[1]");
        assert_close(result[2], 6.0, "scale[2]");
    }

    #[test]
    fn test_zscore() {
        let data = vec![1.0, 2.0, 3.0, 4.0, 5.0];
        let normalized = zscore(&data);
        assert_eq!(normalized.len(), 5);
        // Mean should be close to 0
        let m: f64 = normalized.iter().sum::<f64>() / normalized.len() as f64;
        assert!(m.abs() < EPSILON, "zscore mean should be ~0, got {}", m);
    }

    #[test]
    fn test_minmax_normalize() {
        let result = minmax_normalize(&[0.0, 50.0, 100.0]);
        assert_close(result[0], 0.0, "minmax[0]");
        assert_close(result[1], 0.5, "minmax[1]");
        assert_close(result[2], 1.0, "minmax[2]");
    }

    #[test]
    fn test_max_min() {
        assert_close(max(&[1.0, 5.0, 3.0, 2.0]), 5.0, "max");
        assert_close(min(&[1.0, 5.0, 3.0, 2.0]), 1.0, "min");
    }

    #[test]
    fn test_variance_sample() {
        let data = vec![2.0, 4.0, 4.0, 4.0, 5.0, 5.0, 7.0, 9.0];
        let pop_var = variance(&data);
        let sample_var = variance_sample(&data);
        // Sample variance = pop_variance * n / (n-1)
        let expected = pop_var * 8.0 / 7.0;
        assert_close(sample_var, expected, "variance_sample");

        // Edge cases
        assert!(variance_sample(&[]).is_nan(), "empty variance_sample");
        assert!(
            variance_sample(&[1.0]).is_nan(),
            "single element variance_sample"
        );
    }

    #[test]
    fn test_stddev() {
        let data = vec![2.0, 4.0, 4.0, 4.0, 5.0, 5.0, 7.0, 9.0];
        let expected = variance(&data).sqrt();
        assert_close(stddev(&data), expected, "stddev");
        assert_close(stddev(&data), 2.0, "stddev value");

        // Edge cases
        assert!(stddev(&[]).is_nan(), "empty stddev");
        assert!(stddev(&[1.0]).is_nan(), "single element stddev");
    }

    #[test]
    fn test_add() {
        let result = add(&[1.0, 2.0, 3.0], &[4.0, 5.0, 6.0]);
        assert_eq!(result.len(), 3);
        assert_close(result[0], 5.0, "add[0]");
        assert_close(result[1], 7.0, "add[1]");
        assert_close(result[2], 9.0, "add[2]");

        // Empty case
        let empty_result = add(&[], &[]);
        assert!(empty_result.is_empty(), "empty add");
    }

    #[test]
    fn test_sub_empty() {
        let result = sub(&[], &[]);
        assert!(result.is_empty(), "empty sub");
    }

    #[test]
    fn test_mul_empty() {
        let result = mul(&[], &[]);
        assert!(result.is_empty(), "empty mul");
    }

    #[test]
    fn test_div_empty() {
        let result = div(&[], &[]);
        assert!(result.is_empty(), "empty div");
    }

    #[test]
    fn test_scale_empty() {
        let result = scale(&[], 2.0);
        assert!(result.is_empty(), "empty scale");
    }

    #[test]
    fn test_zscore_edge_cases() {
        // Single element returns unchanged
        let single = zscore(&[5.0]);
        assert_eq!(single.len(), 1);
        assert_close(single[0], 5.0, "zscore single");

        // Empty returns empty
        let empty = zscore(&[]);
        assert!(empty.is_empty(), "zscore empty");

        // Constant data (stddev = 0) returns unchanged
        let constant = zscore(&[3.0, 3.0, 3.0, 3.0]);
        assert_eq!(constant.len(), 4);
        // Should return original data when stddev is 0
        for &v in &constant {
            assert_close(v, 3.0, "zscore constant");
        }
    }

    #[test]
    fn test_minmax_normalize_edge_cases() {
        // Empty returns empty
        let empty = minmax_normalize(&[]);
        assert!(empty.is_empty(), "minmax empty");

        // Constant data returns zeros
        let constant = minmax_normalize(&[5.0, 5.0, 5.0]);
        assert_eq!(constant.len(), 3);
        for &v in &constant {
            assert_close(v, 0.0, "minmax constant");
        }

        // Single element
        let single = minmax_normalize(&[5.0]);
        assert_eq!(single.len(), 1);
        assert_close(single[0], 0.0, "minmax single");
    }

    #[test]
    fn test_max_empty() {
        assert_eq!(max(&[]), f64::NEG_INFINITY);
    }

    #[test]
    fn test_min_empty() {
        assert_eq!(min(&[]), f64::INFINITY);
    }

    #[test]
    fn test_single_element_sum_of_squares() {
        assert_close(sum_of_squares(&[3.0]), 9.0, "single sum_of_squares");
    }

    #[test]
    fn test_single_element_dot() {
        assert_close(dot(&[3.0], &[4.0]), 12.0, "single dot");
    }

    #[test]
    fn test_single_element_mean() {
        assert_close(mean(&[5.0]), 5.0, "single mean");
    }

    #[test]
    fn test_single_element_max_min() {
        assert_close(max(&[5.0]), 5.0, "single max");
        assert_close(min(&[5.0]), 5.0, "single min");
    }

    #[test]
    fn test_single_element_distances() {
        assert_close(
            squared_distance(&[3.0], &[5.0]),
            4.0,
            "single squared_distance",
        );
        assert_close(l1_distance(&[3.0], &[5.0]), 2.0, "single l1_distance");
    }

    #[test]
    fn test_single_element_elementwise_ops() {
        let sub_result = sub(&[5.0], &[3.0]);
        assert_close(sub_result[0], 2.0, "single sub");

        let mul_result = mul(&[5.0], &[3.0]);
        assert_close(mul_result[0], 15.0, "single mul");

        let div_result = div(&[6.0], &[3.0]);
        assert_close(div_result[0], 2.0, "single div");

        let add_result = add(&[5.0], &[3.0]);
        assert_close(add_result[0], 8.0, "single add");

        let scale_result = scale(&[5.0], 3.0);
        assert_close(scale_result[0], 15.0, "single scale");
    }

    #[test]
    fn test_large_vectors() {
        // Test with vectors larger than typical SIMD width
        let large_a: Vec<f64> = (0..1000).map(|x| x as f64).collect();
        let large_b: Vec<f64> = (0..1000).map(|x| (x * 2) as f64).collect();

        // Sum: 0 + 1 + 2 + ... + 999 = 999 * 1000 / 2 = 499500
        assert_close(sum(&large_a), 499500.0, "large sum");

        // Mean
        assert_close(mean(&large_a), 499.5, "large mean");

        // Max/Min
        assert_close(max(&large_a), 999.0, "large max");
        assert_close(min(&large_a), 0.0, "large min");

        // Element-wise operations
        let add_result = add(&large_a, &large_b);
        assert_eq!(add_result.len(), 1000);
        assert_close(add_result[500], 1500.0, "large add");

        let sub_result = sub(&large_b, &large_a);
        assert_eq!(sub_result.len(), 1000);
        assert_close(sub_result[500], 500.0, "large sub");
    }

    #[test]
    fn test_non_multiple_of_four_lengths() {
        // Test with lengths that are not multiples of 4 (typical SIMD width)
        let v3: Vec<f64> = vec![1.0, 2.0, 3.0];
        let v5: Vec<f64> = vec![1.0, 2.0, 3.0, 4.0, 5.0];
        let v7: Vec<f64> = vec![1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0];

        assert_close(sum(&v3), 6.0, "sum v3");
        assert_close(sum(&v5), 15.0, "sum v5");
        assert_close(sum(&v7), 28.0, "sum v7");

        assert_close(mean(&v3), 2.0, "mean v3");
        assert_close(mean(&v5), 3.0, "mean v5");
        assert_close(mean(&v7), 4.0, "mean v7");
    }

    #[test]
    fn test_negative_values() {
        let data = vec![-5.0, -3.0, -1.0, 0.0, 1.0, 3.0, 5.0];

        assert_close(sum(&data), 0.0, "negative sum");
        assert_close(mean(&data), 0.0, "negative mean");
        assert_close(max(&data), 5.0, "negative max");
        assert_close(min(&data), -5.0, "negative min");

        let squared = sum_of_squares(&data);
        assert_close(squared, 70.0, "negative sum_of_squares"); // 25+9+1+0+1+9+25

        let a = vec![-1.0, -2.0];
        let b = vec![3.0, 4.0];
        assert_close(l1_distance(&a, &b), 10.0, "negative l1"); // |(-1)-3| + |(-2)-4| = 4 + 6
        assert_close(squared_distance(&a, &b), 52.0, "negative squared"); // 16 + 36
    }
}