Struct linfa_nn::LinearSearchIndex
source · [−]Expand description
Spatial indexing structure created by LinearSearch
Implementations
Trait Implementations
sourceimpl<'a, F: Clone + Float, D: Clone + Distance<F>> Clone for LinearSearchIndex<'a, F, D>
impl<'a, F: Clone + Float, D: Clone + Distance<F>> Clone for LinearSearchIndex<'a, F, D>
sourcefn clone(&self) -> LinearSearchIndex<'a, F, D>
fn clone(&self) -> LinearSearchIndex<'a, F, D>
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source
. Read more
sourceimpl<'a, F: Float, D: Distance<F>> NearestNeighbourIndex<F> for LinearSearchIndex<'a, F, D>
impl<'a, F: Float, D: Distance<F>> NearestNeighbourIndex<F> for LinearSearchIndex<'a, F, D>
sourcefn k_nearest<'b>(
&self,
point: ArrayView1<'b, F>,
k: usize
) -> Result<Vec<(ArrayView1<'_, F>, usize)>, NnError>
fn k_nearest<'b>(
&self,
point: ArrayView1<'b, F>,
k: usize
) -> Result<Vec<(ArrayView1<'_, F>, usize)>, NnError>
Returns the k
points in the index that are the closest to the provided point, along with
their positions in the original dataset. Points are returned in ascending order of the
distance away from the provided points, and less than k
points will be returned if the
index contains fewer than k
. Read more
sourcefn within_range<'b>(
&self,
point: ArrayView1<'b, F>,
range: F
) -> Result<Vec<(ArrayView1<'_, F>, usize)>, NnError>
fn within_range<'b>(
&self,
point: ArrayView1<'b, F>,
range: F
) -> Result<Vec<(ArrayView1<'_, F>, usize)>, NnError>
Returns all the points in the index that are within the specified distance to the provided point, along with their positions in the original dataset. The points are not guaranteed to be in any order, though many algorithms return the points in order of distance. Read more
sourceimpl<'a, F: PartialEq + Float, D: PartialEq + Distance<F>> PartialEq<LinearSearchIndex<'a, F, D>> for LinearSearchIndex<'a, F, D>
impl<'a, F: PartialEq + Float, D: PartialEq + Distance<F>> PartialEq<LinearSearchIndex<'a, F, D>> for LinearSearchIndex<'a, F, D>
sourcefn eq(&self, other: &LinearSearchIndex<'a, F, D>) -> bool
fn eq(&self, other: &LinearSearchIndex<'a, F, D>) -> bool
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
sourcefn ne(&self, other: &LinearSearchIndex<'a, F, D>) -> bool
fn ne(&self, other: &LinearSearchIndex<'a, F, D>) -> bool
This method tests for !=
.
impl<'a, F: Float, D: Distance<F>> StructuralPartialEq for LinearSearchIndex<'a, F, D>
Auto Trait Implementations
impl<'a, F, D> RefUnwindSafe for LinearSearchIndex<'a, F, D> where
D: RefUnwindSafe,
F: RefUnwindSafe,
impl<'a, F, D> Send for LinearSearchIndex<'a, F, D>
impl<'a, F, D> Sync for LinearSearchIndex<'a, F, D>
impl<'a, F, D> Unpin for LinearSearchIndex<'a, F, D>
impl<'a, F, D> UnwindSafe for LinearSearchIndex<'a, F, D> where
D: UnwindSafe,
F: RefUnwindSafe,
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