Struct Polynomial 

pub struct Polynomial { /* private fields */ }

A polynomial is a sum of monomials with integer coefficients.

Example: 2x^2 + 3xy - 5 is {x^2: 2, xy: 3, 1: -5}

Uses BTreeMap for deterministic ordering (canonical form).

Implementations

impl Polynomial

pub fn zero() -> Self

The additive identity (zero polynomial).

Represented as an empty map of terms.

pub fn constant(c: i64) -> Self

Create a constant polynomial from an integer.

Returns the zero polynomial if c is 0.

pub fn var(index: i64) -> Self

A single variable: x_i

pub fn add(&self, other: &Polynomial) -> Polynomial

Add two polynomials

pub fn neg(&self) -> Polynomial

Negate a polynomial

pub fn sub(&self, other: &Polynomial) -> Polynomial

Subtract two polynomials

pub fn mul(&self, other: &Polynomial) -> Polynomial

Multiply two polynomials

pub fn canonical_eq(&self, other: &Polynomial) -> bool

Check equality in canonical form. Since BTreeMap maintains sorted order and we remove zeros, structural equality is semantic equality.

Trait Implementations

impl Clone for Polynomial

fn clone(&self) -> Polynomial

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Polynomial

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

Formats the value using the given formatter.

impl PartialEq for Polynomial

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

impl StructuralPartialEq for Polynomial