malachite-nz 0.13.0

The bignum types Natural and Integer, with efficient algorithms partially derived from GMP and FLINT.
Documentation 
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

// 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::integer_polynomial::IntegerPolynomial;
use crate::natural_polynomial::NaturalPolynomial;

impl PartialEq<NaturalPolynomial> for IntegerPolynomial {
    /// Determines whether an [`IntegerPolynomial`] is equal to a [`NaturalPolynomial`].
    ///
    /// The two are equal when they have the same coefficients, which, since neither stores trailing
    /// zeros, means the same number of coefficients and equal coefficients in each position. So the
    /// zero polynomials are equal, and an [`IntegerPolynomial`] with a negative coefficient is
    /// equal to no [`NaturalPolynomial`].
    ///
    /// # Worst-case complexity
    /// $T(n) = O(n)$
    ///
    /// $M(n) = O(1)$
    ///
    /// where $T$ is time, $M$ is additional memory, and $n$ is the smaller of the two polynomials'
    /// total number of bits, summed over their coefficients. Polynomials of different degrees are
    /// compared in constant time.
    ///
    /// # Examples
    /// See [here](super::partial_eq_natural_polynomial#partial_eq).
    fn eq(&self, other: &NaturalPolynomial) -> bool {
        let other = other.coefficients_asc();
        self.coefficients.len() == other.len()
            && self.coefficients.iter().zip(other).all(|(x, y)| x == y)
    }
}

impl PartialEq<IntegerPolynomial> for NaturalPolynomial {
    /// Determines whether a [`NaturalPolynomial`] is equal to an [`IntegerPolynomial`].
    ///
    /// The two are equal when they have the same coefficients, so the zero polynomials are equal.
    ///
    /// # Worst-case complexity
    /// $T(n) = O(n)$
    ///
    /// $M(n) = O(1)$
    ///
    /// where $T$ is time, $M$ is additional memory, and $n$ is the smaller of the two polynomials'
    /// total number of bits, summed over their coefficients. Polynomials of different degrees are
    /// compared in constant time.
    ///
    /// # Examples
    /// See [here](super::partial_eq_natural_polynomial#partial_eq).
    #[inline]
    fn eq(&self, other: &IntegerPolynomial) -> bool {
        other == self
    }
}