pure is:module

This module supplies a 'pure' monad transformer that can be used for mock-testing code that throws exceptions, so long as those exceptions are always thrown with throwM. Do not mix CatchT with IO. Choose one or the other for the bottom of your transformer stack!

AcidState container without a transaction log. Mostly used for testing. This module consists of internal implementation details for Data.Acid.Memory. You should not normally need to import it. Call openMemoryState and thereafter use the API from Data.Acid instead.

A typeclass collecting all pure typechecking operations | (i.e. ones that do not modify the typechecking state, throw or | catch errors, or do IO other than debug printing).

This module introduces helpful pure codes to customise the terminal output view.

This module contains the reference implementation for the pure subset of the simple variant of Elerea. I/O embedding is substituted by conversion from and to lists.

This module defines instances which lift from haskell pure values to query internal record values.

Pure implementation of logging action.

We have simple linear functions and simple linear data structures that illustrate the basic concepts of how the type checker of GHC with linear types behaves. The goal of this is to be a ridiculously simple tutorial on the basics of linear types.

Experimental pure haskell version of the fast variant of the PCG random number generator. This module can perform faster than the c bindings version, especially for parallel code. See http://www.pcg-random.org for details.

import Control.Monad.ST
import System.Random.PCG.Fast.Pure

three :: [Double]
three = runST $ do
g <- create
a <- uniform g
b <- uniform g
c <- uniform g
return [a,b,c]

Standard PCG Random Number Generator with chosen streams, written in pure haskell. See http://www.pcg-random.org for details.

import Control.Monad.ST
import System.Random.PCG.Pure

three :: [Double]
three = runST $ do
g <- create
a <- uniform g
b <- uniform g
c <- uniform g
return [a,b,c]

A pure in-memory B+-tree implementation.

A pure gloss backend for Rhine. To run pure Rhine apps with gloss, write a clocked signal function (ClSF) in the GlossClock and use flowGloss.

This module exports noop but type compatible versions of the most common combinators from the Hoed package. It is designed to be used in conjunction with Cabal flags to preserve the ability to debug a program without the overhead.

Efficient, pure, standard 32-bit MT19937 Mersenne Twister implementation.

Tested with: GHC 6.8.3 A purely functional binding 64 bit binding to the classic mersenne twister random number generator. This is more flexible than the impure 'mersenne-random' library, at the cost of being a bit slower. This generator is however, many times faster than System.Random, and yields high quality randoms with a long period. This generator may be used with System.Random, however, that is likely to be slower than using it directly.

This module defines instances to lift from haskell UTF8 byte-sequence to query internal record values. This module is not defaultly imported to be selectable instance of byte-sequences.