Struct Factorization 

pub struct Factorization {
    pub map: BTreeMap<Monomial, (Polynomial, Rational)>,
    pub gcd: Rational,
}

Uniquely reduced but volatile form of symbolic polynomial factorization.

Factors pinned symbols as monomials and factors the greatest common divisors (GCDs) of the remaining polynomials and the GCD among them. Optionally, the GCDs are signed comprising the factored predominant sign.

Initially, a factorization is uniquely reduced but in contrast to Polynomial, the invariants are no longer enforced by storage, making this form volatile. As the members are public, the invariants are unguarded. For instance, manipulating a polynomial in Self::map, potentially invalidates the Self::gcd.

Fields

map: BTreeMap<Monomial, (Polynomial, Rational)>

Symbolic storage mapping factored monomials to remaining polynomials and their GCDs.

gcd: Rational

GCD among remaining polynomials’ GCDs.

Implementations

impl Factorization

pub fn new(p: Polynomial, signed: bool) -> Self

Performs the factorization.

Optionally, the GCDs are signed comprising the factored predominant sign.

pub fn is_zero(&self) -> bool

Whether this factorization is zero.

pub fn is_one(&self) -> bool

Whether this factorization is one.

Trait Implementations

impl Clone for Factorization

fn clone(&self) -> Factorization

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Factorization

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Factorization

fn default() -> Self

Returns the “default value” for a type.

impl From<Factorization> for Polynomial

fn from(f: Factorization) -> Self

Converts to this type from the input type.

impl From<Factorization> for Tree

fn from(f: Factorization) -> Self

Converts to this type from the input type.

impl From<Polynomial> for Factorization

fn from(p: Polynomial) -> Self

Converts to this type from the input type.

impl Ord for Factorization

fn cmp(&self, other: &Factorization) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for Factorization

fn eq(&self, other: &Factorization) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for Factorization

fn partial_cmp(&self, other: &Factorization) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Eq for Factorization

impl StructuralPartialEq for Factorization