Struct Polynomial 

pub struct Polynomial {
    pub coeffs: Vec<u64>,
}

A polynomial represented by its coefficients (degree d has d+1 coefficients).

Fields

coeffs: Vec<u64>

Coefficients from lowest degree to highest.

Implementations

impl Polynomial

pub fn new(coeffs: Vec<u64>) -> Self

Create a new polynomial from coefficients.

pub fn zero() -> Self

Create the zero polynomial.

pub fn evaluate(&self, x: u64) -> u64

Evaluate the polynomial at a given point.

pub fn degree(&self) -> usize

Degree of the polynomial.

pub fn len(&self) -> usize

Number of coefficients.

pub fn is_empty(&self) -> bool

Whether the polynomial is empty.

Trait Implementations

impl Clone for Polynomial

fn clone(&self) -> Polynomial

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Polynomial

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

Formats the value using the given formatter.

impl PartialEq for Polynomial

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