Paket: libghc-data-reify-prof (0.6.3-6) [debports]

[ Källkod:  ]

Reify a recursive data structure into an explicit graph.; profiling libraries

'data-reify' provided the ability to turn recursive structures into explicit graphs. Many (implicitly or explicitly) recursive data structure can be given this ability, via a type class instance. This gives an alternative to using 'Ref' for observable sharing.

Observable sharing in general is unsafe, so we use the IO monad to bound this effect, but can be used safely even with 'unsafePerformIO' if some simple conditions are met. Typically this package will be used to tie the knot with DSL's that depend of observable sharing, like Lava.

Providing an instance for 'MuRef' is the mechanism for allowing a structure to be reified into a graph, and several examples of this are provided.

© 2009 Andy Gill; BSD3 license.

This package provides a library for the Haskell programming language, compiled for profiling. See http://www.haskell.org/ for more information on Haskell.

Andra paket besläktade med libghc-data-reify-prof

• dep: libghc-base-prof-4.18.2.1-e617e

  virtuellt paket som tillhandahålls av ghc-prof

• dep: libghc-containers-prof-0.6.7-338ff

  virtuellt paket som tillhandahålls av ghc-prof

• dep: libghc-data-reify-dev (= 0.6.3-6)

  Reify a recursive data structure into an explicit graph.

• dep: libghc-hashable-prof-1.4.4.0-872f0

  virtuellt paket som tillhandahålls av libghc-hashable-prof

• dep: libghc-unordered-containers-prof-0.2.20-55204

  virtuellt paket som tillhandahålls av libghc-unordered-containers-prof

Hämta libghc-data-reify-prof

Hämtningar för alla tillgängliga arkitekturer

Arkitektur	Paketstorlek	Installerad storlek	Filer
hppa (inofficiell anpassning)	38,5 kbyte	178,0 kbyte	[filförteckning]