aivika-6.1.1: A multi-method simulation library
CopyrightCopyright (c) 2009-2017 David Sorokin <david.sorokin@gmail.com>
LicenseBSD3
MaintainerDavid Sorokin <david.sorokin@gmail.com>
Stabilityexperimental
Safe HaskellSafe-Inferred
LanguageHaskell2010

Simulation.Aivika.PriorityQueue.EventQueue

Description

Tested with: GHC 8.0.1

An imperative heap-based priority queue to implement the event queue.

Synopsis

Documentation

data PriorityQueue a Source #

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

type Priority = Int Source #

The priority value (greater is higher).

queueNull :: PriorityQueue a -> IO Bool Source #

Test whether the priority queue is empty.

queueCount :: PriorityQueue a -> IO Int Source #

Return the number of elements in the priority queue.

newQueue :: IO (PriorityQueue a) Source #

Create a new priority queue.

enqueue :: PriorityQueue a -> Double -> Priority -> a -> IO () Source #

Enqueue a new element with the specified priority.

dequeue :: PriorityQueue a -> IO () Source #

Dequeue the element with the minimal priority.

queueFront :: PriorityQueue a -> IO (Double, Priority, a) Source #

Return the element with the minimal priority.