var searchIndex = {};
searchIndex["bk_tree"] = {"doc":"","items":[[3,"BKNode","bk_tree","A node within the [BK-tree](https://en.wikipedia.org/wiki/BK-tree).",null,null],[12,"key","","The key determining the node.",0,null],[12,"children","","A hash-map of children, indexed by their distance from this node based\non the metric being used by the tree.",0,null],[3,"BKTree","","A representation of a [BK-tree](https://en.wikipedia.org/wiki/BK-tree).",null,null],[12,"root","","The root node. May be empty if nothing has been put in the tree yet.",1,null],[0,"metrics","","This is a collection of string metrics that are suitable for use with a\nBK-tree.",null,null],[5,"levenshtein","bk_tree::metrics","This calculates the Levenshtein distance between two strings.",null,{"inputs":[{"name":"str"},{"name":"str"}],"output":{"name":"u64"}}],[11,"new","bk_tree","Constructs a new `BKNode<K>`.",0,{"inputs":[{"name":"k"}],"output":{"name":"bknode"}}],[11,"add_child","","Add a child to the node.",0,null],[11,"fmt","","",0,null],[11,"new","","Constructs a new `BKTree<K>` using the provided metric.",1,{"inputs":[{"name":"m"}],"output":{"name":"bktree"}}],[11,"add","","Adds a key to the tree.",1,null],[11,"extend","","Adds multiple keys to the tree.",1,null],[11,"find","","Searches for a key in the BK-tree given a certain tolerance.",1,null],[11,"find_exact","","Searches for an exact match in the tree.",1,null]],"paths":[[3,"BKNode"],[3,"BKTree"]]};
initSearch(searchIndex);