Trait malachite_base::num::arithmetic::traits::ModPowerOf2MulAssign

source · [−]
pub trait ModPowerOf2MulAssign<RHS = Self> {
    fn mod_power_of_2_mul_assign(&mut self, other: RHS, pow: u64);
}
Expand description

Multiplies two numbers modulo $2^k$, in place. Assumes the inputs are already reduced modulo $2^k$.

Required Methods

Implementations on Foreign Types

Multiplies two numbers modulo a third number $2^k$, in place. Assumes the inputs are already reduced modulo $2^k$.

$x \gets z$, where $x, y, z < 2^k$ and $xy \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.

Multiplies two numbers modulo a third number $2^k$, in place. Assumes the inputs are already reduced modulo $2^k$.

$x \gets z$, where $x, y, z < 2^k$ and $xy \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.

Multiplies two numbers modulo a third number $2^k$, in place. Assumes the inputs are already reduced modulo $2^k$.

$x \gets z$, where $x, y, z < 2^k$ and $xy \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.

Multiplies two numbers modulo a third number $2^k$, in place. Assumes the inputs are already reduced modulo $2^k$.

$x \gets z$, where $x, y, z < 2^k$ and $xy \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.

Multiplies two numbers modulo a third number $2^k$, in place. Assumes the inputs are already reduced modulo $2^k$.

$x \gets z$, where $x, y, z < 2^k$ and $xy \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.

Multiplies two numbers modulo a third number $2^k$, in place. Assumes the inputs are already reduced modulo $2^k$.

$x \gets z$, where $x, y, z < 2^k$ and $xy \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.

Implementors