Simulation.Aivika.Dynamics.LIFO

Tested with: GHC 7.6.3

This module defines the LIFO queue.

Documentation

data LIFO a

Represents the LIFO queue with rule: last input - first output.

lifoQueue :: LIFO a -> EventQueue

Return the event queue.

lifoNull :: LIFO a -> Dynamics Bool

Test whether the LIFO queue is empty.

lifoFull :: LIFO a -> Dynamics Bool

Test whether the LIFO queue is full.

lifoMaxCount :: LIFO a -> Int

The maximum available number of items.

lifoCount :: LIFO a -> Dynamics Int

Return the queue size.

lifoLostCount :: LIFO a -> Dynamics Int

Return the number of lost items.

lifoEnqueue :: LIFO a -> Signal a

Return a signal that notifies when any item is enqueued.

lifoDequeue :: LIFO a -> Signal a

Return a signal that notifies when any item is dequeued.

lifoEnqueueLost :: LIFO a -> Signal a

Return a signal which notifies that the item was lost when attempting to add it to the full queue with help of enqueueLIFOOrLost.

newLIFO :: EventQueue -> Int -> Simulation (LIFO a)

Create a new LIFO queue with the specified maximum available number of items.

dequeueLIFO :: LIFO a -> Process a

Dequeue from the LIFO queue suspending the process if the queue is empty.

tryDequeueLIFO :: LIFO a -> Dynamics (Maybe a)

Try to dequeue from the LIFO queue immediately.

enqueueLIFO :: LIFO a -> a -> Process ()

Enqueue the item in the LIFO queue suspending the process if the queue is full.

tryEnqueueLIFO :: LIFO a -> a -> Dynamics Bool

Try to enqueue the item in the LIFO queue. Return False in the monad if the queue is full.

enqueueLIFOOrLost :: LIFO a -> a -> Dynamics ()

Try to enqueue the item in the LIFO queue. If the queue is full then the item will be lost.