Struct nyx_space::polyfit::Polynomial
source · pub struct Polynomial<const SIZE: usize> {
pub coefficients: [f64; SIZE],
}
Expand description
Polynomial is a statically allocated polynomial.
Fields§
§coefficients: [f64; SIZE]
Coefficients are orders by their power, e.g. index 0 is to the power 0, 1 is linear, 2 is quadratic, etc.
Implementations§
source§impl<const SIZE: usize> Polynomial<SIZE>
impl<const SIZE: usize> Polynomial<SIZE>
pub fn from_most_significant(coeffs: [f64; SIZE]) -> Self
sourcepub fn eval_n_deriv(&self, x: f64) -> (f64, f64)
pub fn eval_n_deriv(&self, x: f64) -> (f64, f64)
Evaluate the polynomial and its derivative at the provided position
sourcepub fn zero_power(&mut self, i: usize)
pub fn zero_power(&mut self, i: usize)
Set the i-th power of this polynomial to zero (e.g. if i=0, set the x^0 coefficient to zero, i.e. the constant part goes to zero)
sourcepub fn zero_below_tolerance(&mut self, tol: f64)
pub fn zero_below_tolerance(&mut self, tol: f64)
Set all of the coefficients below this tolerance to zero
Trait Implementations§
source§impl<const S1: usize, const S2: usize> Add<Polynomial<S1>> for Polynomial<S2>
impl<const S1: usize, const S2: usize> Add<Polynomial<S1>> for Polynomial<S2>
source§fn add(self, other: Polynomial<S1>) -> Self::Output
fn add(self, other: Polynomial<S1>) -> Self::Output
Add Self and Other, IF S2 >= S1 (else panic!)
§type Output = Polynomial<S1>
type Output = Polynomial<S1>
The resulting type after applying the
+
operator.source§impl<const SIZE: usize> AddAssign<f64> for Polynomial<SIZE>
impl<const SIZE: usize> AddAssign<f64> for Polynomial<SIZE>
source§fn add_assign(&mut self, rhs: f64)
fn add_assign(&mut self, rhs: f64)
Performs the
+=
operation. Read moresource§impl<const SIZE: usize> Clone for Polynomial<SIZE>
impl<const SIZE: usize> Clone for Polynomial<SIZE>
source§fn clone(&self) -> Polynomial<SIZE>
fn clone(&self) -> Polynomial<SIZE>
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<const SIZE: usize> Debug for Polynomial<SIZE>
impl<const SIZE: usize> Debug for Polynomial<SIZE>
source§impl<const SIZE: usize> Display for Polynomial<SIZE>
impl<const SIZE: usize> Display for Polynomial<SIZE>
source§impl<const SIZE: usize> LowerHex for Polynomial<SIZE>
impl<const SIZE: usize> LowerHex for Polynomial<SIZE>
source§impl<const SIZE: usize> Mul<Polynomial<SIZE>> for f64
impl<const SIZE: usize> Mul<Polynomial<SIZE>> for f64
In-place multiplication of a polynomial with an f64
§type Output = Polynomial<SIZE>
type Output = Polynomial<SIZE>
The resulting type after applying the
*
operator.source§impl<const SIZE: usize> Mul<f64> for &Polynomial<SIZE>
impl<const SIZE: usize> Mul<f64> for &Polynomial<SIZE>
Clone current polynomial and then multiply it with an f64
source§impl<const SIZE: usize> Mul<f64> for Polynomial<SIZE>
impl<const SIZE: usize> Mul<f64> for Polynomial<SIZE>
In-place multiplication of a polynomial with an f64
source§impl<const SIZE: usize> PartialEq<Polynomial<SIZE>> for Polynomial<SIZE>
impl<const SIZE: usize> PartialEq<Polynomial<SIZE>> for Polynomial<SIZE>
source§fn eq(&self, other: &Polynomial<SIZE>) -> bool
fn eq(&self, other: &Polynomial<SIZE>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl<const S1: usize, const S2: usize> Sub<Polynomial<S2>> for Polynomial<S1>
impl<const S1: usize, const S2: usize> Sub<Polynomial<S2>> for Polynomial<S1>
§type Output = Polynomial<S1>
type Output = Polynomial<S1>
The resulting type after applying the
-
operator.impl<const SIZE: usize> Copy for Polynomial<SIZE>
impl<const SIZE: usize> StructuralPartialEq for Polynomial<SIZE>
Auto Trait Implementations§
impl<const SIZE: usize> RefUnwindSafe for Polynomial<SIZE>
impl<const SIZE: usize> Send for Polynomial<SIZE>
impl<const SIZE: usize> Sync for Polynomial<SIZE>
impl<const SIZE: usize> Unpin for Polynomial<SIZE>
impl<const SIZE: usize> UnwindSafe for Polynomial<SIZE>
Blanket Implementations§
§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> Printing<T> for Twhere
T: Display,
impl<T> Printing<T> for Twhere T: Display,
§fn to_str(self) -> String
fn to_str(self) -> String
Method to serialize.
Decorates Vecs with square brackets and tuples with round ones.
Implementation code is in
printing.rs
. §fn to_plainstr(self) -> String
fn to_plainstr(self) -> String
Method to serialize in minimal form (space separated, no brackets)
Implementation code is in
printing.rs
.§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.