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

Simulation.Aivika.Trans.GPSS.TransactQueueStrategy

Description

Tested with: GHC 8.0.2

This module defines a GPSS transact queue strategy.

Synopsis

Documentation

data TransactQueueStrategy s Source #

The transact queue strategy.

Constructors

TransactQueueStrategy s

Instances

MonadDES m => QueueStrategy m (TransactQueueStrategy s) Source #	An implementation of the `QueueStrategy` class.
Associated Types data StrategyQueue (m :: * -> ) (TransactQueueStrategy s) a :: # Methods newStrategyQueue :: TransactQueueStrategy s -> Simulation m (StrategyQueue m (TransactQueueStrategy s) a) # strategyQueueNull :: StrategyQueue m (TransactQueueStrategy s) a -> Event m Bool #
MonadDES m => DequeueStrategy m (TransactQueueStrategy LCFS) Source #
Methods strategyDequeue :: StrategyQueue m (TransactQueueStrategy LCFS) a -> Event m a #
MonadDES m => DequeueStrategy m (TransactQueueStrategy FCFS) Source #
Methods strategyDequeue :: StrategyQueue m (TransactQueueStrategy FCFS) a -> Event m a #
MonadDES m => DeletingQueueStrategy m (TransactQueueStrategy FCFS) Source #
Methods strategyQueueDelete :: Eq a => StrategyQueue m (TransactQueueStrategy FCFS) a -> a -> Event m Bool # strategyQueueDeleteBy :: StrategyQueue m (TransactQueueStrategy FCFS) a -> (a -> Bool) -> Event m (Maybe a) # strategyQueueContains :: Eq a => StrategyQueue m (TransactQueueStrategy FCFS) a -> a -> Event m Bool # strategyQueueContainsBy :: StrategyQueue m (TransactQueueStrategy FCFS) a -> (a -> Bool) -> Event m (Maybe a) #
(MonadDES m, DequeueStrategy m (TransactQueueStrategy s)) => PriorityQueueStrategy m (TransactQueueStrategy s) Int Source #
Methods strategyEnqueueWithPriority :: StrategyQueue m (TransactQueueStrategy s) a -> Int -> a -> Event m () #
data StrategyQueue m (TransactQueueStrategy s) Source #
data StrategyQueue m (TransactQueueStrategy s) = TransactStrategyQueue { transactStrategy :: TransactQueueStrategy s transactStrategyQueue :: Ref m (IntMap (DoubleLinkedList m a)) }

transactStrategyQueueDeleteBy Source #

Arguments

:: MonadDES m
=> StrategyQueue m (TransactQueueStrategy s) a	the queue
-> Int	the transact priority
-> (a -> Bool)	the predicate
-> Event m (Maybe a)

Try to delete the transact by the specified priority and satisfying to the provided predicate.

transactStrategyQueueContainsBy Source #

Arguments

:: MonadDES m
=> StrategyQueue m (TransactQueueStrategy s) a	the queue
-> Int	the transact priority
-> (a -> Bool)	the predicate
-> Event m (Maybe a)

Test whether the queue contains a transact with the specified priority satisfying the provided predicate.