algorithmz 1.1.3

This is the corresponding implemenation of the python module of the same name.
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

/// One Edit Distance
///
/// Given two strings, determine if they are exactly one edit distance apart. An edit is an insertion, deletion, or replacement of a single character.
///
/// # Examples
///
/// Basic usage:
/// ```
/// let result = algorithmz::string::is_one_edit("abc","abd");
/// assert_eq!(result, true);
/// ```
pub fn is_one_edit(source: &str, target: &str) -> bool {
    if source.len() > target.len() {
        return is_one_edit(target, source);
    }

    if target.len() - source.len() > 1 || source == target {
        return false;
    }

    let s: Vec<char> = source.chars().collect();
    let t: Vec<char> = target.chars().collect();

    for i in 0..s.len() {
        if s[i] != t[i] {
            let replace = s[i + 1..] == t[i + 1..];

            let insert_delete = s[i..] == t[i + 1..];

            return replace || insert_delete;
        }
    }

    true
}