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
// 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::{
DeflatePowerOfX, DeflatePowerOfXAssign, slice_deflate_power_of_x, vec_deflate_power_of_x,
};
use crate::unsigned_polynomial::UnsignedPolynomial;
impl<T: PrimitiveUnsigned> DeflatePowerOfX for UnsignedPolynomial<T> {
type Output = Self;
/// Deflates an [`UnsignedPolynomial`] by $n$, taking it by value, giving the polynomial $q$
/// with $q(x^n) = p(x)$. The coefficient of $x^{in}$ moves to $x^i$.
///
/// $$
/// f(p, n) = q, \quad \text{where} \quad q(x^n) = p(x).
/// $$
///
/// A constant polynomial deflates to itself, and deflating by 1 changes nothing.
///
/// # Worst-case complexity
/// $T(m) = O(m)$
///
/// $M(m) = O(1)$
///
/// where $T$ is time, $M$ is additional memory, and $m$ is `self.len()`.
///
/// # Panics
/// Panics if `n` is 0, or if the polynomial has a nonzero coefficient at an exponent that is
/// not a multiple of `n`.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::polynomial::DeflatePowerOfX;
/// use malachite_base::unsigned_polynomial::UnsignedPolynomial;
///
/// let p = UnsignedPolynomial::<u8>::from_str("x^6+2*x^3+1").unwrap();
/// assert_eq!(p.deflate_power_of_x(3).to_string(), "x^2+2*x+1");
/// ```
///
/// This is equivalent to `nmod_poly_deflate` from `nmod_poly/deflate.c`, FLINT 3.6.0, except
/// that it panics rather than dropping the coefficients at other exponents.
#[inline]
fn deflate_power_of_x(mut self, n: u64) -> Self {
self.deflate_power_of_x_assign(n);
self
}
}
impl<T: PrimitiveUnsigned> DeflatePowerOfX for &UnsignedPolynomial<T> {
type Output = UnsignedPolynomial<T>;
/// Deflates an [`UnsignedPolynomial`] by $n$, taking it by reference, giving the polynomial $q$
/// with $q(x^n) = p(x)$. The coefficient of $x^{in}$ moves to $x^i$.
///
/// $$
/// f(p, n) = q, \quad \text{where} \quad q(x^n) = p(x).
/// $$
///
/// A constant polynomial deflates to itself, and deflating by 1 changes nothing.
///
/// # Worst-case complexity
/// $T(m) = O(m)$
///
/// $M(m) = O(m)$
///
/// where $T$ is time, $M$ is additional memory, and $m$ is `self.len()`.
///
/// # Panics
/// Panics if `n` is 0, or if the polynomial has a nonzero coefficient at an exponent that is
/// not a multiple of `n`.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::polynomial::DeflatePowerOfX;
/// use malachite_base::unsigned_polynomial::UnsignedPolynomial;
///
/// let p = UnsignedPolynomial::<u8>::from_str("x^6+2*x^3+1").unwrap();
/// assert_eq!((&p).deflate_power_of_x(3).to_string(), "x^2+2*x+1");
/// ```
///
/// This is equivalent to `nmod_poly_deflate` from `nmod_poly/deflate.c`, FLINT 3.6.0, except
/// that it panics rather than dropping the coefficients at other exponents.
#[inline]
fn deflate_power_of_x(self, n: u64) -> UnsignedPolynomial<T> {
UnsignedPolynomial {
coefficients: slice_deflate_power_of_x(&self.coefficients, n, |c| *c == T::ZERO),
}
}
}
impl<T: PrimitiveUnsigned> DeflatePowerOfXAssign for UnsignedPolynomial<T> {
/// Deflates an [`UnsignedPolynomial`] by $n$ in place, replacing $p$ with the polynomial $q$
/// such that $q(x^n) = p(x)$. The coefficient of $x^{in}$ moves to $x^i$.
///
/// $$
/// p \gets q, \quad \text{where} \quad q(x^n) = p(x).
/// $$
///
/// A constant polynomial deflates to itself, and deflating by 1 changes nothing.
///
/// # Worst-case complexity
/// $T(m) = O(m)$
///
/// $M(m) = O(1)$
///
/// where $T$ is time, $M$ is additional memory, and $m$ is `self.len()`.
///
/// # Panics
/// Panics if `n` is 0, or if the polynomial has a nonzero coefficient at an exponent that is
/// not a multiple of `n`.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::polynomial::DeflatePowerOfXAssign;
/// use malachite_base::unsigned_polynomial::UnsignedPolynomial;
///
/// let mut p = UnsignedPolynomial::<u8>::from_str("x^6+2*x^3+1").unwrap();
/// p.deflate_power_of_x_assign(3);
/// assert_eq!(p.to_string(), "x^2+2*x+1");
/// ```
///
/// This is equivalent to `nmod_poly_deflate` from `nmod_poly/deflate.c`, FLINT 3.6.0, except
/// that it panics rather than dropping the coefficients at other exponents.
#[inline]
fn deflate_power_of_x_assign(&mut self, n: u64) {
vec_deflate_power_of_x(&mut self.coefficients, n, |c| *c == T::ZERO);
}
}