Enum NeighborSearchAlgorithm 

pub enum NeighborSearchAlgorithm {
    Auto,
    BruteForce,
    KDTree,
    BallTree,
    LSH,
}

Available neighbor search algorithms

Variants

Auto

Automatically choose the best algorithm based on data characteristics

BruteForce

Brute force search (exact, O(n²) time)

KDTree

KD-Tree search (good for low dimensions)

BallTree

Ball Tree search (good for high dimensions)

LSH

Locality Sensitive Hashing (approximate, very fast)

Trait Implementations

impl Clone for NeighborSearchAlgorithm

fn clone(&self) -> NeighborSearchAlgorithm

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for NeighborSearchAlgorithm

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for NeighborSearchAlgorithm

fn eq(&self, other: &NeighborSearchAlgorithm) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for NeighborSearchAlgorithm

impl Eq for NeighborSearchAlgorithm

impl StructuralPartialEq for NeighborSearchAlgorithm