Trait malachite_base::num::arithmetic::traits::ModPowerOf2Add
source · [−]pub trait ModPowerOf2Add<RHS = Self> {
type Output;
fn mod_power_of_2_add(self, other: RHS, pow: u64) -> Self::Output;
}
Expand description
Adds two numbers modulo $2^k$. Assumes the inputs are already reduced modulo $2^k$.
Required Associated Types
Required Methods
fn mod_power_of_2_add(self, other: RHS, pow: u64) -> Self::Output
Implementations on Foreign Types
sourceimpl ModPowerOf2Add<u8> for u8
impl ModPowerOf2Add<u8> for u8
sourcefn mod_power_of_2_add(self, other: u8, pow: u64) -> u8
fn mod_power_of_2_add(self, other: u8, pow: u64) -> u8
Adds two numbers modulo a third number $2^k$. Assumes the inputs are already reduced modulo $2^k$.
$f(x, y, k) = z$, where $x, y, z < 2^k$ and $x + y \equiv z \mod 2^k$.
Worst-case complexity
Constant time and additional memory.
Panics
Panics if pow
is greater than Self::WIDTH
.
Examples
See here.
type Output = u8
sourceimpl ModPowerOf2Add<u16> for u16
impl ModPowerOf2Add<u16> for u16
sourcefn mod_power_of_2_add(self, other: u16, pow: u64) -> u16
fn mod_power_of_2_add(self, other: u16, pow: u64) -> u16
Adds two numbers modulo a third number $2^k$. Assumes the inputs are already reduced modulo $2^k$.
$f(x, y, k) = z$, where $x, y, z < 2^k$ and $x + y \equiv z \mod 2^k$.
Worst-case complexity
Constant time and additional memory.
Panics
Panics if pow
is greater than Self::WIDTH
.
Examples
See here.
type Output = u16
sourceimpl ModPowerOf2Add<u32> for u32
impl ModPowerOf2Add<u32> for u32
sourcefn mod_power_of_2_add(self, other: u32, pow: u64) -> u32
fn mod_power_of_2_add(self, other: u32, pow: u64) -> u32
Adds two numbers modulo a third number $2^k$. Assumes the inputs are already reduced modulo $2^k$.
$f(x, y, k) = z$, where $x, y, z < 2^k$ and $x + y \equiv z \mod 2^k$.
Worst-case complexity
Constant time and additional memory.
Panics
Panics if pow
is greater than Self::WIDTH
.
Examples
See here.
type Output = u32
sourceimpl ModPowerOf2Add<u64> for u64
impl ModPowerOf2Add<u64> for u64
sourcefn mod_power_of_2_add(self, other: u64, pow: u64) -> u64
fn mod_power_of_2_add(self, other: u64, pow: u64) -> u64
Adds two numbers modulo a third number $2^k$. Assumes the inputs are already reduced modulo $2^k$.
$f(x, y, k) = z$, where $x, y, z < 2^k$ and $x + y \equiv z \mod 2^k$.
Worst-case complexity
Constant time and additional memory.
Panics
Panics if pow
is greater than Self::WIDTH
.
Examples
See here.
type Output = u64
sourceimpl ModPowerOf2Add<u128> for u128
impl ModPowerOf2Add<u128> for u128
sourcefn mod_power_of_2_add(self, other: u128, pow: u64) -> u128
fn mod_power_of_2_add(self, other: u128, pow: u64) -> u128
Adds two numbers modulo a third number $2^k$. Assumes the inputs are already reduced modulo $2^k$.
$f(x, y, k) = z$, where $x, y, z < 2^k$ and $x + y \equiv z \mod 2^k$.
Worst-case complexity
Constant time and additional memory.
Panics
Panics if pow
is greater than Self::WIDTH
.
Examples
See here.
type Output = u128
sourceimpl ModPowerOf2Add<usize> for usize
impl ModPowerOf2Add<usize> for usize
sourcefn mod_power_of_2_add(self, other: usize, pow: u64) -> usize
fn mod_power_of_2_add(self, other: usize, pow: u64) -> usize
Adds two numbers modulo a third number $2^k$. Assumes the inputs are already reduced modulo $2^k$.
$f(x, y, k) = z$, where $x, y, z < 2^k$ and $x + y \equiv z \mod 2^k$.
Worst-case complexity
Constant time and additional memory.
Panics
Panics if pow
is greater than Self::WIDTH
.
Examples
See here.