Simulation.Aivika.PriorityQueue

Tested with: GHC 7.10.1

An imperative heap-based priority queue.

Documentation

data PriorityQueue a

The PriorityQueue type represents an imperative heap-based priority queue.

queueNull :: PriorityQueue a -> IO Bool

Test whether the priority queue is empty.

queueCount :: PriorityQueue a -> IO Int

Return the number of elements in the priority queue.

newQueue :: IO (PriorityQueue a)

Create a new priority queue.

enqueue :: PriorityQueue a -> Double -> a -> IO ()

Enqueue a new element with the specified priority.

dequeue :: PriorityQueue a -> IO ()

Dequeue the element with the minimal priority.

queueFront :: PriorityQueue a -> IO (Double, a)

Return the element with the minimal priority.

queueDelete :: Eq a => PriorityQueue a -> a -> IO Bool

Remove the specified element from the queue and return a computation of the flag indicating whether the element was actually removed.

Note that unlike other functions it has complexity O(n).

queueDeleteBy :: PriorityQueue a -> (a -> Bool) -> IO (Maybe a)

Remove an element satisfying the predicate and return a computation of the element if found.

Note that unlike other functions it has complexity O(n).

queueContains :: Eq a => PriorityQueue a -> a -> IO Bool

Detect whether the specified element is contained in the queue.

Note that unlike other functions it has complexity O(n).

queueContainsBy :: PriorityQueue a -> (a -> Bool) -> IO (Maybe a)

Detect whether an element satisfying the predicate is contained in the queue.

Note that unlike other functions it has complexity O(n).

remove :: Eq a => PriorityQueue a -> a -> IO Bool

Deprecated: Use queueDelete instead.

Use queueDelete instead.

removeBy :: PriorityQueue a -> (a -> Bool) -> IO Bool

Deprecated: Use queueDeleteBy instead.

Use queueDeleteBy instead.