Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Lightweight package providing commonly useful parser combinators Lightweight package providing commonly useful parser combinators.
-
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.
-
Components of paths. Hackage documentation generation is not reliable. For up to date documentation, please see: http://www.stackage.org/package/path-pieces.
-
Mid-Level PostgreSQL client library Mid-Level PostgreSQL client library, forked from mysql-simple.
-
A high-performance striped resource pooling implementation A high-performance striped pooling abstraction for managing flexibly-sized collections of resources such as database connections.
-
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
-
Fast Splittable PRNG Pure Haskell implementation of SplitMix described in Guy L. Steele, Jr., Doug Lea, and Christine H. Flood. 2014. Fast splittable pseudorandom number generators. In Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications (OOPSLA '14). ACM, New York, NY, USA, 453-472. DOI: https://doi.org/10.1145/2660193.2660195 The paper describes a new algorithm SplitMix for splittable pseudorandom number generator that is quite fast: 9 64 bit arithmetic/logical operations per 64 bits generated. SplitMix is tested with two standard statistical test suites (DieHarder and TestU01, this implementation only using the former) and it appears to be adequate for "everyday" use, such as Monte Carlo algorithms and randomized data structures where speed is important. In particular, it should not be used for cryptographic or security applications, because generated sequences of pseudorandom values are too predictable (the mixing functions are easily inverted, and two successive outputs suffice to reconstruct the internal state).
-
Haskell string/text/bytestring interpolation that just works Unicode-aware string interpolation that handles all textual types. See the README at https://gitlab.com/williamyaoh/string-interpolate/blob/master/README.md for more info.
-
Hspec support for the Tasty test framework. This package provides a Tasty provider for Hspec test suites.
-
Self-documenting encoder and decoder Self-documenting encoder and decoder