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 [RSS] [faq] 0.1.0.0, 0.2.0.0, 0.3.0.0, 0.4.0.0, 0.4.1.0, 0.4.2
Change log ChangeLog.md
Dependencies base (>=4.7 && <5), containers (>=0.6.0.1), deepseq (>=1.4.4), psqueues (>=0.2.7.2) [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-23T08:06:21Z
Distributions LTSHaskell:0.4.2, NixOS:0.4.2, Stackage:0.4.2
Downloads 723 total (48 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-23 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Candidates


Readme for depq-0.3.0.0

[back to package description]

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.

The most common use case of this library is to populate a DEPQ (either from a 'Foldable' collection or by 'insert'ing incrementally) and query either or both 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.