Paketti: libghc-data-reify-prof (0.6.3-6)

[ Source: haskell-data-reify  ]

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.

Muut pakettiin libghc-data-reify-prof liittyvät paketit

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

  näennäispaketti, jonka toteuttaa ghc-prof

• dep: libghc-containers-prof-0.6.7-69002

  näennäispaketti, jonka toteuttaa 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-2c563

  näennäispaketti, jonka toteuttaa libghc-hashable-prof

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

  näennäispaketti, jonka toteuttaa libghc-unordered-containers-prof

Imuroi libghc-data-reify-prof

Imurointi kaikille saataville arkkitehtuureille

Arkkitehtuuri	Paketin koko	Koko asennettuna	Tiedostot
ppc64el	30.4 kt	187.0 kt	[tiedostoluettelo]