abd-clam 0.30.0

Clustering, Learning and Approximation with Manifolds
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36

//! Linear RNN search in a compressed space.

use distances::number::UInt;
use rayon::prelude::*;

use crate::{pancakes::CodecData, Cluster, Instance};

/// Perform a linear search in a compressed space.
pub fn search<I, U, M>(query: &I, radius: U, data: &CodecData<I, U, M>) -> Vec<(usize, U)>
where
    I: Instance,
    U: UInt,
    M: Instance,
{
    let leaves = data.root().compressible_leaves();

    leaves
        .into_par_iter()
        .flat_map(|leaf| {
            let points = data
                .load_leaf_data(leaf)
                .unwrap_or_else(|e| unreachable!("Impossible by construction.: {e}"));
            points
                .into_par_iter()
                .zip(leaf.indices().into_par_iter())
                .filter_map(|(point, index)| {
                    let distance = data.metric()(query, &point);
                    if distance <= radius {
                        Some((index, distance))
                    } else {
                        None
                    }
                })
        })
        .collect()
}