BSD-3-Clause licensed by Marco Zocca
Maintained by ocramz

Module documentation for 0.4.1.0

This version can be pinned in stack with:depq-0.4.1.0@sha256:e8a8700ba2f20fc87df32162c63e659051b3d7e52362eedb0e0a25e77ededacd,1283

depq

Hackage 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.1

  • add Foldable instance

0.4

  • Add test suite ( @HirotoShioi )

0.3

  • Add ‘size’
  • Add dependency lower bounds

0.1

First release