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

[ algorithms, bsd3, deprecated, library, monads ] [ Propose Tags ]
Deprecated in favor of queuelike

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.

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 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]
License BSD-3-Clause
Author Louis Wasserman
Maintainer wasserman.louis@gmail.com
Category Monads, Algorithms
Bug tracker mailto:wasserman.louis@gmail.com
Uploaded by LouisWasserman at 2009-03-13T21:58:50Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 5689 total (10 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]