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
// 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 core::ops::Neg;
use malachite_base::num::arithmetic::traits::NegAssign;
impl Neg for RationalPolynomial {
type Output = Self;
/// Negates a [`RationalPolynomial`], taking it by value.
///
/// $$
/// f(p) = -p.
/// $$
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(1)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is `self.len()`.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::basic::traits::Zero;
/// use malachite_q::rational_polynomial::RationalPolynomial;
///
/// let p = RationalPolynomial::from_str("1/2*x^2-1/3").unwrap();
/// assert_eq!((-p).to_string(), "-1/2*x^2+1/3");
/// assert_eq!(-RationalPolynomial::ZERO, RationalPolynomial::ZERO);
/// ```
///
/// This is equivalent to `fmpq_poly_neg` from `fmpq_poly/neg.c`, FLINT 3.6.0.
fn neg(mut self) -> Self {
// The content is unchanged by the sign, so the pair stays canonical
self.numerator.neg_assign();
self
}
}
impl Neg for &RationalPolynomial {
type Output = RationalPolynomial;
/// Negates a [`RationalPolynomial`], taking it by reference.
///
/// $$
/// f(p) = -p.
/// $$
///
/// # Worst-case complexity
/// $T(n) = O(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::basic::traits::Zero;
/// use malachite_q::rational_polynomial::RationalPolynomial;
///
/// let p = RationalPolynomial::from_str("1/2*x^2-1/3").unwrap();
/// assert_eq!((-&p).to_string(), "-1/2*x^2+1/3");
/// assert_eq!(-&RationalPolynomial::ZERO, RationalPolynomial::ZERO);
/// ```
///
/// This is equivalent to `fmpq_poly_neg` from `fmpq_poly/neg.c`, FLINT 3.6.0.
fn neg(self) -> RationalPolynomial {
RationalPolynomial {
numerator: -&self.numerator,
denominator: self.denominator.clone(),
}
}
}
impl NegAssign for RationalPolynomial {
/// Negates a [`RationalPolynomial`] in place.
///
/// $$
/// p \gets -p.
/// $$
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(1)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is `self.len()`.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::NegAssign;
/// use malachite_q::rational_polynomial::RationalPolynomial;
///
/// let mut p = RationalPolynomial::from_str("1/2*x^2-1/3").unwrap();
/// p.neg_assign();
/// assert_eq!(p.to_string(), "-1/2*x^2+1/3");
/// ```
fn neg_assign(&mut self) {
self.numerator.neg_assign();
}
}