psq

Functional Priority Search Queues
README

v0.2.0-7-gb2eb861

psq provides a functional priority search queue for OCaml. This structure
behaves both as a finite map, containing bindings k -> p, and a priority queue
over p. It provides efficient access along more than one axis: to any binding
by k, and to the binding(s) with the least p.

Typical applications are searches, schedulers and caches. If you ever scratched
your head because that A* didn't look quite right, a PSQ is what you needed.

The implementation is backed by priority search pennants.

psq is distributed under the ISC license.

Documentation

Documentation is generated by odoc. It can be browsed online.

Install
Published
26 Oct 2022
Sources
psq-0.2.1.tbz
sha256=42005f533eabe74b1799ee32b8905654cd66a22bed4af2bd266b28d8462cd344
sha512=8a8dfe20dc77e1cf38a7b1a7fc76f815c71a4ffe04627151b855feaba8f1ae742594739d1b7a45580b5b24a2cd99b58516f6b5c8d858aa314201f4a6422101ee
Dependencies
alcotest
with-test
qcheck-core
with-test
dune
>= "1.7"
ocaml
>= "4.03.0"
Reverse Dependencies