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

Control.Monad.Queue.Heap

Synopsis

type HeapM s e = HeapT s e (ST s) data HeapT s e m a runHeapM :: Ord e => (forall s. HeapM s e a) -> a runHeapMIO :: Ord e => HeapM RealWorld e a -> IO a runHeapT :: (MonadST s m, Monad m) => HeapT s e m a -> m a

Documentation

type HeapM s e = HeapT s e (ST s) Source

Monad based on an array implementation of a standard binary heap.

data HeapT s e m a Source

Monad transformer based on an array implementation of a standard binary heap. Instances MonadReader r m => MonadReader r (HeapT s e m) (MonadST s m, MonadState t m) => MonadState t (HeapT s e m) MonadWriter w m => MonadWriter w (HeapT s e m) MonadST s m => MonadST s (HeapT s e m) (MonadST s m, Monad m, Ord e) => MonadQueue e (HeapT s e m) MonadTrans (HeapT s e) Monad m => Monad (HeapT s e m) MonadFix m => MonadFix (HeapT s e m)

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

Runs an HeapM computation starting with an empty heap.

runHeapMIO :: Ord e => HeapM RealWorld e a -> IO a Source

runHeapT :: (MonadST s m, Monad m) => HeapT s e m a -> m a Source

Produced by Haddock version 2.4.1