Trait malachite_base::num::arithmetic::traits::NegModPowerOf2
source · [−]pub trait NegModPowerOf2 {
type Output;
fn neg_mod_power_of_2(self, other: u64) -> Self::Output;
}
Expand description
Divides the negative of a number by $2^k$, returning the remainder.
If the quotient were computed, the quotient and remainder would satisfy $x = q2^k - r$ and $0 \leq r < 2^k$.
Required Associated Types
Required Methods
fn neg_mod_power_of_2(self, other: u64) -> Self::Output
Implementations on Foreign Types
sourceimpl NegModPowerOf2 for u8
impl NegModPowerOf2 for u8
sourcefn neg_mod_power_of_2(self, pow: u64) -> u8
fn neg_mod_power_of_2(self, pow: u64) -> u8
Divides the negative of a number by a $2^k$, returning just the remainder.
If the quotient were computed, the quotient and remainder would satisfy $x = q2^k - r$ and $0 \leq r < 2^k$.
$$ f(x, k) = 2^k\left \lceil \frac{x}{2^k} \right \rceil - x. $$
Worst-case complexity
Constant time and additional memory.
Panics
Panics if self
is nonzero and pow
is greater than Self::WIDTH
.
Examples
See here.
type Output = u8
sourceimpl NegModPowerOf2 for u16
impl NegModPowerOf2 for u16
sourcefn neg_mod_power_of_2(self, pow: u64) -> u16
fn neg_mod_power_of_2(self, pow: u64) -> u16
Divides the negative of a number by a $2^k$, returning just the remainder.
If the quotient were computed, the quotient and remainder would satisfy $x = q2^k - r$ and $0 \leq r < 2^k$.
$$ f(x, k) = 2^k\left \lceil \frac{x}{2^k} \right \rceil - x. $$
Worst-case complexity
Constant time and additional memory.
Panics
Panics if self
is nonzero and pow
is greater than Self::WIDTH
.
Examples
See here.
type Output = u16
sourceimpl NegModPowerOf2 for u32
impl NegModPowerOf2 for u32
sourcefn neg_mod_power_of_2(self, pow: u64) -> u32
fn neg_mod_power_of_2(self, pow: u64) -> u32
Divides the negative of a number by a $2^k$, returning just the remainder.
If the quotient were computed, the quotient and remainder would satisfy $x = q2^k - r$ and $0 \leq r < 2^k$.
$$ f(x, k) = 2^k\left \lceil \frac{x}{2^k} \right \rceil - x. $$
Worst-case complexity
Constant time and additional memory.
Panics
Panics if self
is nonzero and pow
is greater than Self::WIDTH
.
Examples
See here.
type Output = u32
sourceimpl NegModPowerOf2 for u64
impl NegModPowerOf2 for u64
sourcefn neg_mod_power_of_2(self, pow: u64) -> u64
fn neg_mod_power_of_2(self, pow: u64) -> u64
Divides the negative of a number by a $2^k$, returning just the remainder.
If the quotient were computed, the quotient and remainder would satisfy $x = q2^k - r$ and $0 \leq r < 2^k$.
$$ f(x, k) = 2^k\left \lceil \frac{x}{2^k} \right \rceil - x. $$
Worst-case complexity
Constant time and additional memory.
Panics
Panics if self
is nonzero and pow
is greater than Self::WIDTH
.
Examples
See here.
type Output = u64
sourceimpl NegModPowerOf2 for u128
impl NegModPowerOf2 for u128
sourcefn neg_mod_power_of_2(self, pow: u64) -> u128
fn neg_mod_power_of_2(self, pow: u64) -> u128
Divides the negative of a number by a $2^k$, returning just the remainder.
If the quotient were computed, the quotient and remainder would satisfy $x = q2^k - r$ and $0 \leq r < 2^k$.
$$ f(x, k) = 2^k\left \lceil \frac{x}{2^k} \right \rceil - x. $$
Worst-case complexity
Constant time and additional memory.
Panics
Panics if self
is nonzero and pow
is greater than Self::WIDTH
.
Examples
See here.
type Output = u128
sourceimpl NegModPowerOf2 for usize
impl NegModPowerOf2 for usize
sourcefn neg_mod_power_of_2(self, pow: u64) -> usize
fn neg_mod_power_of_2(self, pow: u64) -> usize
Divides the negative of a number by a $2^k$, returning just the remainder.
If the quotient were computed, the quotient and remainder would satisfy $x = q2^k - r$ and $0 \leq r < 2^k$.
$$ f(x, k) = 2^k\left \lceil \frac{x}{2^k} \right \rceil - x. $$
Worst-case complexity
Constant time and additional memory.
Panics
Panics if self
is nonzero and pow
is greater than Self::WIDTH
.
Examples
See here.