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
Quadratic(f64, f64, f64)
Quadratic(a, b, c) <=> f(x) = ax^2 + bx + c (order is FLIPPED from Polynomial
Implementations§
source§impl CommonPolynomial
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§
source§impl Clone for CommonPolynomial
impl Clone for CommonPolynomial
source§fn clone(&self) -> CommonPolynomial
fn clone(&self) -> CommonPolynomial
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl Debug for CommonPolynomial
impl Debug for CommonPolynomial
source§impl Display for CommonPolynomial
impl Display for CommonPolynomial
source§impl PartialEq for CommonPolynomial
impl PartialEq for CommonPolynomial
impl Copy for CommonPolynomial
impl StructuralPartialEq for CommonPolynomial
Auto Trait Implementations§
impl Freeze for CommonPolynomial
impl RefUnwindSafe for CommonPolynomial
impl Send for CommonPolynomial
impl Sync for CommonPolynomial
impl Unpin for CommonPolynomial
impl UnwindSafe for CommonPolynomial
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.