The pqueue-mtl package
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
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.
|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 [details]|
|Uploaded||Fri Mar 13 21:58:50 UTC 2009 by LouisWasserman|
|Downloads||2673 total (42 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI
For package maintainers and hackage trustees