malachite-q 0.14.0

The arbitrary-precision type Rational, with efficient algorithms partially derived from GMP and FLINT.
Documentation
// 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_nz::natural::Natural;

impl PartialEq<Natural> for RationalPolynomial {
    /// Determines whether a [`RationalPolynomial`] is equal to a [`Natural`].
    ///
    /// The polynomial is equal to the [`Natural`] when it is the constant polynomial with that
    /// value, so the zero polynomial is equal to 0 and nothing else, and no polynomial with a
    /// non-integer or negative coefficient, or of positive degree, is equal to any [`Natural`].
    ///
    /// # 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_natural#partial_eq).
    fn eq(&self, other: &Natural) -> bool {
        self.denominator == 1u32 && self.numerator == *other
    }
}

impl PartialEq<RationalPolynomial> for Natural {
    /// Determines whether a [`Natural`] is equal to a [`RationalPolynomial`].
    ///
    /// The [`Natural`] is equal to the polynomial when the polynomial is the constant polynomial
    /// with that value, so 0 is equal to the zero 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_natural#partial_eq).
    #[inline]
    fn eq(&self, other: &RationalPolynomial) -> bool {
        other == self
    }
}