pub struct SumKernel<K1: Kernel, K2: Kernel> {
pub kernel1: K1,
pub kernel2: K2,
}Expand description
Sum of two kernels: k(x, x’) = k1(x, x’) + k2(x, x’)
Fields§
§kernel1: K1§kernel2: K2Implementations§
Trait Implementations§
Source§impl<K1: Kernel, K2: Kernel> Kernel for SumKernel<K1, K2>
impl<K1: Kernel, K2: Kernel> Kernel for SumKernel<K1, K2>
Source§fn compute(&self, x1: &ArrayView1<'_, f64>, x2: &ArrayView1<'_, f64>) -> f64
fn compute(&self, x1: &ArrayView1<'_, f64>, x2: &ArrayView1<'_, f64>) -> f64
Compute covariance between two points
Source§fn get_params(&self) -> Vec<f64>
fn get_params(&self) -> Vec<f64>
Get kernel parameters (for optimization)
Source§fn set_params(&mut self, params: &[f64])
fn set_params(&mut self, params: &[f64])
Set kernel parameters
Source§fn compute_matrix(&self, x: &Array2<f64>) -> Array2<f64>
fn compute_matrix(&self, x: &Array2<f64>) -> Array2<f64>
Compute covariance matrix for a set of points
Auto Trait Implementations§
impl<K1, K2> Freeze for SumKernel<K1, K2>
impl<K1, K2> RefUnwindSafe for SumKernel<K1, K2>where
K1: RefUnwindSafe,
K2: RefUnwindSafe,
impl<K1, K2> Send for SumKernel<K1, K2>
impl<K1, K2> Sync for SumKernel<K1, K2>
impl<K1, K2> Unpin for SumKernel<K1, K2>
impl<K1, K2> UnsafeUnpin for SumKernel<K1, K2>where
K1: UnsafeUnpin,
K2: UnsafeUnpin,
impl<K1, K2> UnwindSafe for SumKernel<K1, K2>where
K1: UnwindSafe,
K2: 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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
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.