Struct nyx_space::dimensions::EuclideanNorm [−][src]
pub struct EuclideanNorm;
Expand description
Euclidean norm.
Trait Implementations
Apply this norm to the given matrix.
pub fn metric_distance<R1, C1, S1, R2, C2, S2>(
&self,
m1: &Matrix<N, R1, C1, S1>,
m2: &Matrix<N, R2, C2, S2>
) -> <N as SimdComplexField>::SimdRealField where
R1: Dim,
R2: Dim,
C2: Dim,
S2: Storage<N, R2, C2>,
C1: Dim,
S1: Storage<N, R1, C1>,
ShapeConstraint: SameNumberOfRows<R1, R2>,
ShapeConstraint: SameNumberOfColumns<C1, C2>,
[src]
pub fn metric_distance<R1, C1, S1, R2, C2, S2>(
&self,
m1: &Matrix<N, R1, C1, S1>,
m2: &Matrix<N, R2, C2, S2>
) -> <N as SimdComplexField>::SimdRealField where
R1: Dim,
R2: Dim,
C2: Dim,
S2: Storage<N, R2, C2>,
C1: Dim,
S1: Storage<N, R1, C1>,
ShapeConstraint: SameNumberOfRows<R1, R2>,
ShapeConstraint: SameNumberOfColumns<C1, C2>,
[src]Use the metric induced by this norm to compute the metric distance between the two given matrices.
Auto Trait Implementations
impl RefUnwindSafe for EuclideanNorm
impl Send for EuclideanNorm
impl Sync for EuclideanNorm
impl Unpin for EuclideanNorm
impl UnwindSafe for EuclideanNorm
Blanket Implementations
Mutably borrows from an owned value. Read more
type Output = T
type Output = T
Should always be Self
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
pub fn vzip(self) -> V