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
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
// 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::integer::Integer;
use crate::integer_polynomial::IntegerPolynomial;
use alloc::vec::Vec;
use malachite_base::num::arithmetic::traits::{BalancedMod, BalancedModAssign};
use malachite_base::polynomial::Polynomial;
impl BalancedMod<Integer> for IntegerPolynomial {
type Output = Self;
/// Reduces every coefficient of an [`IntegerPolynomial`] modulo an [`Integer`] to the
/// representative closest to zero, taking the polynomial by value and the modulus by value.
///
/// Each coefficient $r_i$ of the result satisfies $-|m|/2 < r_i \leq |m|/2$ and $r_i \equiv p_i
/// \bmod m$, which determine it uniquely, as with [`BalancedMod`] for [`Integer`]s. A remainder
/// of exactly $|m|/2$ is positive, and only the magnitude of $m$ matters.
///
/// Reducing can lower the degree, and can even give the zero polynomial: a leading coefficient
/// that is a multiple of $m$ becomes zero, and a polynomial does not hold trailing zero
/// coefficients. So $10x^2 + 7x + 5$ modulo $10$ is $-3x + 5$.
///
/// # Worst-case complexity
/// $T(n) = O(n \log n \log\log n)$
///
/// $M(n) = O(n \log n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is the total number of bits in the
/// polynomial's coefficients.
///
/// # Panics
/// Panics if `m` is zero.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::BalancedMod;
/// use malachite_nz::integer::Integer;
/// use malachite_nz::integer_polynomial::IntegerPolynomial;
///
/// // Each coefficient goes to the representative closest to zero.
/// let p = IntegerPolynomial::from_str("x^2+27*x-23").unwrap();
/// assert_eq!(
/// p.clone().balanced_mod(Integer::from(10)).to_string(),
/// "x^2-3*x-3"
/// );
///
/// // Half the modulus stays positive, only the modulus's magnitude matters, and reducing the
/// // leading coefficient to zero lowers the degree.
/// let p = IntegerPolynomial::from_str("10*x^2+7*x+5").unwrap();
/// assert_eq!(
/// p.clone().balanced_mod(Integer::from(-10)).to_string(),
/// "-3*x+5"
/// );
/// ```
#[inline]
fn balanced_mod(mut self, m: Integer) -> Self {
self.balanced_mod_assign(m);
self
}
}
impl<'a> BalancedMod<&'a Integer> for IntegerPolynomial {
type Output = Self;
/// Reduces every coefficient of an [`IntegerPolynomial`] modulo an [`Integer`] to the
/// representative closest to zero, taking the polynomial by value and the modulus by reference.
///
/// See the documentation for the [`BalancedMod`] implementation on [`IntegerPolynomial`] that
/// takes both arguments by value for details.
///
/// # Worst-case complexity
/// $T(n) = O(n \log n \log\log n)$
///
/// $M(n) = O(n \log n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is the total number of bits in the
/// polynomial's coefficients.
///
/// # Panics
/// Panics if `m` is zero.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::BalancedMod;
/// use malachite_nz::integer::Integer;
/// use malachite_nz::integer_polynomial::IntegerPolynomial;
///
/// // Each coefficient goes to the representative closest to zero.
/// let p = IntegerPolynomial::from_str("x^2+27*x-23").unwrap();
/// assert_eq!(
/// p.clone().balanced_mod(&Integer::from(10)).to_string(),
/// "x^2-3*x-3"
/// );
///
/// // Half the modulus stays positive, only the modulus's magnitude matters, and reducing the
/// // leading coefficient to zero lowers the degree.
/// let p = IntegerPolynomial::from_str("10*x^2+7*x+5").unwrap();
/// assert_eq!(
/// p.clone().balanced_mod(&Integer::from(-10)).to_string(),
/// "-3*x+5"
/// );
/// ```
#[inline]
fn balanced_mod(mut self, m: &'a Integer) -> Self {
self.balanced_mod_assign(m);
self
}
}
impl BalancedMod<Integer> for &IntegerPolynomial {
type Output = IntegerPolynomial;
/// Reduces every coefficient of an [`IntegerPolynomial`] modulo an [`Integer`] to the
/// representative closest to zero, taking the polynomial by reference and the modulus by value.
///
/// See the documentation for the [`BalancedMod`] implementation on [`IntegerPolynomial`] that
/// takes both arguments by value for details.
///
/// # Worst-case complexity
/// $T(n) = O(n \log n \log\log n)$
///
/// $M(n) = O(n \log n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is the total number of bits in the
/// polynomial's coefficients.
///
/// # Panics
/// Panics if `m` is zero.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::BalancedMod;
/// use malachite_nz::integer::Integer;
/// use malachite_nz::integer_polynomial::IntegerPolynomial;
///
/// // Each coefficient goes to the representative closest to zero.
/// let p = IntegerPolynomial::from_str("x^2+27*x-23").unwrap();
/// assert_eq!(
/// (&p).balanced_mod(Integer::from(10)).to_string(),
/// "x^2-3*x-3"
/// );
///
/// // Half the modulus stays positive, only the modulus's magnitude matters, and reducing the
/// // leading coefficient to zero lowers the degree.
/// let p = IntegerPolynomial::from_str("10*x^2+7*x+5").unwrap();
/// assert_eq!((&p).balanced_mod(Integer::from(-10)).to_string(), "-3*x+5");
/// ```
#[inline]
fn balanced_mod(self, m: Integer) -> IntegerPolynomial {
self.balanced_mod(&m)
}
}
impl<'a> BalancedMod<&'a Integer> for &IntegerPolynomial {
type Output = IntegerPolynomial;
/// Reduces every coefficient of an [`IntegerPolynomial`] modulo an [`Integer`] to the
/// representative closest to zero, taking the polynomial by reference and the modulus by
/// reference.
///
/// See the documentation for the [`BalancedMod`] implementation on [`IntegerPolynomial`] that
/// takes both arguments by value for details.
///
/// # Worst-case complexity
/// $T(n) = O(n \log n \log\log n)$
///
/// $M(n) = O(n \log n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is the total number of bits in the
/// polynomial's coefficients.
///
/// # Panics
/// Panics if `m` is zero.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::BalancedMod;
/// use malachite_nz::integer::Integer;
/// use malachite_nz::integer_polynomial::IntegerPolynomial;
///
/// // Each coefficient goes to the representative closest to zero.
/// let p = IntegerPolynomial::from_str("x^2+27*x-23").unwrap();
/// assert_eq!(
/// (&p).balanced_mod(&Integer::from(10)).to_string(),
/// "x^2-3*x-3"
/// );
///
/// // Half the modulus stays positive, only the modulus's magnitude matters, and reducing the
/// // leading coefficient to zero lowers the degree.
/// let p = IntegerPolynomial::from_str("10*x^2+7*x+5").unwrap();
/// assert_eq!((&p).balanced_mod(&Integer::from(-10)).to_string(), "-3*x+5");
/// ```
fn balanced_mod(self, m: &'a Integer) -> IntegerPolynomial {
assert_ne!(*m, 0u32, "division by zero");
// `from_coefficients_asc` trims, which is what makes the degree fall when the leading
// coefficient reduces to zero.
IntegerPolynomial::from_coefficients_asc(
self.coefficients
.iter()
.map(|c| c.balanced_mod(m))
.collect::<Vec<_>>(),
)
}
}
impl BalancedModAssign<Integer> for IntegerPolynomial {
/// Reduces every coefficient of an [`IntegerPolynomial`] modulo an [`Integer`] to the
/// representative closest to zero, in place, taking the modulus by value.
///
/// See the documentation for the [`BalancedMod`] implementation on [`IntegerPolynomial`] that
/// takes both arguments by value for details.
///
/// # Worst-case complexity
/// $T(n) = O(n \log n \log\log n)$
///
/// $M(n) = O(n \log n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is the total number of bits in the
/// polynomial's coefficients.
///
/// # Panics
/// Panics if `m` is zero.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::BalancedModAssign;
/// use malachite_nz::integer::Integer;
/// use malachite_nz::integer_polynomial::IntegerPolynomial;
///
/// let mut p = IntegerPolynomial::from_str("x^2+27*x-23").unwrap();
/// p.balanced_mod_assign(Integer::from(10));
/// assert_eq!(p.to_string(), "x^2-3*x-3");
///
/// let mut p = IntegerPolynomial::from_str("10*x^2+7*x+5").unwrap();
/// p.balanced_mod_assign(Integer::from(-10));
/// assert_eq!(p.to_string(), "-3*x+5");
/// ```
#[inline]
fn balanced_mod_assign(&mut self, m: Integer) {
self.balanced_mod_assign(&m);
}
}
impl<'a> BalancedModAssign<&'a Integer> for IntegerPolynomial {
/// Reduces every coefficient of an [`IntegerPolynomial`] modulo an [`Integer`] to the
/// representative closest to zero, in place, taking the modulus by reference.
///
/// See the documentation for the [`BalancedMod`] implementation on [`IntegerPolynomial`] that
/// takes both arguments by value for details.
///
/// # Worst-case complexity
/// $T(n) = O(n \log n \log\log n)$
///
/// $M(n) = O(n \log n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is the total number of bits in the
/// polynomial's coefficients.
///
/// # Panics
/// Panics if `m` is zero.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::BalancedModAssign;
/// use malachite_nz::integer::Integer;
/// use malachite_nz::integer_polynomial::IntegerPolynomial;
///
/// let mut p = IntegerPolynomial::from_str("x^2+27*x-23").unwrap();
/// p.balanced_mod_assign(&Integer::from(10));
/// assert_eq!(p.to_string(), "x^2-3*x-3");
///
/// let mut p = IntegerPolynomial::from_str("10*x^2+7*x+5").unwrap();
/// p.balanced_mod_assign(&Integer::from(-10));
/// assert_eq!(p.to_string(), "-3*x+5");
/// ```
fn balanced_mod_assign(&mut self, m: &'a Integer) {
assert_ne!(*m, 0u32, "division by zero");
for c in &mut self.coefficients {
c.balanced_mod_assign(m);
}
self.trim();
}
}