pub struct SparseGridBuilder<F>{ /* private fields */ }
Expand description
Builder for sparse grid interpolators
Implementations§
Source§impl<F> SparseGridBuilder<F>
impl<F> SparseGridBuilder<F>
Sourcepub fn with_bounds(self, bounds: Vec<(F, F)>) -> Self
pub fn with_bounds(self, bounds: Vec<(F, F)>) -> Self
Set the bounds for each dimension
Sourcepub fn with_max_level(self, maxlevel: usize) -> Self
pub fn with_max_level(self, maxlevel: usize) -> Self
Set the maximum level for the sparse grid
Sourcepub fn with_adaptive_refinement(self, adaptive: bool) -> Self
pub fn with_adaptive_refinement(self, adaptive: bool) -> Self
Enable adaptive refinement
Sourcepub fn with_tolerance(self, tolerance: F) -> Self
pub fn with_tolerance(self, tolerance: F) -> Self
Set the tolerance for adaptive refinement
Sourcepub fn with_initial_points(self, points: Vec<Vec<F>>) -> Self
pub fn with_initial_points(self, points: Vec<Vec<F>>) -> Self
Set initial points (if any)
Sourcepub fn build<Func>(
self,
func: Func,
) -> InterpolateResult<SparseGridInterpolator<F>>
pub fn build<Func>( self, func: Func, ) -> InterpolateResult<SparseGridInterpolator<F>>
Build the sparse grid interpolator with a function
Sourcepub fn build_from_data(
self,
points: &[Vec<F>],
values: &[F],
) -> InterpolateResult<SparseGridInterpolator<F>>
pub fn build_from_data( self, points: &[Vec<F>], values: &[F], ) -> InterpolateResult<SparseGridInterpolator<F>>
Build the sparse grid interpolator with data points
Trait Implementations§
Source§impl<F> Debug for SparseGridBuilder<F>
impl<F> Debug for SparseGridBuilder<F>
Auto Trait Implementations§
impl<F> Freeze for SparseGridBuilder<F>where
F: Freeze,
impl<F> RefUnwindSafe for SparseGridBuilder<F>where
F: RefUnwindSafe,
impl<F> Send for SparseGridBuilder<F>where
F: Send,
impl<F> Sync for SparseGridBuilder<F>where
F: Sync,
impl<F> Unpin for SparseGridBuilder<F>where
F: Unpin,
impl<F> UnwindSafe for SparseGridBuilder<F>where
F: UnwindSafe,
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> 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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
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.