Copyright	Copyright (c) 2009-2017 David Sorokin <david.sorokin@gmail.com>
License	BSD3
Maintainer	David Sorokin <david.sorokin@gmail.com>
Stability	experimental
Safe Haskell	None
Language	Haskell2010

Simulation.Aivika.QueueStrategy

Description

Tested with: GHC 8.0.1

This module defines the queue strategies.

Synopsis

Documentation

class QueueStrategy s where Source #

Defines the basic queue strategy.

Minimal complete definition

newStrategyQueue, strategyQueueNull

Associated Types

data StrategyQueue s :: * -> * Source #

A queue used by the strategy.

Methods

newStrategyQueue Source #

Arguments

:: s	the strategy
-> Simulation (StrategyQueue s i)	a new queue

Create a new queue by the specified strategy.

strategyQueueNull Source #

Arguments

:: StrategyQueue s i	the queue
-> Event Bool	the result of the test

Test whether the queue is empty.

Instances

QueueStrategy StaticPriorities Source #	An implementation of the `StaticPriorities` queue strategy.
Associated Types data StrategyQueue StaticPriorities a :: * Source # Methods newStrategyQueue :: StaticPriorities -> Simulation (StrategyQueue StaticPriorities i) Source # strategyQueueNull :: StrategyQueue StaticPriorities i -> Event Bool Source #
QueueStrategy SIRO Source #	An implementation of the `SIRO` queue strategy.
Associated Types data StrategyQueue SIRO a :: * Source # Methods newStrategyQueue :: SIRO -> Simulation (StrategyQueue SIRO i) Source # strategyQueueNull :: StrategyQueue SIRO i -> Event Bool Source #
QueueStrategy LCFS Source #	An implementation of the `LCFS` queue strategy.
Associated Types data StrategyQueue LCFS a :: * Source # Methods newStrategyQueue :: LCFS -> Simulation (StrategyQueue LCFS i) Source # strategyQueueNull :: StrategyQueue LCFS i -> Event Bool Source #
QueueStrategy FCFS Source #	An implementation of the `FCFS` queue strategy.
Associated Types data StrategyQueue FCFS a :: * Source # Methods newStrategyQueue :: FCFS -> Simulation (StrategyQueue FCFS i) Source # strategyQueueNull :: StrategyQueue FCFS i -> Event Bool Source #

class QueueStrategy s => DequeueStrategy s where Source #

Defines a strategy with support of the dequeuing operation.

Minimal complete definition

strategyDequeue

Methods

strategyDequeue Source #

Arguments

:: StrategyQueue s i	the queue
-> Event i	the dequeued element

Dequeue the front element and return it.

Instances

DequeueStrategy StaticPriorities Source #	An implementation of the `StaticPriorities` queue strategy.
Methods strategyDequeue :: StrategyQueue StaticPriorities i -> Event i Source #
DequeueStrategy SIRO Source #	An implementation of the `SIRO` queue strategy.
Methods strategyDequeue :: StrategyQueue SIRO i -> Event i Source #
DequeueStrategy LCFS Source #	An implementation of the `LCFS` queue strategy.
Methods strategyDequeue :: StrategyQueue LCFS i -> Event i Source #
DequeueStrategy FCFS Source #	An implementation of the `FCFS` queue strategy.
Methods strategyDequeue :: StrategyQueue FCFS i -> Event i Source #

class DequeueStrategy s => EnqueueStrategy s where Source #

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

Minimal complete definition

strategyEnqueue

Methods

strategyEnqueue Source #

Arguments

:: StrategyQueue s i	the queue
-> i	the element to be enqueued
-> Event ()	the action of enqueuing

Enqueue an element.

Instances

EnqueueStrategy SIRO Source #	An implementation of the `SIRO` queue strategy.
Methods strategyEnqueue :: StrategyQueue SIRO i -> i -> Event () Source #
EnqueueStrategy LCFS Source #	An implementation of the `LCFS` queue strategy.
Methods strategyEnqueue :: StrategyQueue LCFS i -> i -> Event () Source #
EnqueueStrategy FCFS Source #	An implementation of the `FCFS` queue strategy.
Methods strategyEnqueue :: StrategyQueue FCFS i -> i -> Event () Source #

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

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

Minimal complete definition

strategyEnqueueWithPriority

Methods

strategyEnqueueWithPriority Source #

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 Source #	An implementation of the `StaticPriorities` queue strategy.
Methods strategyEnqueueWithPriority :: StrategyQueue StaticPriorities i -> Double -> i -> Event () Source #

class DequeueStrategy s => DeletingQueueStrategy s where Source #

Defines a strategy with support of the deleting operation.

Minimal complete definition

strategyQueueDeleteBy, strategyQueueContainsBy

Methods

strategyQueueDelete Source #

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 Source #

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 Source #

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 Source #

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 Source #	An implementation of the `StaticPriorities` queue strategy.
Methods strategyQueueDelete :: Eq i => StrategyQueue StaticPriorities i -> i -> Event Bool Source # strategyQueueDeleteBy :: StrategyQueue StaticPriorities i -> (i -> Bool) -> Event (Maybe i) Source # strategyQueueContains :: Eq i => StrategyQueue StaticPriorities i -> i -> Event Bool Source # strategyQueueContainsBy :: StrategyQueue StaticPriorities i -> (i -> Bool) -> Event (Maybe i) Source #
DeletingQueueStrategy SIRO Source #	An implementation of the `SIRO` queue strategy.
Methods strategyQueueDelete :: Eq i => StrategyQueue SIRO i -> i -> Event Bool Source # strategyQueueDeleteBy :: StrategyQueue SIRO i -> (i -> Bool) -> Event (Maybe i) Source # strategyQueueContains :: Eq i => StrategyQueue SIRO i -> i -> Event Bool Source # strategyQueueContainsBy :: StrategyQueue SIRO i -> (i -> Bool) -> Event (Maybe i) Source #
DeletingQueueStrategy LCFS Source #	An implementation of the `LCFS` queue strategy.
Methods strategyQueueDelete :: Eq i => StrategyQueue LCFS i -> i -> Event Bool Source # strategyQueueDeleteBy :: StrategyQueue LCFS i -> (i -> Bool) -> Event (Maybe i) Source # strategyQueueContains :: Eq i => StrategyQueue LCFS i -> i -> Event Bool Source # strategyQueueContainsBy :: StrategyQueue LCFS i -> (i -> Bool) -> Event (Maybe i) Source #
DeletingQueueStrategy FCFS Source #	An implementation of the `FCFS` queue strategy.
Methods strategyQueueDelete :: Eq i => StrategyQueue FCFS i -> i -> Event Bool Source # strategyQueueDeleteBy :: StrategyQueue FCFS i -> (i -> Bool) -> Event (Maybe i) Source # strategyQueueContains :: Eq i => StrategyQueue FCFS i -> i -> Event Bool Source # strategyQueueContainsBy :: StrategyQueue FCFS i -> (i -> Bool) -> Event (Maybe i) Source #

data FCFS Source #

Strategy: First Come - First Served (FCFS).

Constructors

FCFS

Instances

Eq FCFS Source #
Methods (==) :: FCFS -> FCFS -> Bool # (/=) :: FCFS -> FCFS -> Bool #
Ord FCFS Source #
Methods compare :: FCFS -> FCFS -> Ordering # (<) :: FCFS -> FCFS -> Bool # (<=) :: FCFS -> FCFS -> Bool # (>) :: FCFS -> FCFS -> Bool # (>=) :: FCFS -> FCFS -> Bool # max :: FCFS -> FCFS -> FCFS # min :: FCFS -> FCFS -> FCFS #
Show FCFS Source #
Methods showsPrec :: Int -> FCFS -> ShowS # show :: FCFS -> String # showList :: [FCFS] -> ShowS #
DeletingQueueStrategy FCFS Source #	An implementation of the `FCFS` queue strategy.
Methods strategyQueueDelete :: Eq i => StrategyQueue FCFS i -> i -> Event Bool Source # strategyQueueDeleteBy :: StrategyQueue FCFS i -> (i -> Bool) -> Event (Maybe i) Source # strategyQueueContains :: Eq i => StrategyQueue FCFS i -> i -> Event Bool Source # strategyQueueContainsBy :: StrategyQueue FCFS i -> (i -> Bool) -> Event (Maybe i) Source #
EnqueueStrategy FCFS Source #	An implementation of the `FCFS` queue strategy.
Methods strategyEnqueue :: StrategyQueue FCFS i -> i -> Event () Source #
DequeueStrategy FCFS Source #	An implementation of the `FCFS` queue strategy.
Methods strategyDequeue :: StrategyQueue FCFS i -> Event i Source #
QueueStrategy FCFS Source #	An implementation of the `FCFS` queue strategy.
Associated Types data StrategyQueue FCFS a :: * Source # Methods newStrategyQueue :: FCFS -> Simulation (StrategyQueue FCFS i) Source # strategyQueueNull :: StrategyQueue FCFS i -> Event Bool Source #
ResultItemable (ResultValue FCFS) Source #
Methods resultItemName :: ResultValue FCFS -> ResultName Source # resultItemNamePath :: ResultValue FCFS -> [ResultName] Source # resultItemId :: ResultValue FCFS -> ResultId Source # resultItemIdPath :: ResultValue FCFS -> [ResultId] Source # resultItemSignal :: ResultValue FCFS -> ResultSignal Source # resultItemExpansion :: ResultValue FCFS -> ResultSource Source # resultItemSummary :: ResultValue FCFS -> ResultSource Source # resultItemAsIntValue :: ResultValue FCFS -> Maybe (ResultValue Int) Source # resultItemAsIntListValue :: ResultValue FCFS -> Maybe (ResultValue [Int]) Source # resultItemAsIntStatsValue :: ResultValue FCFS -> Maybe (ResultValue (SamplingStats Int)) Source # resultItemAsIntTimingStatsValue :: ResultValue FCFS -> Maybe (ResultValue (TimingStats Int)) Source # resultItemAsDoubleValue :: ResultValue FCFS -> Maybe (ResultValue Double) Source # resultItemAsDoubleListValue :: ResultValue FCFS -> Maybe (ResultValue [Double]) Source # resultItemAsDoubleStatsValue :: ResultValue FCFS -> Maybe (ResultValue (SamplingStats Double)) Source # resultItemAsDoubleTimingStatsValue :: ResultValue FCFS -> Maybe (ResultValue (TimingStats Double)) Source # resultItemAsStringValue :: ResultValue FCFS -> Maybe (ResultValue String) Source #
data StrategyQueue FCFS Source #
data StrategyQueue FCFS = FCFSQueue (DoubleLinkedList i)

data LCFS Source #

Strategy: Last Come - First Served (LCFS)

Constructors

LCFS

Instances

Eq LCFS Source #
Methods (==) :: LCFS -> LCFS -> Bool # (/=) :: LCFS -> LCFS -> Bool #
Ord LCFS Source #
Methods compare :: LCFS -> LCFS -> Ordering # (<) :: LCFS -> LCFS -> Bool # (<=) :: LCFS -> LCFS -> Bool # (>) :: LCFS -> LCFS -> Bool # (>=) :: LCFS -> LCFS -> Bool # max :: LCFS -> LCFS -> LCFS # min :: LCFS -> LCFS -> LCFS #
Show LCFS Source #
Methods showsPrec :: Int -> LCFS -> ShowS # show :: LCFS -> String # showList :: [LCFS] -> ShowS #
DeletingQueueStrategy LCFS Source #	An implementation of the `LCFS` queue strategy.
Methods strategyQueueDelete :: Eq i => StrategyQueue LCFS i -> i -> Event Bool Source # strategyQueueDeleteBy :: StrategyQueue LCFS i -> (i -> Bool) -> Event (Maybe i) Source # strategyQueueContains :: Eq i => StrategyQueue LCFS i -> i -> Event Bool Source # strategyQueueContainsBy :: StrategyQueue LCFS i -> (i -> Bool) -> Event (Maybe i) Source #
EnqueueStrategy LCFS Source #	An implementation of the `LCFS` queue strategy.
Methods strategyEnqueue :: StrategyQueue LCFS i -> i -> Event () Source #
DequeueStrategy LCFS Source #	An implementation of the `LCFS` queue strategy.
Methods strategyDequeue :: StrategyQueue LCFS i -> Event i Source #
QueueStrategy LCFS Source #	An implementation of the `LCFS` queue strategy.
Associated Types data StrategyQueue LCFS a :: * Source # Methods newStrategyQueue :: LCFS -> Simulation (StrategyQueue LCFS i) Source # strategyQueueNull :: StrategyQueue LCFS i -> Event Bool Source #
ResultItemable (ResultValue LCFS) Source #
Methods resultItemName :: ResultValue LCFS -> ResultName Source # resultItemNamePath :: ResultValue LCFS -> [ResultName] Source # resultItemId :: ResultValue LCFS -> ResultId Source # resultItemIdPath :: ResultValue LCFS -> [ResultId] Source # resultItemSignal :: ResultValue LCFS -> ResultSignal Source # resultItemExpansion :: ResultValue LCFS -> ResultSource Source # resultItemSummary :: ResultValue LCFS -> ResultSource Source # resultItemAsIntValue :: ResultValue LCFS -> Maybe (ResultValue Int) Source # resultItemAsIntListValue :: ResultValue LCFS -> Maybe (ResultValue [Int]) Source # resultItemAsIntStatsValue :: ResultValue LCFS -> Maybe (ResultValue (SamplingStats Int)) Source # resultItemAsIntTimingStatsValue :: ResultValue LCFS -> Maybe (ResultValue (TimingStats Int)) Source # resultItemAsDoubleValue :: ResultValue LCFS -> Maybe (ResultValue Double) Source # resultItemAsDoubleListValue :: ResultValue LCFS -> Maybe (ResultValue [Double]) Source # resultItemAsDoubleStatsValue :: ResultValue LCFS -> Maybe (ResultValue (SamplingStats Double)) Source # resultItemAsDoubleTimingStatsValue :: ResultValue LCFS -> Maybe (ResultValue (TimingStats Double)) Source # resultItemAsStringValue :: ResultValue LCFS -> Maybe (ResultValue String) Source #
data StrategyQueue LCFS Source #
data StrategyQueue LCFS = LCFSQueue (DoubleLinkedList i)

data SIRO Source #

Strategy: Service in Random Order (SIRO).

Constructors

SIRO

Instances

Eq SIRO Source #
Methods (==) :: SIRO -> SIRO -> Bool # (/=) :: SIRO -> SIRO -> Bool #
Ord SIRO Source #
Methods compare :: SIRO -> SIRO -> Ordering # (<) :: SIRO -> SIRO -> Bool # (<=) :: SIRO -> SIRO -> Bool # (>) :: SIRO -> SIRO -> Bool # (>=) :: SIRO -> SIRO -> Bool # max :: SIRO -> SIRO -> SIRO # min :: SIRO -> SIRO -> SIRO #
Show SIRO Source #
Methods showsPrec :: Int -> SIRO -> ShowS # show :: SIRO -> String # showList :: [SIRO] -> ShowS #
DeletingQueueStrategy SIRO Source #	An implementation of the `SIRO` queue strategy.
Methods strategyQueueDelete :: Eq i => StrategyQueue SIRO i -> i -> Event Bool Source # strategyQueueDeleteBy :: StrategyQueue SIRO i -> (i -> Bool) -> Event (Maybe i) Source # strategyQueueContains :: Eq i => StrategyQueue SIRO i -> i -> Event Bool Source # strategyQueueContainsBy :: StrategyQueue SIRO i -> (i -> Bool) -> Event (Maybe i) Source #
EnqueueStrategy SIRO Source #	An implementation of the `SIRO` queue strategy.
Methods strategyEnqueue :: StrategyQueue SIRO i -> i -> Event () Source #
DequeueStrategy SIRO Source #	An implementation of the `SIRO` queue strategy.
Methods strategyDequeue :: StrategyQueue SIRO i -> Event i Source #
QueueStrategy SIRO Source #	An implementation of the `SIRO` queue strategy.
Associated Types data StrategyQueue SIRO a :: * Source # Methods newStrategyQueue :: SIRO -> Simulation (StrategyQueue SIRO i) Source # strategyQueueNull :: StrategyQueue SIRO i -> Event Bool Source #
ResultItemable (ResultValue SIRO) Source #
Methods resultItemName :: ResultValue SIRO -> ResultName Source # resultItemNamePath :: ResultValue SIRO -> [ResultName] Source # resultItemId :: ResultValue SIRO -> ResultId Source # resultItemIdPath :: ResultValue SIRO -> [ResultId] Source # resultItemSignal :: ResultValue SIRO -> ResultSignal Source # resultItemExpansion :: ResultValue SIRO -> ResultSource Source # resultItemSummary :: ResultValue SIRO -> ResultSource Source # resultItemAsIntValue :: ResultValue SIRO -> Maybe (ResultValue Int) Source # resultItemAsIntListValue :: ResultValue SIRO -> Maybe (ResultValue [Int]) Source # resultItemAsIntStatsValue :: ResultValue SIRO -> Maybe (ResultValue (SamplingStats Int)) Source # resultItemAsIntTimingStatsValue :: ResultValue SIRO -> Maybe (ResultValue (TimingStats Int)) Source # resultItemAsDoubleValue :: ResultValue SIRO -> Maybe (ResultValue Double) Source # resultItemAsDoubleListValue :: ResultValue SIRO -> Maybe (ResultValue [Double]) Source # resultItemAsDoubleStatsValue :: ResultValue SIRO -> Maybe (ResultValue (SamplingStats Double)) Source # resultItemAsDoubleTimingStatsValue :: ResultValue SIRO -> Maybe (ResultValue (TimingStats Double)) Source # resultItemAsStringValue :: ResultValue SIRO -> Maybe (ResultValue String) Source #
data StrategyQueue SIRO Source #
data StrategyQueue SIRO = SIROQueue (Vector i)

data StaticPriorities Source #

Strategy: Static Priorities. It uses the priority queue.

Constructors

StaticPriorities

Instances

Eq StaticPriorities Source #
Methods (==) :: StaticPriorities -> StaticPriorities -> Bool # (/=) :: StaticPriorities -> StaticPriorities -> Bool #
Ord StaticPriorities Source #
Methods compare :: StaticPriorities -> StaticPriorities -> Ordering # (<) :: StaticPriorities -> StaticPriorities -> Bool # (<=) :: StaticPriorities -> StaticPriorities -> Bool # (>) :: StaticPriorities -> StaticPriorities -> Bool # (>=) :: StaticPriorities -> StaticPriorities -> Bool # max :: StaticPriorities -> StaticPriorities -> StaticPriorities # min :: StaticPriorities -> StaticPriorities -> StaticPriorities #
Show StaticPriorities Source #
Methods showsPrec :: Int -> StaticPriorities -> ShowS # show :: StaticPriorities -> String # showList :: [StaticPriorities] -> ShowS #
DeletingQueueStrategy StaticPriorities Source #	An implementation of the `StaticPriorities` queue strategy.
Methods strategyQueueDelete :: Eq i => StrategyQueue StaticPriorities i -> i -> Event Bool Source # strategyQueueDeleteBy :: StrategyQueue StaticPriorities i -> (i -> Bool) -> Event (Maybe i) Source # strategyQueueContains :: Eq i => StrategyQueue StaticPriorities i -> i -> Event Bool Source # strategyQueueContainsBy :: StrategyQueue StaticPriorities i -> (i -> Bool) -> Event (Maybe i) Source #
DequeueStrategy StaticPriorities Source #	An implementation of the `StaticPriorities` queue strategy.
Methods strategyDequeue :: StrategyQueue StaticPriorities i -> Event i Source #
QueueStrategy StaticPriorities Source #	An implementation of the `StaticPriorities` queue strategy.
Associated Types data StrategyQueue StaticPriorities a :: * Source # Methods newStrategyQueue :: StaticPriorities -> Simulation (StrategyQueue StaticPriorities i) Source # strategyQueueNull :: StrategyQueue StaticPriorities i -> Event Bool Source #
PriorityQueueStrategy StaticPriorities Double Source #	An implementation of the `StaticPriorities` queue strategy.
Methods strategyEnqueueWithPriority :: StrategyQueue StaticPriorities i -> Double -> i -> Event () Source #
ResultItemable (ResultValue StaticPriorities) Source #
Methods resultItemName :: ResultValue StaticPriorities -> ResultName Source # resultItemNamePath :: ResultValue StaticPriorities -> [ResultName] Source # resultItemId :: ResultValue StaticPriorities -> ResultId Source # resultItemIdPath :: ResultValue StaticPriorities -> [ResultId] Source # resultItemSignal :: ResultValue StaticPriorities -> ResultSignal Source # resultItemExpansion :: ResultValue StaticPriorities -> ResultSource Source # resultItemSummary :: ResultValue StaticPriorities -> ResultSource Source # resultItemAsIntValue :: ResultValue StaticPriorities -> Maybe (ResultValue Int) Source # resultItemAsIntListValue :: ResultValue StaticPriorities -> Maybe (ResultValue [Int]) Source # resultItemAsIntStatsValue :: ResultValue StaticPriorities -> Maybe (ResultValue (SamplingStats Int)) Source # resultItemAsIntTimingStatsValue :: ResultValue StaticPriorities -> Maybe (ResultValue (TimingStats Int)) Source # resultItemAsDoubleValue :: ResultValue StaticPriorities -> Maybe (ResultValue Double) Source # resultItemAsDoubleListValue :: ResultValue StaticPriorities -> Maybe (ResultValue [Double]) Source # resultItemAsDoubleStatsValue :: ResultValue StaticPriorities -> Maybe (ResultValue (SamplingStats Double)) Source # resultItemAsDoubleTimingStatsValue :: ResultValue StaticPriorities -> Maybe (ResultValue (TimingStats Double)) Source # resultItemAsStringValue :: ResultValue StaticPriorities -> Maybe (ResultValue String) Source #
data StrategyQueue StaticPriorities Source #
data StrategyQueue StaticPriorities = StaticPriorityQueue (PriorityQueue i)