Trait ModPowerOf2SubMulAssign 

pub trait ModPowerOf2SubMulAssign<Y = Self, Z = Self> {
    // Required method
    fn mod_power_of_2_sub_mul_assign(&mut self, y: Y, z: Z, pow: u64);
}

Subtracts the product of two numbers from a number modulo $2^k$, in place. All three inputs must be already reduced modulo $2^k$.

Required Methods

fn mod_power_of_2_sub_mul_assign(&mut self, y: Y, z: Z, pow: u64)

Dyn Compatibility

This trait is dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementations on Foreign Types

impl ModPowerOf2SubMulAssign for u8

fn mod_power_of_2_sub_mul_assign(&mut self, y: u8, z: u8, pow: u64)

Subtracts the product of two numbers from a third number, modulo a fourth number $2^k$, in place. All three inputs must be already reduced modulo $2^k$.

$x \gets w$, where $x, y, z, w < 2^k$ and $x - yz \equiv w \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH or if self, y, or z are greater than or equal to $2^k$.

Examples

See here.

impl ModPowerOf2SubMulAssign for u16

fn mod_power_of_2_sub_mul_assign(&mut self, y: u16, z: u16, pow: u64)

Subtracts the product of two numbers from a third number, modulo a fourth number $2^k$, in place. All three inputs must be already reduced modulo $2^k$.

$x \gets w$, where $x, y, z, w < 2^k$ and $x - yz \equiv w \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH or if self, y, or z are greater than or equal to $2^k$.

Examples

See here.

impl ModPowerOf2SubMulAssign for u32

fn mod_power_of_2_sub_mul_assign(&mut self, y: u32, z: u32, pow: u64)

Subtracts the product of two numbers from a third number, modulo a fourth number $2^k$, in place. All three inputs must be already reduced modulo $2^k$.

$x \gets w$, where $x, y, z, w < 2^k$ and $x - yz \equiv w \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH or if self, y, or z are greater than or equal to $2^k$.

Examples

See here.

impl ModPowerOf2SubMulAssign for u64

fn mod_power_of_2_sub_mul_assign(&mut self, y: u64, z: u64, pow: u64)

Subtracts the product of two numbers from a third number, modulo a fourth number $2^k$, in place. All three inputs must be already reduced modulo $2^k$.

$x \gets w$, where $x, y, z, w < 2^k$ and $x - yz \equiv w \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH or if self, y, or z are greater than or equal to $2^k$.

Examples

See here.

impl ModPowerOf2SubMulAssign for u128

fn mod_power_of_2_sub_mul_assign(&mut self, y: u128, z: u128, pow: u64)

Subtracts the product of two numbers from a third number, modulo a fourth number $2^k$, in place. All three inputs must be already reduced modulo $2^k$.

$x \gets w$, where $x, y, z, w < 2^k$ and $x - yz \equiv w \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH or if self, y, or z are greater than or equal to $2^k$.

Examples

See here.

impl ModPowerOf2SubMulAssign for usize

fn mod_power_of_2_sub_mul_assign(&mut self, y: usize, z: usize, pow: u64)

Subtracts the product of two numbers from a third number, modulo a fourth number $2^k$, in place. All three inputs must be already reduced modulo $2^k$.

$x \gets w$, where $x, y, z, w < 2^k$ and $x - yz \equiv w \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH or if self, y, or z are greater than or equal to $2^k$.

Examples

See here.

Implementors

impl<T: PrimitiveUnsigned> ModPowerOf2SubMulAssign<&UnsignedVector<T>, T> for UnsignedVector<T>

impl<T: PrimitiveUnsigned> ModPowerOf2SubMulAssign<UnsignedVector<T>, T> for UnsignedVector<T>