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.
-
Privacy Enhanced Mail (PEM) format reader and writer. Privacy Enhanced Mail (PEM) format reader and writer. long description
-
ByteString support for pipes This library provides pipes utilities for ByteStrings
-
Primitive GHC types with unlifted types inside Primitive GHC types with unlifted types inside. There used to be a module named Data.Primitive.UnliftedArray in the primitive library. However, it turns out that it is impossible to write such an API safely in versions of GHC before 8.10.1, thanks to some nasty interactions between unsafe coercions and the foreign function interface. This package also uses a somewhat different, and more flexible, approach than that module did.
-
A lens-based implementation of protocol buffers in Haskell. The proto-lens library provides an API for protocol buffers using modern Haskell language and library patterns. Specifically, it provides:
- Composable field accessors via lenses
- Simple field name resolution/overloading via type-level literals
- Type-safe reflection and encoding/decoding of messages via GADTs
-
A small prelude. A sensible set of defaults for writing custom Preludes.
-
Test properties and default-mains for QuickCheck This package contains definitions of test properties and default-mains using QuickCheck library.
-
Representing common recursion patterns as higher-order functions Many recursive functions share the same structure, e.g. pattern-match on the input and, depending on the data constructor, either recur on a smaller input or terminate the recursion with the base case. Another one: start with a seed value, use it to produce the first element of an infinite list, and recur on a modified seed in order to produce the rest of the list. Such a structure is called a recursion scheme. Using higher-order functions to implement those recursion schemes makes your code clearer, faster, and safer. See README for details.
-
PCRE Backend for "Text.Regex" (regex-base) This package provides a PCRE backend for the regex-base API. See also https://wiki.haskell.org/Regular_expressions for more information. Includes bundled code from www.pcre.org
-
Binary serialization with version control. An extension to Data.Serialize with built-in version control.
-
two monoids as one, in holy haskimony Haskellers are usually familiar with monoids and semigroups. A monoid has an appending operation <> (or mappend), and an identity element, mempty. A semigroup has an appending <> operation, but does not require a mempty element. A Semiring has two appending operations, plus and times, and two respective identity elements, zero and one. More formally, a Semiring R is a set equipped with two binary relations + and *, such that: (R,+) is a commutative monoid with identity element 0, (R,*) is a monoid with identity element 1, (*) left and right distributes over addition, and multiplication by '0' annihilates R.