Struct DynamicPolynomialFS 

pub struct DynamicPolynomialFS<R: FixedSemiring> {
    pub coeffs: Vec<R>,
}

Polynomials of dynamic degree. The implementation is tailored to work with FixedSemirings. To be used in UAIR and PIOP where ZIP+ degree bound is not observed anymore.

Note that operations involving dynamic polynomials do not trim leading zeros meaning one can end up with unequal objects of the type DynamicPoly<R> that represent equal polynomials, therefore trim has to be called before checking equality.

Fields

coeffs: Vec<R>

Implementations

impl<R: FixedSemiring> DynamicPolynomialFS<R>

pub fn new_trimmed(coeffs: impl AsRef<[R]>) -> Self

Create a new polynomial with the given coefficients.

pub fn new(coeffs: impl AsRef<[R]>) -> Self

pub fn degree(&self) -> Option<usize>

pub fn trim(&mut self)

Trait Implementations

impl<R: FixedSemiring> Add<&DynamicPolynomialFS<R>> for DynamicPolynomialFS<R>

type Output = DynamicPolynomialFS<R>

The resulting type after applying the + operator.

fn add(self, rhs: &Self) -> Self::Output

Performs the + operation.

impl<R: FixedSemiring> Add for DynamicPolynomialFS<R>

type Output = DynamicPolynomialFS<R>

The resulting type after applying the + operator.

fn add(self, rhs: Self) -> Self::Output

Performs the + operation.

impl<R: FixedSemiring> AddAssign<&DynamicPolynomialFS<R>> for DynamicPolynomialFS<R>

fn add_assign(&mut self, rhs: &Self)

Performs the += operation.

impl<R: FixedSemiring> AddAssign for DynamicPolynomialFS<R>

fn add_assign(&mut self, rhs: Self)

Performs the += operation.

impl<R: FixedSemiring> CheckedAdd for DynamicPolynomialFS<R>

fn checked_add(&self, rhs: &Self) -> Option<Self>

Adds two numbers, checking for overflow. If overflow happens, None is returned.

impl<R: FixedSemiring> CheckedMul for DynamicPolynomialFS<R>

fn checked_mul(&self, rhs: &Self) -> Option<Self>

Multiplies two numbers, checking for underflow or overflow. If underflow or overflow happens, None is returned.

impl<R: FixedSemiring + Ring> CheckedNeg for DynamicPolynomialFS<R>

fn checked_neg(&self) -> Option<Self>

Negates a number, returning None for results that can’t be represented, like signed MIN values that can’t be positive, or non-zero unsigned values that can’t be negative.

impl<R: FixedSemiring> CheckedSub for DynamicPolynomialFS<R>

fn checked_sub(&self, rhs: &Self) -> Option<Self>

Subtracts two numbers, checking for underflow. If underflow happens, None is returned.

impl<R: Clone + FixedSemiring> Clone for DynamicPolynomialFS<R>

fn clone(&self) -> DynamicPolynomialFS<R>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<R: FixedSemiring> ConstZero for DynamicPolynomialFS<R>

const ZERO: Self

The additive identity element of Self, 0.

impl<R: Debug + FixedSemiring> Debug for DynamicPolynomialFS<R>

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

Formats the value using the given formatter.

impl<R: Default + FixedSemiring> Default for DynamicPolynomialFS<R>

fn default() -> DynamicPolynomialFS<R>

Returns the “default value” for a type.

impl<R: FixedSemiring> Display for DynamicPolynomialFS<R>

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

Formats the value using the given formatter.

impl<R: FixedSemiring> EvaluatablePolynomial<R, R> for DynamicPolynomialFS<R>

type EvaluationPoint = R

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

fn evaluate_at_point(&self, point: &R) -> Result<R, EvaluationError>

Evaluates the polynomial at the given point.

impl<const DEGREE_PLUS_ONE: usize> From<BinaryU64Poly<DEGREE_PLUS_ONE>> for DynamicPolynomialFS<Boolean>

fn from(binary_poly: BinaryPoly<DEGREE_PLUS_ONE>) -> Self

Converts to this type from the input type.

impl<R: FixedSemiring, const DEGREE_PLUS_ONE: usize> From<DensePolynomial<R, DEGREE_PLUS_ONE>> for DynamicPolynomialFS<R>

fn from(dense_poly: DensePolynomial<R, DEGREE_PLUS_ONE>) -> Self

Converts to this type from the input type.

impl<R: FixedSemiring> From<Vec<R>> for DynamicPolynomialFS<R>

fn from(value: Vec<R>) -> Self

Converts to this type from the input type.

impl<R: Hash + FixedSemiring> Hash for DynamicPolynomialFS<R>

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<R: FixedSemiring> Mul<&DynamicPolynomialFS<R>> for DynamicPolynomialFS<R>

type Output = DynamicPolynomialFS<R>

The resulting type after applying the * operator.

fn mul(self, rhs: &Self) -> Self::Output

Performs the * operation.

impl<'a, R: FixedSemiring> Mul for &'a DynamicPolynomialFS<R>

type Output = DynamicPolynomialFS<R>

The resulting type after applying the * operator.

fn mul(self, rhs: Self) -> Self::Output

Performs the * operation.

impl<R: FixedSemiring> Mul for DynamicPolynomialFS<R>

type Output = DynamicPolynomialFS<R>

The resulting type after applying the * operator.

fn mul(self, rhs: Self) -> Self::Output

Performs the * operation.

impl<R: FixedSemiring> MulAssign<&DynamicPolynomialFS<R>> for DynamicPolynomialFS<R>

fn mul_assign(&mut self, rhs: &Self)

Performs the *= operation.

impl<R: FixedSemiring> MulAssign for DynamicPolynomialFS<R>

fn mul_assign(&mut self, rhs: Self)

Performs the *= operation.

impl<R: FixedSemiring + Ring> Neg for DynamicPolynomialFS<R>

type Output = DynamicPolynomialFS<R>

The resulting type after applying the - operator.

fn neg(self) -> Self::Output

Performs the unary - operation.

impl<R: FixedSemiring> One for DynamicPolynomialFS<R>

fn one() -> Self

Returns the multiplicative identity element of Self, 1.

fn set_one(&mut self)

Sets self to the multiplicative identity element of Self, 1.

fn is_one(&self) -> bool

where Self: PartialEq,

Returns true if self is equal to the multiplicative identity.

impl<R: PartialEq + FixedSemiring> PartialEq for DynamicPolynomialFS<R>

fn eq(&self, other: &DynamicPolynomialFS<R>) -> 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<R: FixedSemiring> Polynomial<R> for DynamicPolynomialFS<R>

const DEGREE_BOUND: usize = usize::MAX

impl<R, F> ProjectableToField<F> for DynamicPolynomialFS<R>

where R: FixedSemiring, F: PrimeField + for<'a> FromWithConfig<&'a R> + for<'a> MulByScalar<&'a F> + 'static,

fn prepare_projection( sampled_value: &F, ) -> impl Fn(&DynamicPolynomialFS<R>) -> F + Send + Sync + 'static

Prepare a projection function that will project the current type to a prime field using the given sampled value.

impl<R: FixedSemiring> Sub<&DynamicPolynomialFS<R>> for DynamicPolynomialFS<R>

type Output = DynamicPolynomialFS<R>

The resulting type after applying the - operator.

fn sub(self, rhs: &Self) -> Self::Output

Performs the - operation.

impl<R: FixedSemiring> Sub for DynamicPolynomialFS<R>

type Output = DynamicPolynomialFS<R>

The resulting type after applying the - operator.

fn sub(self, rhs: Self) -> Self::Output

Performs the - operation.

impl<R: FixedSemiring> SubAssign<&DynamicPolynomialFS<R>> for DynamicPolynomialFS<R>

fn sub_assign(&mut self, rhs: &Self)

Performs the -= operation.

impl<R: FixedSemiring> SubAssign for DynamicPolynomialFS<R>

fn sub_assign(&mut self, rhs: Self)

Performs the -= operation.

impl<R: FixedSemiring> Zero for DynamicPolynomialFS<R>

fn zero() -> Self

Returns the additive identity element of Self, 0.

fn is_zero(&self) -> bool

Returns true if self is equal to the additive identity.

fn set_zero(&mut self)

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

impl<R: Eq + FixedSemiring> Eq for DynamicPolynomialFS<R>

impl<R: FixedSemiring + Ring> Ring for DynamicPolynomialFS<R>

impl<R: FixedSemiring> Semiring for DynamicPolynomialFS<R>

impl<R: FixedSemiring> StructuralPartialEq for DynamicPolynomialFS<R>