Simulation.Aivika.QueueStrategy

Tested with: GHC 7.10.1

This module defines the queue strategies.

Documentation

class QueueStrategy s where

Defines the basic queue strategy.

Associated Types

data StrategyQueue s :: * -> *

A queue used by the strategy.

Methods

newStrategyQueue

Arguments

:: s

the strategy

-> Simulation (StrategyQueue s i)

a new queue

Create a new queue by the specified strategy.

strategyQueueNull

Arguments

:: StrategyQueue s i

the queue

-> Event Bool

the result of the test

Test whether the queue is empty.

Instances

QueueStrategy StaticPriorities

An implementation of the StaticPriorities queue strategy.

QueueStrategy SIRO

An implementation of the SIRO queue strategy.

QueueStrategy LCFS

An implementation of the LCFS queue strategy.

QueueStrategy FCFS

An implementation of the FCFS queue strategy.

class QueueStrategy s => DequeueStrategy s where

Defines a strategy with support of the dequeuing operation.

Methods

strategyDequeue

Arguments

:: StrategyQueue s i

the queue

-> Event i

the dequeued element

Dequeue the front element and return it.

Instances

DequeueStrategy StaticPriorities

An implementation of the StaticPriorities queue strategy.

DequeueStrategy SIRO

An implementation of the SIRO queue strategy.

DequeueStrategy LCFS

An implementation of the LCFS queue strategy.

DequeueStrategy FCFS

An implementation of the FCFS queue strategy.

class DequeueStrategy s => EnqueueStrategy s where

It defines a strategy when we can enqueue a single element.

Methods

strategyEnqueue

Arguments

:: StrategyQueue s i

the queue

-> i

the element to be enqueued

-> Event ()

the action of enqueuing

Enqueue an element.

Instances

EnqueueStrategy SIRO

An implementation of the SIRO queue strategy.

EnqueueStrategy LCFS

An implementation of the LCFS queue strategy.

EnqueueStrategy FCFS

An implementation of the FCFS queue strategy.

class DequeueStrategy s => PriorityQueueStrategy s p | s -> p where

It defines a strategy when we can enqueue an element with the specified priority.

Methods

strategyEnqueueWithPriority

Arguments

:: StrategyQueue s i

the queue

-> p

the priority

-> i

the element to be enqueued

-> Event ()

the action of enqueuing

Enqueue an element with the specified priority.

Instances

PriorityQueueStrategy StaticPriorities Double

An implementation of the StaticPriorities queue strategy.

class DequeueStrategy s => DeletingQueueStrategy s where

Defines a strategy with support of the deleting operation.

Minimal complete definition

strategyQueueDeleteBy, strategyQueueContainsBy

Methods

strategyQueueDelete

Arguments

:: Eq i

=> StrategyQueue s i

the queue

-> i

the element

-> Event Bool

whether the element was found and removed

Remove the element and return a flag indicating whether the element was found and removed.

strategyQueueDeleteBy

Arguments

:: StrategyQueue s i

the queue

-> (i -> Bool)

the predicate

-> Event (Maybe i)

the element if it was found and removed

Remove an element satisfying the predicate and return the element if found.

strategyQueueContains

Arguments

:: Eq i

=> StrategyQueue s i

the queue

-> i

the element to find

-> Event Bool

whether the element is contained in the queue

Detect whether the specified element is contained in the queue.

strategyQueueContainsBy

Arguments

:: StrategyQueue s i

the queue

-> (i -> Bool)

the predicate

-> Event (Maybe i)

the element if it was found

Detect whether an element satifying the specified predicate is contained in the queue.

Instances

DeletingQueueStrategy StaticPriorities

An implementation of the StaticPriorities queue strategy.

DeletingQueueStrategy SIRO

An implementation of the SIRO queue strategy.

DeletingQueueStrategy LCFS

An implementation of the LCFS queue strategy.

DeletingQueueStrategy FCFS

An implementation of the FCFS queue strategy.

data FCFS

Strategy: First Come - First Served (FCFS).

Constructors

FCFS

Instances

Eq FCFS

Ord FCFS

Show FCFS

DeletingQueueStrategy FCFS

An implementation of the FCFS queue strategy.

EnqueueStrategy FCFS

An implementation of the FCFS queue strategy.

DequeueStrategy FCFS

An implementation of the FCFS queue strategy.

QueueStrategy FCFS

An implementation of the FCFS queue strategy.

ResultItemable (ResultValue FCFS)

data StrategyQueue FCFS = FCFSQueue (DoubleLinkedList i)

data LCFS

Strategy: Last Come - First Served (LCFS)

Constructors

LCFS

Instances

Eq LCFS

Ord LCFS

Show LCFS

DeletingQueueStrategy LCFS

An implementation of the LCFS queue strategy.

EnqueueStrategy LCFS

An implementation of the LCFS queue strategy.

DequeueStrategy LCFS

An implementation of the LCFS queue strategy.

QueueStrategy LCFS

An implementation of the LCFS queue strategy.

ResultItemable (ResultValue LCFS)

data StrategyQueue LCFS = LCFSQueue (DoubleLinkedList i)

data SIRO

Strategy: Service in Random Order (SIRO).

Constructors

SIRO

Instances

Eq SIRO

Ord SIRO

Show SIRO

DeletingQueueStrategy SIRO

An implementation of the SIRO queue strategy.

EnqueueStrategy SIRO

An implementation of the SIRO queue strategy.

DequeueStrategy SIRO

An implementation of the SIRO queue strategy.

QueueStrategy SIRO

An implementation of the SIRO queue strategy.

ResultItemable (ResultValue SIRO)

data StrategyQueue SIRO = SIROQueue (Vector i)

data StaticPriorities

Strategy: Static Priorities. It uses the priority queue.

Constructors

StaticPriorities

Instances

Eq StaticPriorities

Ord StaticPriorities

Show StaticPriorities

DeletingQueueStrategy StaticPriorities

An implementation of the StaticPriorities queue strategy.

DequeueStrategy StaticPriorities

An implementation of the StaticPriorities queue strategy.

QueueStrategy StaticPriorities

An implementation of the StaticPriorities queue strategy.

PriorityQueueStrategy StaticPriorities Double

An implementation of the StaticPriorities queue strategy.

ResultItemable (ResultValue StaticPriorities)

data StrategyQueue StaticPriorities = StaticPriorityQueue (PriorityQueue i)