Struct MultiPoly 

pub struct MultiPoly {
    pub vars: Vec<ExprId>,
    pub terms: BTreeMap<Vec<u32>, Integer>,
}

Sparse multivariate polynomial over ℤ.

vars fixes the variable ordering; the exponent key [e0, e1, …] means vars[0]^e0 * vars[1]^e1 * …. Trailing zeros in the exponent vector are always stripped so structural equality reduces to map equality.

Fields

vars: Vec<ExprId>

terms: BTreeMap<Vec<u32>, Integer>

Implementations

impl MultiPoly

pub fn factor_z(&self) -> Result<MultiPolyFactorization, FactorError>

Factor over ℤ[𝑥₁,…] using FLINT fmpz_mpoly_factor.

impl MultiPoly

pub fn zero(vars: Vec<ExprId>) -> Self

pub fn constant(vars: Vec<ExprId>, c: i64) -> Self

pub fn from_symbolic( expr: ExprId, vars: Vec<ExprId>, pool: &ExprPool, ) -> Result<Self, ConversionError>

pub fn is_zero(&self) -> bool

pub fn total_degree(&self) -> u32

pub fn integer_content(&self) -> Integer

GCD of all integer coefficients (content). Returns 0 for the zero polynomial.

pub fn primitive_part(&self) -> Self

Primitive part: divide all coefficients by the integer content.

pub fn compatible_with(&self, other: &Self) -> bool

Returns true if both polynomials have the same variable list and can be combined.

pub fn gcd(&self, other: &Self) -> Option<Self>

Compute the GCD of two compatible multivariate polynomials using FLINT.

Returns None if the polynomials have different variable lists, if either is zero, or if FLINT’s GCD algorithm fails (which is exceedingly rare).

The returned GCD is normalised so that its leading coefficient is positive.

pub fn to_expr(&self, pool: &ExprPool) -> ExprId

Convert back to a symbolic expression in the given pool.

Produces a canonical sum-of-products: each term is coeff * var[0]^e0 * var[1]^e1 * …. The zero polynomial maps to Integer(0).

pub fn div_integer(&self, d: &Integer) -> Self

Divide all coefficients by d (exact division — caller ensures divisibility).

Trait Implementations

impl Add for MultiPoly

type Output = MultiPoly

The resulting type after applying the + operator.

fn add(self, rhs: Self) -> Self

Performs the + operation.

impl Clone for MultiPoly

fn clone(&self) -> MultiPoly

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MultiPoly

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

Formats the value using the given formatter.

impl Display for MultiPoly

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

Formats the value using the given formatter.

impl Mul for MultiPoly

type Output = MultiPoly

The resulting type after applying the * operator.

fn mul(self, rhs: Self) -> Self

Performs the * operation.

impl Neg for MultiPoly

type Output = MultiPoly

The resulting type after applying the - operator.

fn neg(self) -> Self

Performs the unary - operation.

impl PartialEq for MultiPoly

fn eq(&self, other: &MultiPoly) -> 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 Sub for MultiPoly

type Output = MultiPoly

The resulting type after applying the - operator.

fn sub(self, rhs: Self) -> Self

Performs the - operation.

impl Eq for MultiPoly

impl StructuralPartialEq for MultiPoly