fn approximate_contains(haystack: &str, needle: &str, max_dist: usize) -> boolExpand description
Check whether haystack contains a substring approximately matching needle
within the given maximum edit distance. Uses a sliding-window approach:
for each window of length needle.len() +/- max_dist, compute Levenshtein distance.