Hoogle Search
Within LTS Haskell 24.4 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Read and write uncompressed BMP image files. Read and write uncompressed BMP image files. 100% robust Haskell implementation.
-
Making de Bruijn Succ Less We represent the target language itself as an ideal monad supplied by the user, and provide a Scope monad transformer for introducing bound variables in user supplied terms. Users supply a Monad and Traversable instance, and we traverse to find free variables, and use the Monad to perform substitution that avoids bound variables. Slides describing and motivating this approach to name binding are available online at: http://www.slideshare.net/ekmett/bound-making-de-bruijn-succ-less The goal of this package is to make it as easy as possible to deal with name binding without forcing an awkward monadic style on the user. With generalized de Bruijn term you can lift whole trees instead of just applying succ to individual variables, weakening the all variables bound by a scope and greatly speeding up instantiation. By giving binders more structure we permit easy simultaneous substitution and further speed up instantiation.
-
Portable big-endian and little-endian conversions This library provides an interface to portably work with byte arrays whose contents are known to be of a fixed endianness. There are two ways to use this module. See the System.ByteOrder module for more documentation.
-
Build byte arrays This is similar to the builder facilities provided by Data.ByteString.Builder. It is intended to be used in situations where the following apply:
- An individual entity will be serialized as a small number of bytes (less than 512).
- A large number (more than 32) of entities will be serialized one after another without anything between them.
-
Exposes the native endianness or byte ordering of the system. This package is for working with the native byte-ordering of the system.
-
Nonresumable byte parser Parse bytes as fast as possible. This is a nonresumable parser that aggresively uses UnboxedSums to avoid performing any allocations.
-
Efficiently parse and produce common integral and fractional numbers. The bytestring-lexing package offers extremely efficient ByteString parsers for some common lexemes: namely integral and fractional numbers. In addition, it provides efficient serializers for (some of) the formats it parses. As of version 0.3.0, bytestring-lexing offers the best-in-show parsers for integral values. (According to the Warp web server's benchmark of parsing the Content-Length field of HTTP headers.) And as of version 0.5.0 it offers (to my knowledge) the best-in-show parser for fractional/floating numbers. Some benchmarks for this package can be found at: https://github.com/wrengr/bytestring-lexing/tree/master/bench/html
-
To make a wrapper for struct of C language Please see the README on GitHub at https://github.com/YoshikuniJujo/c-struct#readme
-
Utilities to work with cabal-install files cabal-install-parsers provides parsers for cabal-install files: cabal.project (Cabal.Project), cabal.config (Cabal.Config), 01-index.tar (Cabal.Index); as well as some other utilities. The feature set is mainly motivated by the needs of haskell-ci package. The parsed data is not complete, functionality is added on demand.
-
Concise Binary Object Representation (CBOR) This package provides an efficient implementation of the Concise Binary Object Representation (CBOR), as specified by RFC 7049. If you are looking for a library for serialisation of Haskell values, have a look at the serialise package, which is built upon this library. An implementation of the standard bijection between CBOR and JSON is provided by the cborg-json package. Also see cbor-tool for a convenient command-line utility for working with CBOR data. This package was formerly known as binary-serialise-cbor.