Trait malachite_base::num::arithmetic::traits::ModPowAssign

pub trait ModPowAssign<RHS = Self, M = Self> {
    // Required method
    fn mod_pow_assign(&mut self, exp: RHS, m: M);
}

Raises a number to a power modulo another number $m$, in place. The base must be already reduced modulo $m$.

Required Methods

fn mod_pow_assign(&mut self, exp: RHS, m: M)

Implementations on Foreign Types

impl ModPowAssign for u64

fn mod_pow_assign(&mut self, exp: u64, m: u64)

Raises a number to a power modulo another number $m$, in place. The base must be already reduced modulo $m$.

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

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 self is greater than or equal to m.

Examples

See here.

impl ModPowAssign<u64> for u8

fn mod_pow_assign(&mut self, exp: u64, m: u8)

Raises a number to a power modulo another number $m$, in place. The base must be already reduced modulo $m$.

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

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 self is greater than or equal to m.

Examples

See here.

impl ModPowAssign<u64> for u16

fn mod_pow_assign(&mut self, exp: u64, m: u16)

Raises a number to a power modulo another number $m$, in place. The base must be already reduced modulo $m$.

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

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 self is greater than or equal to m.

Examples

See here.

impl ModPowAssign<u64> for u32

fn mod_pow_assign(&mut self, exp: u64, m: u32)

Raises a number to a power modulo another number $m$, in place. The base must be already reduced modulo $m$.

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

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 self is greater than or equal to m.

Examples

See here.

impl ModPowAssign<u64> for u128

fn mod_pow_assign(&mut self, exp: u64, m: u128)

Raises a number to a power modulo another number $m$, in place. The base must be already reduced modulo $m$.

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

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 self is greater than or equal to m.

Examples

See here.

impl ModPowAssign<u64> for usize

fn mod_pow_assign(&mut self, exp: u64, m: usize)

Raises a number to a power modulo another number $m$, in place. The base must be already reduced modulo $m$.

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

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 self is greater than or equal to m.

Examples

See here.

Implementors