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.

package benri-hspec

Simplify tests where Either or Maybe types are returned from monadic code A small library of convenient functions for writing hspec tests. It simplifies tests where Either, Maybe and other types are returned from monadic code. The README provides usage examples.
package bibtex

Parse, format and processing BibTeX files This package allows parsing, formatting and processing of BibTeX files. BibTeX files are databases for literature for the natbib package of the LaTeX typesetting system. The package contains two examples:
- The first example demonstrates the BibTeX parser by generating a publication overview from a .bib file.
- The second example demonstrates the BibTeX generation by producing a large .bib file from the tar archive that cabal-install downloads to your local cabal directory.
Both examples will be build as stand-alone executable when running
```
cabal install -fbuildExamples bibtex
```
For the first example see the publications directory of this package. You can start the program and build an example document by running
```
make pubs
```
Technically the program generates a list of custom \nocite commands for the LaTeX package multibib. You can add the custom bibtex field subtype to BibTeX entries for more detailed categorization of an entry. See "publications/publications.bib" for examples. The second example can be executed using
```
make hackbib
```
The file hackage.bib is written to the hackage subdirectory. The hackage-bibtex program reads an uncompressed tar archive from standard input and writes the result bibliography file to standard output. Note that hackage.bib exceeds some limits of standard BibTeX and LaTeX: There are currently much more than 5000 versions of packages, the maximum my BibTeX can handle at once. That is, you can use the bibliography file, but you cannot cite all entries with \nocite*. If there are more than 26 uploads by the same author in a year, the BibTeX style alpha generates identifiers including curly braces which interacts badly with LaTeX's handling of them. If you reduce the Bibliography file to 5000 entries and try to generate an overview of all entries with \nocite, then pdflatex hits its limits:
```
TeX capacity exceeded, sorry [save size=5000]
```
package binary-parser

An efficient but limited parser API specialised to bytestrings An efficient but limited parser API specialised to bytestrings
package bindings-GLFW

Low-level bindings to GLFW OpenGL library Low-level bindings to GLFW (http://www.glfw.org/), an open source, multi-platform library for creating windows with OpenGL contexts and managing input and events. The binding is to GLFW 3.3, released 2019-04-15 (http://www.glfw.org/Version-3.3-released.html http://www.glfw.org/changelog.html). These bindings are too low-level for normal use. For higher-level bindings, see GLFW-b (http://hackage.haskell.org/package/GLFW-b). If you've used GLFW before, you were probably using 2.7.x. There are some significant differences in 3.x.x. Please see the transition guide (http://www.glfw.org/docs/3.3/moving.html).
package bits

Various bit twiddling and bitwise serialization primitives Various bit twiddling and bitwise serialization primitives.
package bitset-word8

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
package bitwise

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:
1. unboxed bit packed Bool array,
2. multi-dimensional indexing,
3. fast (de)serialization, or interoperable with foreign code,
4. fast aggregate operations (fold, map, zip).
Quick tour of the bitwise library:
- 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.
Very rough performance benchmarks:
- 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.
package bluefin-internal

The Bluefin effect system, internals The Bluefin effect system, internals
package boltzmann-samplers

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.
package box-socket

Box websockets Websockets built with the box library.

Page 104 of many | Previous | Next