lcmx 0.1.5

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

use gcdx::gcd_euclidean;

fn lcm(a: usize, b: usize) -> usize {
    let tmp = a * b;
    let g = gcd_euclidean(a, b);
    tmp / g
}

pub fn lcmx(values: &[usize]) -> Option<usize>
{
    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 run() {
        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);
    }
}