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

Monad LIO

Methods

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

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

return :: a -> LIO a

fail :: String -> LIO a

Functor LIO

Methods

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

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

MonadFix LIO

Methods

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

Applicative LIO

Methods

pure :: a -> LIO a

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

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

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

MonadException 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

MonadIO LIO

Methods

liftIO :: IO a -> LIO a

data Ref LIO

data Ref LIO = Ref {

• refValue :: Ref a

}

data Ref LIO

data Ref LIO = Ref {

• refValue :: Ref a

}

data EventQueue LIO

data EventQueue LIO = EventQueueLIO {

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

}

data Generator LIO

data Generator LIO = GeneratorLIO {

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

}

data StrategyQueue LIO FCFS

data StrategyQueue LIO FCFS = FCFSQueueLIO (DoubleLinkedList LIO a)

data StrategyQueue LIO LCFS

data StrategyQueue LIO LCFS = 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 probabilty 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

EventIOQueueing LIO

An implementation of the EventIOQueueing type class.

Methods

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

MonadDES LIO

MonadComp LIO