Copyright  Copyright (c) 20092014, David Sorokin <david.sorokin@gmail.com> 

License  BSD3 
Maintainer  David Sorokin <david.sorokin@gmail.com> 
Stability  experimental 
Safe Haskell  None 
Language  Haskell2010 
Tested with: GHC 7.8.3
It represents a circuit synchronized with the event queue. Also it allows creating the recursive links with help of the procnotation.
The implementation is based on the Arrow Tutorial.
 newtype Circuit m a b = Circuit {
 runCircuit :: a > Event m (b, Circuit m a b)
 arrCircuit :: MonadComp m => (a > Event m b) > Circuit m a b
 accumCircuit :: MonadComp m => (acc > a > Event m (acc, b)) > acc > Circuit m a b
 arrivalCircuit :: MonadComp m => Circuit m a (Arrival a)
 delayCircuit :: MonadComp m => a > Circuit m a a
 timeCircuit :: MonadComp m => Circuit m a Double
 (<?<) :: MonadComp m => Circuit m b c > Circuit m a (Maybe b) > Circuit m a (Maybe c)
 (>?>) :: MonadComp m => Circuit m a (Maybe b) > Circuit m b c > Circuit m a (Maybe c)
 filterCircuit :: MonadComp m => (a > Bool) > Circuit m a b > Circuit m a (Maybe b)
 filterCircuitM :: MonadComp m => (a > Event m Bool) > Circuit m a b > Circuit m a (Maybe b)
 neverCircuit :: MonadComp m => Circuit m a (Maybe b)
 circuitSignaling :: MonadComp m => Circuit m a b > Signal m a > Signal m b
 circuitProcessor :: MonadComp m => Circuit m a b > Processor m a b
 integCircuit :: MonadComp m => Double > Circuit m Double Double
 sumCircuit :: (MonadComp m, Num a) => a > Circuit m a a
 circuitTransform :: MonadComp m => Circuit m a b > Transform m a b
The Circuit Arrow
Represents a circuit synchronized with the event queue. Besides, it allows creating the recursive links with help of the procnotation.
Circuit  

Circuit Primitives
arrCircuit :: MonadComp m => (a > Event m b) > Circuit m a b Source
Create a simple circuit by the specified handling function that runs the computation for each input value to get an output.
accumCircuit :: MonadComp m => (acc > a > Event m (acc, b)) > acc > Circuit m a b Source
Accumulator that outputs a value determined by the supplied function.
The Arrival Circuit
arrivalCircuit :: MonadComp m => Circuit m a (Arrival a) Source
A circuit that adds the information about the time points at which the values were received.
Delaying the Circuit
delayCircuit :: MonadComp m => a > Circuit m a a Source
Delay the input by one step using the specified initial value.
The Time Circuit
timeCircuit :: MonadComp m => Circuit m a Double Source
A circuit that returns the current modeling time.
Conditional Computation
:: MonadComp m  
=> Circuit m b c  process the event if it presents 
> Circuit m a (Maybe b)  whether there is an event 
> Circuit m a (Maybe c)  the resulting circuit that processes only the represented events 
Like <<<
but processes only the represented events.
:: MonadComp m  
=> Circuit m a (Maybe b)  whether there is an event 
> Circuit m b c  process the event if it presents 
> Circuit m a (Maybe c)  the resulting circuit that processes only the represented events 
Like >>>
but processes only the represented events.
filterCircuit :: MonadComp m => (a > Bool) > Circuit m a b > Circuit m a (Maybe b) Source
Filter the circuit, calculating only those parts of the circuit that satisfy the specified predicate.
filterCircuitM :: MonadComp m => (a > Event m Bool) > Circuit m a b > Circuit m a (Maybe b) Source
Filter the circuit within the Event
computation, calculating only those parts
of the circuit that satisfy the specified predicate.
neverCircuit :: MonadComp m => Circuit m a (Maybe b) Source
The source of events that never occur.
Converting to Signals and Processors
circuitSignaling :: MonadComp m => Circuit m a b > Signal m a > Signal m b Source
Get a signal transform by the specified circuit.
circuitProcessor :: MonadComp m => Circuit m a b > Processor m a b Source
Transform the circuit to a processor.
Integrals and Difference Equations
:: MonadComp m  
=> Double  the initial value 
> Circuit m Double Double  map the derivative to an integral 
An approximation of the integral using Euler's method.
This function can be rather inaccurate as it depends on
the time points at wich the Circuit
computation is actuated.
Also Euler's method per se is not most accurate, although simple
enough for implementation.
Consider using the integ
function whenever possible.
That function can integrate with help of the RungeKutta method by
the specified integration time points that are passed in the simulation
specs to every Simulation
, when running the model.
At the same time, the integCircuit
function has no mutable state
unlike the former. The latter consumes less memory but at the cost
of inaccuracy and relatively more slow simulation, had we requested
the integral in the same time points.
Regarding the recursive equations, the both functions allow defining them but whithin different computations (either with help of the recursive donotation or the procnotation).
A sum of differences starting from the specified initial value.
Consider using the more accurate diffsum
function whener possible as
it is calculated in every integration time point specified by specs
passed in to every Simulation
, when running the model.
At the same time, the sumCircuit
function has no mutable state and
it consumes less memory than the former.
Regarding the recursive equations, the both functions allow defining them but whithin different computations (either with help of the recursive donotation or the procnotation).
The Circuit Transform
circuitTransform :: MonadComp m => Circuit m a b > Transform m a b Source
Approximate the circuit as a transform of time varying function, calculating the values in the integration time points and then interpolating in all other time points. The resulting transform computation is synchronized with the event queue.
This procedure consumes memory as the underlying memoization allocates an array to store the calculated values.