Trait malachite_base::num::arithmetic::traits::AddMul

pub trait AddMul<Y = Self, Z = Self> {
    type Output;

    // Required method
    fn add_mul(self, y: Y, z: Z) -> Self::Output;
}

Adds a number and the product of two other numbers.

Required Associated Types

type Output

Required Methods

fn add_mul(self, y: Y, z: Z) -> Self::Output

Implementations on Foreign Types

impl AddMul for f32

fn add_mul(self, y: f32, z: f32) -> f32

Adds a number and the product of two other numbers.

$f(x, y, z) = x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

type Output = f32

impl AddMul for f64

fn add_mul(self, y: f64, z: f64) -> f64

Adds a number and the product of two other numbers.

$f(x, y, z) = x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

type Output = f64

impl AddMul for i8

fn add_mul(self, y: i8, z: i8) -> i8

Adds a number and the product of two other numbers.

$f(x, y, z) = x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

type Output = i8

impl AddMul for i16

fn add_mul(self, y: i16, z: i16) -> i16

Adds a number and the product of two other numbers.

$f(x, y, z) = x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

type Output = i16

impl AddMul for i32

fn add_mul(self, y: i32, z: i32) -> i32

Adds a number and the product of two other numbers.

$f(x, y, z) = x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

type Output = i32

impl AddMul for i64

fn add_mul(self, y: i64, z: i64) -> i64

Adds a number and the product of two other numbers.

$f(x, y, z) = x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

type Output = i64

impl AddMul for i128

fn add_mul(self, y: i128, z: i128) -> i128

Adds a number and the product of two other numbers.

$f(x, y, z) = x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

type Output = i128

impl AddMul for isize

fn add_mul(self, y: isize, z: isize) -> isize

Adds a number and the product of two other numbers.

$f(x, y, z) = x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

type Output = isize

impl AddMul for u8

fn add_mul(self, y: u8, z: u8) -> u8

Adds a number and the product of two other numbers.

$f(x, y, z) = x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

type Output = u8

impl AddMul for u16

fn add_mul(self, y: u16, z: u16) -> u16

Adds a number and the product of two other numbers.

$f(x, y, z) = x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

type Output = u16

impl AddMul for u32

fn add_mul(self, y: u32, z: u32) -> u32

Adds a number and the product of two other numbers.

$f(x, y, z) = x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

type Output = u32

impl AddMul for u64

fn add_mul(self, y: u64, z: u64) -> u64

Adds a number and the product of two other numbers.

$f(x, y, z) = x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

type Output = u64

impl AddMul for u128

fn add_mul(self, y: u128, z: u128) -> u128

Adds a number and the product of two other numbers.

$f(x, y, z) = x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

type Output = u128

impl AddMul for usize

fn add_mul(self, y: usize, z: usize) -> usize

Adds a number and the product of two other numbers.

$f(x, y, z) = x + yz$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

type Output = usize

Implementors