Trait malachite_base::num::arithmetic::traits::ModSub
source · pub trait ModSub<RHS = Self, M = Self> {
type Output;
// Required method
fn mod_sub(self, other: RHS, m: M) -> Self::Output;
}
Expand description
Adds two numbers modulo a third number $m$. The inputs must be already reduced modulo $m$.
Required Associated Types§
Required Methods§
Implementations on Foreign Types§
source§impl ModSub for u8
impl ModSub for u8
source§fn mod_sub(self, other: u8, m: u8) -> u8
fn mod_sub(self, other: u8, m: u8) -> u8
Subtracts two numbers modulo a third number $m$. The inputs must be already reduced modulo $m$.
$f(x, y, m) = z$, where $x, y, z < m$ and $x - y \equiv z \mod m$.
§Worst-case complexity
Constant time and additional memory.
§Panics
Panics if self
or other
are greater than or equal to m
.
§Examples
See here.
This is equivalent to nmod_sub
from nmod.h
, FLINT 2.7.1.
type Output = u8
source§impl ModSub for u16
impl ModSub for u16
source§fn mod_sub(self, other: u16, m: u16) -> u16
fn mod_sub(self, other: u16, m: u16) -> u16
Subtracts two numbers modulo a third number $m$. The inputs must be already reduced modulo $m$.
$f(x, y, m) = z$, where $x, y, z < m$ and $x - y \equiv z \mod m$.
§Worst-case complexity
Constant time and additional memory.
§Panics
Panics if self
or other
are greater than or equal to m
.
§Examples
See here.
This is equivalent to nmod_sub
from nmod.h
, FLINT 2.7.1.
type Output = u16
source§impl ModSub for u32
impl ModSub for u32
source§fn mod_sub(self, other: u32, m: u32) -> u32
fn mod_sub(self, other: u32, m: u32) -> u32
Subtracts two numbers modulo a third number $m$. The inputs must be already reduced modulo $m$.
$f(x, y, m) = z$, where $x, y, z < m$ and $x - y \equiv z \mod m$.
§Worst-case complexity
Constant time and additional memory.
§Panics
Panics if self
or other
are greater than or equal to m
.
§Examples
See here.
This is equivalent to nmod_sub
from nmod.h
, FLINT 2.7.1.
type Output = u32
source§impl ModSub for u64
impl ModSub for u64
source§fn mod_sub(self, other: u64, m: u64) -> u64
fn mod_sub(self, other: u64, m: u64) -> u64
Subtracts two numbers modulo a third number $m$. The inputs must be already reduced modulo $m$.
$f(x, y, m) = z$, where $x, y, z < m$ and $x - y \equiv z \mod m$.
§Worst-case complexity
Constant time and additional memory.
§Panics
Panics if self
or other
are greater than or equal to m
.
§Examples
See here.
This is equivalent to nmod_sub
from nmod.h
, FLINT 2.7.1.
type Output = u64
source§impl ModSub for u128
impl ModSub for u128
source§fn mod_sub(self, other: u128, m: u128) -> u128
fn mod_sub(self, other: u128, m: u128) -> u128
Subtracts two numbers modulo a third number $m$. The inputs must be already reduced modulo $m$.
$f(x, y, m) = z$, where $x, y, z < m$ and $x - y \equiv z \mod m$.
§Worst-case complexity
Constant time and additional memory.
§Panics
Panics if self
or other
are greater than or equal to m
.
§Examples
See here.
This is equivalent to nmod_sub
from nmod.h
, FLINT 2.7.1.
type Output = u128
source§impl ModSub for usize
impl ModSub for usize
source§fn mod_sub(self, other: usize, m: usize) -> usize
fn mod_sub(self, other: usize, m: usize) -> usize
Subtracts two numbers modulo a third number $m$. The inputs must be already reduced modulo $m$.
$f(x, y, m) = z$, where $x, y, z < m$ and $x - y \equiv z \mod m$.
§Worst-case complexity
Constant time and additional memory.
§Panics
Panics if self
or other
are greater than or equal to m
.
§Examples
See here.
This is equivalent to nmod_sub
from nmod.h
, FLINT 2.7.1.