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

Simulation.Aivika.IO.QueueStrategy

Contents

Orphan instances

Description

Tested with: GHC 8.0.1

This module defines some queue strategy instances for the MonadIO-based computations.

Orphan instances

(DequeueStrategy m SIRO, MonadComp m, MonadIO m, MonadTemplate m) => DeletingQueueStrategy m SIRO Source #	An implementation of the `SIRO` queue strategy.
Methods strategyQueueDelete :: Eq a => StrategyQueue m SIRO a -> a -> Event m Bool Source # strategyQueueDeleteBy :: StrategyQueue m SIRO a -> (a -> Bool) -> Event m (Maybe a) Source # strategyQueueContains :: Eq a => StrategyQueue m SIRO a -> a -> Event m Bool Source # strategyQueueContainsBy :: StrategyQueue m SIRO a -> (a -> Bool) -> Event m (Maybe a) Source #
(DequeueStrategy m StaticPriorities, MonadComp m, MonadIO m, MonadTemplate m) => DeletingQueueStrategy m StaticPriorities Source #	An implementation of the `StaticPriorities` queue strategy.
Methods strategyQueueDelete :: Eq a => StrategyQueue m StaticPriorities a -> a -> Event m Bool Source # strategyQueueDeleteBy :: StrategyQueue m StaticPriorities a -> (a -> Bool) -> Event m (Maybe a) Source # strategyQueueContains :: Eq a => StrategyQueue m StaticPriorities a -> a -> Event m Bool Source # strategyQueueContainsBy :: StrategyQueue m StaticPriorities a -> (a -> Bool) -> Event m (Maybe a) Source #
(DequeueStrategy m LCFS, MonadComp m, MonadIO m, MonadTemplate m) => DeletingQueueStrategy m LCFS Source #	An implementation of the `LCFS` queue strategy.
Methods strategyQueueDelete :: Eq a => StrategyQueue m LCFS a -> a -> Event m Bool Source # strategyQueueDeleteBy :: StrategyQueue m LCFS a -> (a -> Bool) -> Event m (Maybe a) Source # strategyQueueContains :: Eq a => StrategyQueue m LCFS a -> a -> Event m Bool Source # strategyQueueContainsBy :: StrategyQueue m LCFS a -> (a -> Bool) -> Event m (Maybe a) Source #
(DequeueStrategy m FCFS, MonadComp m, MonadIO m, MonadTemplate m) => DeletingQueueStrategy m FCFS Source #	An implementation of the `FCFS` queue strategy.
Methods strategyQueueDelete :: Eq a => StrategyQueue m FCFS a -> a -> Event m Bool Source # strategyQueueDeleteBy :: StrategyQueue m FCFS a -> (a -> Bool) -> Event m (Maybe a) Source # strategyQueueContains :: Eq a => StrategyQueue m FCFS a -> a -> Event m Bool Source # strategyQueueContainsBy :: StrategyQueue m FCFS a -> (a -> Bool) -> Event m (Maybe a) Source #
(DequeueStrategy m SIRO, MonadComp m, MonadIO m, MonadTemplate m) => EnqueueStrategy m SIRO Source #	A template-based implementation of the `SIRO` queue strategy.
Methods strategyEnqueue :: StrategyQueue m SIRO a -> a -> Event m () Source #
(DequeueStrategy m LCFS, MonadComp m, MonadIO m, MonadTemplate m) => EnqueueStrategy m LCFS Source #	An implementation of the `LCFS` queue strategy.
Methods strategyEnqueue :: StrategyQueue m LCFS a -> a -> Event m () Source #
(DequeueStrategy m FCFS, MonadComp m, MonadIO m, MonadTemplate m) => EnqueueStrategy m FCFS Source #	An implementation of the `FCFS` queue strategy.
Methods strategyEnqueue :: StrategyQueue m FCFS a -> a -> Event m () Source #
(QueueStrategy m SIRO, MonadComp m, MonadIO m, MonadTemplate m) => DequeueStrategy m SIRO Source #	A template-based implementation of the `SIRO` queue strategy.
Methods strategyDequeue :: StrategyQueue m SIRO a -> Event m a Source #
(QueueStrategy m StaticPriorities, MonadComp m, MonadIO m, MonadTemplate m) => DequeueStrategy m StaticPriorities Source #	A template-based implementation of the `StaticPriorities` queue strategy.
Methods strategyDequeue :: StrategyQueue m StaticPriorities a -> Event m a Source #
(QueueStrategy m LCFS, MonadComp m, MonadIO m, MonadTemplate m) => DequeueStrategy m LCFS Source #	An implementation of the `LCFS` queue strategy.
Methods strategyDequeue :: StrategyQueue m LCFS a -> Event m a Source #
(QueueStrategy m FCFS, MonadComp m, MonadIO m, MonadTemplate m) => DequeueStrategy m FCFS Source #	An implementation of the `FCFS` queue strategy.
Methods strategyDequeue :: StrategyQueue m FCFS a -> Event m a Source #
(MonadComp m, MonadIO m, MonadTemplate m) => QueueStrategy m SIRO Source #	A template-based implementation of the `SIRO` queue strategy.
Associated Types data StrategyQueue (m :: * -> ) SIRO a :: Source # Methods newStrategyQueue :: SIRO -> Simulation m (StrategyQueue m SIRO a) Source # strategyQueueNull :: StrategyQueue m SIRO a -> Event m Bool Source #
(MonadComp m, MonadIO m, MonadTemplate m) => QueueStrategy m StaticPriorities Source #	A template-based implementation of the `StaticPriorities` queue strategy.
Associated Types data StrategyQueue (m :: * -> ) StaticPriorities a :: Source # Methods newStrategyQueue :: StaticPriorities -> Simulation m (StrategyQueue m StaticPriorities a) Source # strategyQueueNull :: StrategyQueue m StaticPriorities a -> Event m Bool Source #
(MonadComp m, MonadIO m, MonadTemplate m) => QueueStrategy m LCFS Source #	An implementation of the `LCFS` queue strategy.
Associated Types data StrategyQueue (m :: * -> ) LCFS a :: Source # Methods newStrategyQueue :: LCFS -> Simulation m (StrategyQueue m LCFS a) Source # strategyQueueNull :: StrategyQueue m LCFS a -> Event m Bool Source #
(Monad m, MonadComp m, MonadIO m, MonadTemplate m) => QueueStrategy m FCFS Source #	An implementation of the `FCFS` queue strategy.
Associated Types data StrategyQueue (m :: * -> ) FCFS a :: Source # Methods newStrategyQueue :: FCFS -> Simulation m (StrategyQueue m FCFS a) Source # strategyQueueNull :: StrategyQueue m FCFS a -> Event m Bool Source #
(DequeueStrategy m StaticPriorities, MonadComp m, MonadIO m, MonadTemplate m) => PriorityQueueStrategy m StaticPriorities Double Source #	A template-based implementation of the `StaticPriorities` queue strategy.
Methods strategyEnqueueWithPriority :: StrategyQueue m StaticPriorities a -> Double -> a -> Event m () Source #