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" {>= "1.11"}
  "base-unix" {with-test}
  "dolog" {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.1.tar.gz"
  checksum: [
    "sha256=99a4880a0c3c22953b571469832c690ba4b2cea2215f67b1b7f95e27bd84bfe7"
    "md5=ed687bbee9bc7ee2d5b224274c5b14d0"
  ]
}