Struct Polynomial 

pub struct Polynomial { /* private fields */ }

A polynomial whose coefficients are stored in ascending power order.

coefficients[i] is the coefficient for x^i. For example, 3 + 2x + x^2 is represented as vec![3.0, 2.0, 1.0].

The zero polynomial is represented as an empty coefficient vector.

Implementations

impl Polynomial

pub fn new(coefficients: Vec<f64>) -> Polynomial

Creates a polynomial from coefficients in ascending power order.

Trailing zero coefficients are trimmed. The zero polynomial is stored as an empty coefficient vector.

pub fn constant(value: f64) -> Polynomial

Creates a constant polynomial.

pub fn zero() -> Polynomial

Creates the zero polynomial.

pub fn one() -> Polynomial

Creates the constant polynomial 1.

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

Returns the coefficients in ascending power order.

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

Returns the polynomial degree, or None for the zero polynomial.

pub fn leading_coefficient(&self) -> Option<f64>

Returns the leading coefficient, or None for the zero polynomial.

pub fn is_zero(&self) -> bool

Returns true when the polynomial is the zero polynomial.

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

Evaluates the polynomial at x using Horner’s method.

pub fn derivative(&self) -> Polynomial

Returns the derivative of the polynomial.

pub fn nth_derivative(&self, n: usize) -> Polynomial

Returns the nth derivative of the polynomial.

pub fn integral(&self, constant: f64) -> Polynomial

Returns the indefinite integral with the provided constant term.

pub fn real_roots_degree_1_or_2(&self) -> Option<Vec<f64>>

Returns real roots for degree 0, 1, or 2 polynomials.

Higher-degree polynomials return None. Constant and zero polynomials return Some(vec![]).

Trait Implementations

impl Add for Polynomial

type Output = Polynomial

The resulting type after applying the + operator.

fn add(self, rhs: Polynomial) -> <Polynomial as Add>::Output

Performs the + operation.

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<(), Error>

Formats the value using the given formatter.

impl Div<f64> for Polynomial

type Output = Polynomial

The resulting type after applying the / operator.

fn div(self, rhs: f64) -> <Polynomial as Div<f64>>::Output

Performs the / operation.

impl Mul<f64> for Polynomial

type Output = Polynomial

The resulting type after applying the * operator.

fn mul(self, rhs: f64) -> <Polynomial as Mul<f64>>::Output

Performs the * operation.

impl Mul for Polynomial

type Output = Polynomial

The resulting type after applying the * operator.

fn mul(self, rhs: Polynomial) -> <Polynomial as Mul>::Output

Performs the * operation.

impl Neg for Polynomial

type Output = Polynomial

The resulting type after applying the - operator.

fn neg(self) -> <Polynomial as Neg>::Output

Performs the unary - operation.

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 Sub for Polynomial

type Output = Polynomial

The resulting type after applying the - operator.

fn sub(self, rhs: Polynomial) -> <Polynomial as Sub>::Output

Performs the - operation.

impl StructuralPartialEq for Polynomial