Trait malachite_base::num::arithmetic::traits::PowAssign

pub trait PowAssign<RHS = Self> {
    fn pow_assign(&mut self, exp: RHS);
}

Raises a number to a power in place. Assumes the result is representable.

Required Methods

fn pow_assign(&mut self, exp: RHS)

Implementations on Foreign Types

impl PowAssign<u64> for u8

fn pow_assign(&mut self, exp: u64)

Raises a number to a power, in place.

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().

Examples

See here.

impl PowAssign<u64> for u16

fn pow_assign(&mut self, exp: u64)

Raises a number to a power, in place.

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().

Examples

See here.

impl PowAssign<u64> for u32

fn pow_assign(&mut self, exp: u64)

Raises a number to a power, in place.

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().

Examples

See here.

impl PowAssign<u64> for u64

fn pow_assign(&mut self, exp: u64)

Raises a number to a power, in place.

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().

Examples

See here.

impl PowAssign<u64> for u128

fn pow_assign(&mut self, exp: u64)

Raises a number to a power, in place.

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().

Examples

See here.

impl PowAssign<u64> for usize

fn pow_assign(&mut self, exp: u64)

Raises a number to a power, in place.

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().

Examples

See here.

impl PowAssign<u64> for i8

fn pow_assign(&mut self, exp: u64)

Raises a number to a power, in place.

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().

Examples

See here.

impl PowAssign<u64> for i16

fn pow_assign(&mut self, exp: u64)

Raises a number to a power, in place.

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().

Examples

See here.

impl PowAssign<u64> for i32

fn pow_assign(&mut self, exp: u64)

Raises a number to a power, in place.

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().

Examples

See here.

impl PowAssign<u64> for i64

fn pow_assign(&mut self, exp: u64)

Raises a number to a power, in place.

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().

Examples

See here.

impl PowAssign<u64> for i128

fn pow_assign(&mut self, exp: u64)

Raises a number to a power, in place.

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().

Examples

See here.

impl PowAssign<u64> for isize

fn pow_assign(&mut self, exp: u64)

Raises a number to a power, in place.

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().

Examples

See here.

impl PowAssign<i64> for f32

fn pow_assign(&mut self, exp: i64)

Raises a number to a power, in place.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl PowAssign<f32> for f32

fn pow_assign(&mut self, exp: f32)

Raises a number to a power, in place.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl PowAssign<i64> for f64

fn pow_assign(&mut self, exp: i64)

Raises a number to a power, in place.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl PowAssign<f64> for f64

fn pow_assign(&mut self, exp: f64)

Raises a number to a power, in place.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Implementors