Struct NatEvaluatedPoly 

pub struct NatEvaluatedPoly<F> {
    pub evaluations: Vec<F>,
}

Polynomial evaluated on 0, 1, 2, ….

Fields

evaluations: Vec<F>

Evaluations on P(0), P(1), P(2), …

Implementations

impl<F> NatEvaluatedPoly<F>

pub const fn new(evaluations: Vec<F>) -> Self

Trait Implementations

impl<F: Clone> Clone for NatEvaluatedPoly<F>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<F: Debug> Debug for NatEvaluatedPoly<F>

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

Formats the value using the given formatter.

impl<F: FromPrimitiveWithConfig> EvaluatablePolynomial<F, F> for NatEvaluatedPoly<F>

fn evaluate_at_point( &self, point: &Self::EvaluationPoint, ) -> Result<F, EvaluationError>

Interpolate the unique univariate polynomial of degree at most evaluations.len()-1 passing through the y-values in evaluations at x = 0,…, evaluations.len()-1 and evaluate this polynomial at point. In other words, efficiently compute $\sum_{i=0}^{len\ evaluations - 1} evaluations[i] * (\prod_{j!=i} (\text{point} - j)/(i-j))$.

type EvaluationPoint = F

The type of points a polynomial can be evaluated on. For univariate polynomials this typically is Out, for multivariate this is [Out].

impl<F: PartialEq> PartialEq for NatEvaluatedPoly<F>

fn eq(&self, other: &NatEvaluatedPoly<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: Clone> Polynomial<F> for NatEvaluatedPoly<F>

const DEGREE_BOUND: usize = usize::MAX

impl<F> StructuralPartialEq for NatEvaluatedPoly<F>