Struct PolynomialVector 

pub struct PolynomialVector<F> { /* private fields */ }

Implementations

impl<F: FieldNTT> PolynomialVector<F>

pub fn evaluate(self) -> EvaluationVector<F>

Evaluate each polynomial in this vector over all points in an interpolation domain.

impl<F> PolynomialVector<F>

pub fn coefficients_up_to(&self, n: usize) -> impl Iterator<Item = &[F]>

Iterate over up to n rows of this vector.

For example, given polynomials:

a0 + a1 X + a2 X^2 + … b0 + b1 X + b2 X^2 + …

This will return:

a0 b0 a1 b1 …

up to n times.

Trait Implementations

impl<F: Clone> Clone for PolynomialVector<F>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<F: Debug> Debug for PolynomialVector<F>

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

Formats the value using the given formatter.

impl<F: PartialEq> PartialEq for PolynomialVector<F>

fn eq(&self, other: &PolynomialVector<F>) -> 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<F> StructuralPartialEq for PolynomialVector<F>