depq: Double-ended priority queues
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.
Double-ended priority queues, for efficient retrieval of minimum and maximum elements in ordered collections of items.
[Skip to Readme]
Properties
| Versions | 0.1.0.0, 0.1.0.0, 0.2.0.0, 0.3.0.0, 0.4.0.0, 0.4.1.0, 0.4.2 |
|---|---|
| Change log | ChangeLog.md |
| Dependencies | base (>=4.7 && <5), containers, deepseq, psqueues [details] |
| License | BSD-3-Clause |
| Copyright | 2020 Marco Zocca |
| Author | Marco Zocca |
| Maintainer | ocramz |
| Category | Data, Data Structures, Data Mining |
| Home page | https://github.com/ocramz/depq |
| Bug tracker | https://github.com/ocramz/depq/issues |
| Source repo | head: git clone https://github.com/ocramz/depq |
| Uploaded | by ocramz at 2020-05-23T07:11:43Z |
Modules
[Index] [Quick Jump]
- Data
Downloads
- depq-0.1.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees