bktrees: A set data structure with approximate searching
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 | 0.1, 0.1.1, 0.1.2, 0.1.3, 0.2, 0.2.1 |
|---|---|
| Dependencies | base (<3) or array, base (>=3), containers |
| License | BSD3 |
| Author | Josef Svenningsson |
| Maintainer | josef.svenningsson@gmail.com |
| Category | Data Structures |
| Exposed modules | Data.Set.BKTree |
| Upload date | Tue Nov 6 03:52:13 PST 2007 |
| Uploaded by | JosefSvenningsson |
| Built on | ghc-6.8 |
Downloads
- bktrees-0.1.3.tar.gz (Cabal source package)
- package description (included in the package)