package psq
Functional Priority Search Queues
Install
Dune Dependency
Authors
Maintainers
Sources
psq-v0.1.1.tbz
sha256=58ca577e6cd3e35fdee32f8ecda36e413a513ca034ee4d1bbbe0ce475fe8ef2a
md5=6d6347f177adb1c1dae23c599248a9f1
README.md.html
psq — Functional Priority Search Queues
v0.1.1
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.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>