Trait malachite_base::num::arithmetic::traits::ModPowerOf2PowAssign

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

Raises a number to a power modulo $2^k$, in place. Assumes the input is already reduced modulo $2^k$.

Required Methods

Implementations on Foreign Types

Raises a number to a power modulo another number $2^k$, in place. Assumes the input is already reduced modulo $2^k$.

$x \gets y$, where $x, y < 2^k$ and $x^n \equiv y \mod 2^k$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is exp.significant_bits().

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Raises a number to a power modulo another number $2^k$, in place. Assumes the input is already reduced modulo $2^k$.

$x \gets y$, where $x, y < 2^k$ and $x^n \equiv y \mod 2^k$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is exp.significant_bits().

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Raises a number to a power modulo another number $2^k$, in place. Assumes the input is already reduced modulo $2^k$.

$x \gets y$, where $x, y < 2^k$ and $x^n \equiv y \mod 2^k$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is exp.significant_bits().

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Raises a number to a power modulo another number $2^k$, in place. Assumes the input is already reduced modulo $2^k$.

$x \gets y$, where $x, y < 2^k$ and $x^n \equiv y \mod 2^k$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is exp.significant_bits().

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Raises a number to a power modulo another number $2^k$, in place. Assumes the input is already reduced modulo $2^k$.

$x \gets y$, where $x, y < 2^k$ and $x^n \equiv y \mod 2^k$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is exp.significant_bits().

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Raises a number to a power modulo another number $2^k$, in place. Assumes the input is already reduced modulo $2^k$.

$x \gets y$, where $x, y < 2^k$ and $x^n \equiv y \mod 2^k$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is exp.significant_bits().

Panics

Panics if pow is greater than Self::WIDTH.

Examples

See here.

Implementors