psq

Functional Priority Search Queues
Description

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.

Install
Published
21 Nov 2016
Authors
Maintainers
Sources
psq-0.1.0.tbz
md5=21d6abc3db996888887ec61b7d38f885
Dependencies
alcotest with-test
topkg build
ocaml >= "4.02.0"
Reverse Dependencies
dream < "1.0.0~alpha3"
ke >= "0.5"
lru < "0.3.0"
ocluster < "0.2"