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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
// 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::{ModPowerOf2IsReduced, ModPowerOf2Neg, ModPowerOf2NegAssign};
use crate::num::basic::unsigneds::PrimitiveUnsigned;
use crate::unsigned_polynomial::UnsignedPolynomial;
fn assert_reduced<T: PrimitiveUnsigned>(p: &UnsignedPolynomial<T>, pow: u64) {
assert!(pow <= T::WIDTH);
assert!(
p.mod_power_of_2_is_reduced(pow),
"self must be reduced mod 2^pow, but {p} has a coefficient >= 2^{pow}"
);
}
// Negates every coefficient modulo 2^pow. The coefficients are reduced, so a nonzero one stays
// nonzero and nothing needs trimming.
fn negate<T: PrimitiveUnsigned>(coefficients: &mut [T], pow: u64) {
for c in coefficients {
*c = c.wrapping_neg().mod_power_of_2(pow);
}
}
impl<T: PrimitiveUnsigned> ModPowerOf2Neg for UnsignedPolynomial<T> {
type Output = Self;
/// Negates an [`UnsignedPolynomial`] modulo $2^k$, taking the polynomial by value. The
/// coefficients must already be reduced modulo $2^k$.
///
/// Each nonzero coefficient $c$ becomes $2^k - c$, which is also nonzero, so the degree is
/// unchanged. The zero polynomial is its own negation.
///
/// $$
/// f(p, k) = -p \bmod 2^k.
/// $$
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(1)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is the number of coefficients.
///
/// # Panics
/// Panics if `pow` is greater than `T::WIDTH`, or if any coefficient of `self` is greater than
/// or equal to $2^k$.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::ModPowerOf2Neg;
/// use malachite_base::num::basic::traits::Zero;
/// use malachite_base::unsigned_polynomial::UnsignedPolynomial;
///
/// let p = UnsignedPolynomial::<u8>::from_str("5*x^2+x+3").unwrap();
/// assert_eq!(p.clone().mod_power_of_2_neg(3).to_string(), "3*x^2+7*x+5");
/// let p = UnsignedPolynomial::<u8>::from_str("x").unwrap();
/// assert_eq!(p.clone().mod_power_of_2_neg(8).to_string(), "255*x");
/// assert_eq!(
/// UnsignedPolynomial::<u8>::ZERO.mod_power_of_2_neg(3),
/// UnsignedPolynomial::<u8>::ZERO
/// );
/// ```
///
/// This is equivalent to `nmod_poly_neg` from `nmod_poly/neg.c`, FLINT 3.6.0, with the modulus
/// $2^k$.
#[inline]
fn mod_power_of_2_neg(mut self, pow: u64) -> Self {
self.mod_power_of_2_neg_assign(pow);
self
}
}
impl<T: PrimitiveUnsigned> ModPowerOf2Neg for &UnsignedPolynomial<T> {
type Output = UnsignedPolynomial<T>;
/// Negates an [`UnsignedPolynomial`] modulo $2^k$, taking the polynomial by reference. The
/// coefficients must already be reduced modulo $2^k$.
///
/// Each nonzero coefficient $c$ becomes $2^k - c$, which is also nonzero, so the degree is
/// unchanged. The zero polynomial is its own negation.
///
/// $$
/// f(p, k) = -p \bmod 2^k.
/// $$
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is the number of coefficients.
///
/// # Panics
/// Panics if `pow` is greater than `T::WIDTH`, or if any coefficient of `self` is greater than
/// or equal to $2^k$.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::ModPowerOf2Neg;
/// use malachite_base::num::basic::traits::Zero;
/// use malachite_base::unsigned_polynomial::UnsignedPolynomial;
///
/// let p = UnsignedPolynomial::<u8>::from_str("5*x^2+x+3").unwrap();
/// assert_eq!((&p).mod_power_of_2_neg(3).to_string(), "3*x^2+7*x+5");
/// let p = UnsignedPolynomial::<u8>::from_str("x").unwrap();
/// assert_eq!((&p).mod_power_of_2_neg(8).to_string(), "255*x");
/// assert_eq!(
/// UnsignedPolynomial::<u8>::ZERO.mod_power_of_2_neg(3),
/// UnsignedPolynomial::<u8>::ZERO
/// );
/// ```
///
/// This is equivalent to `nmod_poly_neg` from `nmod_poly/neg.c`, FLINT 3.6.0, with the modulus
/// $2^k$.
#[inline]
fn mod_power_of_2_neg(self, pow: u64) -> UnsignedPolynomial<T> {
assert_reduced(self, pow);
let mut coefficients = self.coefficients.clone();
negate(&mut coefficients, pow);
UnsignedPolynomial { coefficients }
}
}
impl<T: PrimitiveUnsigned> ModPowerOf2NegAssign for UnsignedPolynomial<T> {
/// Negates an [`UnsignedPolynomial`] modulo $2^k$, in place. The coefficients must already be
/// reduced modulo $2^k$.
///
/// See [`mod_power_of_2_neg`](ModPowerOf2Neg::mod_power_of_2_neg).
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(1)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is the number of coefficients.
///
/// # Panics
/// Panics if `pow` is greater than `T::WIDTH`, or if any coefficient of `self` is greater than
/// or equal to $2^k$.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::ModPowerOf2NegAssign;
/// use malachite_base::unsigned_polynomial::UnsignedPolynomial;
///
/// let mut p = UnsignedPolynomial::<u8>::from_str("5*x^2+x+3").unwrap();
/// p.mod_power_of_2_neg_assign(3);
/// assert_eq!(p.to_string(), "3*x^2+7*x+5");
/// ```
#[inline]
fn mod_power_of_2_neg_assign(&mut self, pow: u64) {
assert_reduced(self, pow);
negate(&mut self.coefficients, pow);
}
}