this repo has no description
anil.recoil.org
1opam-version: "2.0"
2maintainer: "unixjunkie@sdf.org"
3authors: ["Francois BERENGER"]
4homepage: "https://github.com/UnixJunkie/vp-tree"
5bug-reports: "https://github.com/UnixJunkie/vp-tree/issues"
6dev-repo: "git+https://github.com/UnixJunkie/vp-tree.git"
7license: "BSD-3-Clause"
8build: [
9 ["dune" "build" "-p" name "-j" jobs]
10 ["dune" "runtest" "-p" name "-j" jobs] {with-test}
11]
12depends: [
13 "dune" {>= "2.8"}
14]
15synopsis: "Vantage point tree implementation in OCaml"
16description: """
17A vantage point tree allows to do fast but exact nearest neighbor searches
18in any space provided that you have a metric (function) to measure the
19distance between any two points in that space.
20
21Bibliography
22============
23Yianilos, P. N. (1993, January).
24Data structures and algorithms for nearest neighbor search
25in general metric spaces.
26In Soda (Vol. 93, No. 194, pp. 311-21).
27http://dx.doi.org/10.1145/313559.313789
28"""
29url {
30 src: "https://github.com/UnixJunkie/vp-tree/archive/v5.0.0.tar.gz"
31 checksum: [
32 "sha256=9bdc6bd62397b4237979a00f802fa81346882a72a4e3ab039979414dc00c8d0d"
33 "md5=898aec0cf703c15443f26ca42cde76d0"
34 ]
35}