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

source · [−]
pub trait ModIsReduced<M = Self> {
    fn mod_is_reduced(&self, m: &M) -> bool;
}
Expand description

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

Required Methods

Implementations on Foreign Types

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.

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.

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.

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.

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.

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