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

MonadIO LIO

Methods

liftIO :: IO a -> 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

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

}

data StrategyQueue LIO FCFS

data StrategyQueue LIO FCFS = FCFSQueueLIO (DoubleLinkedList LIO a)

data StrategyQueue LIO LCFS

data StrategyQueue LIO LCFS = LCFSQueueLIO (DoubleLinkedList LIO a)

runLIO :: LIO a -> IO a

Run the LIO computation using the integration times points as lattice nodes.

latticeTimeIndex :: LIO Int

Return the lattice time index starting from 0. It corresponds to the integration time point.

latticeMemberIndex :: LIO Int

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

Orphan instances

EventIOQueueing LIO

An implementation of the EventIOQueueing type class.

Methods

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

MonadDES LIO

MonadComp LIO