Trait malachite_base::num::arithmetic::traits::ModShr

pub trait ModShr<RHS, M = Self> {
    type Output;

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

Left-shifts a number (divides it by a power of 2) modulo another number $m$. The number must be already reduced modulo $m$.

Required Associated Types

type Output

Required Methods

fn mod_shr(self, other: RHS, m: M) -> Self::Output

Implementations on Foreign Types

impl ModShr<i8> for u8

fn mod_shr(self, other: i8, m: u8) -> u8

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u8

impl ModShr<i8> for u16

fn mod_shr(self, other: i8, m: u16) -> u16

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u16

impl ModShr<i8> for u32

fn mod_shr(self, other: i8, m: u32) -> u32

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u32

impl ModShr<i8> for u64

fn mod_shr(self, other: i8, m: u64) -> u64

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u64

impl ModShr<i8> for u128

fn mod_shr(self, other: i8, m: u128) -> u128

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u128

impl ModShr<i8> for usize

fn mod_shr(self, other: i8, m: usize) -> usize

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = usize

impl ModShr<i16> for u8

fn mod_shr(self, other: i16, m: u8) -> u8

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u8

impl ModShr<i16> for u16

fn mod_shr(self, other: i16, m: u16) -> u16

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u16

impl ModShr<i16> for u32

fn mod_shr(self, other: i16, m: u32) -> u32

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u32

impl ModShr<i16> for u64

fn mod_shr(self, other: i16, m: u64) -> u64

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u64

impl ModShr<i16> for u128

fn mod_shr(self, other: i16, m: u128) -> u128

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u128

impl ModShr<i16> for usize

fn mod_shr(self, other: i16, m: usize) -> usize

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = usize

impl ModShr<i32> for u8

fn mod_shr(self, other: i32, m: u8) -> u8

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u8

impl ModShr<i32> for u16

fn mod_shr(self, other: i32, m: u16) -> u16

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u16

impl ModShr<i32> for u32

fn mod_shr(self, other: i32, m: u32) -> u32

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u32

impl ModShr<i32> for u64

fn mod_shr(self, other: i32, m: u64) -> u64

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u64

impl ModShr<i32> for u128

fn mod_shr(self, other: i32, m: u128) -> u128

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u128

impl ModShr<i32> for usize

fn mod_shr(self, other: i32, m: usize) -> usize

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = usize

impl ModShr<i64> for u8

fn mod_shr(self, other: i64, m: u8) -> u8

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u8

impl ModShr<i64> for u16

fn mod_shr(self, other: i64, m: u16) -> u16

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u16

impl ModShr<i64> for u32

fn mod_shr(self, other: i64, m: u32) -> u32

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u32

impl ModShr<i64> for u64

fn mod_shr(self, other: i64, m: u64) -> u64

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u64

impl ModShr<i64> for u128

fn mod_shr(self, other: i64, m: u128) -> u128

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u128

impl ModShr<i64> for usize

fn mod_shr(self, other: i64, m: usize) -> usize

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = usize

impl ModShr<i128> for u8

fn mod_shr(self, other: i128, m: u8) -> u8

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u8

impl ModShr<i128> for u16

fn mod_shr(self, other: i128, m: u16) -> u16

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u16

impl ModShr<i128> for u32

fn mod_shr(self, other: i128, m: u32) -> u32

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u32

impl ModShr<i128> for u64

fn mod_shr(self, other: i128, m: u64) -> u64

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u64

impl ModShr<i128> for u128

fn mod_shr(self, other: i128, m: u128) -> u128

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u128

impl ModShr<i128> for usize

fn mod_shr(self, other: i128, m: usize) -> usize

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = usize

impl ModShr<isize> for u8

fn mod_shr(self, other: isize, m: u8) -> u8

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u8

impl ModShr<isize> for u16

fn mod_shr(self, other: isize, m: u16) -> u16

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u16

impl ModShr<isize> for u32

fn mod_shr(self, other: isize, m: u32) -> u32

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u32

impl ModShr<isize> for u64

fn mod_shr(self, other: isize, m: u64) -> u64

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u64

impl ModShr<isize> for u128

fn mod_shr(self, other: isize, m: u128) -> u128

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = u128

impl ModShr<isize> for usize

fn mod_shr(self, other: isize, m: usize) -> usize

Right-shifts a number (divides it by a power of 2) modulo a number $m$. The number must be already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^{-n}x \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Panics

Panics if self is greater than or equal to m.

Examples

See here.

type Output = usize

Implementors