Struct nalgebra::base::EuclideanNorm

source · [−]

pub struct EuclideanNorm;

Expand description

Euclidean norm.

Trait Implementations

source

impl<T: SimdComplexField> Norm<T> for EuclideanNorm

source

fn norm<R, C, S>(&self, m: &Matrix<T, R, C, S>) -> T::SimdRealField where
 R: Dim,
 C: Dim,
 S: Storage<T, R, C>,

Apply this norm to the given matrix.

source

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>,

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

source

impl<T> Any for T where
T: 'static + ?Sized,

source

pub fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

pub fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

pub fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

pub fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

pub fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T> Same<T> for T

type Output = T

Should always be Self

source

impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,

source

pub fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more

source

pub fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).

source

pub fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.

source

pub fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

pub fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

pub fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

source

impl<V, T> VZip<V> for T where
V: MultiLane<T>,

source

Struct nalgebra::base::EuclideanNorm

Trait Implementations

impl<T: SimdComplexField> Norm<T> for EuclideanNorm

fn norm<R, C, S>(&self, m: &Matrix<T, R, C, S>) -> T::SimdRealField where
    R: Dim,
    C: Dim,
    S: Storage<T, R, C>,

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

impl<T> Any for T where
T: 'static + ?Sized,

pub fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where
T: ?Sized,

pub fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where
T: ?Sized,

pub fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

pub fn from(t: T) -> T

impl<T, U> Into<U> for T where
U: From<T>,

pub fn into(self) -> U

impl<T> Same<T> for T

type Output = T

impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,

pub fn to_subset(&self) -> Option<SS>

pub fn is_in_subset(&self) -> bool

pub fn to_subset_unchecked(&self) -> SS

pub fn from_subset(element: &SS) -> SP

impl<T, U> TryFrom<U> for T where
U: Into<T>,

type Error = Infallible

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<V, T> VZip<V> for T where
V: MultiLane<T>,

pub fn vzip(self) -> V

Struct nalgebra::base::EuclideanNorm

Trait Implementations

impl<T: SimdComplexField> Norm<T> for EuclideanNorm

fn norm<R, C, S>(&self, m: &Matrix<T, R, C, S>) -> T::SimdRealField where R: Dim, C: Dim, S: Storage<T, R, C>,

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>,

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

impl<T> Any for T where T: 'static + ?Sized,

pub fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

pub fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

pub fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

pub fn from(t: T) -> T

impl<T, U> Into<U> for T where U: From<T>,

pub fn into(self) -> U

impl<T> Same<T> for T

type Output = T

impl<SS, SP> SupersetOf<SS> for SP where SS: SubsetOf<SP>,

pub fn to_subset(&self) -> Option<SS>

pub fn is_in_subset(&self) -> bool

pub fn to_subset_unchecked(&self) -> SS

pub fn from_subset(element: &SS) -> SP

impl<T, U> TryFrom<U> for T where U: Into<T>,

type Error = Infallible

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<V, T> VZip<V> for T where V: MultiLane<T>,

pub fn vzip(self) -> V

fn norm<R, C, S>(&self, m: &Matrix<T, R, C, S>) -> T::SimdRealField where
R: Dim,
C: Dim,
S: Storage<T, R, C>,

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>,

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<T, U> Into<U> for T where
U: From<T>,

impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

impl<V, T> VZip<V> for T where
V: MultiLane<T>,