pub struct LpDist<F: Float>(_);
Expand description
L-p or Minkowsky distance
Trait Implementations
sourceimpl<F: Float> Distance<F> for LpDist<F>
impl<F: Float> Distance<F> for LpDist<F>
sourcefn 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
sourcefn 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. Read more
sourcefn rdist_to_dist(&self, rdist: F) -> F
fn rdist_to_dist(&self, rdist: F) -> F
Converts the result of rdistance
to distance
sourcefn dist_to_rdist(&self, dist: F) -> F
fn dist_to_rdist(&self, dist: F) -> F
Converts the result of distance
to rdistance
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
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more