Hoogle Search
Within LTS Haskell 24.56 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Graph structure with type parameters for nodes and edges This graph structure is based on Data.Map and allows any Ord type for nodes and allows directed, undirected and more edge types. There is no need to map nodes to integer numbers. This makes handling in applications much more comfortable, thus the package name. This is especially useful for applications where there is no simple mapping of your node identifiers to integers or where the set of nodes is extended or reduced frequently. However, this flexibility comes with some costs. Since the structure is based on Data.Map.Maps, for efficient computing the node type should support fast comparison. The edge type can be freely chosen. This allows great flexibility but it is a bit more cumbersome to do in Haskell 98. Examples of edge types:
- DirEdge: Edges in a directed graph
- UndirEdge: Edges in an undirected graph
- EitherEdge: For graphs containing both directed and undirected edges
- You may define an edge type with an additional identifier in order to support multiple edges between the same pair of nodes.
- Using type functions with the node type as parameter you may even define an edge type for nodes from a Cartesian product, where only "horizontal" and "vertical" edges are allowed.
- fgl: standard package for graph processing with many graph algorithms but cumbersome data structure with Int numbered nodes
-
Bridge between commonmark and pandoc AST. This library provides typeclasses for rendering commonmark to Pandoc types.
-
Commutative binary operations. Please see the README on Github at https://github.com/athanclark/commutative#readme
-
A read-only memory-efficient key-value store. A read-only key-value store that uses a sorted vector internally
-
A Haskell library to provide companion threads. Please see the README on GitHub at https://github.com/commercialhaskell/companion#readme
-
Compensated floating-point arithmetic This package provides compensated floating point arithmetic.
-
Parser for common compiler warning formats Parser for common compiler warning formats
package
composable-associations Types and helpers for composing types into a single larger key-value type. A library providing generic types and helpers for composing types together into a a single key-value type. This is useful when a normalized data model has a denormalized serialization format. Using this libraries types and functions you build compose your data into the denormalized key-value format needed for serialization. Other libraries provide concrete implementations for a given serialization format.
-
Combinators for unorthodox function composition Combinators for unorthodox function composition
-
MVars and Channels with distinguished input and output side MVars and Channels with distinguished input and output side. When threads communicate via an MVar or a Chan there are often clearly defined roles, which thread is the sender and which one is receiver. We provide wrappers around the standard concurrency communication channels that make the distinction clear and type safe. For example, if a function has a parameter of type TChan.In then it is sure that it will only write to that channel. Additionally if the compiler warns about an unused TChan.Out that was created by TChan.new then you know that the receiver part of your communication is missing. This package requires only Haskell 98. Related packages:
- stm-split: transactional communication in STM monad
- chan-split: follows the same idea as this package and stm-split but requires multi-parameter type classes with functional dependencies.
- privileged-concurrency:
- split-channel: