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
// Copyright © 2026 Mikhail Hogrefe
//
// This file is part of Malachite.
//
// Malachite is free software: you can redistribute it and/or modify it under the terms of the GNU
// Lesser General Public License (LGPL) as published by the Free Software Foundation; either version
// 3 of the License, or (at your option) any later version. See <https://www.gnu.org/licenses/>.
use crate::Rational;
macro_rules! impl_unsigned {
($t: ident) => {
impl PartialEq<$t> for Rational {
/// Determines whether a [`Rational`] is equal to an unsigned primitive integer.
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(1)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is `self.significant_bits()`.
///
/// # Examples
/// See [here](super::partial_eq_primitive_int#partial_eq).
#[inline]
fn eq(&self, other: &$t) -> bool {
self.sign && self.denominator == 1u32 && self.numerator == *other
}
}
impl PartialEq<Rational> for $t {
/// Determines whether an unsigned primitive integer is equal to a [`Rational`].
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(1)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is `other.significant_bits()`.
///
/// # Examples
/// See [here](super::partial_eq_primitive_int#partial_eq).
#[inline]
fn eq(&self, other: &Rational) -> bool {
other == self
}
}
};
}
apply_to_unsigneds!(impl_unsigned);
macro_rules! impl_signed {
($t: ident) => {
impl PartialEq<$t> for Rational {
/// Determines whether a [`Rational`] is equal to a signed primitive integer.
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(1)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is `self.significant_bits()`.
///
/// # Examples
/// See [here](super::partial_eq_primitive_int#partial_eq).
fn eq(&self, other: &$t) -> bool {
self.sign == (*other >= 0)
&& self.denominator == 1
&& self.numerator == other.unsigned_abs()
}
}
impl PartialEq<Rational> for $t {
/// Determines whether a signed primitive integer is equal to a [`Rational`].
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(1)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is `other.significant_bits()`.
///
/// # Examples
/// See [here](super::partial_eq_primitive_int#partial_eq).
#[inline]
fn eq(&self, other: &Rational) -> bool {
other == self
}
}
};
}
apply_to_signeds!(impl_signed);