pub fn try_levenshtein_iter<I, T, D>(a: I, b: I, limit: u32) -> Option<u32>where
    I: IntoIterator<IntoIter = D>,
    D: DoubleEndedIterator<Item = T> + Clone,
    T: PartialEq,
Expand description

The same algorithm as [levenshtein_limit_iter] but return an Option to indicate if the limit is exceeded

Returns Some(u32) if a distance is found, None if a limit is hit

Example

use stringmetrics::try_levenshtein_iter;

assert_eq!(try_levenshtein_iter("abc".bytes(), "abd".bytes(), 10), Some(1));
assert_eq!(try_levenshtein_iter("abcdef".bytes(), "wxyz".bytes(), 3), None);