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 42 43 44 45 46 47 48 49 50 51
pub mod distance;
pub mod edit;
pub mod util;
pub use distance::*;
pub use edit::*;
use util::DistanceMatrix;
/// Computes and returns the Levenshtein distance between the source and target sequences.
///
/// # Arguments
///
/// * `source` - The source sequence
/// * `target` - The target sequence
///
/// # Examples
///
/// ```
/// use levenshtein_diff as levenshtein;
///
/// let s1 = "FLAW";
/// let s2 = "LAWN";
///
/// let (distance, _) = levenshtein::distance(s1.as_bytes(), s2.as_bytes());
/// assert_eq!(distance, 2);
///
/// let v1 = vec![0, 1, 2];
/// let v2 = vec![1, 2, 3, 4];
///
/// let (distance, _) = levenshtein::distance(&v1[..], &v2[..]); // Also works on vectors
/// assert_eq!(distance, 3);
/// ```
pub fn distance<T: PartialEq>(source: &[T], target: &[T]) -> (usize, DistanceMatrix) {
levenshtein_memoization(source, target)
}
#[cfg(test)]
mod tests {
use crate::*;
#[test]
fn default_distance_test() {
let s1 = "FLOWER";
let s2 = "FOLLOWER";
let expected_dist = 2;
let (dist, _) = distance(s1.as_bytes(), s2.as_bytes());
assert_eq!(expected_dist, dist);
}
}