pqueue-mtl-1.0.1: Fully encapsulated monad transformers with queuelike functionality. Source code Contents Index

Control.Monad.Queue.Heap

Synopsis

data HeapM s e a runHeapM :: Ord e => (forall s. HeapM s e a) -> a

Documentation

data HeapM s e a Source

Monad based on an array implementation of a standard binary heap. Instances MonadST s (HeapM s e) Ord e => MonadQueue e (HeapM s e) Monad (HeapM s e)

runHeapM :: Ord e => (forall s. HeapM s e a) -> a Source

Runs an HeapM computation starting with an empty heap.

Produced by Haddock version 2.4.1