lcmx 0.1.8

Calculate the least common multiple of multiple values
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

use gcdx::gcd;
use std::fmt::Display;
use std::ops::Div;
use std::ops::Mul;
use std::ops::Rem;

fn lcm<T>(a: T, b: T) -> T
where
    T: Rem<Output = T>
        + PartialOrd
        + Mul<Output = T>
        + Div<Output = T>
        + Copy
        + Display
        + Clone
        + gcdx::Zero,
{
    let tmp = a * b;
    let g = gcd(a, b);
    tmp / g
}

pub fn lcmx<T>(values: &[T]) -> Option<T>
where
    T: Rem<Output = T>
        + PartialOrd
        + Mul<Output = T>
        + Div<Output = T>
        + Copy
        + Display
        + Clone
        + gcdx::Zero,
{
    if values.len() > 0 {
        let mut m = values[0];
        for i in 1..values.len() {
            m = lcm(m, values[i]);
        }
        Some(m)
    } else {
        None
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    #[test]
    fn test_lcmx() {
        let v: Vec<usize> = vec![1, 2, 3, 4];
        let l = lcmx(&v).unwrap();
        // println!("{}", l);
        assert_eq!(l, 12);

        let v: Vec<usize> = vec![1, 2, 3, 99];
        let l = lcmx(&v).unwrap();
        // println!("{}", l);
        assert_eq!(l, 198);

        let v: Vec<usize> = vec![1, 2];
        let l = lcmx(&v).unwrap();
        // println!("{}", l);
        assert_eq!(l, 2);

        let v: Vec<usize> = vec![1];
        let l = lcmx(&v).unwrap();
        // println!("{}", l);
        assert_eq!(l, 1);
    }
}