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: ["dune" "build" "-p" name "-j" jobs]
9depends: [
10 "ocaml"
11 "batteries"
12 "dune" {< "3.0"}
13 "base-unix" {with-test}
14 "dolog" {< "4.0.0" & with-test}
15 "minicli" {with-test}
16]
17synopsis: "Bisector tree implementation in OCaml"
18description: """
19A bisector tree allows to do fast but exact nearest neighbor searches
20in any space provided that you can measure the
21distance between any two points in that space.
22A bisector tree also allows fast neighbor searches (range queries/
23finding all points within a given tolerance from your query point).
24Cf. this article for details:
25'A Data Structure and an Algorithm for the Nearest Point Problem';
26Iraj Kalaranti and Gerard McDonald.
27ieeexplore.ieee.org/iel5/32/35936/01703102.pdf
28"""
29url {
30 src: "https://github.com/UnixJunkie/bisec-tree/archive/v7.0.0.tar.gz"
31 checksum: [
32 "sha256=b1a2bd2c72a8b42e11dcf58850d3b398be3e3cf1d514a628a88c88e42089dcfd"
33 "md5=38b8967699a79d0df30e8acac23093fc"
34 ]
35}