pub struct PPSpline<T> { /* private fields */ }Expand description
A piecewise polynomial spline of given order and knot sequence.
Implementations§
Source§impl<T> PPSpline<T>
 
impl<T> PPSpline<T>
Sourcepub fn new(k: usize, t: Vec<f64>, c: Option<Vec<T>>) -> Self
 
pub fn new(k: usize, t: Vec<f64>, c: Option<Vec<T>>) -> Self
Create a PPSpline from its order k, knot sequence t and optional spline coefficents c.
pub fn ppdnev_single(&self, x: &f64, m: usize) -> Result<T, PyErr>
pub fn csolve( &mut self, tau: &[f64], y: &[T], left_n: usize, right_n: usize, allow_lsq: bool, ) -> Result<(), PyErr>
pub fn bspldnev(&self, x: &[f64], i: &usize, m: &usize) -> Vec<f64>
pub fn bsplmatrix( &self, tau: &[f64], left_n: usize, right_n: usize, ) -> Array2<f64>
Trait Implementations§
Source§impl<'de, T> Deserialize<'de> for PPSpline<T>where
    T: Deserialize<'de>,
 
impl<'de, T> Deserialize<'de> for PPSpline<T>where
    T: Deserialize<'de>,
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
    __D: Deserializer<'de>,
 
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
    __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl NumberMapping for PPSpline<Dual>
 
impl NumberMapping for PPSpline<Dual>
Source§impl NumberMapping for PPSpline<Dual2>
 
impl NumberMapping for PPSpline<Dual2>
Source§impl NumberMapping for PPSpline<f64>
 
impl NumberMapping for PPSpline<f64>
Auto Trait Implementations§
impl<T> Freeze for PPSpline<T>
impl<T> RefUnwindSafe for PPSpline<T>where
    T: RefUnwindSafe,
impl<T> Send for PPSpline<T>where
    T: Send,
impl<T> Sync for PPSpline<T>where
    T: Sync,
impl<T> Unpin for PPSpline<T>
impl<T> UnwindSafe for PPSpline<T>where
    T: RefUnwindSafe,
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§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<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.