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