distance-wasm 0.0.6

WebAssembly bindings for high-performance string distance and similarity algorithms
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

/// Naive string similarity: prefix, suffix, length.
///
/// Time: O(min(m, n)) for prefix/suffix, O(1) for length

pub fn prefix(a: &str, b: &str) -> f64 {
    let a_bytes = a.as_bytes();
    let b_bytes = b.as_bytes();
    let max_len = a_bytes.len().max(b_bytes.len()) as f64;
    if max_len == 0.0 { return 1.0; }

    let min_len = a_bytes.len().min(b_bytes.len());
    let mut common = 0usize;
    while common < min_len && a_bytes[common] == b_bytes[common] {
        common += 1;
    }
    common as f64 / max_len
}

pub fn suffix(a: &str, b: &str) -> f64 {
    let a_bytes = a.as_bytes();
    let b_bytes = b.as_bytes();
    let max_len = a_bytes.len().max(b_bytes.len()) as f64;
    if max_len == 0.0 { return 1.0; }

    let min_len = a_bytes.len().min(b_bytes.len());
    let mut common = 0usize;
    while common < min_len
        && a_bytes[a_bytes.len() - 1 - common] == b_bytes[b_bytes.len() - 1 - common]
    {
        common += 1;
    }
    common as f64 / max_len
}

pub fn length(a: &str, b: &str) -> f64 {
    let max_len = a.len().max(b.len()) as f64;
    if max_len == 0.0 { return 1.0; }
    1.0 - (a.len() as f64 - b.len() as f64).abs() / max_len
}