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