Trait malachite_base::num::arithmetic::traits::ModPowerOf2Shl

source · [−]
pub trait ModPowerOf2Shl<RHS> {
    type Output;

    fn mod_power_of_2_shl(self, other: RHS, pow: u64) -> Self::Output;
}
Expand description

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

Required Associated Types

Required Methods

Implementations on Foreign Types

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $2^nx \equiv y \mod 2^k$.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo $2^k$. Assumes the input is already reduced modulo $2^k$.

$f(x, n, k) = y$, where $x, y < 2^k$ and $\lfloor 2^nx \rfloor \equiv y \mod 2^k$.

Panics

Panics if pow is greater than Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Implementors