Simulation.Aivika.Trans.Queue.Base

Tested with: GHC 8.0.1

This module defines an optimised finite queue, which has no counters nor signals.

Queue Types

type FCFSQueue m a = Queue m FCFS FCFS FCFS a

A type synonym for the ordinary FIFO queue also known as the FCFS (First Come - First Serviced) queue.

type LCFSQueue m a = Queue m FCFS LCFS FCFS a

A type synonym for the ordinary LIFO queue also known as the LCFS (Last Come - First Serviced) queue.

type SIROQueue m a = Queue m FCFS SIRO FCFS a

A type synonym for the SIRO (Serviced in Random Order) queue.

type PriorityQueue m a = Queue m FCFS StaticPriorities FCFS a

A type synonym for the queue with static priorities applied when storing the elements in the queue.

data Queue m si sm so a

Represents a queue using the specified strategies for enqueueing (input), si, internal storing (in memory), sm, and dequeueing (output), so, where a denotes the type of items stored in the queue. Type m denotes the underlying monad within which the simulation executes.

Creating Queue

newFCFSQueue :: MonadDES m => Int -> Simulation m (FCFSQueue m a)

Create a new FCFS queue with the specified capacity.

newLCFSQueue :: MonadDES m => Int -> Simulation m (LCFSQueue m a)

Create a new LCFS queue with the specified capacity.

newSIROQueue :: (MonadDES m, QueueStrategy m SIRO) => Int -> Simulation m (SIROQueue m a)

Create a new SIRO queue with the specified capacity.

newPriorityQueue :: (MonadDES m, QueueStrategy m StaticPriorities) => Int -> Simulation m (PriorityQueue m a)

Create a new priority queue with the specified capacity.

newQueue

Arguments

:: (MonadDES m, QueueStrategy m si, QueueStrategy m sm, QueueStrategy m so)

=> si

the strategy applied to the enqueueing (input) processes when the queue is full

-> sm

the strategy applied when storing items in the queue

-> so

the strategy applied to the dequeueing (output) processes when the queue is empty

-> Int

the queue capacity

-> Simulation m (Queue m si sm so a)

Create a new queue with the specified strategies and capacity.

Queue Properties and Activities

enqueueStrategy :: Queue m si sm so a -> si

The strategy applied to the enqueueing (input) processes when the queue is full.

enqueueStoringStrategy :: Queue m si sm so a -> sm

The strategy applied when storing (in memory) items in the queue.

dequeueStrategy :: Queue m si sm so a -> so

The strategy applied to the dequeueing (output) processes when the queue is empty.

queueNull :: MonadDES m => Queue m si sm so a -> Event m Bool

Test whether the queue is empty.

See also queueNullChanged and queueNullChanged_.

queueFull :: MonadDES m => Queue m si sm so a -> Event m Bool

Test whether the queue is full.

See also queueFullChanged and queueFullChanged_.

queueMaxCount :: Queue m si sm so a -> Int

The queue capacity.

queueCount :: MonadDES m => Queue m si sm so a -> Event m Int

Return the current queue size.

See also queueCountStats, queueCountChanged and queueCountChanged_.

Dequeuing and Enqueuing

dequeue

Arguments

:: (MonadDES m, DequeueStrategy m si, DequeueStrategy m sm, EnqueueStrategy m so)

=> Queue m si sm so a

the queue

-> Process m a

the dequeued value

Dequeue suspending the process if the queue is empty.

dequeueWithOutputPriority

Arguments

:: (MonadDES m, DequeueStrategy m si, DequeueStrategy m sm, PriorityQueueStrategy m so po)

=> Queue m si sm so a

the queue

-> po

the priority for output

-> Process m a

the dequeued value

Dequeue with the output priority suspending the process if the queue is empty.

tryDequeue

Arguments

:: (MonadDES m, DequeueStrategy m si, DequeueStrategy m sm)

=> Queue m si sm so a

the queue

-> Event m (Maybe a)

the dequeued value of Nothing

Try to dequeue immediately.

enqueue

Arguments

:: (MonadDES m, EnqueueStrategy m si, EnqueueStrategy m sm, DequeueStrategy m so)

=> Queue m si sm so a

the queue

-> a

the item to enqueue

-> Process m ()

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

enqueueWithInputPriority

Arguments

:: (MonadDES m, PriorityQueueStrategy m si pi, EnqueueStrategy m sm, DequeueStrategy m so)

=> Queue m si sm so a

the queue

-> pi

the priority for input

-> a

the item to enqueue

-> Process m ()

Enqueue with the input priority the item suspending the process if the queue is full.

enqueueWithStoringPriority

Arguments

:: (MonadDES m, EnqueueStrategy m si, PriorityQueueStrategy m sm pm, DequeueStrategy m so)

=> Queue m si sm so a

the queue

-> pm

the priority for storing

-> a

the item to enqueue

-> Process m ()

Enqueue with the storing priority the item suspending the process if the queue is full.

enqueueWithInputStoringPriorities

Arguments

:: (MonadDES m, PriorityQueueStrategy m si pi, PriorityQueueStrategy m sm pm, DequeueStrategy m so)

=> Queue m si sm so a

the queue

-> pi

the priority for input

-> pm

the priority for storing

-> a

the item to enqueue

-> Process m ()

Enqueue with the input and storing priorities the item suspending the process if the queue is full.

tryEnqueue

Arguments

:: (MonadDES m, EnqueueStrategy m sm, DequeueStrategy m so)

=> Queue m si sm so a

the queue

-> a

the item which we try to enqueue

-> Event m Bool

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

tryEnqueueWithStoringPriority

Arguments

:: (MonadDES m, PriorityQueueStrategy m sm pm, DequeueStrategy m so)

=> Queue m si sm so a

the queue

-> pm

the priority for storing

-> a

the item which we try to enqueue

-> Event m Bool

Try to enqueue with the storing priority the item. Return False in the monad if the queue is full.

queueDelete

Arguments

:: (MonadDES m, Eq a, DequeueStrategy m si, DeletingQueueStrategy m sm, DequeueStrategy m so)

=> Queue m si sm so a

the queue

-> a

the item to remove from the queue

-> Event m Bool

whether the item was found and removed

Remove the item from the queue and return a flag indicating whether the item was found and actually removed.

queueDelete_

Arguments

:: (MonadDES m, Eq a, DequeueStrategy m si, DeletingQueueStrategy m sm, DequeueStrategy m so)

=> Queue m si sm so a

the queue

-> a

the item to remove from the queue

-> Event m ()

Remove the specified item from the queue.

queueDeleteBy

Arguments

:: (MonadDES m, DequeueStrategy m si, DeletingQueueStrategy m sm, DequeueStrategy m so)

=> Queue m si sm so a

the queue

-> (a -> Bool)

the predicate

-> Event m (Maybe a)

Remove an item satisfying the specified predicate and return the item if found.

queueDeleteBy_

Arguments

:: (MonadDES m, DequeueStrategy m si, DeletingQueueStrategy m sm, DequeueStrategy m so)

=> Queue m si sm so a

the queue

-> (a -> Bool)

the predicate

-> Event m ()

Remove an item satisfying the specified predicate.

queueContains

Arguments

:: (MonadDES m, Eq a, DeletingQueueStrategy m sm)

=> Queue m si sm so a

the queue

-> a

the item to search the queue for

-> Event m Bool

whether the item was found

Detect whether the item is contained in the queue.

queueContainsBy

Arguments

:: (MonadDES m, DeletingQueueStrategy m sm)

=> Queue m si sm so a

the queue

-> (a -> Bool)

the predicate

-> Event m (Maybe a)

the item if it was found

Detect whether an item satisfying the specified predicate is contained in the queue.

clearQueue

Arguments

:: (MonadDES m, DequeueStrategy m si, DequeueStrategy m sm)

=> Queue m si sm so a

the queue

-> Event m ()

Clear the queue immediately.