Struct ark_poly::polynomial::univariate::SparsePolynomial

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

Stores a sparse polynomial in coefficient form.

Implementations

impl<F: Field> SparsePolynomial<F>

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

Constructs a new polynomial from a list of coefficients.

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

Constructs a new polynomial from a list of coefficients.

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

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

impl<F: FftField> SparsePolynomial<F>

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

Evaluate self over domain.

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

Evaluate self over domain.

Trait Implementations

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

type Output = DensePolynomial<F>

The resulting type after applying the + operator.

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

Performs the + operation.

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

type Output = SparsePolynomial<F>

The resulting type after applying the + operator.

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

Performs the + operation.

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

type Output = SparsePolynomial<F>

The resulting type after applying the + operator.

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

Performs the + operation.

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

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

Performs the += operation.

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

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

Performs the += operation.

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

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> CanonicalSerialize for SparsePolynomial<F>

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: 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<F: Field> Deref for SparsePolynomial<F>

type Target = [(usize, F)]

The resulting type after dereferencing.

fn deref(&self) -> &[(usize, F)]

Dereferences the value.

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

fn deref_mut(&mut self) -> &mut [(usize, F)]

Mutably dereferences the value.

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

fn from(dense_poly: DensePolynomial<F>) -> SparsePolynomial<F>

Performs the conversion.

impl<'a, F: 'a + Field> From<SparsePolynomial<F>> for DenseOrSparsePolynomial<'a, 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.

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

type Output = SparsePolynomial<F>

The resulting type after applying the * operator.

fn mul(self, elem: F) -> SparsePolynomial<F>

Performs the * operation.

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

type Output = SparsePolynomial<F>

The resulting type after applying the - operator.

fn neg(self) -> SparsePolynomial<F>

Performs the unary - 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: &SparsePolynomial<F>) -> bool

This method tests for !=.

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

fn degree(&self) -> usize

Returns the degree of the polynomial.

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

Evaluates self at the given point in the field.

type Point = F

The type of evaluation points for this polynomial.

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

type Output = DensePolynomial<F>

The resulting type after applying the - operator.

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

Performs the - operation.

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

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

Performs the -= operation.

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

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

Performs the -= operation.

impl<'a, F: 'a + Field> TryInto<SparsePolynomial<F>> for DenseOrSparsePolynomial<'a, 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> Zero for SparsePolynomial<F>

fn zero() -> Self

Returns the zero polynomial.

fn is_zero(&self) -> bool

Checks if the given polynomial is zero.

fn set_zero(&mut self)

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

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

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

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