bktree
A crate implementing a Brukhard Keller tree datastructure which allows for fast querying of "close" matches on discrete distances.
Useful for spell checking based on edit distance and other typical applications.
use *;
let mut bk = new;
bk.insert_all;
let : = bk.find.into_iter.unzip;
assert_eq!;
assert_eq!;
use *;
let mut bk = new;
bk.insert_all;
let : = bk.find.into_iter.unzip;
assert_eq!;
assert_eq!;