Trait WrappingAddMul
Source pub trait WrappingAddMul<Y = Self, Z = Self> {
type Output;
// Required method
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.
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, 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.