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

Simulation.Aivika.Branch.Br

Contents

Description

Tested with: GHC 7.10.3

This module defines BrIO as an instance of the MonadDES type class.

Synopsis

Documentation

The branching computation.

Instances

Monad BrIO Source #
Methods (>>=) :: BrIO a -> (a -> BrIO b) -> BrIO b # (>>) :: BrIO a -> BrIO b -> BrIO b # return :: a -> BrIO a # fail :: String -> BrIO a #
Functor BrIO Source #
Methods fmap :: (a -> b) -> BrIO a -> BrIO b # (<$) :: a -> BrIO b -> BrIO a #
Applicative BrIO Source #
Methods pure :: a -> BrIO a # (<>) :: BrIO (a -> b) -> BrIO a -> BrIO b # (>) :: BrIO a -> BrIO b -> BrIO b # (<*) :: BrIO a -> BrIO b -> BrIO a #
MonadException BrIO Source #
Methods catchComp :: Exception e => BrIO a -> (e -> BrIO a) -> BrIO a # finallyComp :: BrIO a -> BrIO b -> BrIO a # throwComp :: Exception e => e -> BrIO a #
MonadIO BrIO Source #
Methods liftIO :: IO a -> BrIO a #
data Ref BrIO #
data Ref BrIO = Ref { refValue :: Ref a }
data EventQueue BrIO #
data EventQueue BrIO = EventQueue { queuePQ :: IORef (PriorityQueue (Point BrIO -> BrIO ())) queueBusy :: IORef Bool queueTime :: IORef Double }
data Generator BrIO #
data Generator BrIO = Generator { generator01 :: BrIO Double generatorNormal01 :: BrIO Double }
data StrategyQueue BrIO FCFS #
data StrategyQueue BrIO FCFS = FCFSQueue (DoubleLinkedList BrIO a)
data StrategyQueue BrIO LCFS #
data StrategyQueue BrIO LCFS = LCFSQueue (DoubleLinkedList BrIO a)

Run the branching computation.

Return the current branch level starting from 0.

Orphan instances