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

use crate::num::arithmetic::traits::Parity;

macro_rules! impl_parity {
    ($t:ident) => {
        impl Parity for $t {
            /// Tests whether a number is even.
            ///
            /// $f(x) = (2|x)$.
            ///
            /// $f(x) = (\exists k \in \N \ x = 2k)$.
            ///
            /// # Worst-case complexity
            /// Constant time and additional memory.
            ///
            /// # Examples
            /// See [here](super::parity#even).
            #[inline]
            fn even(self) -> bool {
                (self & 1) == 0
            }

            /// Tests whether a number 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
            /// See [here](super::parity#odd).
            #[inline]
            fn odd(self) -> bool {
                (self & 1) != 0
            }
        }
    };
}
apply_to_primitive_ints!(impl_parity);