pub struct BarycentricInterpolation {
pub nodes: Vec<f64>,
pub values: Vec<f64>,
pub weights: Vec<f64>,
}Expand description
Barycentric interpolation (Berrut second form).
Fields§
§nodes: Vec<f64>Interpolation nodes.
values: Vec<f64>Function values at nodes.
weights: Vec<f64>Barycentric weights.
Implementations§
Auto Trait Implementations§
impl Freeze for BarycentricInterpolation
impl RefUnwindSafe for BarycentricInterpolation
impl Send for BarycentricInterpolation
impl Sync for BarycentricInterpolation
impl Unpin for BarycentricInterpolation
impl UnsafeUnpin for BarycentricInterpolation
impl UnwindSafe for BarycentricInterpolation
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<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.