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
use crate::natural::InnerNatural::{Large, Small};
use crate::natural::Natural;
use malachite_base::num::arithmetic::traits::Parity;
impl<'a> Parity for &'a Natural {
/// Tests whether a [`Natural`] is even.
///
/// $f(x) = (2|x)$.
///
/// $f(x) = (\exists k \in \N : x = 2k)$.
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Examples
/// ```
/// extern crate malachite_base;
///
/// use malachite_base::num::arithmetic::traits::{Parity, Pow};
/// use malachite_base::num::basic::traits::{One, Zero};
/// use malachite_nz::natural::Natural;
///
/// assert_eq!(Natural::ZERO.even(), true);
/// assert_eq!(Natural::from(123u32).even(), false);
/// assert_eq!(Natural::from(0x80u32).even(), true);
/// assert_eq!(Natural::from(10u32).pow(12).even(), true);
/// assert_eq!((Natural::from(10u32).pow(12) + Natural::ONE).even(), false);
/// ```
fn even(self) -> bool {
match self {
Natural(Small(small)) => small.even(),
Natural(Large(ref limbs)) => limbs[0].even(),
}
}
/// Tests whether a [`Natural`] is odd.
///
/// $f(x) = (2\nmid x)$.
///
/// $f(x) = (\exists k \in \N : x = 2k+1)$.
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Examples
/// ```
/// extern crate malachite_base;
///
/// use malachite_base::num::arithmetic::traits::{Parity, Pow};
/// use malachite_base::num::basic::traits::{One, Zero};
/// use malachite_nz::natural::Natural;
///
/// assert_eq!(Natural::ZERO.odd(), false);
/// assert_eq!(Natural::from(123u32).odd(), true);
/// assert_eq!(Natural::from(0x80u32).odd(), false);
/// assert_eq!(Natural::from(10u32).pow(12).odd(), false);
/// assert_eq!((Natural::from(10u32).pow(12) + Natural::ONE).odd(), true);
/// ```
fn odd(self) -> bool {
match *self {
Natural(Small(small)) => small.odd(),
Natural(Large(ref limbs)) => limbs[0].odd(),
}
}
}