Trait malachite_base::num::arithmetic::traits::ModMul
source · [−]pub trait ModMul<RHS = Self, M = Self> {
type Output;
fn mod_mul(self, other: RHS, m: M) -> Self::Output;
}
Expand description
Multiplies two numbers modulo a third number $m$. Assumes the inputs are already reduced mod $m$.
Required Associated Types
Required Methods
Implementations on Foreign Types
sourceimpl ModMul<u8, u8> for u8
impl ModMul<u8, u8> for u8
sourcefn mod_mul(self, other: u8, m: u8) -> u8
fn mod_mul(self, other: u8, m: u8) -> u8
Multiplies two numbers modulo a third number $m$. Assumes the inputs are already reduced modulo $m$.
$f(x, y, m) = z$, where $x, y, z < m$ and $xy \equiv z \mod m$.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
This is equivalent to nmod_mul
from nmod_vec.h
, FLINT 2.7.1.
type Output = u8
sourceimpl ModMul<u16, u16> for u16
impl ModMul<u16, u16> for u16
sourcefn mod_mul(self, other: u16, m: u16) -> u16
fn mod_mul(self, other: u16, m: u16) -> u16
Multiplies two numbers modulo a third number $m$. Assumes the inputs are already reduced modulo $m$.
$f(x, y, m) = z$, where $x, y, z < m$ and $xy \equiv z \mod m$.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
This is equivalent to nmod_mul
from nmod_vec.h
, FLINT 2.7.1.
type Output = u16
sourceimpl ModMul<u32, u32> for u32
impl ModMul<u32, u32> for u32
sourcefn mod_mul(self, other: u32, m: u32) -> u32
fn mod_mul(self, other: u32, m: u32) -> u32
Multiplies two numbers modulo a third number $m$. Assumes the inputs are already reduced modulo $m$.
$f(x, y, m) = z$, where $x, y, z < m$ and $xy \equiv z \mod m$.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
This is equivalent to nmod_mul
from nmod_vec.h
, FLINT 2.7.1.
type Output = u32
sourceimpl ModMul<u64, u64> for u64
impl ModMul<u64, u64> for u64
sourcefn mod_mul(self, other: u64, m: u64) -> u64
fn mod_mul(self, other: u64, m: u64) -> u64
Multiplies two numbers modulo a third number $m$. Assumes the inputs are already reduced modulo $m$.
$f(x, y, m) = z$, where $x, y, z < m$ and $xy \equiv z \mod m$.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
This is equivalent to nmod_mul
from nmod_vec.h
, FLINT 2.7.1.
type Output = u64
sourceimpl ModMul<u128, u128> for u128
impl ModMul<u128, u128> for u128
sourcefn mod_mul(self, other: u128, m: u128) -> u128
fn mod_mul(self, other: u128, m: u128) -> u128
Multiplies two numbers modulo a third number $m$. Assumes the inputs are already reduced modulo $m$.
$f(x, y, m) = z$, where $x, y, z < m$ and $xy \equiv z \mod m$.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
This is equivalent to nmod_mul
from nmod_vec.h
, FLINT 2.7.1.
type Output = u128
sourceimpl ModMul<usize, usize> for usize
impl ModMul<usize, usize> for usize
sourcefn mod_mul(self, other: usize, m: usize) -> usize
fn mod_mul(self, other: usize, m: usize) -> usize
Multiplies two numbers modulo a third number $m$. Assumes the inputs are already reduced modulo $m$.
$f(x, y, m) = z$, where $x, y, z < m$ and $xy \equiv z \mod m$.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
This is equivalent to nmod_mul
from nmod_vec.h
, FLINT 2.7.1.