pub struct LpDist<F: Float>(pub F);
Expand description
L-p or Minkowsky distance
Tuple Fields§
§0: F
Implementations§
Trait Implementations§
source§impl<F: Float> Distance<F> for LpDist<F>
impl<F: Float> Distance<F> for LpDist<F>
source§fn distance<D: Dimension>(
&self,
a: ArrayView<'_, F, D>,
b: ArrayView<'_, F, D>
) -> F
fn distance<D: Dimension>( &self, a: ArrayView<'_, F, D>, b: ArrayView<'_, F, D> ) -> F
Computes the distance between two points. For most spatial algorithms to work correctly,
this metric must satisfy the Triangle Inequality. Read more
source§fn rdistance<D: Dimension>(
&self,
a: ArrayView<'_, F, D>,
b: ArrayView<'_, F, D>
) -> F
fn rdistance<D: Dimension>( &self, a: ArrayView<'_, F, D>, b: ArrayView<'_, F, D> ) -> F
A faster version of the distance metric that keeps the order of the distance function. That
is,
dist(a, b) > dist(c, d)
implies rdist(a, b) > rdist(c, d)
. For most algorithms this
is the same as distance
. Unlike distance
, this function does not need to satisfy
the Triangle Inequality.source§fn rdist_to_dist(&self, rdist: F) -> F
fn rdist_to_dist(&self, rdist: F) -> F
Converts the result of
rdistance
to distance
source§fn dist_to_rdist(&self, dist: F) -> F
fn dist_to_rdist(&self, dist: F) -> F
Converts the result of
distance
to rdistance
source§impl<F: PartialEq + Float> PartialEq for LpDist<F>
impl<F: PartialEq + Float> PartialEq for LpDist<F>
impl<F: Float> StructuralPartialEq for LpDist<F>
Auto Trait Implementations§
impl<F> RefUnwindSafe for LpDist<F>where
F: RefUnwindSafe,
impl<F> Send for LpDist<F>
impl<F> Sync for LpDist<F>
impl<F> Unpin for LpDist<F>
impl<F> UnwindSafe for LpDist<F>where
F: 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