pub struct Neighbour {
pub index: u32,
pub distance: f64,
}Expand description
A point a query found, by its index in the cloud.
Fields§
§index: u32The point’s index in the cloud the index was built from.
distance: f64Its distance from the query point.
Trait Implementations§
impl Copy for Neighbour
impl StructuralPartialEq for Neighbour
Auto Trait Implementations§
impl Freeze for Neighbour
impl RefUnwindSafe for Neighbour
impl Send for Neighbour
impl Sync for Neighbour
impl Unpin for Neighbour
impl UnsafeUnpin for Neighbour
impl UnwindSafe for Neighbour
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> Scalar for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.