depq: Double-ended priority queues
Double-ended priority queues, for efficient retrieval of minimum and maximum elements in ordered collections of items.
[Skip to Readme]
Versions [faq] | 0.1.0.0, 0.2.0.0, 0.3.0.0, 0.4.0.0, 0.4.1.0 |
---|---|
Change log | ChangeLog.md |
Dependencies | base (>=4.7 && <5), containers (>=0.6.0.1), deepseq (>=1.4.4), psqueues (>=0.2.7.2), QuickCheck [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-31T11:17:31Z |
Distributions | NixOS:0.4.1.0 |
Downloads | 333 total (3 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2020-05-31 [all 1 reports] |
Downloads
- depq-0.4.1.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)