Struct snarkvm_algorithms::fft::polynomial::SparsePolynomial

pub struct SparsePolynomial<F: Field> { /* private fields */ }

Stores a sparse polynomial in coefficient form.

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(coeffs: impl IntoIterator<Item = (usize, F)>) -> Self

Constructs a new polynomial from a list of coefficients.

pub fn coeffs(&self) -> impl Iterator<Item = (&usize, &F)>

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<'a, F: Field> AddAssign<&'a SparsePolynomial<F>> for DensePolynomial<F>

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

Performs the += operation.

impl<'a, F: PrimeField> AddAssign<&'a SparsePolynomial<F>> for SparsePolynomial<F>

fn add_assign(&mut self, other: &'a Self)

Performs the += operation.

impl<'a, F: PrimeField> AddAssign<(F, &'a SparsePolynomial<F>)> for SparsePolynomial<F>

fn add_assign(&mut self, (f, other): (F, &'a Self))

Performs the += operation.

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

fn deserialize_with_mode<R: Read>( reader: R, compress: Compress, validate: Validate ) -> Result<Self, SerializationError>

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

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

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

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

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

fn serialize_with_mode<W: Write>( &self, writer: W, compress: Compress ) -> Result<(), SerializationError>

fn serialized_size(&self, compress: Compress) -> usize

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

fn compressed_size(&self) -> usize

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

fn uncompressed_size(&self) -> usize

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

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

Returns a copy of the value.

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<'a, F: Field> From<&'a SparsePolynomial<F>> for Polynomial<'a, F>

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

Converts to this type from the input type.

impl<F: Field> From<SparsePolynomial<F>> for DensePolynomial<F>

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

Converts to this type from the input type.

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

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

Converts to this type from the input type.

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

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<'a, F: PrimeField> Mul<F> for &'a SparsePolynomial<F>

type Output = SparsePolynomial<F>

The resulting type after applying the * operator.

fn mul(self, other: F) -> Self::Output

Performs the * operation.

impl<F: PrimeField> MulAssign<F> for SparsePolynomial<F>

fn mul_assign(&mut self, other: F)

Performs the *= operation.

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: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'a, F: Field> Sub<&'a SparsePolynomial<F>> for DensePolynomial<F>

type Output = DensePolynomial<F>

The resulting type after applying the - operator.

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

Performs the - operation.

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

type Error = ()

The type returned in the event of a conversion error.

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

Performs the conversion.

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

fn check(&self) -> Result<(), SerializationError>

fn batch_check<'a>( batch: impl Iterator<Item = &'a Self> + Send ) -> Result<(), SerializationError>where Self: 'a,

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

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

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