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
// 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::rational_polynomial::RationalPolynomial;
use malachite_base::polynomial::{MulPowerOfX, MulPowerOfXAssign};
impl MulPowerOfX for RationalPolynomial {
type Output = Self;
/// Multiplies a [`RationalPolynomial`] by $x^n$, taking it by value. Every coefficient moves up
/// by $n$ places, and $n$ zeros fill the places below them.
///
/// $$
/// f(p, n) = x^np.
/// $$
///
/// Only the numerator changes, so the denominator stays the same and the result is still in
/// lowest terms. The zero polynomial stays zero, and multiplying by $x^0$ changes nothing.
///
/// # Worst-case complexity
/// $T(n, m) = O(n + m)$
///
/// $M(n, m) = O(1)$
///
/// where $T$ is time, $M$ is additional memory, $n$ is `n`, and $m$ is the total number of bits
/// of the numerator's coefficients and the denominator.
///
/// # Panics
/// Panics if the polynomial is nonzero and `n` is greater than `usize::MAX`.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::basic::traits::Zero;
/// use malachite_base::polynomial::MulPowerOfX;
/// use malachite_q::rational_polynomial::RationalPolynomial;
///
/// assert_eq!(
/// RationalPolynomial::from_str("1/2*x^2-1/3")
/// .unwrap()
/// .mul_power_of_x(2)
/// .to_string(),
/// "1/2*x^4-1/3*x^2"
/// );
/// assert_eq!(
/// RationalPolynomial::from_str("-5/3")
/// .unwrap()
/// .mul_power_of_x(1)
/// .to_string(),
/// "-5/3*x"
/// );
/// assert_eq!(
/// RationalPolynomial::ZERO.mul_power_of_x(3),
/// RationalPolynomial::ZERO
/// );
/// ```
///
/// This is equivalent to `fmpq_poly_shift_left` from `fmpq_poly/shift_left.c`, FLINT 3.6.0.
#[inline]
fn mul_power_of_x(mut self, n: u64) -> Self {
self.mul_power_of_x_assign(n);
self
}
}
impl MulPowerOfX for &RationalPolynomial {
type Output = RationalPolynomial;
/// Multiplies a [`RationalPolynomial`] by $x^n$, taking it by reference. Every coefficient
/// moves up by $n$ places, and $n$ zeros fill the places below them.
///
/// $$
/// f(p, n) = x^np.
/// $$
///
/// Only the numerator changes, so the denominator stays the same and the result is still in
/// lowest terms. The zero polynomial stays zero, and multiplying by $x^0$ changes nothing.
///
/// # Worst-case complexity
/// $T(n, m) = O(n + m)$
///
/// $M(n, m) = O(n + m)$
///
/// where $T$ is time, $M$ is additional memory, $n$ is `n`, and $m$ is the total number of bits
/// of the numerator's coefficients and the denominator.
///
/// # Panics
/// Panics if the polynomial is nonzero and `n` is greater than `usize::MAX`.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::basic::traits::Zero;
/// use malachite_base::polynomial::MulPowerOfX;
/// use malachite_q::rational_polynomial::RationalPolynomial;
///
/// assert_eq!(
/// (&RationalPolynomial::from_str("1/2*x^2-1/3").unwrap())
/// .mul_power_of_x(2)
/// .to_string(),
/// "1/2*x^4-1/3*x^2"
/// );
/// assert_eq!(
/// (&RationalPolynomial::from_str("-5/3").unwrap())
/// .mul_power_of_x(1)
/// .to_string(),
/// "-5/3*x"
/// );
/// assert_eq!(
/// (&RationalPolynomial::ZERO).mul_power_of_x(3),
/// RationalPolynomial::ZERO
/// );
/// ```
///
/// This is equivalent to `fmpq_poly_shift_left` from `fmpq_poly/shift_left.c`, FLINT 3.6.0.
fn mul_power_of_x(self, n: u64) -> RationalPolynomial {
RationalPolynomial {
numerator: (&self.numerator).mul_power_of_x(n),
denominator: self.denominator.clone(),
}
}
}
impl MulPowerOfXAssign for RationalPolynomial {
/// Multiplies a [`RationalPolynomial`] by $x^n$ in place. Every coefficient moves up by $n$
/// places, and $n$ zeros fill the places below them.
///
/// $$
/// p \gets x^np.
/// $$
///
/// Only the numerator changes, so the denominator stays the same and the result is still in
/// lowest terms. The zero polynomial stays zero, and multiplying by $x^0$ changes nothing.
///
/// # Worst-case complexity
/// $T(n, m) = O(n + m)$
///
/// $M(n, m) = O(n)$
///
/// where $T$ is time, $M$ is additional memory, $n$ is `n`, and $m$ is the total number of bits
/// of the numerator's coefficients and the denominator.
///
/// # Panics
/// Panics if the polynomial is nonzero and `n` is greater than `usize::MAX`.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::basic::traits::Zero;
/// use malachite_base::polynomial::MulPowerOfXAssign;
/// use malachite_q::rational_polynomial::RationalPolynomial;
///
/// let mut p = RationalPolynomial::from_str("1/2*x^2-1/3").unwrap();
/// p.mul_power_of_x_assign(2);
/// assert_eq!(p.to_string(), "1/2*x^4-1/3*x^2");
///
/// let mut p = RationalPolynomial::from_str("-5/3").unwrap();
/// p.mul_power_of_x_assign(1);
/// assert_eq!(p.to_string(), "-5/3*x");
///
/// let mut p = RationalPolynomial::ZERO;
/// p.mul_power_of_x_assign(3);
/// assert_eq!(p, RationalPolynomial::ZERO);
/// ```
///
/// This is equivalent to `fmpq_poly_shift_left` from `fmpq_poly/shift_left.c`, FLINT 3.6.0.
#[inline]
fn mul_power_of_x_assign(&mut self, n: u64) {
self.numerator.mul_power_of_x_assign(n);
}
}