Trait malachite_base::num::arithmetic::traits::WrappingSubMulAssign

pub trait WrappingSubMulAssign<Y = Self, Z = Self> {
    // Required method
    fn wrapping_sub_mul_assign(&mut self, y: Y, z: Z);
}

Subtracts a number by the product of two other numbers, in place, wrapping around at the boundary of the type.

Required Methods

fn wrapping_sub_mul_assign(&mut self, y: Y, z: Z)

Implementations on Foreign Types

impl WrappingSubMulAssign for i8

fn wrapping_sub_mul_assign(&mut self, y: i8, z: i8)

Subtracts a number by 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.

impl WrappingSubMulAssign for i16

fn wrapping_sub_mul_assign(&mut self, y: i16, z: i16)

Subtracts a number by 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.

impl WrappingSubMulAssign for i32

fn wrapping_sub_mul_assign(&mut self, y: i32, z: i32)

Subtracts a number by 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.

impl WrappingSubMulAssign for i64

fn wrapping_sub_mul_assign(&mut self, y: i64, z: i64)

Subtracts a number by 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.

impl WrappingSubMulAssign for i128

fn wrapping_sub_mul_assign(&mut self, y: i128, z: i128)

Subtracts a number by 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.

impl WrappingSubMulAssign for isize

fn wrapping_sub_mul_assign(&mut self, y: isize, z: isize)

Subtracts a number by 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.

impl WrappingSubMulAssign for u8

fn wrapping_sub_mul_assign(&mut self, y: u8, z: u8)

Subtracts a number by 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.

impl WrappingSubMulAssign for u16

fn wrapping_sub_mul_assign(&mut self, y: u16, z: u16)

Subtracts a number by 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.

impl WrappingSubMulAssign for u32

fn wrapping_sub_mul_assign(&mut self, y: u32, z: u32)

Subtracts a number by 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.

impl WrappingSubMulAssign for u64

fn wrapping_sub_mul_assign(&mut self, y: u64, z: u64)

Subtracts a number by 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.

impl WrappingSubMulAssign for u128

fn wrapping_sub_mul_assign(&mut self, y: u128, z: u128)

Subtracts a number by 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.

impl WrappingSubMulAssign for usize

fn wrapping_sub_mul_assign(&mut self, y: usize, z: usize)

Subtracts a number by 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.

Implementors