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
// 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::natural::Natural;
use crate::natural_polynomial::NaturalPolynomial;
use malachite_base::num::arithmetic::traits::{
CanonicalPrimitivePart, CanonicalPrimitivePartAssign, ContentAndCanonicalPrimitivePart,
ContentAndPrimitivePart, PrimitivePart, PrimitivePartAssign,
};
impl CanonicalPrimitivePart for NaturalPolynomial {
type Output = Self;
/// Computes the canonical primitive part of a [`NaturalPolynomial`], taking the polynomial by
/// value.
///
/// The coefficients of a [`NaturalPolynomial`] are never negative, so it has only one associate
/// with coprime coefficients, and this is the same as
/// [`primitive_part`](PrimitivePart::primitive_part).
///
/// # Worst-case complexity
/// $T(n) = O(n (\log n)^2 \log\log n)$
///
/// $M(n) = O(1)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is the total number of bits of the
/// coefficients.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::CanonicalPrimitivePart;
/// use malachite_nz::natural_polynomial::NaturalPolynomial;
///
/// let p = NaturalPolynomial::from_str("6*x^2+4*x+10").unwrap();
/// assert_eq!(p.canonical_primitive_part().to_string(), "3*x^2+2*x+5");
/// ```
#[inline]
fn canonical_primitive_part(self) -> Self {
self.primitive_part()
}
}
impl CanonicalPrimitivePart for &NaturalPolynomial {
type Output = NaturalPolynomial;
/// Computes the canonical primitive part of a [`NaturalPolynomial`], taking the polynomial by
/// reference.
///
/// The coefficients of a [`NaturalPolynomial`] are never negative, so it has only one associate
/// with coprime coefficients, and this is the same as
/// [`primitive_part`](PrimitivePart::primitive_part).
///
/// # Worst-case complexity
/// $T(n) = O(n (\log n)^2 \log\log n)$
///
/// $M(n) = O(n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is the total number of bits of the
/// coefficients.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::CanonicalPrimitivePart;
/// use malachite_nz::natural_polynomial::NaturalPolynomial;
///
/// let p = NaturalPolynomial::from_str("6*x^2+4*x+10").unwrap();
/// assert_eq!((&p).canonical_primitive_part().to_string(), "3*x^2+2*x+5");
/// ```
#[inline]
fn canonical_primitive_part(self) -> NaturalPolynomial {
self.primitive_part()
}
}
impl CanonicalPrimitivePartAssign for NaturalPolynomial {
/// Replaces a [`NaturalPolynomial`] with its canonical primitive part.
///
/// The coefficients of a [`NaturalPolynomial`] are never negative, so it has only one associate
/// with coprime coefficients, and this is the same as
/// [`primitive_part`](PrimitivePart::primitive_part).
///
/// # Worst-case complexity
/// $T(n) = O(n (\log n)^2 \log\log n)$
///
/// $M(n) = O(1)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is the total number of bits of the
/// coefficients.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::CanonicalPrimitivePartAssign;
/// use malachite_nz::natural_polynomial::NaturalPolynomial;
///
/// let mut p = NaturalPolynomial::from_str("6*x^2+4*x+10").unwrap();
/// p.canonical_primitive_part_assign();
/// assert_eq!(p.to_string(), "3*x^2+2*x+5");
/// ```
#[inline]
fn canonical_primitive_part_assign(&mut self) {
self.primitive_part_assign();
}
}
impl ContentAndCanonicalPrimitivePart for NaturalPolynomial {
type Content = Natural;
type CanonicalPrimitivePart = Self;
/// Computes the content and the canonical primitive part of a [`NaturalPolynomial`] together,
/// taking the polynomial by value.
///
/// The coefficients of a [`NaturalPolynomial`] are never negative, so it has only one associate
/// with coprime coefficients, and this is the same as
/// [`primitive_part`](PrimitivePart::primitive_part).
///
/// # Worst-case complexity
/// $T(n) = O(n (\log n)^2 \log\log n)$
///
/// $M(n) = O(1)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is the total number of bits of the
/// coefficients.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::ContentAndCanonicalPrimitivePart;
/// use malachite_nz::natural_polynomial::NaturalPolynomial;
///
/// let p = NaturalPolynomial::from_str("6*x^2+4*x+10").unwrap();
/// let (content, primitive_part) = p.content_and_canonical_primitive_part();
/// assert_eq!(content, 2u32);
/// assert_eq!(primitive_part.to_string(), "3*x^2+2*x+5");
/// ```
#[inline]
fn content_and_canonical_primitive_part(self) -> (Natural, Self) {
self.content_and_primitive_part()
}
}
impl ContentAndCanonicalPrimitivePart for &NaturalPolynomial {
type Content = Natural;
type CanonicalPrimitivePart = NaturalPolynomial;
/// Computes the content and the canonical primitive part of a [`NaturalPolynomial`] together,
/// taking the polynomial by reference.
///
/// The coefficients of a [`NaturalPolynomial`] are never negative, so it has only one associate
/// with coprime coefficients, and this is the same as
/// [`primitive_part`](PrimitivePart::primitive_part).
///
/// # Worst-case complexity
/// $T(n) = O(n (\log n)^2 \log\log n)$
///
/// $M(n) = O(n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is the total number of bits of the
/// coefficients.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::ContentAndCanonicalPrimitivePart;
/// use malachite_nz::natural_polynomial::NaturalPolynomial;
///
/// let p = NaturalPolynomial::from_str("6*x^2+4*x+10").unwrap();
/// let (content, primitive_part) = (&p).content_and_canonical_primitive_part();
/// assert_eq!(content, 2u32);
/// assert_eq!(primitive_part.to_string(), "3*x^2+2*x+5");
/// ```
#[inline]
fn content_and_canonical_primitive_part(self) -> (Natural, NaturalPolynomial) {
self.content_and_primitive_part()
}
}