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

Control.Monad.Queue.Heap

Synopsis

type HeapM s e = HeapT e (ST s) data HeapT e m a runHeapM :: Ord e => (forall s. HeapM s e a) -> a runHeapMOn :: Ord e => (forall s. HeapM s e a) -> Int -> [e] -> a runHeapT :: (MonadST m, Monad m) => HeapT e m a -> m a runHeapTOn :: (MonadST m, Monad m, Ord e) => HeapT e m a -> Int -> [e] -> m a

Documentation

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

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

data HeapT e m a Source

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

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

Runs an HeapM computation starting with an empty heap.

runHeapMOn :: Ord e => (forall s. HeapM s e a) -> Int -> [e] -> a Source

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

runHeapTOn Source

:: (MonadST m, Monad m, Ord e) => HeapT e m a The transformer operation. -> Int The starting size of the heap (must be equal to the length of the list) -> [e] The initial contents of the heap -> m a Runs an HeapM computation starting with a heap initialized to hold the specified list. (Since this can be done with linear preprocessing, this is more efficient than inserting the elements one by one.)

Produced by Haddock version 2.4.1