Trait malachite_base::num::arithmetic::traits::ModAssign

source · [−]
pub trait ModAssign<RHS = Self> {
    fn mod_assign(&mut self, other: RHS);
}
Expand description

Divides a number by another number, replacing the first number by the remainder. The remainder has the same sign as the divisor (second number).

If the quotient were computed, the quotient and remainder would satisfy $x = qy + r$ and $0 \leq |r| < |y|$.

Required Methods

Implementations on Foreign Types

Divides a number by another number, replacing the first number by the remainder.

If the quotient were computed, he quotient and remainder would satisfy $x = qy + r$ and $0 \leq r < y$.

$$ x \gets x - y\left \lfloor \frac{x}{y} \right \rfloor. $$

Worst-case complexity

Constant time and additional memory.

Panics

Panics if other is 0.

Examples

See here.

Divides a number by another number, replacing the first number by the remainder.

If the quotient were computed, he quotient and remainder would satisfy $x = qy + r$ and $0 \leq r < y$.

$$ x \gets x - y\left \lfloor \frac{x}{y} \right \rfloor. $$

Worst-case complexity

Constant time and additional memory.

Panics

Panics if other is 0.

Examples

See here.

Divides a number by another number, replacing the first number by the remainder.

If the quotient were computed, he quotient and remainder would satisfy $x = qy + r$ and $0 \leq r < y$.

$$ x \gets x - y\left \lfloor \frac{x}{y} \right \rfloor. $$

Worst-case complexity

Constant time and additional memory.

Panics

Panics if other is 0.

Examples

See here.

Divides a number by another number, replacing the first number by the remainder.

If the quotient were computed, he quotient and remainder would satisfy $x = qy + r$ and $0 \leq r < y$.

$$ x \gets x - y\left \lfloor \frac{x}{y} \right \rfloor. $$

Worst-case complexity

Constant time and additional memory.

Panics

Panics if other is 0.

Examples

See here.

Divides a number by another number, replacing the first number by the remainder.

If the quotient were computed, he quotient and remainder would satisfy $x = qy + r$ and $0 \leq r < y$.

$$ x \gets x - y\left \lfloor \frac{x}{y} \right \rfloor. $$

Worst-case complexity

Constant time and additional memory.

Panics

Panics if other is 0.

Examples

See here.

Divides a number by another number, replacing the first number by the remainder.

If the quotient were computed, he quotient and remainder would satisfy $x = qy + r$ and $0 \leq r < y$.

$$ x \gets x - y\left \lfloor \frac{x}{y} \right \rfloor. $$

Worst-case complexity

Constant time and additional memory.

Panics

Panics if other is 0.

Examples

See here.

Divides a number by another number, replacing the first number by the remainder. The remainder has the same sign as the second number.

If the quotient were computed, he quotient and remainder would satisfy $x = qy + r$ and $0 \leq |r| < |y|$.

$$ x \gets x - y\left \lfloor \frac{x}{y} \right \rfloor. $$

Worst-case complexity

Constant time and additional memory.

Panics

Panics if other is 0.

Examples

See here.

Divides a number by another number, replacing the first number by the remainder. The remainder has the same sign as the second number.

If the quotient were computed, he quotient and remainder would satisfy $x = qy + r$ and $0 \leq |r| < |y|$.

$$ x \gets x - y\left \lfloor \frac{x}{y} \right \rfloor. $$

Worst-case complexity

Constant time and additional memory.

Panics

Panics if other is 0.

Examples

See here.

Divides a number by another number, replacing the first number by the remainder. The remainder has the same sign as the second number.

If the quotient were computed, he quotient and remainder would satisfy $x = qy + r$ and $0 \leq |r| < |y|$.

$$ x \gets x - y\left \lfloor \frac{x}{y} \right \rfloor. $$

Worst-case complexity

Constant time and additional memory.

Panics

Panics if other is 0.

Examples

See here.

Divides a number by another number, replacing the first number by the remainder. The remainder has the same sign as the second number.

If the quotient were computed, he quotient and remainder would satisfy $x = qy + r$ and $0 \leq |r| < |y|$.

$$ x \gets x - y\left \lfloor \frac{x}{y} \right \rfloor. $$

Worst-case complexity

Constant time and additional memory.

Panics

Panics if other is 0.

Examples

See here.

Divides a number by another number, replacing the first number by the remainder. The remainder has the same sign as the second number.

If the quotient were computed, he quotient and remainder would satisfy $x = qy + r$ and $0 \leq |r| < |y|$.

$$ x \gets x - y\left \lfloor \frac{x}{y} \right \rfloor. $$

Worst-case complexity

Constant time and additional memory.

Panics

Panics if other is 0.

Examples

See here.

Divides a number by another number, replacing the first number by the remainder. The remainder has the same sign as the second number.

If the quotient were computed, he quotient and remainder would satisfy $x = qy + r$ and $0 \leq |r| < |y|$.

$$ x \gets x - y\left \lfloor \frac{x}{y} \right \rfloor. $$

Worst-case complexity

Constant time and additional memory.

Panics

Panics if other is 0.

Examples

See here.

Implementors