Trait AddMulAssign

pub trait AddMulAssign<Y = Self, Z = Self> {
    // Required method
    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 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 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.

impl AddMulAssign 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 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 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 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 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 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 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 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 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 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 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 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.

Implementors