dsalgo 0.3.10

A package for Datastructures and Algorithms.
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

use std::ops::*;

use crate::greatest_common_divisor_euclidean::gcd;

pub fn gcd_reduce<T, I>(iter: I) -> T
where
    I: Iterator<Item = T>,
    T: Default + PartialEq + Copy + RemAssign + PartialOrd,
{
    iter.fold(T::default(), |a, b| gcd(a, b))
}

#[cfg(test)]

mod tests {

    use super::*;

    const CASES: &[(&[i32], i32)] = &[
        (&[], 0),
        (&[0], 0),
        (&[10], 10),
        (&[0, 2, 8, 4], 2),
        (&[33, -111], 3),
        (&[-33, 111], 3),
        (&[-33, -111], 3),
        (&[100, -3], 1),
        (&[-1, 0], 1),
        (&[10, 5], 5),
        (&[0, 10], 10),
    ];

    #[test]

    fn test_reduce() {
        for &(values, ans) in CASES {
            assert_eq!(gcd_reduce(values.iter().cloned()).abs(), ans);
        }
    }
}