1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60
use num::arithmetic::traits::{ModPowerOf2Neg, ModPowerOf2NegAssign};
use num::basic::unsigneds::PrimitiveUnsigned;
fn mod_power_of_2_neg<T: PrimitiveUnsigned>(x: T, pow: u64) -> T {
assert!(pow <= T::WIDTH);
x.wrapping_neg().mod_power_of_2(pow)
}
fn mod_power_of_2_neg_assign<T: PrimitiveUnsigned>(x: &mut T, pow: u64) {
assert!(pow <= T::WIDTH);
x.wrapping_neg_assign();
x.mod_power_of_2_assign(pow);
}
macro_rules! impl_mod_power_of_2_neg {
($t:ident) => {
impl ModPowerOf2Neg for $t {
type Output = $t;
/// Negates a number modulo another number $2^k$. Assumes the input is already reduced
/// modulo $2^k$.
///
/// $f(x, k) = y$, where $x, y < 2^k$ and $-x \equiv y \mod 2^k$.
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Panics
/// Panics if `pow` is greater than `Self::WIDTH`.
///
/// # Examples
/// See [here](super::mod_power_of_2_neg#mod_power_of_2_neg).
#[inline]
fn mod_power_of_2_neg(self, pow: u64) -> $t {
mod_power_of_2_neg(self, pow)
}
}
impl ModPowerOf2NegAssign for $t {
/// Negates a number modulo another number $2^k$, in place. Assumes the input is
/// already reduced modulo $2^k$.
///
/// $x \gets y$, where $x, y < 2^k$ and $-x \equiv y \mod 2^k$.
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Panics
/// Panics if `pow` is greater than `Self::WIDTH`.
///
/// # Examples
/// See [here](super::mod_power_of_2_neg#mod_power_of_2_neg_assign).
#[inline]
fn mod_power_of_2_neg_assign(&mut self, pow: u64) {
mod_power_of_2_neg_assign(self, pow);
}
}
};
}
apply_to_unsigneds!(impl_mod_power_of_2_neg);