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.

Modules

[Index]

Downloads

• bktrees-0.1.tar.gz [browse] (Cabal source package)
• Package description (as included in the package)

Maintainer's Corner

Package maintainers

• JosefSvenningsson

For package maintainers and hackage trustees

• edit package information

Candidates

• No Candidates