Hoogle Search
Within LTS Haskell 24.67 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
abstraction to an auto scrubbing and const time eq, memory chunk. SecureMem is similar to ByteString, except that it provides a memory chunk that will be auto-scrubbed after it run out of scope.
-
generate API docs for your servant webservice Library for generating API docs from a servant API definition. Runnable example here. CHANGELOG
-
multipart/form-data (e.g file upload) support for servant This package contains servant API types that support multiform upload, used by servant-multipart and servant-multipart-client for backend/client implementation.
-
Simple command args parsing and execution This is a small wrapper over optparse-applicative which allows combining args parsers directly with IO commands. For subcommands this can avoid type boilerplate. It also provides some compact aliases for options with their Mod's.
-
Type level booleans Type level booleans. singletons package provides similar functionality, but it has tight dependency constraints.
-
Batteries-included, opinionated test framework Batteries-included, opinionated test framework. See README.md for more details.
-
Storable instance for pairs and triples Provides a Storable instance for pair and triple which should be binary compatible with C99 and C++. The only purpose of this package is to provide a standard location for this instance so that other packages needing this instance can play nicely together. Note however, that the original purpose of the Storable class was the transfer of primitive types between Haskell and foreign code. This purpose was already extended by HSC, which creates Storable instances for records from C header files. Nonetheless, Storable instances for tuples were omitted from base by intention. Instead of using the orphan instances from this package, you may instead use the custom class or the wrapper type from the module Foreign.Storable.Record.Tuple from the package storable-record.
-
Fast searching, splitting and replacing of ByteStrings This package provides several functions to quickly search for substrings in strict or lazy ByteStrings. It also provides functions for breaking or splitting on substrings and replacing all occurrences of a substring (the first in case of overlaps) with another. GHC before 6.10 are no longer supported, other compilers only if they support BangPatterns. If you need it to work with other compilers, send a feature request.
-
A typed-process companion library for sydtest A typed-process companion library for sydtest
-
Two-dimensional data tables with rendering functions Tabular provides a Haskell representation of two-dimensional data tables, the kind that you might find in a spreadsheet or or a research report. It also comes with some default rendering functions for turning those tables into ASCII art, simple text with an arbitrary delimiter, CSV, HTML or LaTeX. Below is an example of the kind of output this library produces. The tabular package can group rows and columns, each group having one of three separators (no line, single line, double line) between its members.
|| memtest 1 | memtest 2 || time test | time test 2 ====++===========+===========++=============+============ A 1 || hog | terrible || slow | slower A 2 || pig | not bad || fast | slowest ----++-----------+-----------++-------------+------------ B 1 || good | awful || intolerable | bearable B 2 || better | no chance || crawling | amazing B 3 || meh | well... || worst ever | ok