pub struct GenericDistanceMatrix;Expand description
Generic distance matrix computation with SIMD optimizations
Implementations§
Source§impl GenericDistanceMatrix
impl GenericDistanceMatrix
Sourcepub fn compute<T, P, M>(points: &[P], metric: &M) -> SpatialResult<Vec<Vec<T>>>where
T: SpatialScalar + Send + Sync,
P: SpatialPoint<T> + Send + Sync,
M: DistanceMetric<T, P> + Send + Sync,
pub fn compute<T, P, M>(points: &[P], metric: &M) -> SpatialResult<Vec<Vec<T>>>where
T: SpatialScalar + Send + Sync,
P: SpatialPoint<T> + Send + Sync,
M: DistanceMetric<T, P> + Send + Sync,
Compute pairwise distance matrix between points with SIMD acceleration
Sourcepub fn compute_flat<T, P, M>(points: &[P], metric: &M) -> SpatialResult<Vec<T>>where
T: SpatialScalar + Send + Sync,
P: SpatialPoint<T> + Send + Sync,
M: DistanceMetric<T, P> + Send + Sync,
pub fn compute_flat<T, P, M>(points: &[P], metric: &M) -> SpatialResult<Vec<T>>where
T: SpatialScalar + Send + Sync,
P: SpatialPoint<T> + Send + Sync,
M: DistanceMetric<T, P> + Send + Sync,
Compute pairwise distance matrix with optimized flat memory layout
Sourcepub fn compute_parallel<T, P, M>(
points: &[P],
metric: &M,
) -> SpatialResult<Vec<Vec<T>>>where
T: SpatialScalar + Send + Sync,
P: SpatialPoint<T> + Send + Sync + Clone,
M: DistanceMetric<T, P> + Send + Sync,
pub fn compute_parallel<T, P, M>(
points: &[P],
metric: &M,
) -> SpatialResult<Vec<Vec<T>>>where
T: SpatialScalar + Send + Sync,
P: SpatialPoint<T> + Send + Sync + Clone,
M: DistanceMetric<T, P> + Send + Sync,
Compute pairwise distance matrix with memory-optimized parallel processing
Sourcepub fn compute_condensed<T, P, M>(
points: &[P],
metric: &M,
) -> SpatialResult<Vec<T>>
pub fn compute_condensed<T, P, M>( points: &[P], metric: &M, ) -> SpatialResult<Vec<T>>
Compute condensed distance matrix (upper triangle only)
Auto Trait Implementations§
impl Freeze for GenericDistanceMatrix
impl RefUnwindSafe for GenericDistanceMatrix
impl Send for GenericDistanceMatrix
impl Sync for GenericDistanceMatrix
impl Unpin for GenericDistanceMatrix
impl UnwindSafe for GenericDistanceMatrix
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
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.