pub fn nearest<'a>(
        &self,
        q: &T,
        ef: usize,
        searcher: &mut Searcher<Met::Unit>,
        dest: &'a mut [Neighbor<Met::Unit>],
    ) -> &'a mut [Neighbor<Met::Unit>] {
        self.search_layer(q, ef, 0, searcher, dest)
    }
/// Does a k-NN search where `q` is the query element and it attempts to put up to `M` nearest neighbors into `dest`.
/// `ef` is the candidate pool size. `ef` can be increased to get better recall at the expense of speed.
/// If `ef` is less than `dest.len()` then `dest` will only be filled with `ef` elements.
///
/// Returns a slice of the filled neighbors.


Returns a slice of the filled neighbors.
Returns a slice of the filled neighbors .
pub fn nearest<'a>(
        &self,
        q: &T,
        ef: usize,
        searcher: &mut Searcher<Met::Unit>,
        dest: &'a mut [Neighbor<Met::Unit>],
    ) -> &'a mut [Neighbor<Met::Unit>] {
        self.search_layer(q, ef, 0, searcher, dest)
    }
pub fn nearest < ' a > ( & self , q : & T , ef : usize , searcher : & mut Searcher < Met :: Unit > , dest : & ' a mut [ Neighbor < Met :: Unit > ] , ) -> & ' a mut [ Neighbor < Met :: Unit > ] { self . search_layer ( q , ef , 0 , searcher , dest ) }
Does a k-NN search where `q` is the query element and it attempts to put up to `M` nearest neighbors into `dest`.
Does a k - NN search where ` q ` is the query element and it attempts to put up to ` M ` nearest neighbors into ` dest ` .
&self
q
&T
ef
usize
searcher
&mut Searcher<Met::Unit>
dest
&'a mut [Neighbor<Met::Unit>]
&self
q
&T
ef
usize
searcher
&mut Searcher<Met::Unit>
dest
&'a mut [Neighbor<Met::Unit>]