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.

```rust use bktree::*;

let mut bk = BkTree::new(hammingdistance); bk.insertall(vec![0, 4, 5, 14, 15]);

let (words, dists): (Vec, Vec) = bk.find(13, 1).intoiter().unzip(); asserteq!(words, [5, 15]); assert_eq!(dists, [1, 1]); ```

```rust use bktree::*;

let mut bk = BkTree::new(levenshteindistance); bk.insertall(vec![ "book", "books", "boo", "boon", "cook", "cake", "cape", "cart", ]); let (words, dists): (Vec<&str>, Vec) = bk.find("bo", 2).intoiter().unzip(); asserteq!(words, ["book", "boo", "boon"]); assert_eq!(dists, [2, 1, 2]); ```