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. This package is now deprecated. Use queuelike instead.
Properties
| Versions | 1.0, 1.0.1, 1.0.2, 1.0.3, 1.0.4, 1.0.5, 1.0.6, 1.0.7 |
|---|---|
| Dependencies | base, containers, ghc-prim, MaybeT, mtl, stateful-mtl (1.0.5), uvector |
| License | BSD3 |
| Author | Louis Wasserman |
| Maintainer | wasserman.louis@gmail.com |
| Stability | experimental |
| Category | Monads, Algorithms |
| Bug tracker | mailto:wasserman.louis@gmail.com |
| Upload date | Fri Mar 13 21:58:50 UTC 2009 |
| Uploaded by | LouisWasserman |
| Built on | ghc-6.10 |
| Build failure | ghc-6.12 (log), ghc-7.0 (log) |
Modules
- Control
- Data
Downloads
- pqueue-mtl-1.0.7.tar.gz (Cabal source package)
- package description (included in the package)