homepage: https://github.com/ocramz/vp-tree
changelog-type: ''
hash: 5a9579db3a53acf16c64ef0a6d5c8656e619c84673a194e843a7511f183782ab
test-bench-deps:
  bytestring: -any
  base: -any
  hspec: -any
  conduit: -any
  containers: -any
  weigh: -any
  vp-tree: -any
  deepseq: -any
  QuickCheck: -any
  mwc-probability: -any
  primitive: -any
  vector: -any
maintainer: ocramz
synopsis: Vantage Point Trees
changelog: ''
basic-deps:
  serialise: '>=0.2.2.0'
  base: '>=4.7 && <5'
  depq: '>=0.3'
  containers: '>=0.6.0.1'
  mtl: '>=2.2.2'
  vector-algorithms: '>=0.8.0.3'
  transformers: '>=0.5.6.2'
  deepseq: '>=1.4.4.0'
  boxes: '>=0.1.5'
  sampling: '>=0.3.3'
  mwc-probability: '>=2.1.0'
  primitive: '>=0.6.4.0'
  psqueues: '>=0.2.7.2'
  vector: '>=0.12.1.2'
all-versions:
- 0.1.0.0
author: Marco Zocca
latest: 0.1.0.0
description-type: markdown
description: "# vp-tree\n\nVantage point trees, as described in \n\nData structures
  and algorithms for nearest neighbor search in general metric spaces - P. N. Yianilos\n\nhttp://web.cs.iastate.edu/~honavar/nndatastructures.pdf\n\n\n##
  Usage\n\nImport 'Data.VPTree', which also contains usage instructions and comments\n\n\n##
  Benchmarks\n\nCumulative memory usage and garbage collection cycles :\n\n    $ stack
  bench -- vp-tree:bench-memory\n"
license-name: BSD-3-Clause

Update from Hackage at 2021-04-30T09:50:41Z
Update from Hackage at 2021-04-30T09:50:41Z
