Trait WrappingNegAssign
Source pub trait WrappingNegAssign {
// Required method
fn wrapping_neg_assign(&mut self);
}
Expand description
Negates a number in place, wrapping around at the boundary of the type.
Negates a number in place, wrapping around at the boundary of the type.
$x \gets y$, where $y \equiv -x \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Negates a number in place, wrapping around at the boundary of the type.
$x \gets y$, where $y \equiv -x \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Negates a number in place, wrapping around at the boundary of the type.
$x \gets y$, where $y \equiv -x \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Negates a number in place, wrapping around at the boundary of the type.
$x \gets y$, where $y \equiv -x \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Negates a number in place, wrapping around at the boundary of the type.
$x \gets y$, where $y \equiv -x \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Negates a number in place, wrapping around at the boundary of the type.
$x \gets y$, where $y \equiv -x \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Negates a number in place, wrapping around at the boundary of the type.
$x \gets y$, where $y \equiv -x \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Negates a number in place, wrapping around at the boundary of the type.
$x \gets y$, where $y \equiv -x \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Negates a number in place, wrapping around at the boundary of the type.
$x \gets y$, where $y \equiv -x \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Negates a number in place, wrapping around at the boundary of the type.
$x \gets y$, where $y \equiv -x \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Negates a number in place, wrapping around at the boundary of the type.
$x \gets y$, where $y \equiv -x \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Negates a number in place, wrapping around at the boundary of the type.
$x \gets y$, where $y \equiv -x \mod 2^W$ and $W$ is Self::WIDTH.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.