pub struct InterpolatedKernel<T> {
pub segments_x: Vec<T>,
pub segments_y: Vec<T>,
pub domain_x: (T, T),
pub domain_y: (T, T),
pub interpolators: DTensor<Interpolate2D<T>, 2>,
pub n_cells_x: usize,
pub n_cells_y: usize,
}Expand description
2D interpolation kernel for efficient evaluation at arbitrary points
This structure manages a grid of Interpolate2D objects for piecewise polynomial interpolation across the entire kernel domain.
Fields§
§segments_x: Vec<T>X-axis segment boundaries (from SVEHints)
segments_y: Vec<T>Y-axis segment boundaries (from SVEHints)
domain_x: (T, T)Domain boundaries
domain_y: (T, T)§interpolators: DTensor<Interpolate2D<T>, 2>Interpolators for each cell ((segments_x.len()-1) × (segments_y.len()-1))
n_cells_x: usizeNumber of cells (for efficiency)
n_cells_y: usizeImplementations§
Source§impl<T: CustomNumeric + Debug + Clone + 'static> InterpolatedKernel<T>
impl<T: CustomNumeric + Debug + Clone + 'static> InterpolatedKernel<T>
Sourcepub fn from_kernel_and_segments<K: CentrosymmKernel + KernelProperties>(
kernel: &K,
segments_x: Vec<T>,
segments_y: Vec<T>,
gauss_per_cell: usize,
symmetry: SymmetryType,
) -> Self
pub fn from_kernel_and_segments<K: CentrosymmKernel + KernelProperties>( kernel: &K, segments_x: Vec<T>, segments_y: Vec<T>, gauss_per_cell: usize, symmetry: SymmetryType, ) -> Self
Create InterpolatedKernel from kernel and segments
This function creates a grid of Interpolate2D objects, one for each cell defined by the segments. Each cell uses independent Gauss rules and kernel evaluation for optimal interpolation.
§Arguments
kernel- Kernel to interpolatesegments_x- X-axis segment boundariessegments_y- Y-axis segment boundariesgauss_per_cell- Number of Gauss points per cell (e.g., 4 for degree 3)symmetry- Symmetry type for kernel evaluation
§Returns
New InterpolatedKernel instance
Trait Implementations§
Source§impl<T: Clone> Clone for InterpolatedKernel<T>
impl<T: Clone> Clone for InterpolatedKernel<T>
Source§fn clone(&self) -> InterpolatedKernel<T>
fn clone(&self) -> InterpolatedKernel<T>
Returns a duplicate 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 moreAuto Trait Implementations§
impl<T> Freeze for InterpolatedKernel<T>where
T: Freeze,
impl<T> RefUnwindSafe for InterpolatedKernel<T>where
T: RefUnwindSafe,
impl<T> Send for InterpolatedKernel<T>where
T: Send,
impl<T> Sync for InterpolatedKernel<T>where
T: Sync,
impl<T> Unpin for InterpolatedKernel<T>where
T: Unpin,
impl<T> UnwindSafe for InterpolatedKernel<T>where
T: UnwindSafe + 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> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
Source§impl<T> IntoCloned<T> for T
impl<T> IntoCloned<T> for T
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.