Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. package acid-state

   Add ACID guarantees to any serializable Haskell data structure. Use regular Haskell data structures as your database and get stronger ACID guarantees than most RDBMS offer.

2. package active

   Abstractions for animation Active abstraction for animated things with finite start and end times.

3. package aern2-mp

   Multi-precision ball (interval) arithmetic Please see the README on GitHub at https://github.com/michalkonecny/aern2/#readme

4. package aeson-casing

   Tools to change the formatting of field names in Aeson instances. Tools to change the formatting of field names in Aeson instances. This includes CamelCasing, Pascal Casing and Snake Casing.

5. package aeson-diff

   Extract and apply patches to JSON documents. This is a small library for working with changes to JSON documents. It includes a library and two command-line executables in the style of the diff(1) and patch(1) commands available on many systems.

6. package aeson-schemas

   Easily consume JSON data on-demand with type-safety Parse JSON data easily and safely without defining new data types. Useful for deeply nested JSON data, which is difficult to parse using the default FromJSON instances.

7. package alfred-margaret

   Fast Aho-Corasick string searching An efficient implementation of the Aho-Corasick string searching algorithm.

8. package algebraic-graphs

   A library for algebraic graph construction and transformation Alga is a library for algebraic construction and manipulation of graphs in Haskell. See this paper for the motivation behind the library, the underlying theory and implementation details. The top-level module Algebra.Graph defines the main data type for algebraic graphs Graph, as well as associated algorithms. For type-safe representation and manipulation of non-empty algebraic graphs, see Algebra.Graph.NonEmpty. Furthermore, algebraic graphs with edge labels are implemented in Algebra.Graph.Labelled. The library also provides conventional graph data structures, such as Algebra.Graph.AdjacencyMap along with its various flavours:

   • adjacency maps specialised to graphs with vertices of type Int (Algebra.Graph.AdjacencyIntMap),
   • non-empty adjacency maps (Algebra.Graph.NonEmpty.AdjacencyMap),
   • adjacency maps for undirected bipartite graphs (Algebra.Graph.Bipartite.AdjacencyMap),
   • adjacency maps with edge labels (Algebra.Graph.Labelled.AdjacencyMap),
   • acyclic adjacency maps (Algebra.Graph.Acyclic.AdjacencyMap),
   A large part of the API of algebraic graphs and adjacency maps is available through the Foldable-like type class Algebra.Graph.ToGraph. The type classes defined in Algebra.Graph.Class and Algebra.Graph.HigherKinded.Class can be used for polymorphic construction and manipulation of graphs. This is an experimental library and the API is expected to remain unstable until version 1.0.0. Please consider contributing to the on-going discussions on the library API.

9. package alsa-pcm

   Binding to the ALSA Library API (PCM audio). This package provides access to ALSA realtime audio signal input and output. For MIDI support see alsa-seq.

10. package appendful

    Append-only cooperative agreement

Page 101 of many | Previous | Next