probminhash 0.1.12

Minhash algorithms for weighted Jaccard index
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
37
38
39
40
41

//! jaccard distance

/// Computes the weighted jaccard index of 2 signatures.
///   
/// The 2 signatures must come from two equivalent instances of the same ProbMinHash algorithm
/// with the same number of hash signatures.  
/// Note that if *jp* is the returned value of this function,  
/// the distance between siga and sigb, associated to the jaccard index is *1.- jp*
pub fn compute_probminhash_jaccard<D: PartialEq>(siga: &[D], sigb: &[D]) -> f64 {
    let sig_size = siga.len();
    assert_eq!(sig_size, sigb.len());
    let mut inter = 0;
    for i in 0..siga.len() {
        if siga[i] == sigb[i] {
            inter += 1;
        }
    }
    inter as f64 / siga.len() as f64
} // end of compute_probminhash_jaccard

/// Computes the weighted jaccard index of 2 signatures.
///   
/// The 2 signatures must come from two equivalent instances of the same ProbMinHash algorithm
/// with the same number of hash signatures.  
/// Note that if *jp* is the returned value of this function,  
/// the distance between siga and sigb, associated to the jaccard index is *1.- jp*
pub fn get_jaccard_index_estimate<F: PartialEq + std::fmt::Debug>(
    siga: &[F],
    sigb: &[F],
) -> anyhow::Result<f64> {
    let sig_size = siga.len();
    assert_eq!(sig_size, sigb.len());
    let mut inter = 0;
    for i in 0..siga.len() {
        if siga[i] == sigb[i] {
            inter += 1;
        }
    }
    let jp = inter as f64 / siga.len() as f64;
    Ok(jp)
}