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"
11 "jbuilder" {>= "1.0+beta19"}
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 can measure the
17distance between any two points in that space.
18A bisector tree also allows fast neighbor searches (finding all points
19within a given tolerance from your query point).
20Cf. this article for details:
21"A Data Structure and an Algorithm for the Nearest Point Problem";
22Iraj Kalaranti and Gerard McDonald.
23ieeexplore.ieee.org/iel5/32/35936/01703102.pdf"""
24url {
25 src: "https://github.com/UnixJunkie/bisec-tree/archive/v3.0.0.tar.gz"
26 checksum: [
27 "sha256=a45601a571d75d50870fb789e8f572665c0366378ee70dc8290f0bb5d629ee91"
28 "md5=5b0caca38e7fd24170efcfda50362b7d"
29 ]
30}