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: ["jbuilder" "build" "-p" name "-j" jobs]
depends: [
  "ocaml"
  "jbuilder" {>= "1.0+beta19"}
  "batteries"
]
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/v5.0.0.tar.gz"
  checksum: [
    "sha256=175215fc6641864cd4e9a14373b1af185d2b23cf774a3892550f41e7072209a1"
    "md5=2cff1148329e7c3b10cce7ae7728c97b"
  ]
}