Enter the query into the form above. You can look for specific version of a package by using @ symbol like this: gcc@10.
API method:
GET /api/packages?search=hello&page=1&limit=20
where search is your query, page is a page number and limit is a number of items on a single page. Pagination information (such as a number of pages and etc) is returned
in response headers.
If you'd like to join our channel webring send a patch to ~whereiseveryone/toys@lists.sr.ht adding your channel as an entry in channels.scm.
This package contains helper functions on top of Template Haskell.
For example, functionExtractor extracts all functions after a regexp-pattern, which can be useful if you wish to extract all functions beginning with test (for a test framework) or all functions beginning with wc (for a web service).
This package provides a monad transformer version of the ST monad for strict state threads.
This library provides the functions to find unique and duplicate elements in a list.
The doctest program checks examples in source code comments. It is modeled after doctest for Python, see the Doctest website.
This library provides fast, packed, strict storable arrays with a list interface, a chunky lazy list interface with variable chunk size and an interface for write access via the ST monad. This is much like bytestring and binary but can be used for every Foreign.Storable.Storable type. See also https://hackage.haskell.org/package/vector, a library with a similar intention.
This library does not do advanced fusion optimization, since especially for lazy vectors this would either be incorrect or not applicable. See https://hackage.haskell.org/package/storablevector-streamfusion for a library that provides fusion with lazy lists.
This package provides tools to measure the memory usage of a Haskell value or function.
This library provides a half-precision floating-point computation library for Haskell.
Fixpoint types and recursion schemes. If you define your AST as fixpoint type, you get fold and unfold operations for free.
Thanks for contribution to: Matej Kollar, Herbert Valerio Riedel
This library provides functions available in later versions of base to a wider range of compilers, without requiring the use of CPP pragmas in your code.
This package provides a library implementing the XDG Base Directory spec.
This package provides first class functional references. In addition to the usual operations of getting, setting and composition, plus integration with the state monad, lens families provide some unique features:
Polymorphic updating
Traversals
Cast projection functions to read-only lenses
Cast
toListfunctions to read-only traversalsCast semantic editor combinators to modify-only traversals
For optimal first-class support use the lens-family package with rank 2/rank N polymorphism. Lens.Family.Clone allows for first-class support of lenses and traversals for those who require Haskell 98.
This module allows tokens produced by skylighting-core to be rendered as LaTeX macros.
Language C is a Haskell library for the analysis and generation of C code. It features a complete, well-tested parser and pretty printer for all of C99 and a large set of GNU extensions.
This package provides a library for parallel programming.
SecureMem is similar to ByteString, except that it provides a memory chunk that will be auto-scrubbed after it run out of scope.
This package provides utilities and combinators for parsing command line options in Haskell.
Experimental Hspec support for testing WAI applications
Zstandard compression packaged as a conduit. This is a very thin wrapper around the official hs-zstd interface.
Containers with merging via monoidal accumulation. The Monoid instances provided by the containers and unordered-containers packages merge structures in a left-biased manner instead of using the underlying monoidal structure of the value. This package wraps the types provided by these packages, but provides Monoid instances implemented in terms of the value type's mappend'.
This package provides bindings to the ALSA simple mixer API.
This package provides implementation of the Wagner-Fischer dynamic programming algorithm to find the optimal edit script and cost between two sequences. The implementation in this package is specialised to sequences represented with Data.Vector but is otherwise agnostic to:
The type of values in the vectors;
The type representing edit operations; and
The type representing the cost of operations.
This package provides Haskell bindings to SDL2_mixer.
This package backports the Control.Monad.Except module from mtl (if using mtl-2.2.0.1 or earlier), which reexports the ExceptT monad transformer and the MonadError class.
This package should only be used if there is a need to use the Control.Monad.Except module specifically. If you just want the mtl class instances for ExceptT, use transformers-compat instead, since mtl-compat does nothing but reexport the instances from that package.
Note that unlike how mtl-2.2 or later works, the Control.Monad.Except module defined in this package exports all of ExceptT's monad class instances. Therefore, you may have to declare import Control.Monad.Except () at the top of your file to get all of the ExceptT instances in scope.
The major use of These of this is provided by the align member of Semialign class, representing a generalized notion of "zipping with padding" that combines structures without truncating to the size of the smaller input. It turns out that zip operation fits well the Semialign class, forming lattice-like structure.