Trait malachite_base::num::arithmetic::traits::NegModAssign

source · 
pub trait NegModAssign<RHS = Self> {
    // Required method
    fn neg_mod_assign(&mut self, other: RHS);
}
Expand description

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

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

Required Methods§

source

fn neg_mod_assign(&mut self, other: RHS)

Implementations on Foreign Types§

source§

impl NegModAssign for u8

source§

fn neg_mod_assign(&mut self, other: u8)

Divides the negative of a number by another number, returning just the remainder.

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

$$ x \gets y\left \lceil \frac{x}{y} \right \rceil - x. $$

§Worst-case complexity

Constant time and additional memory.

§Panics

Panics if other is 0.

§Examples

See here.

source§

impl NegModAssign for u16

source§

fn neg_mod_assign(&mut self, other: u16)

Divides the negative of a number by another number, returning just the remainder.

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

$$ x \gets y\left \lceil \frac{x}{y} \right \rceil - x. $$

§Worst-case complexity

Constant time and additional memory.

§Panics

Panics if other is 0.

§Examples

See here.

source§

impl NegModAssign for u32

source§

fn neg_mod_assign(&mut self, other: u32)

Divides the negative of a number by another number, returning just the remainder.

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

$$ x \gets y\left \lceil \frac{x}{y} \right \rceil - x. $$

§Worst-case complexity

Constant time and additional memory.

§Panics

Panics if other is 0.

§Examples

See here.

source§

impl NegModAssign for u64

source§

fn neg_mod_assign(&mut self, other: u64)

Divides the negative of a number by another number, returning just the remainder.

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

$$ x \gets y\left \lceil \frac{x}{y} \right \rceil - x. $$

§Worst-case complexity

Constant time and additional memory.

§Panics

Panics if other is 0.

§Examples

See here.

source§

impl NegModAssign for u128

source§

fn neg_mod_assign(&mut self, other: u128)

Divides the negative of a number by another number, returning just the remainder.

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

$$ x \gets y\left \lceil \frac{x}{y} \right \rceil - x. $$

§Worst-case complexity

Constant time and additional memory.

§Panics

Panics if other is 0.

§Examples

See here.

source§

impl NegModAssign for usize

source§

fn neg_mod_assign(&mut self, other: usize)

Divides the negative of a number by another number, returning just the remainder.

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

$$ x \gets y\left \lceil \frac{x}{y} \right \rceil - x. $$

§Worst-case complexity

Constant time and additional memory.

§Panics

Panics if other is 0.

§Examples

See here.

Implementors§