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
// 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::num::arithmetic::traits::{CanonicalizeUnit, CanonicalizeUnitAssign};
use malachite_base::polynomial::{MakeMonic, MakeMonicAssign};
impl CanonicalizeUnit for RationalPolynomial {
type Output = Self;
/// Brings a [`RationalPolynomial`] into canonical unit form, taking it by value.
///
/// The units of the polynomials over the rationals are the nonzero constants, so the canonical
/// associate of a nonzero polynomial is its monic multiple, the one whose leading coefficient
/// is 1. This is [`make_monic`](MakeMonic::make_monic). The zero polynomial is its own
/// canonical associate.
///
/// # 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
/// numerator's coefficients.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::CanonicalizeUnit;
/// use malachite_base::num::basic::traits::Zero;
/// use malachite_q::rational_polynomial::RationalPolynomial;
///
/// assert_eq!(
/// RationalPolynomial::from_str("-1/2*x^2+3")
/// .unwrap()
/// .canonicalize_unit()
/// .to_string(),
/// "x^2-6"
/// );
/// assert_eq!(
/// RationalPolynomial::from_str("6*x+4")
/// .unwrap()
/// .canonicalize_unit()
/// .to_string(),
/// "x+2/3"
/// );
/// assert_eq!(
/// RationalPolynomial::ZERO.canonicalize_unit(),
/// RationalPolynomial::ZERO
/// );
/// ```
#[inline]
fn canonicalize_unit(self) -> Self {
self.make_monic()
}
}
impl CanonicalizeUnit for &RationalPolynomial {
type Output = RationalPolynomial;
/// Brings a [`RationalPolynomial`] into canonical unit form, taking it by reference.
///
/// The units of the polynomials over the rationals are the nonzero constants, so the canonical
/// associate of a nonzero polynomial is its monic multiple, the one whose leading coefficient
/// is 1. This is [`make_monic`](MakeMonic::make_monic). The zero polynomial is its own
/// canonical associate.
///
/// # 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
/// numerator's coefficients.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::CanonicalizeUnit;
/// use malachite_base::num::basic::traits::Zero;
/// use malachite_q::rational_polynomial::RationalPolynomial;
///
/// assert_eq!(
/// (&RationalPolynomial::from_str("-1/2*x^2+3").unwrap())
/// .canonicalize_unit()
/// .to_string(),
/// "x^2-6"
/// );
/// assert_eq!(
/// (&RationalPolynomial::from_str("6*x+4").unwrap())
/// .canonicalize_unit()
/// .to_string(),
/// "x+2/3"
/// );
/// assert_eq!(
/// (&RationalPolynomial::ZERO).canonicalize_unit(),
/// RationalPolynomial::ZERO
/// );
/// ```
#[inline]
fn canonicalize_unit(self) -> RationalPolynomial {
self.make_monic()
}
}
impl CanonicalizeUnitAssign for RationalPolynomial {
/// Brings a [`RationalPolynomial`] into canonical unit form, in place.
///
/// The units of the polynomials over the rationals are the nonzero constants, so the canonical
/// associate of a nonzero polynomial is its monic multiple, the one whose leading coefficient
/// is 1. This is [`make_monic`](MakeMonic::make_monic). The zero polynomial is its own
/// canonical associate.
///
/// # 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
/// numerator's coefficients.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::CanonicalizeUnitAssign;
/// use malachite_q::rational_polynomial::RationalPolynomial;
///
/// let mut p = RationalPolynomial::from_str("-1/2*x^2+3").unwrap();
/// p.canonicalize_unit_assign();
/// assert_eq!(p.to_string(), "x^2-6");
/// ```
#[inline]
fn canonicalize_unit_assign(&mut self) {
self.make_monic_assign();
}
}