Trait Parity

pub trait Parity {
    // Required methods
    fn even(self) -> bool;
    fn odd(self) -> bool;
}

Determines whether a number is even or odd.

Required Methods

fn even(self) -> bool

Determines whether a number is even.

fn odd(self) -> bool

Determines whether a number is odd.

Implementations on Foreign Types

impl Parity for i8

fn even(self) -> bool

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.

fn odd(self) -> bool

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.

impl Parity for i16

fn even(self) -> bool

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.

fn odd(self) -> bool

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.

impl Parity for i32

fn even(self) -> bool

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.

fn odd(self) -> bool

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.

impl Parity for i64

fn even(self) -> bool

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.

fn odd(self) -> bool

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.

impl Parity for i128

fn even(self) -> bool

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.

fn odd(self) -> bool

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.

impl Parity for isize

fn even(self) -> bool

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.

fn odd(self) -> bool

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.

impl Parity for u8

fn even(self) -> bool

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.

fn odd(self) -> bool

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.

impl Parity for u16

fn even(self) -> bool

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.

fn odd(self) -> bool

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.

impl Parity for u32

fn even(self) -> bool

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.

fn odd(self) -> bool

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.

impl Parity for u64

fn even(self) -> bool

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.

fn odd(self) -> bool

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.

impl Parity for u128

fn even(self) -> bool

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.

fn odd(self) -> bool

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.

impl Parity for usize

fn even(self) -> bool

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.

fn odd(self) -> bool

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.

Implementors