Enum CommonPolynomial

pub enum CommonPolynomial {
    Constant(f64),
    Linear(f64, f64),
    Quadratic(f64, f64, f64),
}

Variants

Constant(f64)

Linear(f64, f64)

Linear(a, b) <=> f(x) = ax + b (order is FLIPPED from Polynomial structure)

Quadratic(f64, f64, f64)

Quadratic(a, b, c) <=> f(x) = ax^2 + bx + c (order is FLIPPED from Polynomial structure)

Implementations

impl CommonPolynomial

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

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

pub fn coeff_in_order(&self, order: usize) -> Result<f64, NyxError>

pub fn with_val_in_order( self, new_val: f64, order: usize, ) -> Result<Self, NyxError>

pub fn add_val_in_order( self, new_val: f64, order: usize, ) -> Result<Self, NyxError>

Trait Implementations

impl Clone for CommonPolynomial

fn clone(&self) -> CommonPolynomial

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for CommonPolynomial

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

Formats the value using the given formatter.

impl Display for CommonPolynomial

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

Prints the polynomial with the least significant coefficients first

impl PartialEq for CommonPolynomial

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

impl StructuralPartialEq for CommonPolynomial