ghc-fingertree-psqueue
Implementation of priority search queues as finger trees
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.
BSD-3-Clausecloud_download Downloads
To download packages, you need to log in and have a valid subscription.
Please select a product to see the available package versions:
Loading...
Loading package downloads...