Struct DynamicPolynomialConfig 

pub struct DynamicPolynomialConfig<'a, S: SemiringConfig> {
    pub cfg: &'a S,
}

Configuration of the polynomial semiring $S[X]$ over the (semi)ring configured by S, with DynamicPolynomial as its element.

Implements exactly the layer its coefficients provide: [SemiringConfig] over a semiring, additionally [RingConfig] over a ring. The polynomial ring is never a field, hence no [FieldConfig].

Checked operations delegate to the coefficient config’s checked operations, so overflow behavior follows the coefficients (e.g. Int coefficients can overflow, field coefficients cannot).

Fields

cfg: &'a S

Implementations

impl<'a, S: SemiringConfig> DynamicPolynomialConfig<'a, S>

pub fn new_trimmed( &self, coeffs: impl AsRef<[S::Element]>, ) -> DynamicPolynomial<S::Element>

Create a new polynomial with the given coefficients, trimming the leading zeros.

pub fn degree(&self, poly: &DynamicPolynomial<S::Element>) -> Option<usize>

pub fn trim(&self, poly: &mut DynamicPolynomial<S::Element>)

pub fn evaluate_at_point( &self, poly: &DynamicPolynomial<S::Element>, point: &S::Element, ) -> Result<S::Element, EvaluationError>

Evaluate the polynomial at the given point using Horner’s method.

pub fn checked_evaluate_at_point( &self, poly: &DynamicPolynomial<S::Element>, point: &S::Element, ) -> Result<S::Element, EvaluationError>

Evaluate the polynomial at the given point using Horner’s method, with overflow-checked coefficient operations.

pub fn rotate_right<const D: usize>( &self, poly: &DynamicPolynomial<S::Element>, c: usize, ) -> DynamicPolynomial<S::Element>

Right-rotate the coefficient vector by c positions within width D.

The output coefficient at position i is the input coefficient at (i + c) mod D. Missing coefficients are padded with zero before the rotation.

pub fn shr<const D: usize>( &self, poly: &DynamicPolynomial<S::Element>, c: usize, ) -> DynamicPolynomial<S::Element>

Right-shift the coefficient vector by c positions within width D.

The output coefficient at position i is the input coefficient at i + c, or zero when that index is outside width D. Missing coefficients are padded with zero before the shift.

Trait Implementations

impl<'a, S: Clone + SemiringConfig> Clone for DynamicPolynomialConfig<'a, S>

fn clone(&self) -> DynamicPolynomialConfig<'a, S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a, S: Debug + SemiringConfig> Debug for DynamicPolynomialConfig<'a, S>

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

Formats the value using the given formatter.

impl<'a, S: PartialEq + SemiringConfig> PartialEq for DynamicPolynomialConfig<'a, S>

fn eq(&self, other: &DynamicPolynomialConfig<'a, S>) -> 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<'a, S: RingConfig> RingConfig for DynamicPolynomialConfig<'a, S>

fn neg(&self, x: &Self::Element) -> Self::Element

-x

fn checked_neg(&self, x: &Self::Element) -> Option<Self::Element>

-x;

fn neg_assign(&self, x: &mut Self::Element)

x = -x;

impl<'a, S: SemiringConfig> SemiringConfig for DynamicPolynomialConfig<'a, S>

fn is_zero(&self, value: &Self::Element) -> bool

fn zero(&self) -> Self::Element

fn one(&self) -> Self::Element

fn add(&self, x: &Self::Element, y: &Self::Element) -> Self::Element

x + y

fn sub(&self, x: &Self::Element, y: &Self::Element) -> Self::Element

x - y

fn mul(&self, x: &Self::Element, y: &Self::Element) -> Self::Element

x * y

fn pow_u32(&self, x: &Self::Element, y: u32) -> Self::Element

x ** y

fn checked_add( &self, x: &Self::Element, y: &Self::Element, ) -> Option<Self::Element>

x + y

fn checked_sub( &self, x: &Self::Element, y: &Self::Element, ) -> Option<Self::Element>

x - y

fn checked_mul( &self, x: &Self::Element, y: &Self::Element, ) -> Option<Self::Element>

x * y

fn checked_pow_u32(&self, x: &Self::Element, y: u32) -> Option<Self::Element>

x ** y

fn add_assign(&self, x: &mut Self::Element, y: &Self::Element)

x += y

fn sub_assign(&self, x: &mut Self::Element, y: &Self::Element)

x -= y

fn mul_assign(&self, x: &mut Self::Element, y: &Self::Element)

x *= y

fn pow_u32_assign(&self, x: &mut Self::Element, y: u32)

x **= y

fn sum<I>(&self, iter: I) -> Self::Element

where I: Iterator<Item = Self::Element>,

fn sum_refs<'a, I>(&self, iter: I) -> Self::Element

where I: Iterator<Item = &'a Self::Element> + 'a,

fn product<I>(&self, iter: I) -> Self::Element

where I: Iterator<Item = Self::Element>,

fn product_refs<'a, I>(&self, iter: I) -> Self::Element

where I: Iterator<Item = &'a Self::Element>,

impl<'a, S: SemiringConfig> SetConfig for DynamicPolynomialConfig<'a, S>

type Element = DynamicPolynomial<<S as SetConfig>::Element>

impl<'a, S: Copy + SemiringConfig> Copy for DynamicPolynomialConfig<'a, S>

impl<'a, S: Eq + SemiringConfig> Eq for DynamicPolynomialConfig<'a, S>

impl<'a, S: SemiringConfig> StructuralPartialEq for DynamicPolynomialConfig<'a, S>