|Author||David Kaloper Meršinjak <firstname.lastname@example.org>|
|Maintainer||David Kaloper Meršinjak <email@example.com>|
|Available||ocaml-version >= "4.02.0"|
|Published||Nov 20, 2016|
|Statistics||Installed 8 times in last month.|
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
p. It provides efficient access along more than one axis: to any binding
k, and to the binding(s) with the least
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.