Trait malachite_base::num::arithmetic::traits::SaturatingNegAssign

source · [−]
pub trait SaturatingNegAssign {
    fn saturating_neg_assign(&mut self);
}
Expand description

Negates a number in place, saturating at the numeric bounds instead of overflowing.

Required Methods

Implementations on Foreign Types

Negates a number in place, saturating at the numeric bounds instead of overflowing.

$$ x \gets \begin{cases} -x & \text{if} \quad x^2 > -2^{W-1}, \\ 2^{W-1} - 1 & \text{if} \quad x = -2^{W-1}, \end{cases} $$ where $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Negates a number in place, saturating at the numeric bounds instead of overflowing.

$$ x \gets \begin{cases} -x & \text{if} \quad x^2 > -2^{W-1}, \\ 2^{W-1} - 1 & \text{if} \quad x = -2^{W-1}, \end{cases} $$ where $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Negates a number in place, saturating at the numeric bounds instead of overflowing.

$$ x \gets \begin{cases} -x & \text{if} \quad x^2 > -2^{W-1}, \\ 2^{W-1} - 1 & \text{if} \quad x = -2^{W-1}, \end{cases} $$ where $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Negates a number in place, saturating at the numeric bounds instead of overflowing.

$$ x \gets \begin{cases} -x & \text{if} \quad x^2 > -2^{W-1}, \\ 2^{W-1} - 1 & \text{if} \quad x = -2^{W-1}, \end{cases} $$ where $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Negates a number in place, saturating at the numeric bounds instead of overflowing.

$$ x \gets \begin{cases} -x & \text{if} \quad x^2 > -2^{W-1}, \\ 2^{W-1} - 1 & \text{if} \quad x = -2^{W-1}, \end{cases} $$ where $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Negates a number in place, saturating at the numeric bounds instead of overflowing.

$$ x \gets \begin{cases} -x & \text{if} \quad x^2 > -2^{W-1}, \\ 2^{W-1} - 1 & \text{if} \quad x = -2^{W-1}, \end{cases} $$ where $W$ is Self::WIDTH.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Implementors