@hackage bktrees0.1

A set data structure with approximate searching

Categories
- Data Structures
License
BSD-3-Clause
Maintainer
josef.svenningsson@gmail.com
Links
- Documentation
- No source repository
Versions
- 0.3.1 Mon, 22 Nov 2010
- 0.3 Tue, 29 Jun 2010
- 0.2.2 Thu, 26 Nov 2009
- 0.2.1 Fri, 21 Dec 2007
- 0.2 Thu, 20 Dec 2007
- 0.1.3 Tue, 6 Nov 2007

Installation
Custom
In your cabal file:
Dependencies (2)
- base
- containers
Dependents (2)
@hackage/Graphalyze, @hackage/acme-everything

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.

@hackage bktrees0.1

Categories

License

Maintainer

Links

Versions

InstallationCustom

Dependencies (2)

Dependents (2)

Installation
Custom