Function damerau_lev 

pub fn damerau_lev<T>(source: &[T], target: &[T]) -> usize
where
    T: PartialEq + Hash + Eq,

Finds the edit distance between source and target, taking into account additions, deletions, and swaps. This has a time complexity of O(n^2) and a space complexity of O(n^2).