Trait malachite_base::num::arithmetic::traits::ModPow

pub trait ModPow<RHS = Self, M = Self> {
    type Output;

    // Required method
    fn mod_pow(self, exp: RHS, m: M) -> Self::Output;
}

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

Required Associated Types

type Output

Required Methods

fn mod_pow(self, exp: RHS, m: M) -> Self::Output

Implementations on Foreign Types

impl ModPow for u64

fn mod_pow(self, exp: u64, m: u64) -> u64

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

$f(x, n, m) = 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.

type Output = u64

impl ModPow<u64> for u8

fn mod_pow(self, exp: u64, m: u8) -> u8

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

$f(x, n, m) = 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.

type Output = u8

impl ModPow<u64> for u16

fn mod_pow(self, exp: u64, m: u16) -> u16

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

$f(x, n, m) = 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.

type Output = u16

impl ModPow<u64> for u32

fn mod_pow(self, exp: u64, m: u32) -> u32

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

$f(x, n, m) = 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.

type Output = u32

impl ModPow<u64> for u128

fn mod_pow(self, exp: u64, m: u128) -> u128

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

$f(x, n, m) = 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.

type Output = u128

impl ModPow<u64> for usize

fn mod_pow(self, exp: u64, m: usize) -> usize

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

$f(x, n, m) = 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.

type Output = usize

Implementors