Trait malachite_base::num::arithmetic::traits::WrappingAddMulAssign
source · [−]pub trait WrappingAddMulAssign<Y = Self, Z = Self> {
fn wrapping_add_mul_assign(&mut self, y: Y, z: Z);
}
Expand description
Adds a number and the product of two other numbers, in place, wrapping around at the boundary of the type.
Required Methods
fn wrapping_add_mul_assign(&mut self, y: Y, z: Z)
Implementations on Foreign Types
sourceimpl WrappingAddMulAssign<u8, u8> for u8
impl WrappingAddMulAssign<u8, u8> for u8
sourcefn wrapping_add_mul_assign(&mut self, y: u8, z: u8)
fn wrapping_add_mul_assign(&mut self, y: u8, z: u8)
Adds a number and the product of two other numbers in place, wrapping around at the boundary of the type.
$x \gets w$, where $w \equiv x + yz \mod 2^W$ and $W$ is Self::WIDTH
.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
sourceimpl WrappingAddMulAssign<u16, u16> for u16
impl WrappingAddMulAssign<u16, u16> for u16
sourcefn wrapping_add_mul_assign(&mut self, y: u16, z: u16)
fn wrapping_add_mul_assign(&mut self, y: u16, z: u16)
Adds a number and the product of two other numbers in place, wrapping around at the boundary of the type.
$x \gets w$, where $w \equiv x + yz \mod 2^W$ and $W$ is Self::WIDTH
.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
sourceimpl WrappingAddMulAssign<u32, u32> for u32
impl WrappingAddMulAssign<u32, u32> for u32
sourcefn wrapping_add_mul_assign(&mut self, y: u32, z: u32)
fn wrapping_add_mul_assign(&mut self, y: u32, z: u32)
Adds a number and the product of two other numbers in place, wrapping around at the boundary of the type.
$x \gets w$, where $w \equiv x + yz \mod 2^W$ and $W$ is Self::WIDTH
.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
sourceimpl WrappingAddMulAssign<u64, u64> for u64
impl WrappingAddMulAssign<u64, u64> for u64
sourcefn wrapping_add_mul_assign(&mut self, y: u64, z: u64)
fn wrapping_add_mul_assign(&mut self, y: u64, z: u64)
Adds a number and the product of two other numbers in place, wrapping around at the boundary of the type.
$x \gets w$, where $w \equiv x + yz \mod 2^W$ and $W$ is Self::WIDTH
.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
sourceimpl WrappingAddMulAssign<u128, u128> for u128
impl WrappingAddMulAssign<u128, u128> for u128
sourcefn wrapping_add_mul_assign(&mut self, y: u128, z: u128)
fn wrapping_add_mul_assign(&mut self, y: u128, z: u128)
Adds a number and the product of two other numbers in place, wrapping around at the boundary of the type.
$x \gets w$, where $w \equiv x + yz \mod 2^W$ and $W$ is Self::WIDTH
.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
sourceimpl WrappingAddMulAssign<usize, usize> for usize
impl WrappingAddMulAssign<usize, usize> for usize
sourcefn wrapping_add_mul_assign(&mut self, y: usize, z: usize)
fn wrapping_add_mul_assign(&mut self, y: usize, z: usize)
Adds a number and the product of two other numbers in place, wrapping around at the boundary of the type.
$x \gets w$, where $w \equiv x + yz \mod 2^W$ and $W$ is Self::WIDTH
.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
sourceimpl WrappingAddMulAssign<i8, i8> for i8
impl WrappingAddMulAssign<i8, i8> for i8
sourcefn wrapping_add_mul_assign(&mut self, y: i8, z: i8)
fn wrapping_add_mul_assign(&mut self, y: i8, z: i8)
Adds a number and the product of two other numbers in place, wrapping around at the boundary of the type.
$x \gets w$, where $w \equiv x + yz \mod 2^W$ and $W$ is Self::WIDTH
.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
sourceimpl WrappingAddMulAssign<i16, i16> for i16
impl WrappingAddMulAssign<i16, i16> for i16
sourcefn wrapping_add_mul_assign(&mut self, y: i16, z: i16)
fn wrapping_add_mul_assign(&mut self, y: i16, z: i16)
Adds a number and the product of two other numbers in place, wrapping around at the boundary of the type.
$x \gets w$, where $w \equiv x + yz \mod 2^W$ and $W$ is Self::WIDTH
.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
sourceimpl WrappingAddMulAssign<i32, i32> for i32
impl WrappingAddMulAssign<i32, i32> for i32
sourcefn wrapping_add_mul_assign(&mut self, y: i32, z: i32)
fn wrapping_add_mul_assign(&mut self, y: i32, z: i32)
Adds a number and the product of two other numbers in place, wrapping around at the boundary of the type.
$x \gets w$, where $w \equiv x + yz \mod 2^W$ and $W$ is Self::WIDTH
.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
sourceimpl WrappingAddMulAssign<i64, i64> for i64
impl WrappingAddMulAssign<i64, i64> for i64
sourcefn wrapping_add_mul_assign(&mut self, y: i64, z: i64)
fn wrapping_add_mul_assign(&mut self, y: i64, z: i64)
Adds a number and the product of two other numbers in place, wrapping around at the boundary of the type.
$x \gets w$, where $w \equiv x + yz \mod 2^W$ and $W$ is Self::WIDTH
.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
sourceimpl WrappingAddMulAssign<i128, i128> for i128
impl WrappingAddMulAssign<i128, i128> for i128
sourcefn wrapping_add_mul_assign(&mut self, y: i128, z: i128)
fn wrapping_add_mul_assign(&mut self, y: i128, z: i128)
Adds a number and the product of two other numbers in place, wrapping around at the boundary of the type.
$x \gets w$, where $w \equiv x + yz \mod 2^W$ and $W$ is Self::WIDTH
.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
sourceimpl WrappingAddMulAssign<isize, isize> for isize
impl WrappingAddMulAssign<isize, isize> for isize
sourcefn wrapping_add_mul_assign(&mut self, y: isize, z: isize)
fn wrapping_add_mul_assign(&mut self, y: isize, z: isize)
Adds a number and the product of two other numbers in place, wrapping around at the boundary of the type.
$x \gets w$, where $w \equiv x + yz \mod 2^W$ and $W$ is Self::WIDTH
.
Worst-case complexity
Constant time and additional memory.
Examples
See here.