vp-tree: Vantage Point Trees

[ bsd3, data, data-mining, data-structures, library, machine-learning ] [ Propose Tags ]

Vantage Point Trees enable fast nearest-neighbor queries in metric spaces

[Skip to Readme]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS],
Dependencies base (>=4.7 && <5), boxes (>=0.1.5), containers (>=, deepseq (>=, depq (>=0.3), mtl (>=2.2.2), mwc-probability (>=2.1.0), primitive (>=, psqueues (>=, sampling (>=0.3.3), serialise (>=, transformers (>=, vector (>=, vector-algorithms (>= [details]
License BSD-3-Clause
Copyright 2020-2021 Marco Zocca
Author Marco Zocca
Maintainer ocramz
Category Data, Data Mining, Data Structures, Machine Learning
Home page https://github.com/ocramz/vp-tree
Source repo head: git clone https://github.com/ocramz/vp-tree
Uploaded by ocramz at 2021-04-30T10:30:34Z
Distributions NixOS:
Downloads 288 total (12 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2021-04-30 [all 1 reports]

Readme for vp-tree-

[back to package description]


Vantage point trees, as described in

Data structures and algorithms for nearest neighbor search in general metric spaces - P. N. Yianilos



Import 'Data.VPTree', which also contains usage instructions and comments


Cumulative memory usage and garbage collection cycles :

$ stack bench -- vp-tree:bench-memory