typerat 0.0.4

Type-level rational numbers based on `typenum`.
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

use crate::{Denominator, Numerator, Recip, Q};
use core::ops::{Div, Mul};

impl<Nl, Dl, Nr, Dr, No, Do> Div<Q<Nr, Dr>> for Q<Nl, Dl>
where
    Self: Mul<<Q<Nr, Dr> as Recip>::Output, Output = Q<No, Do>>,
    Q<Nr, Dr>: Recip,
    Nl: Numerator<Dl>,
    Dl: Denominator,
    Nr: Numerator<Dr>,
    Dr: Denominator,
    No: Numerator<Do>,
    Do: Denominator,
{
    type Output = Q<No, Do>;

    fn div(self, rhs: Q<Nr, Dr>) -> Self::Output {
        let _ = rhs;
        Self::Output::new()
    }
}

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

    #[test]
    fn test_div() {
        // zero / zero
        // let _ = Q::<Z0>::new() / Q::<Z0>::new();

        // zero / positive
        assert!(Q::<Z0>::new() / Q::<P3, P2>::new() == Q::<Z0>::new());

        // zero / negative
        assert!(Q::<Z0>::new() / Q::<N3, P2>::new() == Q::<Z0>::new());

        // positive / zero
        // let _ = Q::<P2, P3>::new() / Q::<Z0>::new();

        // positive / positive
        assert!(Q::<P2, P3>::new() / Q::<P3, P2>::new() == Q::<P4, P9>::new());

        // positive / negative
        assert!(Q::<P2, P3>::new() / Q::<N3, P2>::new() == Q::<N4, P9>::new());

        // negative / zero
        // let _ = Q::<N2, P3>::new() / Q::<Z0>::new();

        // negative / positive
        assert!(Q::<N2, P3>::new() / Q::<P3, P2>::new() == Q::<N4, P9>::new());

        // negative / negative
        assert!(Q::<N2, P3>::new() / Q::<N3, P2>::new() == Q::<P4, P9>::new());
    }
}