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
use crate::integer::Integer;
use malachite_base::num::comparison::traits::PartialOrdAbs;
use std::cmp::Ordering;
macro_rules! impl_unsigned {
($t: ident) => {
impl PartialOrdAbs<$t> for Integer {
/// Compares the absolute values of an [`Integer`] and an unsigned primitive integer.
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Examples
/// See [here](super::partial_cmp_abs_primitive_int#partial_cmp_abs).
#[inline]
fn partial_cmp_abs(&self, other: &$t) -> Option<Ordering> {
self.abs.partial_cmp(other)
}
}
impl PartialOrdAbs<Integer> for $t {
/// Compares the absolute values of an unsigned primitive integer and an [`Integer`].
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// See [here](super::partial_cmp_abs_primitive_int#partial_cmp_abs).
#[inline]
fn partial_cmp_abs(&self, other: &Integer) -> Option<Ordering> {
other.partial_cmp_abs(self).map(Ordering::reverse)
}
}
};
}
apply_to_unsigneds!(impl_unsigned);
macro_rules! impl_signed {
($t: ident) => {
impl PartialOrdAbs<$t> for Integer {
/// Compares the absolute values of an [`Integer`] and a signed primitive integer.
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Examples
/// See [here](super::partial_cmp_abs_primitive_int#partial_cmp_abs).
fn partial_cmp_abs(&self, other: &$t) -> Option<Ordering> {
self.abs.partial_cmp(&other.unsigned_abs())
}
}
impl PartialOrdAbs<Integer> for $t {
/// Compares the absolute values of a signed primitive integer and an [`Integer`].
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// See [here](super::partial_cmp_abs_primitive_int#partial_cmp_abs).
#[inline]
fn partial_cmp_abs(&self, other: &Integer) -> Option<Ordering> {
other.partial_cmp_abs(self).map(Ordering::reverse)
}
}
};
}
apply_to_signeds!(impl_signed);