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
59

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

impl PartialEq<Integer> for NaturalPolynomial {
    /// Determines whether a [`NaturalPolynomial`] is equal to an [`Integer`].
    ///
    /// The polynomial is equal to the [`Integer`] when it is the constant polynomial with that
    /// value, so the zero polynomial is equal to 0 and nothing else, no polynomial is equal to a
    /// negative [`Integer`], and no polynomial of positive degree is equal to any [`Integer`].
    ///
    /// # Worst-case complexity
    /// $T(n) = O(n)$
    ///
    /// $M(n) = O(1)$
    ///
    /// where $T$ is time, $M$ is additional memory, and $n$ is
    /// `min(self.coefficient(0).significant_bits(), other.significant_bits())`.
    ///
    /// # Examples
    /// See [here](super::partial_eq_integer#partial_eq).
    fn eq(&self, other: &Integer) -> bool {
        match self.coefficients.as_slice() {
            [] => *other == 0u32,
            [c] => other == c,
            _ => false,
        }
    }
}

impl PartialEq<NaturalPolynomial> for Integer {
    /// Determines whether an [`Integer`] is equal to a [`NaturalPolynomial`].
    ///
    /// The [`Integer`] is equal to the polynomial when the polynomial is the constant polynomial
    /// with that value, so 0 is equal to the zero polynomial and a negative [`Integer`] is equal to
    /// no polynomial.
    ///
    /// # Worst-case complexity
    /// $T(n) = O(n)$
    ///
    /// $M(n) = O(1)$
    ///
    /// where $T$ is time, $M$ is additional memory, and $n$ is `min(self.significant_bits(),
    /// other.coefficient(0).significant_bits())`.
    ///
    /// # Examples
    /// See [here](super::partial_eq_integer#partial_eq).
    #[inline]
    fn eq(&self, other: &NaturalPolynomial) -> bool {
        other == self
    }
}