priority-queue-0.1: Simple implementation of a priority queue. Source code Contents Index

Data.PriorityQueue

Synopsis

data PriorityQueue m a newPriorityQueue :: (DefaultStateRef sr m1 (PQ a), ModifyRef sr m1 (PQ a), NewRef sr m (PQ a), Ord p) => (a -> p) -> m (PriorityQueue m1 a) newPriorityQueueBy :: (DefaultStateRef sr m1 (PQ a), ModifyRef sr m1 (PQ a), NewRef sr m (PQ a)) => (a -> a -> Ordering) -> m (PriorityQueue m1 a)

Documentation

data PriorityQueue m a Source

Instances Monad m => QueueSize (PriorityQueue m a) m Monad m => Enqueue (PriorityQueue m a) m a Monad m => Dequeue (PriorityQueue m a) m a Monad m => DequeueWhere (PriorityQueue m a) m a Monad m => PeekQueue (PriorityQueue m a) m a

newPriorityQueue :: (DefaultStateRef sr m1 (PQ a), ModifyRef sr m1 (PQ a), NewRef sr m (PQ a), Ord p) => (a -> p) -> m (PriorityQueue m1 a) Source

Construct a new priority queue using the specified indexing function

newPriorityQueueBy :: (DefaultStateRef sr m1 (PQ a), ModifyRef sr m1 (PQ a), NewRef sr m (PQ a)) => (a -> a -> Ordering) -> m (PriorityQueue m1 a) Source

Construct a new priority queue using a comparator function. It is the user's respensibility to ensure that this function provides a sensible order.

Produced by Haddock version 2.3.0