Trait malachite_base::num::arithmetic::traits::WrappingSubAssign
source · pub trait WrappingSubAssign<RHS = Self> {
fn wrapping_sub_assign(&mut self, other: RHS);
}Expand description
Subtracts a number by another number in place, wrapping around at the boundary of the type.
Required Methods§
fn wrapping_sub_assign(&mut self, other: RHS)
Implementations on Foreign Types§
source§impl WrappingSubAssign<u8> for u8
impl WrappingSubAssign<u8> for u8
source§fn wrapping_sub_assign(&mut self, other: u8)
fn wrapping_sub_assign(&mut self, other: u8)
Subtracts a number by another number in place, wrapping around at the boundary of the type.
$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
source§impl WrappingSubAssign<u16> for u16
impl WrappingSubAssign<u16> for u16
source§fn wrapping_sub_assign(&mut self, other: u16)
fn wrapping_sub_assign(&mut self, other: u16)
Subtracts a number by another number in place, wrapping around at the boundary of the type.
$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
source§impl WrappingSubAssign<u32> for u32
impl WrappingSubAssign<u32> for u32
source§fn wrapping_sub_assign(&mut self, other: u32)
fn wrapping_sub_assign(&mut self, other: u32)
Subtracts a number by another number in place, wrapping around at the boundary of the type.
$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
source§impl WrappingSubAssign<u64> for u64
impl WrappingSubAssign<u64> for u64
source§fn wrapping_sub_assign(&mut self, other: u64)
fn wrapping_sub_assign(&mut self, other: u64)
Subtracts a number by another number in place, wrapping around at the boundary of the type.
$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
source§impl WrappingSubAssign<u128> for u128
impl WrappingSubAssign<u128> for u128
source§fn wrapping_sub_assign(&mut self, other: u128)
fn wrapping_sub_assign(&mut self, other: u128)
Subtracts a number by another number in place, wrapping around at the boundary of the type.
$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
source§impl WrappingSubAssign<usize> for usize
impl WrappingSubAssign<usize> for usize
source§fn wrapping_sub_assign(&mut self, other: usize)
fn wrapping_sub_assign(&mut self, other: usize)
Subtracts a number by another number in place, wrapping around at the boundary of the type.
$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
source§impl WrappingSubAssign<i8> for i8
impl WrappingSubAssign<i8> for i8
source§fn wrapping_sub_assign(&mut self, other: i8)
fn wrapping_sub_assign(&mut self, other: i8)
Subtracts a number by another number in place, wrapping around at the boundary of the type.
$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
source§impl WrappingSubAssign<i16> for i16
impl WrappingSubAssign<i16> for i16
source§fn wrapping_sub_assign(&mut self, other: i16)
fn wrapping_sub_assign(&mut self, other: i16)
Subtracts a number by another number in place, wrapping around at the boundary of the type.
$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
source§impl WrappingSubAssign<i32> for i32
impl WrappingSubAssign<i32> for i32
source§fn wrapping_sub_assign(&mut self, other: i32)
fn wrapping_sub_assign(&mut self, other: i32)
Subtracts a number by another number in place, wrapping around at the boundary of the type.
$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
source§impl WrappingSubAssign<i64> for i64
impl WrappingSubAssign<i64> for i64
source§fn wrapping_sub_assign(&mut self, other: i64)
fn wrapping_sub_assign(&mut self, other: i64)
Subtracts a number by another number in place, wrapping around at the boundary of the type.
$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
source§impl WrappingSubAssign<i128> for i128
impl WrappingSubAssign<i128> for i128
source§fn wrapping_sub_assign(&mut self, other: i128)
fn wrapping_sub_assign(&mut self, other: i128)
Subtracts a number by another number in place, wrapping around at the boundary of the type.
$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.
Worst-case complexity
Constant time and additional memory.
Examples
See here.
source§impl WrappingSubAssign<isize> for isize
impl WrappingSubAssign<isize> for isize
source§fn wrapping_sub_assign(&mut self, other: isize)
fn wrapping_sub_assign(&mut self, other: isize)
Subtracts a number by another number in place, wrapping around at the boundary of the type.
$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.
Worst-case complexity
Constant time and additional memory.
Examples
See here.