Trait OverflowingPowAssign

pub trait OverflowingPowAssign<RHS = Self> {
    // Required method
    fn overflowing_pow_assign(&mut self, exp: RHS) -> bool;
}

Raises a number to a power in place.

Returns a boolean indicating whether an arithmetic overflow occurred. If an overflow occurred, then the wrapped number is assigned.

Required Methods

fn overflowing_pow_assign(&mut self, exp: RHS) -> bool

Implementations on Foreign Types

impl OverflowingPowAssign for u64

fn overflowing_pow_assign(&mut self, exp: u64) -> bool

Raises a number to a power, in place.

Returns a boolean indicating whether an arithmetic overflow occurred. If an overflow occurred, then the wrapped value is assigned.

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 OverflowingPowAssign<u64> for i8

fn overflowing_pow_assign(&mut self, exp: u64) -> bool

Raises a number to a power, in place.

Returns a boolean indicating whether an arithmetic overflow occurred. If an overflow occurred, then the wrapped value is assigned.

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 OverflowingPowAssign<u64> for i16

fn overflowing_pow_assign(&mut self, exp: u64) -> bool

Raises a number to a power, in place.

Returns a boolean indicating whether an arithmetic overflow occurred. If an overflow occurred, then the wrapped value is assigned.

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 OverflowingPowAssign<u64> for i32

fn overflowing_pow_assign(&mut self, exp: u64) -> bool

Raises a number to a power, in place.

Returns a boolean indicating whether an arithmetic overflow occurred. If an overflow occurred, then the wrapped value is assigned.

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 OverflowingPowAssign<u64> for i64

fn overflowing_pow_assign(&mut self, exp: u64) -> bool

Raises a number to a power, in place.

Returns a boolean indicating whether an arithmetic overflow occurred. If an overflow occurred, then the wrapped value is assigned.

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 OverflowingPowAssign<u64> for i128

fn overflowing_pow_assign(&mut self, exp: u64) -> bool

Raises a number to a power, in place.

Returns a boolean indicating whether an arithmetic overflow occurred. If an overflow occurred, then the wrapped value is assigned.

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 OverflowingPowAssign<u64> for isize

fn overflowing_pow_assign(&mut self, exp: u64) -> bool

Raises a number to a power, in place.

Returns a boolean indicating whether an arithmetic overflow occurred. If an overflow occurred, then the wrapped value is assigned.

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 OverflowingPowAssign<u64> for u8

fn overflowing_pow_assign(&mut self, exp: u64) -> bool

Raises a number to a power, in place.

Returns a boolean indicating whether an arithmetic overflow occurred. If an overflow occurred, then the wrapped value is assigned.

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 OverflowingPowAssign<u64> for u16

fn overflowing_pow_assign(&mut self, exp: u64) -> bool

Raises a number to a power, in place.

Returns a boolean indicating whether an arithmetic overflow occurred. If an overflow occurred, then the wrapped value is assigned.

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 OverflowingPowAssign<u64> for u32

fn overflowing_pow_assign(&mut self, exp: u64) -> bool

Raises a number to a power, in place.

Returns a boolean indicating whether an arithmetic overflow occurred. If an overflow occurred, then the wrapped value is assigned.

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 OverflowingPowAssign<u64> for u128

fn overflowing_pow_assign(&mut self, exp: u64) -> bool

Raises a number to a power, in place.

Returns a boolean indicating whether an arithmetic overflow occurred. If an overflow occurred, then the wrapped value is assigned.

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 OverflowingPowAssign<u64> for usize

fn overflowing_pow_assign(&mut self, exp: u64) -> bool

Raises a number to a power, in place.

Returns a boolean indicating whether an arithmetic overflow occurred. If an overflow occurred, then the wrapped value is assigned.

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.

Implementors