pub fn nearest<'a>(name: &str, candidates: &[&'a str]) -> Option<&'a str>
The nearest candidate: Levenshtein distance ≤ 2, or a prefix relation either way; ties → the bytewise-first.