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]

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

Versions1.0, 1.1, 1.1.0.1, 1.1.0.1
Change logChangeLog.md
Dependenciesbase (>=4.3 && <4.13) [details]
LicenseBSD-3-Clause
AuthorRalf Hinze
MaintainerHackage Trustees <trustees@hackage.haskell.org>
CategoryData Structures
Bug trackerhttps://github.com/hackage-trustees/PSQueue/issues
Source repositoryhead: git clone https://github.com/hackage-trustees/PSQueue.git
UploadedSat Jan 12 19:54:48 UTC 2019 by HerbertValerioRiedel

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees