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

use crate::index::Comparable;

pub fn search_minhashes<L>(node: &dyn Comparable<L>, query: &L, threshold: f64) -> bool {
    node.similarity(query) > threshold
}

pub fn search_minhashes_containment<L>(
    node: &dyn Comparable<L>,
    query: &L,
    threshold: f64,
) -> bool {
    node.containment(query) > threshold
}

pub fn search_minhashes_find_best<L>() -> fn(&dyn Comparable<L>, &L, f64) -> bool {
    /* TODO: implement the proper function, as a closure that modifies `best_so_far`
    let mut _best_so_far = 0.;

    move |node, query, threshold| {
        let sim = node.similarity(query);
        if sim > best_so_far {
            best_so_far = sim;
            true
        } else {
            if sim > threshold {
                true
            } else {
                false
            }
        }
    }
    */
    unimplemented!();
}