Trait ModPowerOf2AddMulShl 

pub trait ModPowerOf2AddMulShl<Y = Self, Z = Self> {
    type Output;

    // Required method
    fn mod_power_of_2_add_mul_shl(
        self,
        y: Y,
        z: Z,
        bits: u64,
        pow: u64,
    ) -> Self::Output;
}

Adds a number and the product of two other numbers, shifted left by a number of bits, modulo $2^k$: $x + yz2^b \bmod 2^k$. All three inputs must be already reduced modulo $2^k$.

Required Associated Types

type Output

Required Methods

fn mod_power_of_2_add_mul_shl( self, y: Y, z: Z, bits: u64, pow: u64, ) -> Self::Output

Dyn Compatibility

This trait is dyn compatible.

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

Implementations on Foreign Types

impl ModPowerOf2AddMulShl for u8

fn mod_power_of_2_add_mul_shl(self, y: u8, z: u8, bits: u64, pow: u64) -> u8

Adds a number and the product of two other numbers, shifted left by bits, modulo $2^k$. All three inputs must be already reduced modulo $2^k$.

$f(x, y, z, b, k) = w$, where $x, y, z, w < 2^k$ and $x + yz2^b \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.

type Output = u8

impl ModPowerOf2AddMulShl for u16

fn mod_power_of_2_add_mul_shl(self, y: u16, z: u16, bits: u64, pow: u64) -> u16

Adds a number and the product of two other numbers, shifted left by bits, modulo $2^k$. All three inputs must be already reduced modulo $2^k$.

$f(x, y, z, b, k) = w$, where $x, y, z, w < 2^k$ and $x + yz2^b \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.

type Output = u16

impl ModPowerOf2AddMulShl for u32

fn mod_power_of_2_add_mul_shl(self, y: u32, z: u32, bits: u64, pow: u64) -> u32

Adds a number and the product of two other numbers, shifted left by bits, modulo $2^k$. All three inputs must be already reduced modulo $2^k$.

$f(x, y, z, b, k) = w$, where $x, y, z, w < 2^k$ and $x + yz2^b \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.

type Output = u32

impl ModPowerOf2AddMulShl for u64

fn mod_power_of_2_add_mul_shl(self, y: u64, z: u64, bits: u64, pow: u64) -> u64

Adds a number and the product of two other numbers, shifted left by bits, modulo $2^k$. All three inputs must be already reduced modulo $2^k$.

$f(x, y, z, b, k) = w$, where $x, y, z, w < 2^k$ and $x + yz2^b \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.

type Output = u64

impl ModPowerOf2AddMulShl for u128

fn mod_power_of_2_add_mul_shl( self, y: u128, z: u128, bits: u64, pow: u64, ) -> u128

Adds a number and the product of two other numbers, shifted left by bits, modulo $2^k$. All three inputs must be already reduced modulo $2^k$.

$f(x, y, z, b, k) = w$, where $x, y, z, w < 2^k$ and $x + yz2^b \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.

type Output = u128

impl ModPowerOf2AddMulShl for usize

fn mod_power_of_2_add_mul_shl( self, y: usize, z: usize, bits: u64, pow: u64, ) -> usize

Adds a number and the product of two other numbers, shifted left by bits, modulo $2^k$. All three inputs must be already reduced modulo $2^k$.

$f(x, y, z, b, k) = w$, where $x, y, z, w < 2^k$ and $x + yz2^b \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.

type Output = usize

Implementors

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

type Output = UnsignedVector<T>

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

type Output = UnsignedVector<T>

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

type Output = UnsignedVector<T>