algo 0.1.9

Algorithms & Data Structure implementations
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

use std::num::Zero;
use std::ops::{Mul, Div, Neg, Rem};

pub fn lcm<T>(u: T, v: T) -> T
    where T: Copy,
          T: Zero,
          T: PartialEq,
          T: PartialOrd,
          T: Mul<Output = T>,
          T: Div<Output = T>,
          T: Rem<Output = T>,
          T: Neg<Output = T>
{

    let gcd = super::gcd(u, v);
    let product = u * v;
    let zero = T::zero();

    if product < zero {
        -product / gcd
    } else {
        product / gcd
    }
}

#[test]
fn test_zero() {
    assert_eq!(0, lcm(0, 1));
}

#[test]
fn test_same() {
    assert_eq!(4, lcm(4, 4));
}

#[test]
fn test_simple() {
    assert_eq!(42, lcm(21, 6));
}

#[test]
fn test_negative() {
    assert_eq!(42, lcm(21, -6));
}

#[test]
fn test_prime() {
    assert_eq!(77, lcm(7, 11));
}