Trait malachite_base::num::arithmetic::traits::PowAssign
source · [−]pub trait PowAssign<RHS = Self> {
fn pow_assign(&mut self, exp: RHS);
}
Expand description
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
sourceimpl PowAssign<u64> for u8
impl PowAssign<u64> for u8
sourcefn pow_assign(&mut self, exp: 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.
sourceimpl PowAssign<u64> for u16
impl PowAssign<u64> for u16
sourcefn pow_assign(&mut self, exp: 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.
sourceimpl PowAssign<u64> for u32
impl PowAssign<u64> for u32
sourcefn pow_assign(&mut self, exp: 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.
sourceimpl PowAssign<u64> for u64
impl PowAssign<u64> for u64
sourcefn pow_assign(&mut self, exp: 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.
sourceimpl PowAssign<u64> for u128
impl PowAssign<u64> for u128
sourcefn pow_assign(&mut self, exp: 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.
sourceimpl PowAssign<u64> for usize
impl PowAssign<u64> for usize
sourcefn pow_assign(&mut self, exp: 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.
sourceimpl PowAssign<u64> for i8
impl PowAssign<u64> for i8
sourcefn pow_assign(&mut self, exp: 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.
sourceimpl PowAssign<u64> for i16
impl PowAssign<u64> for i16
sourcefn pow_assign(&mut self, exp: 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.
sourceimpl PowAssign<u64> for i32
impl PowAssign<u64> for i32
sourcefn pow_assign(&mut self, exp: 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.
sourceimpl PowAssign<u64> for i64
impl PowAssign<u64> for i64
sourcefn pow_assign(&mut self, exp: 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.
sourceimpl PowAssign<u64> for i128
impl PowAssign<u64> for i128
sourcefn pow_assign(&mut self, exp: 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.
sourceimpl PowAssign<u64> for isize
impl PowAssign<u64> for isize
sourcefn pow_assign(&mut self, exp: 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.
sourceimpl PowAssign<i64> for f32
impl PowAssign<i64> for f32
sourcefn pow_assign(&mut self, exp: i64)
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.
sourceimpl PowAssign<f32> for f32
impl PowAssign<f32> for f32
sourcefn pow_assign(&mut self, exp: 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.
sourceimpl PowAssign<i64> for f64
impl PowAssign<i64> for f64
sourcefn pow_assign(&mut self, exp: i64)
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.
sourceimpl PowAssign<f64> for f64
impl PowAssign<f64> for f64
sourcefn pow_assign(&mut self, exp: 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.