string_matching/
string_matching.rs1pub fn main(){
2 let mut tree=BKTreeMap::new(Levenshtein::new());
3 tree.insert("calculate","mathematics");
4 tree.insert("cat","pet");
5 tree.insert("kat","name");
6 tree.insert("hello","greeting");
7 tree.insert("hi","greeting");
8 tree.insert("linear","mathematics");
9
10 println!("{}",tree.get("calculator",2).map(|(s,_d)|*s).unwrap_or("not found"));
11 println!("{}",tree.get("hey",2).map(|(s,_d)|*s).unwrap_or("not found"));
12 println!("{}",tree.get("kate",2).map(|(s,_d)|*s).unwrap_or("not found"));
13 println!("{}",tree.get("line",2).map(|(s,_d)|*s).unwrap_or("not found"));
14 println!("{}",tree.get("serotonin",2).map(|(s,_d)|*s).unwrap_or("not found"));
15}
16use b_k_tree::{BKTreeMap,metrics::Levenshtein};