Hoogle Search
Within LTS Haskell 24.57 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Space efficient set of Word8 and some pre-canned sets useful for parsing HTTP Please see the README on GitHub at https://github.com/nshimaza/bitset-word8#readme
-
fast multi-dimensional unboxed bit packed Bool arrays Unboxed multidimensional bit packed Bool arrays with fast aggregate operations based on lifting Bool operations to bitwise operations. There are many other bit packed structures out there, but none met all of these requirements:
- unboxed bit packed Bool array,
- multi-dimensional indexing,
- fast (de)serialization, or interoperable with foreign code,
- fast aggregate operations (fold, map, zip).
- Data.Bits.Bitwise Lift boolean operations on Bool to bitwise operations on Data.Bits.Bits.
- Data.Array.BitArray Immutable bit arrays.
- Data.Array.BitArray.ST Mutable bit arrays in Control.Monad.ST.ST.
- Data.Array.BitArray.IO Mutable bit arrays in IO.
- Data.Array.BitArray.ByteString (De)serialization.
- Codec.Image.PBM Portable bitmap monochrome 2D image format.
- immutable random access single bit reads: BitArray ix is about 40% slower than UArray ix Bool,
- Control.Monad.ST.ST mutable random access single bit reads: STBitArray s ix is about the same as STUArray s ix Bool,
- immutable map Bool -> Bool: BitArray ix is about 85x faster than UArray ix Bool,
- immutable zipWith Bool -> Bool -> Bool: BitArray ix is about 1300x faster than UArray ix Bool.
-
The Bluefin effect system, internals The Bluefin effect system, internals
-
Uniform random generators Random generators with a uniform distribution conditioned to a given size. See also testing-feat, which is currently a faster method with similar results.
-
Box websockets Websockets built with the box library.
-
Brotli (RFC7932) compression and decompression Brotli (RFC7932) is a generic-purpose lossless compression algorithm suitable for HTTP compression that compresses data using a combination of a modern variant of the LZ77 algorithm, Huffman coding and 2nd order context modeling. This package provides a pure interface for compressing and decompressing Brotli streams of data represented as lazy ByteStrings. A monadic incremental interface is provided as well. This package relies on Google's C implementation. The following packages are based on this package and provide API support for popular streaming frameworks:
- brotli-streams (for io-streams)
- pipes-brotli (for pipes)
- brotli-conduit (for conduit)
-
IO-Streams interface for Brotli (RFC7932) compression Brotli (RFC7932) is a generic-purpose lossless compression algorithm suitable for HTTP compression that compresses data using a combination of a modern variant of the LZ77 algorithm, Huffman coding and 2nd order context modeling. This package provides an IO-Streams interface for the Brotli compression algorithm. Decompressing Brotli InputStreams and compressing OutputStreams to Brotli streams with tunable (de)compression parameters is supported.
-
Chunked HTTP transfer encoding for bytestring builders This library contains functions for encoding bytestring builders for chunked HTTP/1.1 transfer. This functionality was extracted from the blaze-builder package.
-
A Bugsnag client for Haskell. Please see the README at https://github.com/jwoudenberg/bugsnag-hs.
-
WAI integration for Bugsnag error reporting for Haskell Please see README.md