this repo has no description
anil.recoil.org
1opam-version: "2.0"
2maintainer: "David Kaloper Meršinjak <david@numm.org>"
3authors: ["David Kaloper Meršinjak <david@numm.org>"]
4homepage: "https://github.com/pqwy/psq"
5doc: "https://pqwy.github.io/psq/doc"
6license: "ISC"
7dev-repo: "git+https://github.com/pqwy/psq.git"
8bug-reports: "https://github.com/pqwy/psq/issues"
9depends: [
10 "ocaml" {>= "4.02.0"}
11 "ocamlfind" {build}
12 "ocamlbuild" {build}
13 "topkg" {build}
14 "alcotest" {with-test}
15]
16build: [ "ocaml" "pkg/pkg.ml" "build" "--pinned" "%{pinned}%" ]
17synopsis: "Functional Priority Search Queues"
18description: """
19psq provides a functional priority search queue for OCaml. This structure
20behaves both as a finite map, containing bindings `k -> p`, and a priority queue
21over `p`. It provides efficient access along more than one axis: to any binding
22by `k`, and to the binding(s) with the least `p`.
23
24Typical applications are searches, schedulers and caches. If you ever scratched
25your head because that A\\* didn't look quite right, a PSQ is what you needed.
26
27The implementation is backed by [priority search pennants][hinze].
28
29psq is distributed under the ISC license.
30
31[hinze]: https://www.cs.ox.ac.uk/ralf.hinze/publications/ICFP01.pdf"""
32url {
33 src: "https://github.com/pqwy/psq/releases/download/v0.1.0/psq-0.1.0.tbz"
34 checksum: [
35 "sha256=979abf22fe357ef3cf3a6939a05ba158e8946b324bc3c1b0b23dcbb5637bf021"
36 "md5=21d6abc3db996888887ec61b7d38f885"
37 ]
38}