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.
[Skip to Readme]
|Versions [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 (<5), containers [details]|
|Source repo||head: darcs get http://patch-tag.com/r/josef/bktrees|
|Uploaded||by JosefSvenningsson at Mon Nov 22 23:23:44 UTC 2010|
|Downloads||13456 total (110 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs uploaded by user
Build status unknown [no reports yet]
Choose the new smaller, split-up base package.
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
For package maintainers and hackage trustees