Skip to main content

vibe/catalog/
suggest.rs

1//! Closest-match suggestions for unknown catalog ids.
2
3use super::ALL_INVOKE_IDS;
4use crate::animation::presets::list_all_presets;
5
6/// Did-you-mean suggestion.
7pub fn did_you_mean(path: &str) -> Option<String> {
8    let mut best: Option<(&str, usize)> = None;
9    for id in ALL_INVOKE_IDS.iter().copied() {
10        let d = edit_distance(path, id);
11        if best.map(|(_, bd)| d < bd).unwrap_or(true) {
12            best = Some((id, d));
13        }
14    }
15    for info in list_all_presets() {
16        let alias = format!("Animation.{}", info.preset);
17        let d = edit_distance(path, &alias);
18        if best.map(|(_, bd)| d < bd).unwrap_or(true) {
19            // leak-free: only keep if we later format from a static id
20            if d <= 4 {
21                return Some(alias);
22            }
23        }
24    }
25    let (id, d) = best?;
26    if d <= 6 && d * 3 < path.len().max(id.len()) + 6 {
27        Some(id.to_string())
28    } else {
29        None
30    }
31}
32
33fn edit_distance(a: &str, b: &str) -> usize {
34    let aa: Vec<char> = a.chars().collect();
35    let bb: Vec<char> = b.chars().collect();
36    let n = aa.len();
37    let m = bb.len();
38    if n == 0 {
39        return m;
40    }
41    if m == 0 {
42        return n;
43    }
44    let mut prev: Vec<usize> = (0..=m).collect();
45    let mut cur = vec![0; m + 1];
46    for i in 1..=n {
47        cur[0] = i;
48        for j in 1..=m {
49            let cost = if aa[i - 1] == bb[j - 1] { 0 } else { 1 };
50            cur[j] = (prev[j] + 1).min(cur[j - 1] + 1).min(prev[j - 1] + cost);
51        }
52        std::mem::swap(&mut prev, &mut cur);
53    }
54    prev[m]
55}