Struct nalgebra::base::UniformNorm [−][src]
pub struct UniformNorm;
Expand description
L-infinite norm aka. Chebytchev norm aka. uniform norm aka. suppremum norm.
Trait Implementations
impl<T: SimdComplexField> Norm<T> for UniformNorm
[src]
impl<T: SimdComplexField> Norm<T> for UniformNorm
[src]fn norm<R, C, S>(&self, m: &Matrix<T, R, C, S>) -> T::SimdRealField where
R: Dim,
C: Dim,
S: Storage<T, R, C>,
[src]
fn norm<R, C, S>(&self, m: &Matrix<T, R, C, S>) -> T::SimdRealField where
R: Dim,
C: Dim,
S: Storage<T, R, C>,
[src]Apply this norm to the given matrix.
fn metric_distance<R1, C1, S1, R2, C2, S2>(
&self,
m1: &Matrix<T, R1, C1, S1>,
m2: &Matrix<T, R2, C2, S2>
) -> T::SimdRealField where
R1: Dim,
C1: Dim,
S1: Storage<T, R1, C1>,
R2: Dim,
C2: Dim,
S2: Storage<T, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
[src]
fn metric_distance<R1, C1, S1, R2, C2, S2>(
&self,
m1: &Matrix<T, R1, C1, S1>,
m2: &Matrix<T, R2, C2, S2>
) -> T::SimdRealField where
R1: Dim,
C1: Dim,
S1: Storage<T, R1, C1>,
R2: Dim,
C2: Dim,
S2: Storage<T, R2, C2>,
ShapeConstraint: SameNumberOfRows<R1, R2> + 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 UniformNorm
impl Send for UniformNorm
impl Sync for UniformNorm
impl Unpin for UniformNorm
impl UnwindSafe for UniformNorm
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]pub fn to_subset(&self) -> Option<SS>
[src]
pub fn to_subset(&self) -> Option<SS>
[src]The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
[src]
pub fn is_in_subset(&self) -> bool
[src]Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
[src]
pub fn to_subset_unchecked(&self) -> SS
[src]Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
[src]
pub fn from_subset(element: &SS) -> SP
[src]The inclusion map: converts self
to the equivalent element of its superset.
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,