this repo has no description
anil.recoil.org
1opam-version: "2.0"
2maintainer: "unixjunkie@sdf.org"
3authors: ["Francois BERENGER"]
4homepage: "https://github.com/UnixJunkie/bisec-tree"
5bug-reports: "https://github.com/UnixJunkie/bisec-tree/issues"
6dev-repo: "git+https://github.com/UnixJunkie/bisec-tree.git"
7license: "BSD-3-Clause"
8build: ["jbuilder" "build" "-p" name "-j" jobs]
9depends: [
10 "ocaml" {>= "4.03.0"}
11 "jbuilder" {>= "1.0+beta7"}
12]
13synopsis: "Bisector tree implementation in OCaml."
14description: """
15A bisector tree allows to do fast but exact nearest neighbor searches
16in any space provided that you have a metric (function) to measure the
17distance between any two points in that space.
18Cf. this article for details:
19"A Data Structure and an Algorithm for the Nearest Point Problem";
20Iraj Kalaranti and Gerard McDonald.
21ieeexplore.ieee.org/iel5/32/35936/01703102.pdf"""
22url {
23 src: "https://github.com/UnixJunkie/bisec-tree/archive/v1.0.1.tar.gz"
24 checksum: [
25 "sha256=b71c6b8ad9a6704b09569ccad962781139f9d06f3acd07f2ba4efe48844d571d"
26 "md5=baaacd991615279629aa7bd6464933d6"
27 ]
28}