Implementation of priority search queues as finger trees.

Version on this page:0.3
LTS Haskell 8.12:0.3
Stackage Nightly 2017-02-11:0.3
Latest on Hackage:0.3
BSD3 licensed by Cale Gibbard
Maintained by

Module documentation for 0.3

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.

Depends on:
Used by 1 package:
comments powered byDisqus