Struct ark_poly::polynomial::multivariate::SparsePolynomial

pub struct SparsePolynomial<F: Field, T: Term> {
    pub num_vars: usize,
    pub terms: Vec<(F, T)>,
}

Stores a sparse multivariate polynomial in coefficient form.

Fields

num_vars: usize

The number of variables the polynomial supports

terms: Vec<(F, T)>

List of each term along with its coefficient

Trait Implementations

impl<'a, 'b, F: Field, T: Term> Add<&'a SparsePolynomial<F, T>> for &'b SparsePolynomial<F, T>

type Output = SparsePolynomial<F, T>

The resulting type after applying the + operator.

fn add(self, other: &'a SparsePolynomial<F, T>) -> SparsePolynomial<F, T>

Performs the + operation.

impl<F: Field, T: Term> Add<SparsePolynomial<F, T>> for SparsePolynomial<F, T>

type Output = SparsePolynomial<F, T>

The resulting type after applying the + operator.

fn add(self, other: SparsePolynomial<F, T>) -> Self

Performs the + operation.

impl<'a, 'b, F: Field, T: Term> AddAssign<&'a SparsePolynomial<F, T>> for SparsePolynomial<F, T>

fn add_assign(&mut self, other: &'a SparsePolynomial<F, T>)

Performs the += operation.

impl<'a, 'b, F: Field, T: Term> AddAssign<(F, &'a SparsePolynomial<F, T>)> for SparsePolynomial<F, T>

fn add_assign(&mut self, (f, other): (F, &'a SparsePolynomial<F, T>))

Performs the += operation.

impl<F: Field, T: Term> CanonicalDeserialize for SparsePolynomial<F, T>

fn deserialize<R: Read>(reader: R) -> Result<Self, SerializationError>

Reads Self from reader.

fn deserialize_uncompressed<R: Read>(
    reader: R
) -> Result<Self, SerializationError>

Reads Self from reader without compression.

fn deserialize_unchecked<R: Read>(reader: R) -> Result<Self, SerializationError>

Reads self from reader without compression, and without performing validity checks. Should be used only when the input is trusted.

impl<F: Field, T: Term> CanonicalSerialize for SparsePolynomial<F, T>

fn serialize<W: Write>(&self, writer: W) -> Result<(), SerializationError>

Serializes self into writer. It is left up to a particular type for how it strikes the serialization efficiency vs compression tradeoff. For standard types (e.g. bool, lengths, etc.) typically an uncompressed form is used, whereas for algebraic types compressed forms are used.

fn serialized_size(&self) -> usize

fn serialize_uncompressed<W: Write>(
    &self,
    writer: W
) -> Result<(), SerializationError>

Serializes self into writer without compression.

fn serialize_unchecked<W: Write>(
    &self,
    writer: W
) -> Result<(), SerializationError>

Serializes self into writer without compression, and without performing validity checks. Should be used only when there is no danger of adversarial manipulation of the output.

fn uncompressed_size(&self) -> usize

impl<F: Field, T: Term> Clone for SparsePolynomial<F, T> where
    F: Clone,
    T: Clone, 

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<F: Field, T: Term> Debug for SparsePolynomial<F, T>

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

Formats the value using the given formatter.

impl<F: Field, T: Term> Default for SparsePolynomial<F, T> where
    F: Default,
    T: Default, 

fn default() -> Self

Returns the “default value” for a type.

impl<F: Field, T: Term> Eq for SparsePolynomial<F, T> where
    F: Eq,
    T: Eq, 

impl<F: Field, T: Term> Hash for SparsePolynomial<F, T> where
    F: Hash,
    T: Hash, 

fn hash<__HFT>(&self, __state: &mut __HFT) where
    __HFT: Hasher, 

Feeds this value into the given Hasher.

pub fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl<F: Field> MVPolynomial<F> for SparsePolynomial<F, SparseTerm>

fn num_vars(&self) -> usize

Returns the number of variables in self

fn rand<R: Rng>(d: usize, l: usize, rng: &mut R) -> Self

Outputs an l-variate polynomial which is the sum of l d-degree univariate polynomials where each coefficient is sampled uniformly at random.

type Term = SparseTerm

The type of the terms of self

fn from_coefficients_vec(num_vars: usize, terms: Vec<(F, SparseTerm)>) -> Self

Constructs a new polynomial from a list of tuples of the form (coeff, Self::Term)

fn terms(&self) -> &[(F, Self::Term)]

Returns the terms of a self as a list of tuples of the form (coeff, Self::Term)

fn from_coefficients_slice(num_vars: usize, terms: &[(F, Self::Term)]) -> Self

Constructs a new polynomial from a list of tuples of the form (Self::Term, coeff)

impl<F: Field, T: Term> Neg for SparsePolynomial<F, T>

type Output = SparsePolynomial<F, T>

The resulting type after applying the - operator.

fn neg(self) -> SparsePolynomial<F, T>

Performs the unary - operation.

impl<F: Field, T: Term> PartialEq<SparsePolynomial<F, T>> for SparsePolynomial<F, T> where
    F: PartialEq,
    T: PartialEq, 

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

This method tests for self and other values to be equal, and is used by ==.

#[must_use]pub fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<F: Field> Polynomial<F> for SparsePolynomial<F, SparseTerm>

type Point = Vec<F>

The type of evaluation points for this polynomial.

fn degree(&self) -> usize

Returns the total degree of the polynomial

fn evaluate(&self, point: &Vec<F>) -> F

Evaluates self at the given point in Self::Point.

impl<'a, 'b, F: Field, T: Term> Sub<&'a SparsePolynomial<F, T>> for &'b SparsePolynomial<F, T>

type Output = SparsePolynomial<F, T>

The resulting type after applying the - operator.

fn sub(self, other: &'a SparsePolynomial<F, T>) -> SparsePolynomial<F, T>

Performs the - operation.

impl<'a, 'b, F: Field, T: Term> SubAssign<&'a SparsePolynomial<F, T>> for SparsePolynomial<F, T>

fn sub_assign(&mut self, other: &'a SparsePolynomial<F, T>)

Performs the -= operation.

impl<F: Field, T: Term> Zero for SparsePolynomial<F, T>

fn zero() -> Self

Returns the zero polynomial.

fn is_zero(&self) -> bool

Checks if the given polynomial is zero.

pub fn set_zero(&mut self)

Sets self to the additive identity element of Self, 0.