Hoogle Search
Within LTS Haskell 24.65 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
package
prettyprinter-combinators Some useful combinators for the prettyprinter package Various utilities that make writing Pretty instances easier. Notable utilites include automatic deriving of Pretty instance via Generic, Data, or Show instance.
-
Efficient interpolation for Prettyprinter This package provides efficient interpolation of string-interpolate quasi quoters when used with prettyprinter.
-
Opaque unique identifiers in primitive state monads Opaque unique identifiers in primitive state monads and a GADT-like type using them as witnesses of type equality.
-
Addresses to unmanaged memory This library provides the Data.Primitive.Addr module that was a part of the primitive library before `primitive-0.7.0.0`.
-
Extras for the "primitive" library Raw collection of extra utiltilies for the "primitive" library.
-
Unaligned access to primitive arrays Unaligned access to primitive arrays. The offsets are given in bytes rather than elements.
-
product-profunctors Product profunctors and tools for working with them
-
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.'
-
Pointer poking action construction and composition toolkit Abstraction over memory writes. Efficiently building strict bytestrings is one usecase for it.
-
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.