opam file synchronized with opam-repository

Author: UnixJunkie

bst.opam

@@ -1,31 +1,31 @@
 opam-version: "2.0"
-name: "bst"
-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"""
 maintainer: "[email protected]"
-authors: "Francois Berenger"
-license: "BSD-3"
+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" {build}
+  "dune"
   "base-unix" {with-test}
   "dolog" {with-test}
   "minicli" {with-test}
 ]
-build: ["dune" "build" "-p" name "-j" jobs]
+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/v6.0.0.tar.gz"
 #   checksum: "md5=e3bafda0a2b705c5cd24e0710dee9c37"