Merge pull request #24696 from jmid/minivpt-lower-bound-take2

Bump minivpt lower bound further
ocaml · Oct 27, 2023 · 6ce4f1b · 6ce4f1b
2 parents f8dd18a + 3034720
commit 6ce4f1b
Show file tree

Hide file tree

Showing 2 changed files with 4 additions and 4 deletions.
diff --git a/packages/minivpt/minivpt.1.0.0/opam b/packages/minivpt/minivpt.1.0.0/opam
@@ -18,9 +18,9 @@ remove: [
 depends: [
   "ocaml"
   "ocamlfind"
-  "obuild" {build & >= "0.0.3"}
+  "obuild" {build & >= "0.1.0"}
 ]
-synopsis: "Minimalist vantage point tree implementation in OCaml."
+synopsis: "Minimalist vantage point tree implementation in OCaml"
 description: """
 A vantage point tree allows to do fast but exact nearest neighbor searches
 in any space provided that you have a distance function to measure the

diff --git a/packages/minivpt/minivpt.2.0.0/opam b/packages/minivpt/minivpt.2.0.0/opam
@@ -18,9 +18,9 @@ remove: [
 depends: [
   "ocaml"
   "ocamlfind"
-  "obuild" {build & >= "0.0.3"}
+  "obuild" {build & >= "0.1.0"}
 ]
-synopsis: "Minimalist vantage point tree implementation in OCaml."
+synopsis: "Minimalist vantage point tree implementation in OCaml"
 description: """
 A vantage point tree allows to do fast but exact nearest neighbor searches
 in any space provided that you have a distance function to measure the