Trait malachite_base::num::arithmetic::traits::WrappingPowAssign

pub trait WrappingPowAssign<RHS = Self> {
    // Required method
    fn wrapping_pow_assign(&mut self, exp: RHS);
}

Raises a number to a power in place, wrapping around at the boundary of the type.

Required Methods

fn wrapping_pow_assign(&mut self, exp: RHS)

Implementations on Foreign Types

impl WrappingPowAssign for u64

fn wrapping_pow_assign(&mut self, exp: u64)

Raises a number to a power, in place, wrapping around at the boundary of the type.

$x \gets y$, where $y \equiv x^n \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl WrappingPowAssign<u64> for i8

fn wrapping_pow_assign(&mut self, exp: u64)

Raises a number to a power, in place, wrapping around at the boundary of the type.

$x \gets y$, where $y \equiv x^n \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl WrappingPowAssign<u64> for i16

fn wrapping_pow_assign(&mut self, exp: u64)

Raises a number to a power, in place, wrapping around at the boundary of the type.

$x \gets y$, where $y \equiv x^n \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl WrappingPowAssign<u64> for i32

fn wrapping_pow_assign(&mut self, exp: u64)

Raises a number to a power, in place, wrapping around at the boundary of the type.

$x \gets y$, where $y \equiv x^n \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl WrappingPowAssign<u64> for i64

fn wrapping_pow_assign(&mut self, exp: u64)

Raises a number to a power, in place, wrapping around at the boundary of the type.

$x \gets y$, where $y \equiv x^n \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl WrappingPowAssign<u64> for i128

fn wrapping_pow_assign(&mut self, exp: u64)

Raises a number to a power, in place, wrapping around at the boundary of the type.

$x \gets y$, where $y \equiv x^n \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl WrappingPowAssign<u64> for isize

fn wrapping_pow_assign(&mut self, exp: u64)

Raises a number to a power, in place, wrapping around at the boundary of the type.

$x \gets y$, where $y \equiv x^n \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl WrappingPowAssign<u64> for u8

fn wrapping_pow_assign(&mut self, exp: u64)

Raises a number to a power, in place, wrapping around at the boundary of the type.

$x \gets y$, where $y \equiv x^n \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl WrappingPowAssign<u64> for u16

fn wrapping_pow_assign(&mut self, exp: u64)

Raises a number to a power, in place, wrapping around at the boundary of the type.

$x \gets y$, where $y \equiv x^n \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl WrappingPowAssign<u64> for u32

fn wrapping_pow_assign(&mut self, exp: u64)

Raises a number to a power, in place, wrapping around at the boundary of the type.

$x \gets y$, where $y \equiv x^n \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl WrappingPowAssign<u64> for u128

fn wrapping_pow_assign(&mut self, exp: u64)

Raises a number to a power, in place, wrapping around at the boundary of the type.

$x \gets y$, where $y \equiv x^n \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl WrappingPowAssign<u64> for usize

fn wrapping_pow_assign(&mut self, exp: u64)

Raises a number to a power, in place, wrapping around at the boundary of the type.

$x \gets y$, where $y \equiv x^n \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Implementors