codetether-rlm 0.1.0

Recursive Language Model processing for CodeTether
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38

use std::collections::HashSet;

use super::TreeSitterVerification;

pub(crate) fn compare_names(
    claimed: Vec<String>,
    actual: Vec<String>,
    label: &str,
) -> TreeSitterVerification {
    if claimed.is_empty() {
        return TreeSitterVerification::CannotVerify {
            reason: format!("Could not extract {label} names from answer"),
        };
    }

    let claimed_set: HashSet<_> = claimed.iter().cloned().collect();
    let actual_set: HashSet<_> = actual.iter().cloned().collect();
    if claimed_set == actual_set {
        TreeSitterVerification::ExactMatch
    } else if claimed_set.is_subset(&actual_set) {
        TreeSitterVerification::SubsetMatch {
            claimed: claimed.len(),
            actual: actual.len(),
        }
    } else {
        TreeSitterVerification::HasErrors {
            errors: unexpected_errors(&claimed, &actual_set, label),
        }
    }
}

fn unexpected_errors(claimed: &[String], actual: &HashSet<String>, label: &str) -> Vec<String> {
    claimed
        .iter()
        .filter(|name| !actual.contains(*name))
        .map(|name| format!("{label} '{name}' not found"))
        .collect()
}