pub fn nearest_matches( input: &str, candidates: &[String], max: usize, ) -> Vec<String>
Return up to max candidates closest to input.
max
input
Matches are sorted by Levenshtein distance and are stable on ties.