| Copyright | Copyright (c) 2009-2017 David Sorokin <david.sorokin@gmail.com> |
|---|---|
| License | BSD3 |
| Maintainer | David Sorokin <david.sorokin@gmail.com> |
| Stability | experimental |
| Safe Haskell | None |
| Language | Haskell2010 |
Simulation.Aivika.Trans.Dynamics.Memo.Unboxed
Description
Tested with: GHC 8.0.1
This module defines the unboxed memo functions. The memoization creates such Dynamics
computations, which values are cached in the integration time points. Then
these values are interpolated in all other time points.
Documentation
class Monad m => MonadMemo m e where Source #
A monad with the support of unboxed memoisation.
Minimal complete definition
Methods
memoDynamics :: Dynamics m e -> Simulation m (Dynamics m e) Source #
Memoize and order the computation in the integration time points using
the interpolation that knows of the Runge-Kutta method. The values are
calculated sequentially starting from starttime.
memo0Dynamics :: Dynamics m e -> Simulation m (Dynamics m e) Source #
Memoize and order the computation in the integration time points using
the discreteDynamics interpolation. It consumes less memory than the memoDynamics
function but it is not aware of the Runge-Kutta method. There is a subtle
difference when we request for values in the intermediate time points
that are used by this method to integrate. In general case you should
prefer the memo0Dynamics function above memoDynamics.
Instances
| MArray IOUArray e IO => MonadMemo IO e Source # | The |
Defined in Simulation.Aivika.IO.Dynamics.Memo.Unboxed Methods memoDynamics :: Dynamics IO e -> Simulation IO (Dynamics IO e) Source # memo0Dynamics :: Dynamics IO e -> Simulation IO (Dynamics IO e) Source # | |