Hoogle Search

Within LTS Haskell 24.5 (ghc-9.10.2)

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

package mono-traversable

Type classes for mapping, folding, and traversing monomorphic containers Please see the README at https://www.stackage.org/package/mono-traversable
package parsers

Parsing combinators This library provides convenient combinators for working with and building parsing combinator libraries. Given a few simple instances, e.g. for the class Text.Parser.Combinators.Parsing in Text.Parser.Combinators.Parsing you get access to a large number of canned definitions. Instances exist for the parsers provided by parsec, attoparsec and base’s Text.Read.
package path-pieces

Components of paths. Hackage documentation generation is not reliable. For up to date documentation, please see: http://www.stackage.org/package/path-pieces.
package postgresql-simple

Mid-Level PostgreSQL client library Mid-Level PostgreSQL client library, forked from mysql-simple.
package resource-pool

A high-performance striped resource pooling implementation A high-performance striped pooling abstraction for managing flexibly-sized collections of resources such as database connections.
package servant-client

Automatic derivation of querying functions for servant This library lets you derive automatically Haskell functions that let you query each endpoint of a servant webservice. . See the client section of the tutorial. . CHANGELOG
package strict

Strict data types and String IO. This package provides strict versions of some standard Haskell data types (pairs, Maybe and Either). It also contains strict IO operations. It is common knowledge that lazy datastructures can lead to space-leaks. This problem is particularly prominent, when using lazy datastructures to store the state of a long-running application in memory. One common solution to this problem is to use seq and its variants in every piece of code that updates your state. However a much easier solution is to use fully strict types to store such state values. By "fully strict types" we mean types for whose values it holds that, if they are in weak-head normal form, then they are also in normal form. Intuitively, this means that values of fully strict types cannot contain unevaluated thunks. To define a fully strict datatype, one typically uses the following recipe.
1. Make all fields of every constructor strict; i.e., add a bang to all fields.
2. Use only strict types for the fields of the constructors.
The second requirement is problematic as it rules out the use of the standard Haskell Maybe, Either, and pair types. This library solves this problem by providing strict variants of these types and their corresponding standard support functions and type-class instances. Note that this library does currently not provide fully strict lists. They can be added if they are really required. However, in many cases one probably wants to use unboxed or strict boxed vectors from the vector library (http://hackage.haskell.org/package/vector) instead of strict lists. Moreover, instead of Strings one probably wants to use strict Text values from the text library (http://hackage.haskell.org/package/text). This library comes with batteries included; i.e., mirror functions and instances of the lazy versions in base. It also includes instances for type-classes from the deepseq, binary, and hashable packages.
package tasty-hspec

Hspec support for the Tasty test framework. This package provides a Tasty provider for Hspec test suites.
package autodocodec

Self-documenting encoder and decoder Self-documenting encoder and decoder
package byteable

Type class for sequence of bytes Abstract class to manipulate sequence of bytes The use case of this class is abstracting manipulation of types that are just wrapping a bytestring with stronger and more meaniful name. Usual definition of those types are of the form: newtype MyType = MyType ByteString

Page 21 of many | Previous | Next