Hoogle Search

Within LTS Haskell 22.23 (ghc-9.6.5)

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

  1. package HUnit

    A unit testing framework for Haskell HUnit is a unit testing framework for Haskell, inspired by the JUnit tool for Java, see: http://www.junit.org.

  2. package amazonka-test

    Common functionality for Amazonka library test-suites. Common functionality depended upon by test suites of the various amazonka-* service libraries. The external interface of this library is stable with respect to the downstream Amazonka libraries, only, and as such is not suitable for use in non-Amazonka projects.

  3. package semigroups

    Anything that associates In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative binary operation. A semigroup generalizes a monoid in that there might not exist an identity element. It also (originally) generalized a group (a monoid with all inverses) to a type where every element did not have to have an inverse, thus the name semigroup.

  4. package tasty-quickcheck

    QuickCheck support for the Tasty test framework. QuickCheck support for the Tasty test framework.

  5. package hashable

    A class for types that can be converted to a hash value This package defines a class, Hashable, for types that can be converted to a hash value. This class exists for the benefit of hashing-based data structures. The package provides instances for basic types and a way to combine hash values. The Hashable hash values are not guaranteed to be stable across library versions, operating systems or architectures. For stable hashing use named hashes: SHA256, CRC32 etc.

  6. package criterion

    Robust, reliable performance measurement and analysis This library provides a powerful but simple way to measure software performance. It provides both a framework for executing and analysing benchmarks and a set of driver functions that makes it easy to build and run benchmarks, and to analyse their results. The fastest way to get started is to read the online tutorial, followed by the documentation and examples in the Criterion.Main module. For examples of the kinds of reports that criterion generates, see the home page.

  7. package random

    Pseudo-random number generation This package provides basic pseudo-random number generation, including the ability to split random number generators.

    System.Random: pure pseudo-random number interface

    In pure code, use System.Random.uniform and System.Random.uniformR from System.Random to generate pseudo-random numbers with a pure pseudo-random number generator like System.Random.StdGen. As an example, here is how you can simulate rolls of a six-sided die using System.Random.uniformR:
    >>> let roll = uniformR (1, 6)        :: RandomGen g => g -> (Word, g)
    
    >>> let rolls = unfoldr (Just . roll) :: RandomGen g => g -> [Word]
    
    >>> let pureGen = mkStdGen 42
    
    >>> take 10 (rolls pureGen)           :: [Word]
    [1,1,3,2,4,5,3,4,6,2]
    
    See System.Random for more details.

    System.Random.Stateful: monadic pseudo-random number interface

    In monadic code, use System.Random.Stateful.uniformM and System.Random.Stateful.uniformRM from System.Random.Stateful to generate pseudo-random numbers with a monadic pseudo-random number generator, or using a monadic adapter. As an example, here is how you can simulate rolls of a six-sided die using System.Random.Stateful.uniformRM:
    >>> let rollM = uniformRM (1, 6)                 :: StatefulGen g m => g -> m Word
    
    >>> let pureGen = mkStdGen 42
    
    >>> runStateGen_ pureGen (replicateM 10 . rollM) :: [Word]
    [1,1,3,2,4,5,3,4,6,2]
    
    The monadic adapter System.Random.Stateful.runStateGen_ is used here to lift the pure pseudo-random number generator pureGen into the System.Random.Stateful.StatefulGen context. The monadic interface can also be used with existing monadic pseudo-random number generators. In this example, we use the one provided in the mwc-random package:
    >>> import System.Random.MWC as MWC
    
    >>> let rollM = uniformRM (1, 6)       :: StatefulGen g m => g -> m Word
    
    >>> monadicGen <- MWC.create
    
    >>> replicateM 10 (rollM monadicGen) :: IO [Word]
    [2,3,6,6,4,4,3,1,5,4]
    
    See System.Random.Stateful for more details.

  8. package exceptions

    Extensible optionally-pure exceptions Extensible optionally-pure exceptions.

  9. package array

    Mutable and immutable arrays In addition to providing the Data.Array module as specified in the Haskell 2010 Language Report, this package also defines the classes IArray of immutable arrays and MArray of arrays mutable within appropriate monads, as well as some instances of these classes.

  10. package ghc-prim

    GHC primitives This package contains the primitive types and operations supplied by GHC. It is an internal package, only for the use of GHC developers. GHC users should not use it! If you do use it then expect breaking changes at any time without warning. You should prefer to import GHC.Exts from the base package instead.

Page 3 of many | Previous | Next