Trait malachite_base::num::arithmetic::traits::ModIsReduced

pub trait ModIsReduced<M = Self> {
    // Required method
    fn mod_is_reduced(&self, m: &M) -> bool;
}

Checks whether a number is reduced modulo another number $m$.

Required Methods

fn mod_is_reduced(&self, m: &M) -> bool

Implementations on Foreign Types

impl ModIsReduced for u8

fn mod_is_reduced(&self, m: &u8) -> bool

Returns whether a number is reduced modulo another number $m$; in other words, whether it is less than $m$. $m$ cannot be zero.

$f(x, m) = (x < m)$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if $m$ is 0.

Examples

See here.

impl ModIsReduced for u16

fn mod_is_reduced(&self, m: &u16) -> bool

Returns whether a number is reduced modulo another number $m$; in other words, whether it is less than $m$. $m$ cannot be zero.

$f(x, m) = (x < m)$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if $m$ is 0.

Examples

See here.

impl ModIsReduced for u32

fn mod_is_reduced(&self, m: &u32) -> bool

Returns whether a number is reduced modulo another number $m$; in other words, whether it is less than $m$. $m$ cannot be zero.

$f(x, m) = (x < m)$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if $m$ is 0.

Examples

See here.

impl ModIsReduced for u64

fn mod_is_reduced(&self, m: &u64) -> bool

Returns whether a number is reduced modulo another number $m$; in other words, whether it is less than $m$. $m$ cannot be zero.

$f(x, m) = (x < m)$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if $m$ is 0.

Examples

See here.

impl ModIsReduced for u128

fn mod_is_reduced(&self, m: &u128) -> bool

Returns whether a number is reduced modulo another number $m$; in other words, whether it is less than $m$. $m$ cannot be zero.

$f(x, m) = (x < m)$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if $m$ is 0.

Examples

See here.

impl ModIsReduced for usize

fn mod_is_reduced(&self, m: &usize) -> bool

Returns whether a number is reduced modulo another number $m$; in other words, whether it is less than $m$. $m$ cannot be zero.

$f(x, m) = (x < m)$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if $m$ is 0.

Examples

See here.

Implementors