Struct snarkvm_algorithms::fft::SparsePolynomial

pub struct SparsePolynomial<F: Field> {
    pub coeffs: Vec<(usize, F)>,
}

Stores a sparse polynomial in coefficient form.

Fields

coeffs: Vec<(usize, F)>

The coefficient a_i of x^i is stored as (i, a_i) in self.coeffs. the entries in self.coeffs are sorted in increasing order of i.

Implementations

impl<F: Field> SparsePolynomial<F>

pub fn zero() -> Self

Returns the zero polynomial.

pub fn is_zero(&self) -> bool

Checks if the given polynomial is zero.

pub fn from_coefficients_slice(coeffs: &[(usize, F)]) -> Self

Constructs a new polynomial from a list of coefficients.

pub fn from_coefficients_vec(mut coeffs: Vec<(usize, F)>) -> Self

Constructs a new polynomial from a list of coefficients.

pub fn degree(&self) -> usize

Returns the degree of the polynomial.

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

Evaluates self at the given point in the field.

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

Perform a naive n^2 multiplicatoin of self by other.

impl<F: PrimeField> SparsePolynomial<F>

pub fn evaluate_over_domain_by_ref(
    &self,
    domain: EvaluationDomain<F>
) -> Evaluations<F>

Evaluate self over domain.

pub fn evaluate_over_domain(self, domain: EvaluationDomain<F>) -> Evaluations<F>

Evaluate self over domain.

Trait Implementations

impl<F: Field> CanonicalDeserialize for SparsePolynomial<F>

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

Reads Self from reader.

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

Reads Self from reader without compression.

impl<F: Field> CanonicalSerialize for SparsePolynomial<F>

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

Serializes self into writer.

fn serialized_size(&self) -> usize

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

Serializes self into writer without compression.

fn uncompressed_size(&self) -> usize

impl<F: Clone + Field> Clone for SparsePolynomial<F>

fn clone(&self) -> SparsePolynomial<F>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<F: Field> Debug for SparsePolynomial<F>

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

Formats the value using the given formatter.

impl<F: Default + Field> Default for SparsePolynomial<F>

fn default() -> SparsePolynomial<F>

Returns the "default value" for a type.

impl<F: Eq + Field> Eq for SparsePolynomial<F>

impl<'a, F: Field> From<&'a SparsePolynomial<F>> for DenseOrSparsePolynomial<'a, F>

fn from(other: &'a SparsePolynomial<F>) -> Self

Performs the conversion.

impl<F: Field> From<SparsePolynomial<F>> for DenseOrSparsePolynomial<'_, F>

fn from(other: SparsePolynomial<F>) -> Self

Performs the conversion.

impl<F: Hash + Field> Hash for SparsePolynomial<F>

fn hash<__H: Hasher>(&self, state: &mut __H)

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> Into<DensePolynomial<F>> for SparsePolynomial<F>

fn into(self) -> DensePolynomial<F>

Performs the conversion.

impl<F: PartialEq + Field> PartialEq<SparsePolynomial<F>> for SparsePolynomial<F>

fn eq(&self, other: &SparsePolynomial<F>) -> bool

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

fn ne(&self, other: &SparsePolynomial<F>) -> bool

This method tests for !=.

impl<F: Field> StructuralEq for SparsePolynomial<F>

impl<F: Field> StructuralPartialEq for SparsePolynomial<F>

impl<F: Field> TryInto<SparsePolynomial<F>> for DenseOrSparsePolynomial<'_, F>

type Error = ()

The type returned in the event of a conversion error.

fn try_into(self) -> Result<SparsePolynomial<F>, ()>

Performs the conversion.