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

Simulation.Aivika.Branch.BR

Contents

Orphan instances

Description

Tested with: GHC 7.10.3

This module defines that BR can be an instance of the MonadDES and EventIOQueueing type classes.

Synopsis

data BR m a
runBR :: MonadIO m => BR m a -> m a
branchLevel :: Monad m => BR m Int

Documentation

data BR m a Source #

The branching computation.

Instances

Instances details

MonadTrans BR Source #
Instance details Defined in Simulation.Aivika.Branch.Internal.BR Methods lift :: Monad m => m a -> BR m a #
MonadComp (BR IO) Source #
Instance details Defined in Simulation.Aivika.Branch.BR
MonadDES (BR IO) Source #
Instance details Defined in Simulation.Aivika.Branch.BR
MonadException m => MonadException (BR m) Source #
Instance details Defined in Simulation.Aivika.Branch.Internal.BR Methods catchComp :: Exception e => BR m a -> (e -> BR m a) -> BR m a # finallyComp :: BR m a -> BR m b -> BR m a # throwComp :: Exception e => e -> BR m a #
MonadGenerator (BR IO) Source #
Instance details Defined in Simulation.Aivika.Branch.Generator Associated Types data Generator (BR IO) # Methods generateUniform :: Generator (BR IO) -> Double -> Double -> BR IO Double # generateUniformInt :: Generator (BR IO) -> Int -> Int -> BR IO Int # generateTriangular :: Generator (BR IO) -> Double -> Double -> Double -> BR IO Double # generateNormal :: Generator (BR IO) -> Double -> Double -> BR IO Double # generateLogNormal :: Generator (BR IO) -> Double -> Double -> BR IO Double # generateExponential :: Generator (BR IO) -> Double -> BR IO Double # generateErlang :: Generator (BR IO) -> Double -> Int -> BR IO Double # generatePoisson :: Generator (BR IO) -> Double -> BR IO Int # generateBinomial :: Generator (BR IO) -> Double -> Int -> BR IO Int # generateGamma :: Generator (BR IO) -> Double -> Double -> BR IO Double # generateBeta :: Generator (BR IO) -> Double -> Double -> BR IO Double # generateWeibull :: Generator (BR IO) -> Double -> Double -> BR IO Double # generateDiscrete :: Generator (BR IO) -> DiscretePDF a -> BR IO a # generateSequenceNo :: Generator (BR IO) -> BR IO Int # newGenerator :: GeneratorType (BR IO) -> BR IO (Generator (BR IO)) # newRandomGenerator :: RandomGen g => g -> BR IO (Generator (BR IO)) # newRandomGenerator01 :: BR IO Double -> BR IO (Generator (BR IO)) #
EventIOQueueing (BR IO) Source #	An implementation of the `EventIOQueueing` type class.
Instance details Defined in Simulation.Aivika.Branch.BR Methods enqueueEventIO :: Double -> Event (BR IO) () -> Event (BR IO) () #
EventQueueing (BR IO) Source #	An implementation of the `EventQueueing` type class.
Instance details Defined in Simulation.Aivika.Branch.Event Associated Types data EventQueue (BR IO) # Methods newEventQueue :: Specs (BR IO) -> BR IO (EventQueue (BR IO)) # enqueueEventWithPriority :: Double -> EventPriority -> Event (BR IO) () -> Event (BR IO) () # enqueueEvent :: Double -> Event (BR IO) () -> Event (BR IO) () # runEvent :: Event (BR IO) a -> Dynamics (BR IO) a # runEventWith :: EventProcessing -> Event (BR IO) a -> Dynamics (BR IO) a # eventQueueCount :: Event (BR IO) Int #
MonadRef (BR IO) Source #	The implementation of mutable references.
Instance details Defined in Simulation.Aivika.Branch.Ref.Base.Lazy Associated Types data Ref (BR IO) a # Methods newRef :: a -> Simulation (BR IO) (Ref (BR IO) a) # readRef :: Ref (BR IO) a -> Event (BR IO) a # writeRef :: Ref (BR IO) a -> a -> Event (BR IO) () # modifyRef :: Ref (BR IO) a -> (a -> a) -> Event (BR IO) () # equalRef :: Ref (BR IO) a -> Ref (BR IO) a -> Bool #
MonadRef0 (BR IO) Source #	A subtype of mutable references that can be created under more weak conditions.
Instance details Defined in Simulation.Aivika.Branch.Ref.Base.Lazy Methods newRef0 :: a -> BR IO (Ref (BR IO) a) #
MonadRef (BR IO) Source #	The implementation of mutable references.
Instance details Defined in Simulation.Aivika.Branch.Ref.Base.Strict Associated Types data Ref (BR IO) a # Methods newRef :: a -> Simulation (BR IO) (Ref (BR IO) a) # readRef :: Ref (BR IO) a -> Event (BR IO) a # writeRef :: Ref (BR IO) a -> a -> Event (BR IO) () # modifyRef :: Ref (BR IO) a -> (a -> a) -> Event (BR IO) () # equalRef :: Ref (BR IO) a -> Ref (BR IO) a -> Bool #
MonadRef0 (BR IO) Source #	A subtype of mutable references that can be created under more weak conditions.
Instance details Defined in Simulation.Aivika.Branch.Ref.Base.Strict Methods newRef0 :: a -> BR IO (Ref (BR IO) a) #
MonadFix m => MonadFix (BR m) Source #
Instance details Defined in Simulation.Aivika.Branch.Internal.BR Methods mfix :: (a -> BR m a) -> BR m a #
MonadIO m => MonadIO (BR m) Source #
Instance details Defined in Simulation.Aivika.Branch.Internal.BR Methods liftIO :: IO a -> BR m a #
Applicative m => Applicative (BR m) Source #
Instance details Defined in Simulation.Aivika.Branch.Internal.BR Methods pure :: a -> BR m a # (<>) :: BR m (a -> b) -> BR m a -> BR m b # liftA2 :: (a -> b -> c) -> BR m a -> BR m b -> BR m c # (>) :: BR m a -> BR m b -> BR m b # (<*) :: BR m a -> BR m b -> BR m a #
Functor m => Functor (BR m) Source #
Instance details Defined in Simulation.Aivika.Branch.Internal.BR Methods fmap :: (a -> b) -> BR m a -> BR m b # (<$) :: a -> BR m b -> BR m a #
Monad m => Monad (BR m) Source #
Instance details Defined in Simulation.Aivika.Branch.Internal.BR Methods (>>=) :: BR m a -> (a -> BR m b) -> BR m b # (>>) :: BR m a -> BR m b -> BR m b # return :: a -> BR m a #
DequeueStrategy (BR IO) FCFS Source #	An implementation of the `FCFS` queue strategy.
Instance details Defined in Simulation.Aivika.Branch.QueueStrategy Methods strategyDequeue :: StrategyQueue (BR IO) FCFS a -> Event (BR IO) a #
DequeueStrategy (BR IO) LCFS Source #	An implementation of the `LCFS` queue strategy.
Instance details Defined in Simulation.Aivika.Branch.QueueStrategy Methods strategyDequeue :: StrategyQueue (BR IO) LCFS a -> Event (BR IO) a #
EnqueueStrategy (BR IO) FCFS Source #	An implementation of the `FCFS` queue strategy.
Instance details Defined in Simulation.Aivika.Branch.QueueStrategy Methods strategyEnqueue :: StrategyQueue (BR IO) FCFS a -> a -> Event (BR IO) () #
EnqueueStrategy (BR IO) LCFS Source #	An implementation of the `LCFS` queue strategy.
Instance details Defined in Simulation.Aivika.Branch.QueueStrategy Methods strategyEnqueue :: StrategyQueue (BR IO) LCFS a -> a -> Event (BR IO) () #
QueueStrategy (BR IO) FCFS Source #	An implementation of the `FCFS` queue strategy.
Instance details Defined in Simulation.Aivika.Branch.QueueStrategy Associated Types data StrategyQueue (BR IO) FCFS :: Type -> Type # Methods newStrategyQueue :: FCFS -> Simulation (BR IO) (StrategyQueue (BR IO) FCFS a) # strategyQueueNull :: StrategyQueue (BR IO) FCFS a -> Event (BR IO) Bool #
QueueStrategy (BR IO) LCFS Source #	An implementation of the `LCFS` queue strategy.
Instance details Defined in Simulation.Aivika.Branch.QueueStrategy Associated Types data StrategyQueue (BR IO) LCFS :: Type -> Type # Methods newStrategyQueue :: LCFS -> Simulation (BR IO) (StrategyQueue (BR IO) LCFS a) # strategyQueueNull :: StrategyQueue (BR IO) LCFS a -> Event (BR IO) Bool #
data Generator (BR IO) Source #
Instance details Defined in Simulation.Aivika.Branch.Generator data Generator (BR IO) = Generator { generator01 :: BR IO Double generatorNormal01 :: BR IO Double generatorSequenceNo :: BR IO Int }
data EventQueue (BR IO) Source #
Instance details Defined in Simulation.Aivika.Branch.Event data EventQueue (BR IO) = EventQueue { queuePQ :: IORef (PriorityQueue (Point (BR IO) -> BR IO ())) queueBusy :: IORef Bool queueTime :: IORef Double }
newtype Ref (BR IO) a Source #
Instance details Defined in Simulation.Aivika.Branch.Ref.Base.Lazy newtype Ref (BR IO) a = Ref { refValue :: Ref a }
newtype Ref (BR IO) a Source #
Instance details Defined in Simulation.Aivika.Branch.Ref.Base.Strict newtype Ref (BR IO) a = Ref { refValue :: Ref a }
newtype StrategyQueue (BR IO) FCFS a Source #
Instance details Defined in Simulation.Aivika.Branch.QueueStrategy newtype StrategyQueue (BR IO) FCFS a = FCFSQueue (DoubleLinkedList (BR IO) a)
newtype StrategyQueue (BR IO) LCFS a Source #
Instance details Defined in Simulation.Aivika.Branch.QueueStrategy newtype StrategyQueue (BR IO) LCFS a = LCFSQueue (DoubleLinkedList (BR IO) a)

runBR :: MonadIO m => BR m a -> m a Source #

Run the branching computation.

branchLevel :: Monad m => BR m Int Source #

Return the current branch level starting from 0.

Orphan instances

MonadComp (BR IO) Source #
Instance details
MonadDES (BR IO) Source #
Instance details
EventIOQueueing (BR IO) Source #	An implementation of the `EventIOQueueing` type class.
Instance details Methods enqueueEventIO :: Double -> Event (BR IO) () -> Event (BR IO) () #