bktrees: A set data structure with approximate searching

[ bsd3, data-structures, library ] [ Propose Tags ]

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.

Versions [RSS] [faq] 0.1, 0.1.1, 0.1.2, 0.1.3, 0.2, 0.2.1, 0.2.2, 0.3, 0.3.1
Dependencies array, base, containers [details]
License BSD-3-Clause
Author Josef Svenningsson
Maintainer josef.svenningsson@gmail.com
Category Data Structures
Uploaded by JosefSvenningsson at 2007-11-06T11:52:13Z
Distributions NixOS:0.3.1
Downloads 15989 total (46 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]



Manual Flags

Automatic Flags

Choose the new smaller, split-up base package.


Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info


Maintainer's Corner

For package maintainers and hackage trustees