Trait malachite_base::num::arithmetic::traits::AddMulAssign

pub trait AddMulAssign<Y = Self, Z = Self> {
    fn add_mul_assign(&mut self, y: Y, z: Z);
}

Adds a number and the product of two other numbers, in place.

Required Methods

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

Implementations on Foreign Types

impl AddMulAssign<u8, u8> for u8

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

Adds the product of two other numbers to a number in place.

$x \gets x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl AddMulAssign<u16, u16> for u16

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

Adds the product of two other numbers to a number in place.

$x \gets x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl AddMulAssign<u32, u32> for u32

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

Adds the product of two other numbers to a number in place.

$x \gets x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl AddMulAssign<u64, u64> for u64

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

Adds the product of two other numbers to a number in place.

$x \gets x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl AddMulAssign<u128, u128> for u128

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

Adds the product of two other numbers to a number in place.

$x \gets x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl AddMulAssign<usize, usize> for usize

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

Adds the product of two other numbers to a number in place.

$x \gets x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl AddMulAssign<i8, i8> for i8

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

Adds the product of two other numbers to a number in place.

$x \gets x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl AddMulAssign<i16, i16> for i16

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

Adds the product of two other numbers to a number in place.

$x \gets x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl AddMulAssign<i32, i32> for i32

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

Adds the product of two other numbers to a number in place.

$x \gets x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl AddMulAssign<i64, i64> for i64

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

Adds the product of two other numbers to a number in place.

$x \gets x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl AddMulAssign<i128, i128> for i128

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

Adds the product of two other numbers to a number in place.

$x \gets x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl AddMulAssign<isize, isize> for isize

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

Adds the product of two other numbers to a number in place.

$x \gets x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl AddMulAssign<f32, f32> for f32

fn add_mul_assign(&mut self, y: f32, z: f32)

Adds the product of two other numbers to a number in place.

$x \gets x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl AddMulAssign<f64, f64> for f64

fn add_mul_assign(&mut self, y: f64, z: f64)

Adds the product of two other numbers to a number in place.

$x \gets x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Implementors