rithm 14.8.0

Arbitrary precision arithmetic.
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

use traiter::numbers::{Sign, Signed, Zeroable};

use crate::big_int::BigInt;

use super::types::Fraction;

impl<Digit, const DIGIT_BITNESS: usize> Signed
    for &Fraction<BigInt<Digit, DIGIT_BITNESS>>
where
    for<'a> &'a BigInt<Digit, DIGIT_BITNESS>: Signed,
    Self: Zeroable,
{
    fn is_negative(self) -> bool {
        (&self.numerator).is_negative()
    }

    fn is_positive(self) -> bool {
        (&self.numerator).is_positive()
    }

    fn sign(self) -> Sign {
        (&self.numerator).sign()
    }
}

impl<Digit, const DIGIT_BITNESS: usize> Signed
    for Fraction<BigInt<Digit, DIGIT_BITNESS>>
where
    BigInt<Digit, DIGIT_BITNESS>: Signed,
    Self: Zeroable,
{
    fn is_negative(self) -> bool {
        self.numerator.is_negative()
    }

    fn is_positive(self) -> bool {
        self.numerator.is_positive()
    }

    fn sign(self) -> Sign {
        self.numerator.sign()
    }
}

macro_rules! signed_integer_fraction_signed_impl {
    ($($integer:ty)*) => ($(
        impl Signed for &Fraction<$integer> {
            fn is_negative(self) -> bool {
                self.numerator.is_negative()
            }

            fn is_positive(self) -> bool {
                self.numerator.is_positive()
            }

            fn sign(self) -> Sign {
                self.numerator.sign()
            }
        }

        impl Signed for Fraction<$integer> {
            fn is_negative(self) -> bool {
                self.numerator.is_negative()
            }

            fn is_positive(self) -> bool {
                self.numerator.is_positive()
            }

            fn sign(self) -> Sign {
                self.numerator.sign()
            }
        }
    )*)
}

signed_integer_fraction_signed_impl!(i8 i16 i32 i64 i128 isize);