bktrees-0.3.1: A set data structure with approximate searching

The bktrees package

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.

Properties

Versions0.1, 0.1.1, 0.1.2, 0.1.3, 0.2, 0.2.1, 0.2.2, 0.3, 0.3.1
Dependenciesbase (<3) or
array, base (≥3 & <5), containers
LicenseBSD3
AuthorJosef Svenningsson
Maintainerjosef.svenningsson@gmail.com
CategoryData Structures
Source repositorydarcs get http://patch-tag.com/r/josef/bktrees
Upload dateMon Nov 22 23:23:44 UTC 2010
Uploaded byJosefSvenningsson
Built onghc-7.0, ghc-7.2
DistributionsNixOS: 0.3.1

Modules

Downloads