Crate bintrie

Structs

BinTrie
FnHeuristic	Wrap a type with the bound F: FnMut(usize) -> bool + Clone and this will implement UncheckedHeuristic. The function will be cloned internally so that from the function's point of view it is being called in the order it descends in. It is passed the group that is being entered and returns whether or not it would like to enter.

Traits

Heuristic	The Heuristic chooses which of the 16 groups to explore next. This is useful for searching spaces for nearest neighbors because you can check the nearest bits first.
IntoHeuristic
UncheckedHeuristic	This is the same as Heuristic except that the returned group indices are unchecked. It is therefore unsafe to implement. See the documentation for Heuristic.