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
// Copyright © 2026 Mikhail Hogrefe
//
// This file is part of Malachite.
//
// Malachite is free software: you can redistribute it and/or modify it under the terms of the GNU
// Lesser General Public License (LGPL) as published by the Free Software Foundation; either version
// 3 of the License, or (at your option) any later version. See <https://www.gnu.org/licenses/>.
use crate::num::arithmetic::traits::{
ModPowerOf2Mul, ModPowerOf2MulAssign, ModPowerOf2Square, ModPowerOf2SquareAssign,
};
macro_rules! impl_mod_power_of_2_square {
($t:ident) => {
impl ModPowerOf2Square for $t {
type Output = $t;
/// Squares a number modulo another number $2^k$. The input must be already reduced
/// modulo $2^k$.
///
/// $f(x, k) = y$, where $x, y < 2^k$ and $x^2 \equiv y \mod 2^k$.
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Panics
/// Panics if `pow` is greater than `Self::WIDTH` or if `self` is greater than or equal
/// to $2^k$.
///
/// # Examples
/// See [here](super::mod_power_of_2_square#mod_power_of_2_square).
#[inline]
fn mod_power_of_2_square(self, pow: u64) -> $t {
self.mod_power_of_2_mul(self, pow)
}
}
impl ModPowerOf2SquareAssign for $t {
/// Squares a number modulo another number $2^k$, in place. The input must be already
/// reduced modulo $2^k$.
///
/// $x \gets y$, where $x, y < 2^k$ and $x^2 \equiv y \mod 2^k$.
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Panics
/// Panics if `pow` is greater than `Self::WIDTH` or if `self` is greater than or equal
/// to $2^k$.
///
/// # Examples
/// See [here](super::mod_power_of_2_square#mod_power_of_2_square_assign).
#[inline]
fn mod_power_of_2_square_assign(&mut self, pow: u64) {
self.mod_power_of_2_mul_assign(*self, pow);
}
}
};
}
apply_to_unsigneds!(impl_mod_power_of_2_square);