PSQueue: Priority Search Queue

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain] [Publish]

A priority search queue efficiently supports the opperations of both a search tree and a priority queue. A Binding is a product of a key and a priority. Bindings can be inserted, deleted, modified and queried in logarithmic time, and the binding with the least priority can be retrieved in constant time. A queue can be built from a list of bindings, sorted by keys, in linear time.

Properties

Versions 1.0, 1.1, 1.1.0.1, 1.1.0.1
Change log ChangeLog.md
Dependencies base (>=4.3 && <4.13) [details]
License BSD-3-Clause
Author Ralf Hinze
Maintainer Hackage Trustees <trustees@hackage.haskell.org>
Category Data Structures
Bug tracker https://github.com/hackage-trustees/PSQueue/issues
Source repo head: git clone https://github.com/hackage-trustees/PSQueue.git
Uploaded by HerbertValerioRiedel at 2019-01-12T19:54:48Z

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees