opam-version: "2.0"
maintainer: "Jean-Christophe.Filliatre@lri.fr"
authors: "Jean-Christophe Filliâtre"
synopsis: "Priority queues"
description: """
Traditional implementation using a binary heap encoded in a resizable array
"""
license: "LGPL-2.1-only"
homepage: "https://github.com/backtracking/bheap"
doc: "https://backtracking.github.io/bheap"
bug-reports: "https://github.com/backtracking/bheap/issues"
depends: [
  "ocaml"
  "stdlib-shims" {with-test}
  "dune" {>= "2.0.0"}
]
build: [
  ["dune" "subst"] {dev}
  ["dune" "build" "-p" name "-j" jobs]
  ["dune" "runtest" "-p" name] {with-test}
]
dev-repo: "git+https://github.com/backtracking/bheap.git"
x-commit-hash: "e36a77483ce79fa52e1ea87a251e7c50b3fec4fb"
url {
  src:
    "https://github.com/backtracking/bheap/releases/download/2.0.0/bheap-2.0.0.tbz"
  checksum: [
    "sha256=5f43d7b237bc87b07097f60eae2b32de64e644158308da338bf1512014bdf636"
    "sha512=90dcf2b3856b25f8ec7204d3596b64dfc264e9158ea84e8c2f15e3980c45ef888b7a969e613f31a626aebc4c5963a09b4fd3c3b95beba7d3159ff42080193841"
  ]
}