fn initialize_searcher(&self, q: &T, searcher: &mut Searcher<Met::Unit>) {
        // Clear the searcher.
        searcher.clear();
        // Add the entry point.
        let entry_distance = self.metric.distance(q, self.entry_feature());
        let candidate = Neighbor {
            index: 0,
            distance: entry_distance,
        };
        searcher.candidates.push(candidate);
        searcher.nearest.push(candidate);
        searcher.seen.insert(
            self.layers
                .last()
                .map(|layer| layer[0].zero_node)
                .unwrap_or(0),
        );
    }
/// Resets a searcher, but does not set the `cap` on the nearest neighbors.
/// Must be passed the query element `q`.
Resets a searcher, but does not set the `cap` on the nearest neighbors.
Must be passed the query element `q`.
Resets a searcher but does not set the ` cap ` on the nearest neighbors . Must be passed the query element ` q ` .
fn initialize_searcher(&self, q: &T, searcher: &mut Searcher<Met::Unit>) {
        // Clear the searcher.
        searcher.clear();
        // Add the entry point.
        let entry_distance = self.metric.distance(q, self.entry_feature());
        let candidate = Neighbor {
            index: 0,
            distance: entry_distance,
        };
        searcher.candidates.push(candidate);
        searcher.nearest.push(candidate);
        searcher.seen.insert(
            self.layers
                .last()
                .map(|layer| layer[0].zero_node)
                .unwrap_or(0),
        );
    }
fn initialize_searcher ( & self , q : & T , searcher : & mut Searcher < Met :: Unit > ) { // Clear the searcher. searcher . clear ( ) ; // Add the entry point. let entry_distance = self . metric . distance ( q , self . entry_feature ( ) ) ; let candidate = Neighbor { index : 0 , distance : entry_distance , } ; searcher . candidates . push ( candidate ) ; searcher . nearest . push ( candidate ) ; searcher . seen . insert ( self . layers . last ( ) . map ( | layer | layer [ 0 ] . zero_node ) . unwrap_or ( 0 ) , ) ; }
Resets a searcher, but does not set the `cap` on the nearest neighbors.
Resets a searcher but does not set the ` cap ` on the nearest neighbors .
&self
q
&T
searcher
&mut Searcher<Met::Unit>
&self
q
&T
searcher
&mut Searcher<Met::Unit>