use crate::normalize;
pub fn levenshtein(a: &str, b: &str) -> usize {
let a = normalize(a);
let b = normalize(b);
levenshtein_raw(&a, &b)
}
pub(crate) fn levenshtein_raw(a: &str, b: &str) -> usize {
let a_chars: Vec<char> = a.chars().collect();
let b_chars: Vec<char> = b.chars().collect();
let m = a_chars.len();
let n = b_chars.len();
let mut dp = vec![vec![0usize; n + 1]; m + 1];
for (i, row) in dp.iter_mut().enumerate() {
row[0] = i;
}
for (j, cell) in dp[0].iter_mut().enumerate() {
*cell = j;
}
for i in 1..=m {
for j in 1..=n {
dp[i][j] = if a_chars[i - 1] == b_chars[j - 1] {
dp[i - 1][j - 1]
} else {
1 + dp[i - 1][j - 1].min(dp[i - 1][j]).min(dp[i][j - 1])
};
}
}
dp[m][n]
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_identical() {
assert_eq!(levenshtein("cat", "cat"), 0);
}
#[test]
fn test_one_substitution() {
assert_eq!(levenshtein("cat", "bat"), 1);
}
#[test]
fn test_one_insertion() {
assert_eq!(levenshtein("cat", "cart"), 1);
}
#[test]
fn test_case_insensitive() {
assert_eq!(levenshtein("Cat", "cat"), 0);
}
#[test]
fn test_completely_different() {
assert_eq!(levenshtein("cat", "dog"), 3);
}
#[test]
fn test_raw_skips_normalization() {
assert_eq!(levenshtein_raw("Cat", "cat"), 1);
assert_eq!(levenshtein_raw(" cat", "cat"), 1);
}
#[test]
fn test_raw_matches_public_on_normalized_input() {
assert_eq!(levenshtein_raw("cat", "bat"), levenshtein("cat", "bat"));
}
}