Implementation of priority search queues as finger trees.

LTS Haskell 11.22:0.3
Stackage Nightly 2018-03-12:0.3
Latest on Hackage:0.3

See all snapshots fingertree-psqueue appears in

BSD-3-Clause licensed by Cale Gibbard
Maintained by [email protected]
This version can be pinned in stack with:fingertree-psqueue-0.3@sha256:3b5f86db8e1b2adfd4d01e2486f2753f326c719f7af90b926c3e1e027ff241c5,873

Module documentation for 0.3

Depends on 2 packages(full list with versions):

An implementation of priority search queues: a datastructure holding key/priority bindings having fast operations both for extracting the element with minimum priority and for modifying and looking up elements by key.