Trait malachite_base::num::arithmetic::traits::ModPowAssign
source · [−]pub trait ModPowAssign<RHS = Self, M = Self> {
fn mod_pow_assign(&mut self, exp: RHS, m: M);
}
Expand description
Raises a number to a power modulo another number $m$, in place. Assumes the input is already reduced modulo $m$.
Required Methods
fn mod_pow_assign(&mut self, exp: RHS, m: M)
Implementations on Foreign Types
sourceimpl ModPowAssign<u64, u8> for u8
impl ModPowAssign<u64, u8> for u8
sourcefn mod_pow_assign(&mut self, exp: u64, m: u8)
fn mod_pow_assign(&mut self, exp: u64, m: u8)
Raises a number to a power modulo another number $m$, in place. Assumes the input is already reduced modulo $m$.
$x \gets y$, where $x, y < m$ and $x^n \equiv y \mod m$.
Worst-case complexity
$T(n) = O(n)$
$M(n) = O(1)$
where $T$ is time, $M$ is additional memory, and $n$ is exp.significant_bits()
.
Examples
See here.
sourceimpl ModPowAssign<u64, u16> for u16
impl ModPowAssign<u64, u16> for u16
sourcefn mod_pow_assign(&mut self, exp: u64, m: u16)
fn mod_pow_assign(&mut self, exp: u64, m: u16)
Raises a number to a power modulo another number $m$, in place. Assumes the input is already reduced modulo $m$.
$x \gets y$, where $x, y < m$ and $x^n \equiv y \mod m$.
Worst-case complexity
$T(n) = O(n)$
$M(n) = O(1)$
where $T$ is time, $M$ is additional memory, and $n$ is exp.significant_bits()
.
Examples
See here.
sourceimpl ModPowAssign<u64, u32> for u32
impl ModPowAssign<u64, u32> for u32
sourcefn mod_pow_assign(&mut self, exp: u64, m: u32)
fn mod_pow_assign(&mut self, exp: u64, m: u32)
Raises a number to a power modulo another number $m$, in place. Assumes the input is already reduced modulo $m$.
$x \gets y$, where $x, y < m$ and $x^n \equiv y \mod m$.
Worst-case complexity
$T(n) = O(n)$
$M(n) = O(1)$
where $T$ is time, $M$ is additional memory, and $n$ is exp.significant_bits()
.
Examples
See here.
sourceimpl ModPowAssign<u64, u64> for u64
impl ModPowAssign<u64, u64> for u64
sourcefn mod_pow_assign(&mut self, exp: u64, m: u64)
fn mod_pow_assign(&mut self, exp: u64, m: u64)
Raises a number to a power modulo another number $m$, in place. Assumes the input is already reduced modulo $m$.
$x \gets y$, where $x, y < m$ and $x^n \equiv y \mod m$.
Worst-case complexity
$T(n) = O(n)$
$M(n) = O(1)$
where $T$ is time, $M$ is additional memory, and $n$ is exp.significant_bits()
.
Examples
See here.
sourceimpl ModPowAssign<u64, u128> for u128
impl ModPowAssign<u64, u128> for u128
sourcefn mod_pow_assign(&mut self, exp: u64, m: u128)
fn mod_pow_assign(&mut self, exp: u64, m: u128)
Raises a number to a power modulo another number $m$, in place. Assumes the input is already reduced modulo $m$.
$x \gets y$, where $x, y < m$ and $x^n \equiv y \mod m$.
Worst-case complexity
$T(n) = O(n)$
$M(n) = O(1)$
where $T$ is time, $M$ is additional memory, and $n$ is exp.significant_bits()
.
Examples
See here.
sourceimpl ModPowAssign<u64, usize> for usize
impl ModPowAssign<u64, usize> for usize
sourcefn mod_pow_assign(&mut self, exp: u64, m: usize)
fn mod_pow_assign(&mut self, exp: u64, m: usize)
Raises a number to a power modulo another number $m$, in place. Assumes the input is already reduced modulo $m$.
$x \gets y$, where $x, y < m$ and $x^n \equiv y \mod m$.
Worst-case complexity
$T(n) = O(n)$
$M(n) = O(1)$
where $T$ is time, $M$ is additional memory, and $n$ is exp.significant_bits()
.
Examples
See here.