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.

  1. package primitive-unaligned

    Unaligned access to primitive arrays Unaligned access to primitive arrays. The offsets are given in bytes rather than elements.

  2. package product-profunctors

    product-profunctors Product profunctors and tools for working with them

  3. package proto-lens-protoc

    Protocol buffer compiler for the proto-lens library. Turn protocol buffer files (.proto) into Haskell files (.hs) which can be used with the proto-lens package. The library component of this package contains compiler code (namely Data.ProtoLens.Compiler.*) is not guaranteed to have stable APIs.'

  4. package ptr-poker

    Pointer poking action construction and composition toolkit Abstraction over memory writes. Efficiently building strict bytestrings is one usecase for it.

  5. package puresat

    Pure Haskell SAT-solver SAT Solver implemented in Haskell. PureSAT uses DPLL with non-chronological backtracking and learning of binaary clauses. Solver is in no-comparison to the state of the art solvers, but it's fast enough to solve sudoku.

  6. package pvar

    Mutable variable with primitive values Mutable variable PVar that is backed by a single value MutableByteArray

  7. package quantizer

    Library to provide the behaviour similar to quantum states superposition. Has three modules with similar functionality. The functions provide the somewhat generalized way to round the numbers based on some data.

  8. package quickcheck-arbitrary-adt

    Generic typeclasses for generating arbitrary ADTs Improve arbitrary value generation for ADTs

  9. package quickcheck-groups

    Testing group class instances with QuickCheck QuickCheck support for testing instances of type classes defined in the groups library.

  10. package quickcheck-higherorder

    QuickCheck extension for higher-order properties Enhancements for property-based testing of higher-order properties.

    • Associate types to their representations with the Constructible class.
    • Testable' class, variant of Testable with an improved instance for (->).
    • Representation of higher-order functions (via test-fun).
    • Testable equality TestEq.
    • Explicit testable type of Equation.
    See also README.

Page 135 of many | Previous | Next