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 "batteries"
13]
14synopsis: "Bisector tree implementation in OCaml."
15description: """
16A bisector tree allows to do fast but exact nearest neighbor searches
17in any space provided that you can measure the
18distance between any two points in that space.
19A bisector tree also allows fast neighbor searches (range queries/
20finding all points within a given tolerance from your query point).
21Cf. this article for details:
22"A Data Structure and an Algorithm for the Nearest Point Problem";
23Iraj Kalaranti and Gerard McDonald.
24ieeexplore.ieee.org/iel5/32/35936/01703102.pdf"""
25url {
26 src: "https://github.com/UnixJunkie/bisec-tree/archive/v5.0.0.tar.gz"
27 checksum: [
28 "sha256=175215fc6641864cd4e9a14373b1af185d2b23cf774a3892550f41e7072209a1"
29 "md5=2cff1148329e7c3b10cce7ae7728c97b"
30 ]
31}