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

/// Hamming distance — counts character mismatches.
///
/// Time: O(min(m, n))

use crate::utils::normalize;

pub fn hamming(a: &str, b: &str) -> u32 {
    let a_bytes = a.as_bytes();
    let b_bytes = b.as_bytes();
    let min_len = a_bytes.len().min(b_bytes.len());
    let mut count = (a_bytes.len() as i32 - b_bytes.len() as i32).unsigned_abs();

    for i in 0..min_len {
        if a_bytes[i] != b_bytes[i] {
            count += 1;
        }
    }

    count
}

pub fn hamming_normalized(a: &str, b: &str) -> f64 {
    let max_len = a.len().max(b.len()) as u32;
    normalize(hamming(a, b), max_len)
}