Simulation.Aivika.Lattice.LIO

Tested with: GHC 7.10.3

This module defines LIO as an instance of the MonadDES and EventIOQueueing type classes.

Documentation

data LIO a

The LIO computation that can be run as nested one on the lattice node.

Instances

MonadComp LIO

Defined in Simulation.Aivika.Lattice.LIO

MonadDES LIO

Defined in Simulation.Aivika.Lattice.LIO

MonadException LIO

Defined in Simulation.Aivika.Lattice.Internal.LIO

Methods

catchComp :: Exception e => LIO a -> (e -> LIO a) -> LIO a

finallyComp :: LIO a -> LIO b -> LIO a

throwComp :: Exception e => e -> LIO a

MonadGenerator LIO

Defined in Simulation.Aivika.Lattice.Generator

Associated Types

data Generator LIO

Methods

generateUniform :: Generator LIO -> Double -> Double -> LIO Double

generateUniformInt :: Generator LIO -> Int -> Int -> LIO Int

generateTriangular :: Generator LIO -> Double -> Double -> Double -> LIO Double

generateNormal :: Generator LIO -> Double -> Double -> LIO Double

generateLogNormal :: Generator LIO -> Double -> Double -> LIO Double

generateExponential :: Generator LIO -> Double -> LIO Double

generateErlang :: Generator LIO -> Double -> Int -> LIO Double

generatePoisson :: Generator LIO -> Double -> LIO Int

generateBinomial :: Generator LIO -> Double -> Int -> LIO Int

generateGamma :: Generator LIO -> Double -> Double -> LIO Double

generateBeta :: Generator LIO -> Double -> Double -> LIO Double

generateWeibull :: Generator LIO -> Double -> Double -> LIO Double

generateDiscrete :: Generator LIO -> DiscretePDF a -> LIO a

generateSequenceNo :: Generator LIO -> LIO Int

newGenerator :: GeneratorType LIO -> LIO (Generator LIO)

newRandomGenerator :: RandomGen g => g -> LIO (Generator LIO)

newRandomGenerator01 :: LIO Double -> LIO (Generator LIO)

EventIOQueueing LIO

An implementation of the EventIOQueueing type class.

Defined in Simulation.Aivika.Lattice.LIO

Methods

enqueueEventIO :: Double -> Event LIO () -> Event LIO ()

EventQueueing LIO

An implementation of the EventQueueing type class.

Defined in Simulation.Aivika.Lattice.Internal.Event

Associated Types

data EventQueue LIO

Methods

newEventQueue :: Specs LIO -> LIO (EventQueue LIO)

enqueueEventWithPriority :: Double -> EventPriority -> Event LIO () -> Event LIO ()

enqueueEvent :: Double -> Event LIO () -> Event LIO ()

runEvent :: Event LIO a -> Dynamics LIO a

runEventWith :: EventProcessing -> Event LIO a -> Dynamics LIO a

eventQueueCount :: Event LIO Int

MonadRef LIO

The implementation of mutable references.

Defined in Simulation.Aivika.Lattice.Ref.Base.Lazy

Associated Types

data Ref LIO a

Methods

newRef :: a -> Simulation LIO (Ref LIO a)

readRef :: Ref LIO a -> Event LIO a

writeRef :: Ref LIO a -> a -> Event LIO ()

modifyRef :: Ref LIO a -> (a -> a) -> Event LIO ()

equalRef :: Ref LIO a -> Ref LIO a -> Bool

MonadRef0 LIO

A subtype of mutable references that can be created under more weak conditions.

Defined in Simulation.Aivika.Lattice.Ref.Base.Lazy

Methods

newRef0 :: a -> LIO (Ref LIO a)

MonadRef LIO

The implementation of mutable references.

Defined in Simulation.Aivika.Lattice.Ref.Base.Strict

Associated Types

data Ref LIO a

Methods

newRef :: a -> Simulation LIO (Ref LIO a)

readRef :: Ref LIO a -> Event LIO a

writeRef :: Ref LIO a -> a -> Event LIO ()

modifyRef :: Ref LIO a -> (a -> a) -> Event LIO ()

equalRef :: Ref LIO a -> Ref LIO a -> Bool

MonadRef0 LIO

A subtype of mutable references that can be created under more weak conditions.

Defined in Simulation.Aivika.Lattice.Ref.Base.Strict

Methods

newRef0 :: a -> LIO (Ref LIO a)

MonadFix LIO

Defined in Simulation.Aivika.Lattice.Internal.LIO

Methods

mfix :: (a -> LIO a) -> LIO a

MonadIO LIO

Defined in Simulation.Aivika.Lattice.Internal.LIO

Methods

liftIO :: IO a -> LIO a

Applicative LIO

Defined in Simulation.Aivika.Lattice.Internal.LIO

Methods

pure :: a -> LIO a

(<*>) :: LIO (a -> b) -> LIO a -> LIO b

liftA2 :: (a -> b -> c) -> LIO a -> LIO b -> LIO c

(*>) :: LIO a -> LIO b -> LIO b

(<*) :: LIO a -> LIO b -> LIO a

Functor LIO

Defined in Simulation.Aivika.Lattice.Internal.LIO

Methods

fmap :: (a -> b) -> LIO a -> LIO b

(<$) :: a -> LIO b -> LIO a

Monad LIO

Defined in Simulation.Aivika.Lattice.Internal.LIO

Methods

(>>=) :: LIO a -> (a -> LIO b) -> LIO b

(>>) :: LIO a -> LIO b -> LIO b

return :: a -> LIO a

DequeueStrategy LIO FCFS

An implementation of the FCFS queue strategy.

Defined in Simulation.Aivika.Lattice.QueueStrategy

Methods

strategyDequeue :: StrategyQueue LIO FCFS a -> Event LIO a

DequeueStrategy LIO LCFS

An implementation of the LCFS queue strategy.

Defined in Simulation.Aivika.Lattice.QueueStrategy

Methods

strategyDequeue :: StrategyQueue LIO LCFS a -> Event LIO a

EnqueueStrategy LIO FCFS

An implementation of the FCFS queue strategy.

Defined in Simulation.Aivika.Lattice.QueueStrategy

Methods

strategyEnqueue :: StrategyQueue LIO FCFS a -> a -> Event LIO ()

EnqueueStrategy LIO LCFS

An implementation of the LCFS queue strategy.

Defined in Simulation.Aivika.Lattice.QueueStrategy

Methods

strategyEnqueue :: StrategyQueue LIO LCFS a -> a -> Event LIO ()

QueueStrategy LIO FCFS

An implementation of the FCFS queue strategy.

Defined in Simulation.Aivika.Lattice.QueueStrategy

Associated Types

data StrategyQueue LIO FCFS :: Type -> Type

Methods

newStrategyQueue :: FCFS -> Simulation LIO (StrategyQueue LIO FCFS a)

strategyQueueNull :: StrategyQueue LIO FCFS a -> Event LIO Bool

QueueStrategy LIO LCFS

An implementation of the LCFS queue strategy.

Defined in Simulation.Aivika.Lattice.QueueStrategy

Associated Types

data StrategyQueue LIO LCFS :: Type -> Type

Methods

newStrategyQueue :: LCFS -> Simulation LIO (StrategyQueue LIO LCFS a)

strategyQueueNull :: StrategyQueue LIO LCFS a -> Event LIO Bool

Observable (Ref LIO) (Estimate LIO)

An instance of the specified type class.

Defined in Simulation.Aivika.Lattice.Ref.Base.Lazy

Methods

readObservable :: Ref LIO a -> Estimate LIO a

Observable (Ref LIO) (Estimate LIO)

An instance of the specified type class.

Defined in Simulation.Aivika.Lattice.Ref.Base.Strict

Methods

readObservable :: Ref LIO a -> Estimate LIO a

data Generator LIO

Defined in Simulation.Aivika.Lattice.Generator

data Generator LIO = GeneratorLIO {

• generator01 :: LIO Double
• generatorNormal01 :: LIO Double
• generatorSequenceNo :: LIO Int

}

data EventQueue LIO

Defined in Simulation.Aivika.Lattice.Internal.Event

data EventQueue LIO = EventQueueLIO {

• queuePQ :: Ref (PriorityQueue (Point LIO -> LIO ()))
• queueBusy :: IORef Bool
• queueTime :: Ref Double

}

newtype Ref LIO a

Defined in Simulation.Aivika.Lattice.Ref.Base.Lazy

newtype Ref LIO a = Ref {

• refValue :: Ref a

}

newtype Ref LIO a

Defined in Simulation.Aivika.Lattice.Ref.Base.Strict

newtype Ref LIO a = Ref {

• refValue :: Ref a

}

newtype StrategyQueue LIO FCFS a

Defined in Simulation.Aivika.Lattice.QueueStrategy

newtype StrategyQueue LIO FCFS a = FCFSQueueLIO (DoubleLinkedList LIO a)

newtype StrategyQueue LIO LCFS a

Defined in Simulation.Aivika.Lattice.QueueStrategy

newtype StrategyQueue LIO LCFS a = LCFSQueueLIO (DoubleLinkedList LIO a)

data LIOLattice

Specifies the lattice.

lattice

Arguments

:: Int

the lattice size

-> (Int -> Int -> Int)

get the parent member index by the specified time and member indices

-> LIOLattice

Return a lattice by the specifed size and the parent member function.

newRandomLattice :: Int -> IO LIOLattice

Create a new random lattice by the specified size with equal probabilities, whether the interior child node derives from the left or right parents.

newRandomLatticeWithProb :: Double -> Int -> IO LIOLattice

Create a new random lattice by the specified probability and size, where the probability defines whether the interior child node derives from the right parent.

runLIO :: LIOLattice -> LIO a -> IO a

Run the LIO computation using the specified lattice.

latticeTimeIndex :: LIO Int

Return the lattice time index starting from 0. The index should be less than or equaled to latticeSize.

latticeMemberIndex :: LIO Int

Return the lattice member index starting from 0. It is always less than or equaled to latticeTimeIndex.

latticeParentMemberIndex :: LIO (Maybe Int)

Return the parent member index starting from 0 for non-root lattice nodes.

latticeSize :: LIO Int

Return the lattice size.

latticeTime :: Parameter LIO Double

Return the time for the current lattice node.

latticeTimes :: Parameter LIO [Double]

Return the time values in the lattice nodes.

latticeTimeStep :: Parameter LIO Double

Return the lattice time step.

findLatticeTimeIndex :: Double -> Parameter LIO Int

Find the lattice time index by the specified modeling time.

enqueueEventWithLatticeTimes :: Event LIO () -> Event LIO ()

Actuate the event handler in the lattice node time points.

Orphan instances

MonadComp LIO

MonadDES LIO

EventIOQueueing LIO

An implementation of the EventIOQueueing type class.

Methods

enqueueEventIO :: Double -> Event LIO () -> Event LIO ()