Hoogle Search
Within LTS Haskell 24.45 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Painless 3D graphics, no affiliation with gloss This package began as a fork of Greg Horn's not-gloss package. The dependencies have been changed so that it builds with recent ghc versions.
-
Type classes generalizing the functionality of the 'monad-par' library. The Par monad offers a parallel programming API based on dataflow programming. To use the Par monad, install the monad-par package, which includes this package as a dependency. This package is an abstract interface only. It provides a number of type clasess, but not an implementation. The type classes separate different levels of Par functionality. See the Control.Monad.Par.Class module for more details.
-
Sequence optimized for monoidal construction and folding Data structure intended for accumulating a sequence of elements for later traversal or folding. Useful for implementing all kinds of builders on top. . The benchmarks show that for the described use-case it is on average 2 times faster than DList and Seq, is on par with list when you always prepend elements and is exponentially faster than list when you append.
-
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.
-
Abstractions for animation Active abstraction for animated things with finite start and end times.
-
Multi-precision ball (interval) arithmetic Please see the README on GitHub at https://github.com/michalkonecny/aern2/#readme
-
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.
-
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.
-
Fast Aho-Corasick string searching An efficient implementation of the Aho-Corasick string searching algorithm.
-
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),