depq: Double-ended priority queues

[ bsd3, data, data-mining, data-structures, library ] [ Propose Tags ]

Double-ended priority queues, for efficient retrieval of minimum and maximum elements in ordered collections of items.

[Skip to Readme]


[Index] [Quick Jump]


Maintainer's Corner

For package maintainers and hackage trustees


Versions [RSS],,,,, 0.4.2
Change log
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
Bug tracker
Source repo head: git clone
Uploaded by ocramz at 2020-05-23T07:16:24Z
Distributions LTSHaskell:0.4.2, NixOS:0.4.2, Stackage:0.4.2
Downloads 876 total (16 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2020-05-23 [all 1 reports]

Readme for depq-

[back to package description]