Trait malachite_base::num::arithmetic::traits::CeilingMod

pub trait CeilingMod<RHS = Self> {
    type Output;

    // Required method
    fn ceiling_mod(self, other: RHS) -> Self::Output;
}

Divides a number by another number, returning just the remainder. The remainder has the opposite 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 Associated Types

type Output

Required Methods

fn ceiling_mod(self, other: RHS) -> Self::Output

Implementations on Foreign Types

impl CeilingMod for i8

fn ceiling_mod(self, other: i8) -> i8

Divides a number by another number, returning just the remainder. The remainder has the opposite sign as the second number.

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

$$ f(x, y) = x - y\left \lceil \frac{x}{y} \right \rceil. $$

Worst-case complexity

Constant time and additional memory.

Panics

Panics if other is 0.

Examples

See here.

type Output = i8

impl CeilingMod for i16

fn ceiling_mod(self, other: i16) -> i16

Divides a number by another number, returning just the remainder. The remainder has the opposite sign as the second number.

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

$$ f(x, y) = x - y\left \lceil \frac{x}{y} \right \rceil. $$

Worst-case complexity

Constant time and additional memory.

Panics

Panics if other is 0.

Examples

See here.

type Output = i16

impl CeilingMod for i32

fn ceiling_mod(self, other: i32) -> i32

Divides a number by another number, returning just the remainder. The remainder has the opposite sign as the second number.

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

$$ f(x, y) = x - y\left \lceil \frac{x}{y} \right \rceil. $$

Worst-case complexity

Constant time and additional memory.

Panics

Panics if other is 0.

Examples

See here.

type Output = i32

impl CeilingMod for i64

fn ceiling_mod(self, other: i64) -> i64

Divides a number by another number, returning just the remainder. The remainder has the opposite sign as the second number.

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

$$ f(x, y) = x - y\left \lceil \frac{x}{y} \right \rceil. $$

Worst-case complexity

Constant time and additional memory.

Panics

Panics if other is 0.

Examples

See here.

type Output = i64

impl CeilingMod for i128

fn ceiling_mod(self, other: i128) -> i128

Divides a number by another number, returning just the remainder. The remainder has the opposite sign as the second number.

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

$$ f(x, y) = x - y\left \lceil \frac{x}{y} \right \rceil. $$

Worst-case complexity

Constant time and additional memory.

Panics

Panics if other is 0.

Examples

See here.

type Output = i128

impl CeilingMod for isize

fn ceiling_mod(self, other: isize) -> isize

Divides a number by another number, returning just the remainder. The remainder has the opposite sign as the second number.

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

$$ f(x, y) = x - y\left \lceil \frac{x}{y} \right \rceil. $$

Worst-case complexity

Constant time and additional memory.

Panics

Panics if other is 0.

Examples

See here.

type Output = isize

Implementors