Trait malachite_base::num::arithmetic::traits::WrappingAddMul

source · [−]
pub trait WrappingAddMul<Y = Self, Z = Self> {
    type Output;

    fn wrapping_add_mul(self, y: Y, z: Z) -> Self::Output;
}
Expand description

Adds a number and the product of two other numbers, wrapping around at the boundary of the type.

Required Associated Types

Required Methods

Implementations on Foreign Types

Adds a number and the product of two other numbers, wrapping around at the boundary of the type.

$f(x, y, z) = 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.

Adds a number and the product of two other numbers, wrapping around at the boundary of the type.

$f(x, y, z) = 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.

Adds a number and the product of two other numbers, wrapping around at the boundary of the type.

$f(x, y, z) = 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.

Adds a number and the product of two other numbers, wrapping around at the boundary of the type.

$f(x, y, z) = 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.

Adds a number and the product of two other numbers, wrapping around at the boundary of the type.

$f(x, y, z) = 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.

Adds a number and the product of two other numbers, wrapping around at the boundary of the type.

$f(x, y, z) = 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.

Adds a number and the product of two other numbers, wrapping around at the boundary of the type.

$f(x, y, z) = 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.

Adds a number and the product of two other numbers, wrapping around at the boundary of the type.

$f(x, y, z) = 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.

Adds a number and the product of two other numbers, wrapping around at the boundary of the type.

$f(x, y, z) = 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.

Adds a number and the product of two other numbers, wrapping around at the boundary of the type.

$f(x, y, z) = 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.

Adds a number and the product of two other numbers, wrapping around at the boundary of the type.

$f(x, y, z) = 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.

Adds a number and the product of two other numbers, wrapping around at the boundary of the type.

$f(x, y, z) = 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