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

Simulation.Aivika.Lattice.LIO

Contents

Description

Tested with: GHC 7.10.3

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

Synopsis

Documentation

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

Instances

Monad LIO Source #
Methods (>>=) :: LIO a -> (a -> LIO b) -> LIO b # (>>) :: LIO a -> LIO b -> LIO b # return :: a -> LIO a # fail :: String -> LIO a #
Functor LIO Source #
Methods fmap :: (a -> b) -> LIO a -> LIO b # (<$) :: a -> LIO b -> LIO a #
MonadFix LIO Source #
Methods mfix :: (a -> LIO a) -> LIO a #
Applicative LIO Source #
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 Source #
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 Source #
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)

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

Return the lattice time index starting from 0. It corresponds to the integration time point. The index should be less than latticeSize.

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

Return the lattice size.

Return the time for the current lattice node.

The time step used when constructing the lattice. Currently, it is equivalent to dt.

Find the lattice time index for the specified modeling time.

Orphan instances

EventIOQueueing LIO Source #	An implementation of the `EventIOQueueing` type class.
Methods enqueueEventIO :: Double -> Event LIO () -> Event LIO () #
MonadDES LIO Source #

MonadComp LIO Source #