/
opam
32 lines (32 loc) · 1.12 KB
/
opam
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
opam-version: "2.0"
maintainer: "unixjunkie@sdf.org"
authors: ["Francois Berenger"]
homepage: "https://github.com/UnixJunkie/bisec-tree"
bug-reports: "https://github.com/UnixJunkie/bisec-tree/issues"
dev-repo: "git+https://github.com/UnixJunkie/bisec-tree.git"
license: "BSD-3-Clause"
build: ["dune" "build" "-p" name "-j" jobs]
depends: [
"ocaml"
"batteries"
"dune" {< "3.0"}
"base-unix" {with-test}
"dolog" {< "4.0.0" & with-test}
"minicli" {with-test}
]
synopsis: "Bisector tree implementation in OCaml"
description: """
A bisector tree allows to do fast but exact nearest neighbor searches
in any space provided that you can measure the
distance between any two points in that space.
A bisector tree also allows fast neighbor searches (range queries/
finding all points within a given tolerance from your query point).
Cf. this article for details:
'A Data Structure and an Algorithm for the Nearest Point Problem';
Iraj Kalaranti and Gerard McDonald.
ieeexplore.ieee.org/iel5/32/35936/01703102.pdf
"""
url {
src: "https://github.com/UnixJunkie/bisec-tree/archive/v7.0.0.tar.gz"
checksum: "md5=38b8967699a79d0df30e8acac23093fc"
}