Merge pull request #18336 from dgllghr/release-interval-map-0.1.0

[new release] interval-map (0.1.0)

packages/interval-map/interval-map.0.1.0/opam

@@ -0,0 +1,47 @@
+opam-version: "2.0"
+synopsis: "An immutable interval map data structure"
+description: """
+An immutable interval map data structure implemented as an interval tree. Based
+on [jgblight/im_interval_tree](https://github.com/jgblight/im_interval_tree).
+
+Interval maps are great for finding intervals and their associated values which
+overlap a given interval. This interval map supports intervals with excluded,
+included, and unbounded bound ends. Multiple values may be associated with the
+same interval.
+"""
+maintainer: ["Dan Gallagher"]
+authors: ["Dan Gallagher"]
+license: "MIT"
+homepage: "https://github.com/dgllghr/interval-map"
+doc: "https://dgllghr.github.io/interval-map/"
+bug-reports: "https://github.com/dgllghr/interval-map/issues"
+depends: [
+  "ocaml" {>= "4.08.0"}
+  "dune" {>= "2.0"}
+  "alcotest" {with-test}
+  "odoc" {with-doc}
+]
+build: [
+  ["dune" "subst"] {pinned}
+  [
+    "dune"
+    "build"
+    "-p"
+    name
+    "-j"
+    jobs
+    "@install"
+    "@runtest" {with-test}
+    "@doc" {with-doc}
+  ]
+]
+dev-repo: "git+https://github.com/dgllghr/interval-map.git"
+x-commit-hash: "e6e86adecf526dfbf8e41e2c4efd44743104c14a"
+url {
+  src:
+    "https://github.com/dgllghr/interval-map/releases/download/0.1.0/interval-map-0.1.0.tbz"
+  checksum: [
+    "sha256=73aad4d6fd4993e3a98e0da1120d551b863c90282fc316f92d127a525aa7322c"
+    "sha512=895e2aa016a1f048e15b823080899ef996e06298167321dfdeca1d37b8c5d0730261f3fea17f6f1a8e796e0b4f7ff0cd638cf97db867f1281cc7803a2cfda2ae"
+  ]
+}