Trait WrappingMulAddMul
Source pub trait WrappingMulAddMul<Y = Self, Z = Self, W = Self> {
type Output;
// Required method
fn wrapping_mul_add_mul(self, y: Y, z: Z, w: W) -> Self::Output;
}
Expand description
Adds the products of two pairs of numbers, 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, wrapping around at the boundary of the
type.
$f(x, y, z, w) = 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, wrapping around at the boundary of the
type.
$f(x, y, z, w) = 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, wrapping around at the boundary of the
type.
$f(x, y, z, w) = 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, wrapping around at the boundary of the
type.
$f(x, y, z, w) = 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, wrapping around at the boundary of the
type.
$f(x, y, z, w) = 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, wrapping around at the boundary of the
type.
$f(x, y, z, w) = 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, wrapping around at the boundary of the
type.
$f(x, y, z, w) = 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, wrapping around at the boundary of the
type.
$f(x, y, z, w) = 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, wrapping around at the boundary of the
type.
$f(x, y, z, w) = 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, wrapping around at the boundary of the
type.
$f(x, y, z, w) = 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, wrapping around at the boundary of the
type.
$f(x, y, z, w) = 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, wrapping around at the boundary of the
type.
$f(x, y, z, w) = 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.