@hackage bktrees0.1.3
A set data structure with approximate searching
Categories
License
BSD-3-Clause
Maintainer
josef.svenningsson@gmail.com
Links
- Documentation
- No source repository
- Security
Versions
Installation
CustomDependencies (3)
Dependents (2)
@hackage/Graphalyze, @hackage/acme-everything
Package Flags
splitbase
(on by default)
Choose the new smaller, split-up base package.
Burhard-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.