Struct Poly 

pub struct Poly(/* private fields */);

A polynomial in R_q = Z_q[X]/(X^n + 1), stored as a centered coefficient vector for the active parameter set.

Implementations

impl Poly

pub fn from_coefficients( coefficients: impl Into<Vec<i64>>, params: &Params, ) -> Result<Self, RuneError>

Builds a polynomial from centered coefficients.

Errors

Returns RuneError::MalformedPublicKey if coefficients does not match params.n() or contains a non-canonical coefficient.

pub fn len(&self) -> usize

Returns the number of stored coefficients.

pub fn is_empty(&self) -> bool

Returns true if the polynomial has no coefficients.

pub fn coefficients(&self) -> &[i64]

Borrows the centered coefficient vector.

Trait Implementations

impl Clone for Poly

fn clone(&self) -> Poly

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Poly

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

Formats the value using the given formatter.

impl Eq for Poly

impl Index<usize> for Poly

type Output = i64

The returned type after indexing.

fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl PartialEq for Poly

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

impl Zeroize for Poly

fn zeroize(&mut self)

Zero out this object from memory using Rust intrinsics which ensure the zeroization operation is not “optimized away” by the compiler.