psq

AuthorDavid Kaloper Meršinjak <david@numm.org>
LicenseISC
Homepagehttps://github.com/pqwy/psq
Issue Trackerhttps://github.com/pqwy/psq/issues
MaintainerDavid Kaloper Meršinjak <david@numm.org>
Dependencies
&alcotest
ocamlbuild
ocamlfind
topkg
Availableocaml-version >= "4.02.0"
PublishedNov 20, 2016
Source [http] https://github.com/pqwy/psq/releases/download/v0.1.0/psq-0.1.0.tbz
21d6abc3db996888887ec61b7d38f885
StatisticsInstalled 5 times last month.
Edithttps://github.com/ocaml/opam-repository/tree/master/packages/psq/psq.0.1.0/opam

Functional Priority Search Queues

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.

Necessary for
lru