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.
Flags
Automatic Flags
| Name | Description | Default |
|---|---|---|
| splitbase | Choose the new smaller, split-up base package. | Enabled |
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
Downloads
- bktrees-0.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 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-12-20T16:59:13Z |
| Distributions | NixOS:0.3.1 |
| Reverse Dependencies | 2 direct, 3 indirect [details] |
| Downloads | 16847 total (21 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |