Struct MultiPolyFp 

pub struct MultiPolyFp {
    pub vars: Vec<ExprId>,
    pub modulus: u64,
    pub terms: BTreeMap<Vec<u32>, u64>,
}

Sparse multivariate polynomial over the prime field F_p = ℤ/pℤ.

Coefficients are stored as u64 in [0, p). The prime modulus is stored alongside the polynomial so that callers can check consistency before combining images with lift_crt.

Fields

vars: Vec<ExprId>

Variable identifiers — same ordering as the originating MultiPoly.

modulus: u64

The prime modulus p.

terms: BTreeMap<Vec<u32>, u64>

Exponent vector → coefficient in [0, p). Zero terms are never stored.

Implementations

impl MultiPolyFp

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

pub fn is_zero(&self) -> bool

pub fn total_degree(&self) -> u32

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

Trait Implementations

impl Clone for MultiPolyFp

fn clone(&self) -> MultiPolyFp

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MultiPolyFp

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

Formats the value using the given formatter.

impl Display for MultiPolyFp

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

Formats the value using the given formatter.

impl PartialEq for MultiPolyFp

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

impl StructuralPartialEq for MultiPolyFp