Trait malachite_base::num::arithmetic::traits::WrappingMulAssign

source · [−]
pub trait WrappingMulAssign<RHS = Self> {
    fn wrapping_mul_assign(&mut self, other: RHS);
}
Expand description

Multiplies a number by another number in place, wrapping around at the boundary of the type.

Required Methods

Implementations on Foreign Types

Adds a number to another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv xy \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Adds a number to another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv xy \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Adds a number to another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv xy \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Adds a number to another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv xy \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Adds a number to another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv xy \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Adds a number to another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv xy \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Adds a number to another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv xy \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Adds a number to another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv xy \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Adds a number to another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv xy \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Adds a number to another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv xy \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Adds a number to another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv xy \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Adds a number to another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv xy \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Implementors