depq

Double-ended priority queues

https://github.com/ocramz/depq

Version on this page:0.4.0.0
LTS Haskell 24.28:0.4.2
Stackage Nightly 2026-01-17:0.4.2
Latest on Hackage:0.4.2

See all snapshots depq appears in

BSD-3-Clause licensed by Marco Zocca
Maintained by ocramz
This version can be pinned in stack with:depq-0.4.0.0@sha256:474be8c6937231dd22d082caae7e6972dd874871b185ac016138f783e0391970,1283

Module documentation for 0.4.0.0

depq

Double-ended priority queues

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

Usage

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!

Implementation

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

Changes

Changelog for depq

0.4

  • Add test suite ( @HirotoShioi )

0.3

  • Add ‘size’
  • Add dependency lower bounds

0.1

First release