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

pub trait ModAssign<RHS = Self> {
    // Required method
    fn mod_assign(&mut self, other: RHS);
}

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

fn mod_assign(&mut self, other: RHS)

Implementations on Foreign Types

impl ModAssign for i8

fn mod_assign(&mut self, other: i8)

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.

impl ModAssign for i16

fn mod_assign(&mut self, other: i16)

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.

impl ModAssign for i32

fn mod_assign(&mut self, other: i32)

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.

impl ModAssign for i64

fn mod_assign(&mut self, other: i64)

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.

impl ModAssign for i128

fn mod_assign(&mut self, other: i128)

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.

impl ModAssign for isize

fn mod_assign(&mut self, other: isize)

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.

impl ModAssign for u8

fn mod_assign(&mut self, other: u8)

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.

impl ModAssign for u16

fn mod_assign(&mut self, other: u16)

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.

impl ModAssign for u32

fn mod_assign(&mut self, other: u32)

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.

impl ModAssign for u64

fn mod_assign(&mut self, other: u64)

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.

impl ModAssign for u128

fn mod_assign(&mut self, other: u128)

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.

impl ModAssign for usize

fn mod_assign(&mut self, other: usize)

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.

Implementors