name: bktrees version: 0.3.1 license: BSD3 license-file: LICENSE author: Josef Svenningsson maintainer: josef.svenningsson@gmail.com category: Data Structures synopsis: A set data structure with approximate searching description: 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. cabal-version: >=1.6 extra-source-files: test/Test.hs extra-source-files: README build-type: Simple source-repository head type: darcs location: http://patch-tag.com/r/josef/bktrees flag splitBase description: Choose the new smaller, split-up base package. library if flag(splitBase) build-depends: base >= 3, base < 5, containers, array else build-depends: base < 3 exposed-modules: Data.Set.BKTree Data.Set.BKTree.Internal extensions: CPP