bktrees
A set data structure with approximate searching
Burkhard-Keller trees provide an implementation of sets which apart from the ordinary operations also has an approximate member search, allowing you to search for elements that are of a certain distance from the element you are searching for.
Available in
| Overlay | Newest | Ebuilds | Last activity | |
|---|---|---|---|---|
| haskell GitHub ↗ | 0.3.1 | 1 | 2 d | details › |