Simulation.Aivika.PriorityQueue.EventQueue.Pure

Tested with: GHC 9.2.8

An immutable heap-based priority queue based on book Algorithms: A Functional Programming Approach by Fethi Rabhi and Guy Lapalme.

The queue allows specifying priorities along with keys.

Documentation

data PriorityQueue a

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

Instances

Show a => Show (PriorityQueue a)

Defined in Simulation.Aivika.PriorityQueue.EventQueue.Pure

Methods

showsPrec :: Int -> PriorityQueue a -> ShowS

show :: PriorityQueue a -> String

showList :: [PriorityQueue a] -> ShowS

type Priority = Int

The priority value (greater is higher).

queueNull :: PriorityQueue a -> Bool

Test whether the priority queue is empty.

queueCount :: PriorityQueue a -> Int

Return the number of elements in the priority queue.

emptyQueue :: PriorityQueue a

An empty priority queue.

enqueue :: PriorityQueue a -> Double -> Priority -> a -> PriorityQueue a

Enqueue a new element with the specified priority.

dequeue :: PriorityQueue a -> PriorityQueue a

Dequeue the element with the minimal priority.

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

Return the element with the minimal priority.