Trait WrappingAddMulAssign
Source pub trait WrappingAddMulAssign<Y = Self, Z = Self> {
// Required method
fn wrapping_add_mul_assign(&mut self, y: Y, z: Z);
}
Expand description
Adds a number and the product of two other numbers, in place, wrapping around at the boundary of
the type.
This trait is dyn compatible.
In older versions of Rust, dyn compatibility was called "object safety".
Adds a number and the product of two other numbers in place, wrapping around at the
boundary of the type.
$x \gets 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 in place, wrapping around at the
boundary of the type.
$x \gets 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 in place, wrapping around at the
boundary of the type.
$x \gets 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 in place, wrapping around at the
boundary of the type.
$x \gets 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 in place, wrapping around at the
boundary of the type.
$x \gets 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 in place, wrapping around at the
boundary of the type.
$x \gets 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 in place, wrapping around at the
boundary of the type.
$x \gets 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 in place, wrapping around at the
boundary of the type.
$x \gets 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 in place, wrapping around at the
boundary of the type.
$x \gets 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 in place, wrapping around at the
boundary of the type.
$x \gets 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 in place, wrapping around at the
boundary of the type.
$x \gets 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 in place, wrapping around at the
boundary of the type.
$x \gets 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.