pub trait WrappingSubAssign<RHS = Self> {
    fn wrapping_sub_assign(&mut self, other: RHS);
}
Expand description

Subtracts a number by another number in place, wrapping around at the boundary of the type.

Required Methods

Implementations on Foreign Types

Subtracts a number by another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Subtracts a number by another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Subtracts a number by another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Subtracts a number by another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Subtracts a number by another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Subtracts a number by another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Subtracts a number by another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Subtracts a number by another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Subtracts a number by another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Subtracts a number by another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Subtracts a number by another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Subtracts a number by another number in place, wrapping around at the boundary of the type.

$x \gets z$, where $z \equiv x - y \mod 2^W$ and $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Implementors