Hoogle Search

Within LTS Haskell 24.16 (ghc-9.10.3)

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

  1. package mono-traversable

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

  2. package parser-combinators

    Lightweight package providing commonly useful parser combinators Lightweight package providing commonly useful parser combinators.

  3. 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.

  4. 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.

  5. package postgresql-simple

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

  6. 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.

  7. 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

  8. package splitmix

    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).

  9. 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.

  10. package tasty-hspec

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

Page 21 of many | Previous | Next