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]
Versions [faq],,,,
Change log
Dependencies base (>=4.7 && <5), containers (>=, deepseq (>=1.4.4), psqueues (>=, QuickCheck [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-31T11:17:31Z
Distributions NixOS:
Downloads 333 total (3 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2020-05-31 [all 1 reports]


[Index] [Quick Jump]


Maintainer's Corner

For package maintainers and hackage trustees

Readme for depq-

[back to package description]


Hackage depq

Double-ended priority queues

This library provides a type for 'DEPQ's, along with functions for constructing and querying them.


The Data.DEPQ module exports the user interface, which is similar to that of most Haskell data container libraries.

Populate a DEPQ (either from a Foldable collection such as a list or array or by inserting incrementally) and query either of its extremes (with findMin, findMax, popMin, popMax, topK, bottomK).

Have fun!


Currently the implementation is based on 'IntPSQ' (integer-indexed priority search queues) from the 'psqueues' package.