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
use crate::integer::Integer;
use crate::natural::Natural;
use core::cmp::Ordering;
use malachite_base::num::arithmetic::traits::UnsignedAbs;
use malachite_base::num::basic::traits::Zero;
fn partial_cmp_unsigned<T>(x: &Integer, other: &T) -> Option<Ordering>
where
Natural: PartialOrd<T>,
{
if x.sign {
x.abs.partial_cmp(other)
} else {
Some(Ordering::Less)
}
}
macro_rules! impl_unsigned {
($t: ident) => {
impl PartialOrd<$t> for Integer {
/// Compares an [`Integer`] to an unsigned primitive integer.
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Examples
/// See [here](super::partial_cmp_primitive_int#partial_cmp).
#[inline]
fn partial_cmp(&self, other: &$t) -> Option<Ordering> {
partial_cmp_unsigned(self, other)
}
}
impl PartialOrd<Integer> for $t {
/// Compares an unsigned primitive integer to an [`Integer`].
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Examples
/// See [here](super::partial_cmp_primitive_int#partial_cmp).
#[inline]
fn partial_cmp(&self, other: &Integer) -> Option<Ordering> {
other.partial_cmp(self).map(Ordering::reverse)
}
}
};
}
apply_to_unsigneds!(impl_unsigned);
fn partial_cmp_signed<U: PartialOrd<Natural>, S: Copy + Ord + UnsignedAbs<Output = U> + Zero>(
x: &Integer,
other: &S,
) -> Option<Ordering>
where
Natural: PartialOrd<U>,
{
if x.sign {
if *other >= S::ZERO {
x.abs.partial_cmp(&other.unsigned_abs())
} else {
Some(Ordering::Greater)
}
} else if *other >= S::ZERO {
Some(Ordering::Less)
} else {
other.unsigned_abs().partial_cmp(&x.abs)
}
}
macro_rules! impl_signed {
($t: ident) => {
impl PartialOrd<$t> for Integer {
/// Compares an [`Integer`] to a signed primitive integer.
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Examples
/// See [here](super::partial_cmp_primitive_int#partial_cmp).
#[inline]
fn partial_cmp(&self, other: &$t) -> Option<Ordering> {
partial_cmp_signed(self, other)
}
}
impl PartialOrd<Integer> for $t {
/// Compares a signed primitive integer to an [`Integer`].
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Examples
/// See [here](super::partial_cmp_primitive_int#partial_cmp).
#[inline]
fn partial_cmp(&self, other: &Integer) -> Option<Ordering> {
other.partial_cmp(self).map(Ordering::reverse)
}
}
};
}
apply_to_signeds!(impl_signed);