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
use num::arithmetic::traits::UnsignedAbs;
use num::comparison::traits::{OrdAbs, PartialOrdAbs};
use std::cmp::Ordering;
macro_rules! impl_partial_ord_abs {
($t:ident) => {
impl PartialOrdAbs<$t> for $t {
/// Compares the absolute values of two numbers, taking both by reference.
///
/// The [`PartialOrdAbs`](super::traits::PartialOrdAbs) interface allows for pairs of
/// incomparable elements, but for primitive integers these never occur.
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Examples
/// See [here](super::cmp_abs#partial_cmp_abs).
#[inline]
fn partial_cmp_abs(&self, other: &$t) -> Option<Ordering> {
Some(self.cmp_abs(other))
}
}
};
}
apply_to_primitive_ints!(impl_partial_ord_abs);
macro_rules! impl_ord_abs_unsigned {
($t:ident) => {
impl OrdAbs for $t {
/// Compares the absolute values of two numbers, taking both by reference.
///
/// For unsigned values, this is the same as ordinary comparison.
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Examples
/// See [here](super::cmp_abs#cmp_abs).
#[inline]
fn cmp_abs(&self, other: &Self) -> Ordering {
self.cmp(other)
}
}
};
}
apply_to_unsigneds!(impl_ord_abs_unsigned);
fn cmp_abs_signed<U: Ord, S: Copy + UnsignedAbs<Output = U>>(x: &S, y: &S) -> Ordering {
x.unsigned_abs().cmp(&y.unsigned_abs())
}
macro_rules! impl_ord_abs_signed {
($t:ident) => {
impl OrdAbs for $t {
/// Compares the absolute values of two numbers, taking both by reference.
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Examples
/// See [here](super::cmp_abs#cmp_abs).
#[inline]
fn cmp_abs(&self, other: &Self) -> Ordering {
cmp_abs_signed(self, other)
}
}
};
}
apply_to_signeds!(impl_ord_abs_signed);