pqueue-mtl-1.0.6: Fully encapsulated monad transformers with queuelike functionality.

The pqueue-mtl package

This package is obsolete: use queuelike instead.

Contains several implementations of data structures implementing a single-in, single-out paradigm, and implements monad transformers for their safe use. The monad transformer part of the library includes tools to fully encapsulate single-threaded use of a priority queue in a monad, including an array-based heap implementation. In general, the purely functional queue types can be ordered in increasing order of speed on generic insertion/deletion operations as follows: Stack, Queue, PQueue, IntQueue, SkewQueue, FQueue, Heap. (PQueue, IntQueue, and SkewQueue are all very nearly the same speed.) Work is in progress on a van Emde Boas or y-fast priority queue implementation, which provides sublogarithmic functionality for all operations.

Properties

Versions1.0, 1.0.1, 1.0.2, 1.0.3, 1.0.4, 1.0.5, 1.0.6, 1.0.7
Dependenciesbase, containers, ghc-prim, MaybeT, mtl, stateful-mtl (1.0.5), uvector
LicenseBSD3
AuthorLouis Wasserman
Maintainerwasserman.louis@gmail.com
Stabilityexperimental
CategoryMonads, Algorithms
Bug trackermailto:wasserman.louis@gmail.com
Upload dateMon Mar 2 15:50:36 UTC 2009
Uploaded byLouisWasserman
Built onghc-6.10
Build failureghc-6.12 (log)

Modules

Downloads