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.

Versions [faq]	0.1.0.0, 0.2.0.0, 0.3.0.0, 0.4.0.0
Change log	ChangeLog.md
Dependencies	base (>=4.7 && <5), containers (>=0.6.0.1), deepseq (>=1.4.4), psqueues (>=0.2.7.2), QuickCheck [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-24T08:37:49Z
Distributions
Downloads	74 total (74 in the last 30 days)
Rating	(no votes yet) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs available [build log] Last success reported on 2020-05-24 [all 1 reports]

Modules

[Index] [Quick Jump]

Data
- Data.DEPQ

Downloads

depq-0.4.0.0.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

For package maintainers and hackage trustees

edit package information

Readme for depq-0.4.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.

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.