@hackage bktrees0.1.3

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.

  • Installation

    Custom

  • Dependencies (0)

  • Dependents (0)

    • Package Flags

      splitbase
       (on by default)

      Choose the new smaller, split-up base package.