hmath 0.1.17

Big Integers and Rational Numbers
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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173

use crate::Ratio;
use std::cmp::Ordering;

impl Ratio {

    /// self < other
    pub fn lt_rat(&self, other: &Ratio) -> bool {
        // self - other < 0
        self.sub_rat(other).is_neg()
    }

    /// self > other
    pub fn gt_rat(&self, other: &Ratio) -> bool {
        // other - self < 0
        other.sub_rat(self).is_neg()
    }

    /// self == other
    pub fn eq_rat(&self, other: &Ratio) -> bool {
        self == other
    }

    /// self != other
    pub fn neq_rat(&self, other: &Ratio) -> bool {
        self != other
    }

    /// self <= other
    pub fn leq_rat(&self, other: &Ratio) -> bool {
        !self.gt_rat(other)
    }

    /// self >= other
    pub fn geq_rat(&self, other: &Ratio) -> bool {
        !self.lt_rat(other)
    }

    pub fn comp_rat(&self, other: &Ratio) -> Ordering {
        self.numer.mul_bi(&other.denom).comp_bi(&other.numer.mul_bi(&self.denom))
    }

    /// self < 1
    pub fn lt_one(&self) -> bool {
        self.is_neg() || self.numer.lt_bi(&self.denom)
    }

    /// self > 1
    pub fn gt_one(&self) -> bool {
        !self.is_neg() && self.numer.gt_bi(&self.denom)
    }

    /// self < other
    pub fn lt_i32(&self, other: i32) -> bool {
        self.numer.lt_bi(&self.denom.mul_i32(other))
    }

    /// self > other
    pub fn gt_i32(&self, other: i32) -> bool {
        self.numer.gt_bi(&self.denom.mul_i32(other))
    }

    /// self == other
    pub fn eq_i32(&self, other: i32) -> bool {
        self.denom.is_one() && self.numer.eq_i32(other)
    }

    /// self != other
    pub fn neq_i32(&self, other: i32) -> bool {
        !self.eq_i32(other)
    }

    /// self <= other
    pub fn leq_i32(&self, other: i32) -> bool {
        !self.gt_i32(other)
    }

    /// self >= other
    pub fn geq_i32(&self, other: i32) -> bool {
        !self.lt_i32(other)
    }

    pub fn comp_i32(&self, other: i32) -> Ordering {
        self.numer.comp_bi(&self.denom.mul_i32(other))
    }

}

impl PartialOrd for Ratio {

    fn partial_cmp(&self, other: &Ratio) -> Option<Ordering> {
        Some(self.comp_rat(other))
    }

}

impl Ord for Ratio {

    fn cmp(&self, other: &Ratio) -> Ordering {
        self.comp_rat(other)
    }

}

#[cfg(test)]
mod tests {
    use crate::Ratio;
    use std::cmp::Ordering;

    #[test]
    fn rat_comp_test() {

        for d1 in 1..6 {

            for d2 in 1..6 {

                for n1 in -7..7 {

                    for n2 in -7..7 {
                        comp_test_worker(d1, d2, n1, n2);
                    }

                }

            }

        }

    }

    fn comp_test_worker(d1: i32, d2: i32, n1: i32, n2: i32) {
        let a = Ratio::from_denom_and_numer_i32(d1, n1);
        let b = Ratio::from_denom_and_numer_i32(d2, n2);

        match a.comp_rat(&b) {
            Ordering::Greater => {
                assert!(a.gt_rat(&b));
                assert!(!a.eq_rat(&b));
                assert!(!a.lt_rat(&b));
            }
            Ordering::Equal => {
                assert!(!a.gt_rat(&b));
                assert!(a.eq_rat(&b));
                assert!(!a.lt_rat(&b));
            }
            Ordering::Less => {
                assert!(!a.gt_rat(&b));
                assert!(!a.eq_rat(&b));
                assert!(a.lt_rat(&b));
            }
        }

        match a.comp_i32(d2 * n2) {
            Ordering::Greater => {
                assert!(a.gt_i32(d2 * n2));
                assert!(!a.eq_i32(d2 * n2));
                assert!(!a.lt_i32(d2 * n2));
            }
            Ordering::Equal => {
                assert!(!a.gt_i32(d2 * n2));
                assert!(a.eq_i32(d2 * n2));
                assert!(!a.lt_i32(d2 * n2));
            }
            Ordering::Less => {
                assert!(!a.gt_i32(d2 * n2));
                assert!(!a.eq_i32(d2 * n2));
                assert!(a.lt_i32(d2 * n2));
            }
        }

        assert!(a.lt_one() && a.lt_i32(1) || a.gt_one() && a.gt_i32(1) || a.eq_i32(1));
    }

}