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
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
// 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::basic::unsigneds::PrimitiveUnsigned;
use crate::polynomial::{ModAddTruncated, ModAddTruncatedAssign, Polynomial};
use crate::unsigned_polynomial::UnsignedPolynomial;
use crate::unsigned_polynomial::arithmetic::mod_add::{
add_assign_ref, add_assign_val, assert_reduced,
};
// The first `len` elements of `xs`, or all of them if there are fewer.
fn prefix<T: PrimitiveUnsigned>(xs: &[T], len: u64) -> &[T] {
&xs[..usize::try_from(len).map_or(xs.len(), |len| len.min(xs.len()))]
}
impl<T: PrimitiveUnsigned> ModAddTruncated<Self, T> for UnsignedPolynomial<T> {
type Output = Self;
/// Adds two [`UnsignedPolynomial`]s modulo `m`, keeping only the coefficients of $x^i$ for $i$
/// less than `len`, taking both by value. The coefficients of both must already be reduced
/// modulo `m`.
///
/// $$
/// f(p, q, n, m) = ((p + q) \bmod x^n) \bmod m.
/// $$
///
/// The polynomials need not already be truncated: this is the sum of their images modulo $x^n$,
/// so only the first `len` coefficients of each are read. The sum is trimmed, so when
/// coefficients cancel modulo `m` at the top of the kept range, the degree is lower still.
///
/// # 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 of the
/// longer polynomial.
///
/// # Panics
/// Panics if `m` is 0, or if any coefficient of `self` or `other` is greater than or equal to
/// `m`.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::polynomial::ModAddTruncated;
/// use malachite_base::unsigned_polynomial::UnsignedPolynomial;
///
/// // The linear and constant coefficients wrap around to 0.
/// assert_eq!(
/// UnsignedPolynomial::<u8>::from_str("x^3+2*x^2+x+5")
/// .unwrap()
/// .mod_add_truncated(UnsignedPolynomial::from_str("4*x^2+6*x+2").unwrap(), 3, 7)
/// .to_string(),
/// "6*x^2"
/// );
/// assert_eq!(
/// UnsignedPolynomial::<u8>::from_str("x^3+2*x^2+x+5")
/// .unwrap()
/// .mod_add_truncated(UnsignedPolynomial::from_str("4*x^2+6*x+2").unwrap(), 1, 7)
/// .to_string(),
/// "0"
/// );
/// ```
///
/// This is equivalent to `nmod_poly_add_series` from `nmod_poly/add_series.c`, FLINT 3.6.0.
fn mod_add_truncated(mut self, mut other: Self, len: u64, m: T) -> Self {
assert_reduced(&self, &other, m);
self.truncate_assign(len);
other.truncate_assign(len);
add_assign_val(&mut self.coefficients, other.coefficients, m);
self.trim();
self
}
}
impl<T: PrimitiveUnsigned> ModAddTruncated<&Self, T> for UnsignedPolynomial<T> {
type Output = Self;
/// Adds two [`UnsignedPolynomial`]s modulo `m`, keeping only the coefficients of $x^i$ for $i$
/// less than `len`, taking the first by value and the second by reference. The coefficients of
/// both must already be reduced modulo `m`.
///
/// $$
/// f(p, q, n, m) = ((p + q) \bmod x^n) \bmod m.
/// $$
///
/// The polynomials need not already be truncated: this is the sum of their images modulo $x^n$,
/// so only the first `len` coefficients of each are read. The sum is trimmed, so when
/// coefficients cancel modulo `m` at the top of the kept range, the degree is lower still.
///
/// # 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 of the
/// longer polynomial.
///
/// # Panics
/// Panics if `m` is 0, or if any coefficient of `self` or `other` is greater than or equal to
/// `m`.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::polynomial::ModAddTruncated;
/// use malachite_base::unsigned_polynomial::UnsignedPolynomial;
///
/// // The linear and constant coefficients wrap around to 0.
/// assert_eq!(
/// UnsignedPolynomial::<u8>::from_str("x^3+2*x^2+x+5")
/// .unwrap()
/// .mod_add_truncated(&UnsignedPolynomial::from_str("4*x^2+6*x+2").unwrap(), 3, 7)
/// .to_string(),
/// "6*x^2"
/// );
/// assert_eq!(
/// UnsignedPolynomial::<u8>::from_str("x^3+2*x^2+x+5")
/// .unwrap()
/// .mod_add_truncated(&UnsignedPolynomial::from_str("4*x^2+6*x+2").unwrap(), 1, 7)
/// .to_string(),
/// "0"
/// );
/// ```
///
/// This is equivalent to `nmod_poly_add_series` from `nmod_poly/add_series.c`, FLINT 3.6.0.
fn mod_add_truncated(mut self, other: &Self, len: u64, m: T) -> Self {
assert_reduced(&self, other, m);
self.truncate_assign(len);
add_assign_ref(&mut self.coefficients, prefix(&other.coefficients, len), m);
self.trim();
self
}
}
impl<T: PrimitiveUnsigned> ModAddTruncated<UnsignedPolynomial<T>, T> for &UnsignedPolynomial<T> {
type Output = UnsignedPolynomial<T>;
/// Adds two [`UnsignedPolynomial`]s modulo `m`, keeping only the coefficients of $x^i$ for $i$
/// less than `len`, taking the first by reference and the second by value. The coefficients of
/// both must already be reduced modulo `m`.
///
/// $$
/// f(p, q, n, m) = ((p + q) \bmod x^n) \bmod m.
/// $$
///
/// The polynomials need not already be truncated: this is the sum of their images modulo $x^n$,
/// so only the first `len` coefficients of each are read. The sum is trimmed, so when
/// coefficients cancel modulo `m` at the top of the kept range, the degree is lower still.
///
/// # 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 of the
/// longer polynomial.
///
/// # Panics
/// Panics if `m` is 0, or if any coefficient of `self` or `other` is greater than or equal to
/// `m`.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::polynomial::ModAddTruncated;
/// use malachite_base::unsigned_polynomial::UnsignedPolynomial;
///
/// // The linear and constant coefficients wrap around to 0.
/// assert_eq!(
/// (&UnsignedPolynomial::<u8>::from_str("x^3+2*x^2+x+5").unwrap())
/// .mod_add_truncated(UnsignedPolynomial::from_str("4*x^2+6*x+2").unwrap(), 3, 7)
/// .to_string(),
/// "6*x^2"
/// );
/// assert_eq!(
/// (&UnsignedPolynomial::<u8>::from_str("x^3+2*x^2+x+5").unwrap())
/// .mod_add_truncated(UnsignedPolynomial::from_str("4*x^2+6*x+2").unwrap(), 1, 7)
/// .to_string(),
/// "0"
/// );
/// ```
///
/// This is equivalent to `nmod_poly_add_series` from `nmod_poly/add_series.c`, FLINT 3.6.0.
fn mod_add_truncated(
self,
mut other: UnsignedPolynomial<T>,
len: u64,
m: T,
) -> UnsignedPolynomial<T> {
assert_reduced(self, &other, m);
other.truncate_assign(len);
add_assign_ref(&mut other.coefficients, prefix(&self.coefficients, len), m);
other.trim();
other
}
}
impl<T: PrimitiveUnsigned> ModAddTruncated<&UnsignedPolynomial<T>, T> for &UnsignedPolynomial<T> {
type Output = UnsignedPolynomial<T>;
/// Adds two [`UnsignedPolynomial`]s modulo `m`, keeping only the coefficients of $x^i$ for $i$
/// less than `len`, taking both by reference. The coefficients of both must already be reduced
/// modulo `m`.
///
/// $$
/// f(p, q, n, m) = ((p + q) \bmod x^n) \bmod m.
/// $$
///
/// The polynomials need not already be truncated: this is the sum of their images modulo $x^n$,
/// so only the first `len` coefficients of each are read. The sum is trimmed, so when
/// coefficients cancel modulo `m` at the top of the kept range, the degree is lower still.
///
/// # 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 of the
/// longer polynomial.
///
/// # Panics
/// Panics if `m` is 0, or if any coefficient of `self` or `other` is greater than or equal to
/// `m`.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::polynomial::ModAddTruncated;
/// use malachite_base::unsigned_polynomial::UnsignedPolynomial;
///
/// // The linear and constant coefficients wrap around to 0.
/// assert_eq!(
/// (&UnsignedPolynomial::<u8>::from_str("x^3+2*x^2+x+5").unwrap())
/// .mod_add_truncated(&UnsignedPolynomial::from_str("4*x^2+6*x+2").unwrap(), 3, 7)
/// .to_string(),
/// "6*x^2"
/// );
/// assert_eq!(
/// (&UnsignedPolynomial::<u8>::from_str("x^3+2*x^2+x+5").unwrap())
/// .mod_add_truncated(&UnsignedPolynomial::from_str("4*x^2+6*x+2").unwrap(), 1, 7)
/// .to_string(),
/// "0"
/// );
/// ```
///
/// This is equivalent to `nmod_poly_add_series` from `nmod_poly/add_series.c`, FLINT 3.6.0.
fn mod_add_truncated(
self,
other: &UnsignedPolynomial<T>,
len: u64,
m: T,
) -> UnsignedPolynomial<T> {
assert_reduced(self, other, m);
let mut coefficients = prefix(&self.coefficients, len).to_vec();
add_assign_ref(&mut coefficients, prefix(&other.coefficients, len), m);
let mut result = UnsignedPolynomial { coefficients };
result.trim();
result
}
}
impl<T: PrimitiveUnsigned> ModAddTruncatedAssign<Self, T> for UnsignedPolynomial<T> {
/// Adds an [`UnsignedPolynomial`] to an [`UnsignedPolynomial`] modulo `m` in place, keeping
/// only the coefficients of $x^i$ for $i$ less than `len`, taking the second polynomial by
/// value. The coefficients of both must already be reduced modulo `m`.
///
/// $$
/// p \gets ((p + q) \bmod x^n) \bmod m.
/// $$
///
/// The polynomials need not already be truncated: this is the sum of their images modulo $x^n$,
/// so only the first `len` coefficients of each are read. The sum is trimmed, so when
/// coefficients cancel modulo `m` at the top of the kept range, the degree is lower still.
///
/// # 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 of the
/// longer polynomial.
///
/// # Panics
/// Panics if `m` is 0, or if any coefficient of `self` or `other` is greater than or equal to
/// `m`.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::polynomial::ModAddTruncatedAssign;
/// use malachite_base::unsigned_polynomial::UnsignedPolynomial;
///
/// // The linear and constant coefficients wrap around to 0.
/// let mut p = UnsignedPolynomial::<u8>::from_str("x^3+2*x^2+x+5").unwrap();
/// p.mod_add_truncated_assign(UnsignedPolynomial::from_str("4*x^2+6*x+2").unwrap(), 3, 7);
/// assert_eq!(p.to_string(), "6*x^2");
///
/// let mut p = UnsignedPolynomial::<u8>::from_str("x^3+2*x^2+x+5").unwrap();
/// p.mod_add_truncated_assign(UnsignedPolynomial::from_str("4*x^2+6*x+2").unwrap(), 1, 7);
/// assert_eq!(p.to_string(), "0");
/// ```
///
/// This is equivalent to `nmod_poly_add_series` from `nmod_poly/add_series.c`, FLINT 3.6.0.
fn mod_add_truncated_assign(&mut self, mut other: Self, len: u64, m: T) {
assert_reduced(self, &other, m);
self.truncate_assign(len);
other.truncate_assign(len);
add_assign_val(&mut self.coefficients, other.coefficients, m);
self.trim();
}
}
impl<T: PrimitiveUnsigned> ModAddTruncatedAssign<&Self, T> for UnsignedPolynomial<T> {
/// Adds an [`UnsignedPolynomial`] to an [`UnsignedPolynomial`] modulo `m` in place, keeping
/// only the coefficients of $x^i$ for $i$ less than `len`, taking the second polynomial by
/// reference. The coefficients of both must already be reduced modulo `m`.
///
/// $$
/// p \gets ((p + q) \bmod x^n) \bmod m.
/// $$
///
/// The polynomials need not already be truncated: this is the sum of their images modulo $x^n$,
/// so only the first `len` coefficients of each are read. The sum is trimmed, so when
/// coefficients cancel modulo `m` at the top of the kept range, the degree is lower still.
///
/// # 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 of the
/// longer polynomial.
///
/// # Panics
/// Panics if `m` is 0, or if any coefficient of `self` or `other` is greater than or equal to
/// `m`.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::polynomial::ModAddTruncatedAssign;
/// use malachite_base::unsigned_polynomial::UnsignedPolynomial;
///
/// // The linear and constant coefficients wrap around to 0.
/// let mut p = UnsignedPolynomial::<u8>::from_str("x^3+2*x^2+x+5").unwrap();
/// p.mod_add_truncated_assign(&UnsignedPolynomial::from_str("4*x^2+6*x+2").unwrap(), 3, 7);
/// assert_eq!(p.to_string(), "6*x^2");
///
/// let mut p = UnsignedPolynomial::<u8>::from_str("x^3+2*x^2+x+5").unwrap();
/// p.mod_add_truncated_assign(&UnsignedPolynomial::from_str("4*x^2+6*x+2").unwrap(), 1, 7);
/// assert_eq!(p.to_string(), "0");
/// ```
///
/// This is equivalent to `nmod_poly_add_series` from `nmod_poly/add_series.c`, FLINT 3.6.0.
fn mod_add_truncated_assign(&mut self, other: &Self, len: u64, m: T) {
assert_reduced(self, other, m);
self.truncate_assign(len);
add_assign_ref(&mut self.coefficients, prefix(&other.coefficients, len), m);
self.trim();
}
}