Hoogle Search
Within LTS Haskell 24.48 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Purely Functional Cursors Purely Functional Cursors for common data structures See https://cs-syd.eu/tags/cursors for more information.
-
A basic framework for effect systems based on effects represented by GADTs. A basic framework for a Haskell effect system library based on GADTs-based effect representations with a style that separates first-order effects and higher-order effects. This library set was created by being separated from the Heftia extensible effects library.
-
A basic framework for effect systems based on effects represented by GADTs. This library provides core definitions of data-effects.
-
Set and bag operations on ordered lists This module provides set and multiset operations on ordered lists.
-
Reify a recursive data structure into an explicit graph. '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.
-
A library for unit-testing concurrent programs. [Déjà Fu is] A martial art in which the user's limbs move in time as well as space, […] It is best described as "the feeling that you have been kicked in the head this way before" -- Terry Pratchett, Thief of Time This package builds on the concurrency package by enabling you to deterministically test your concurrent programs. See the website or README for more.
-
Double-ended queues Strict and lazy implementations of Double-Ended Queue (aka Dequeue or Deque) based on head-tail linked list.
-
Type driven generic aeson instance customisation This package provides a newtype wrapper with FromJSON/ToJSON instances customisable via a phantom type parameter. The instances can be rendered to the original type using DerivingVia.
-
Type, render and parse the df1 hierarchical structured log format Type, render and parse logs in df1 format, a hierarchical structured log format that is easy for humans and fast for computers.
-
Cairo backend for diagrams drawing EDSL A full-featured backend for rendering diagrams using the cairo rendering engine. This ultimately depends on a C library, via Haskell's FFI, and can be difficult to install on some platforms. If you are just looking for a quick way to visualize diagrams, try the diagrams-svg backend; if you want raster output like PNG, try the diagrams-rasterific backend; if you want to embed diagrams in LaTeX documents, try diagrams-pgf.
- Diagrams.Backend.Cairo.CmdLine - if you're just getting started with diagrams, begin here.
- Diagrams.Backend.Cairo - look at this next. The general API for the cairo backend.
- Diagrams.Backend.Cairo.Internal - the implementation guts of the cairo backend. Users should normally not need to import this module.
- Diagrams.Backend.Cairo.List - render diagrams to two-dimensional lists of colors (i.e. pixels).
- Diagrams.Backend.Cairo.Ptr - render diagrams to buffers in memory.