Trait WrappingMulAddMulAssign
Source pub trait WrappingMulAddMulAssign<Y = Self, Z = Self, W = Self> {
// Required method
fn wrapping_mul_add_mul_assign(&mut self, y: Y, z: Z, w: W);
}
Expand description
Adds the products of two pairs of 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 the products of two pairs of numbers, in place, wrapping around at the boundary
of the type.
$x \gets z$, where $z \equiv xy + zw \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Adds the products of two pairs of numbers, in place, wrapping around at the boundary
of the type.
$x \gets z$, where $z \equiv xy + zw \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Adds the products of two pairs of numbers, in place, wrapping around at the boundary
of the type.
$x \gets z$, where $z \equiv xy + zw \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Adds the products of two pairs of numbers, in place, wrapping around at the boundary
of the type.
$x \gets z$, where $z \equiv xy + zw \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Adds the products of two pairs of numbers, in place, wrapping around at the boundary
of the type.
$x \gets z$, where $z \equiv xy + zw \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Adds the products of two pairs of numbers, in place, wrapping around at the boundary
of the type.
$x \gets z$, where $z \equiv xy + zw \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Adds the products of two pairs of numbers, in place, wrapping around at the boundary
of the type.
$x \gets z$, where $z \equiv xy + zw \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Adds the products of two pairs of numbers, in place, wrapping around at the boundary
of the type.
$x \gets z$, where $z \equiv xy + zw \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Adds the products of two pairs of numbers, in place, wrapping around at the boundary
of the type.
$x \gets z$, where $z \equiv xy + zw \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Adds the products of two pairs of numbers, in place, wrapping around at the boundary
of the type.
$x \gets z$, where $z \equiv xy + zw \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Adds the products of two pairs of numbers, in place, wrapping around at the boundary
of the type.
$x \gets z$, where $z \equiv xy + zw \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Adds the products of two pairs of numbers, in place, wrapping around at the boundary
of the type.
$x \gets z$, where $z \equiv xy + zw \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.