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.

Modules

[Last Documentation]

  • Control
    • Monad
      • Control.Monad.Queue
        • Control.Monad.Queue.Class
        • Control.Monad.Queue.Heap
        • Control.Monad.Queue.Instances
        • Control.Monad.Queue.QueueT
  • Data
    • Data.Queue
      • Data.Queue.Class
      • Data.Queue.FibQueue
      • Data.Queue.Instances
      • Data.Queue.PQueue
      • Data.Queue.Queue
      • Data.Queue.ReverseQueue
      • Data.Queue.Stack

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 [details]
License BSD-3-Clause
Author Louis Wasserman
Maintainer wasserman.louis@gmail.com
Category Monads, Algorithms
Uploaded by LouisWasserman at 2009-02-15T19:18:37Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 5730 total (17 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2017-01-02 [all 7 reports]