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 search send a patch to ~whereiseveryone/toys@lists.sr.ht adding your channel as an entry in channels.scm.
This package provides a library implementing the XDG Base Directory spec.
This package provides instances defined in later versions of ghc-binary package.
A clean and powerful stream processing library that lets you build and connect reusable streaming components. Advantages over traditional streaming libraries:
Concise API: Use simple commands like
for, (>->),await, andyieldBlazing fast: Implementation tuned for speed, including shortcut fusion
Lightweight Dependency: pipes is small and compiles very rapidly, including dependencies
Elegant semantics: Use practical category theory
ListT: Correct implementation of
ListTthat interconverts with pipesBidirectionality: Implement duplex channels
Measurement-related functionality extracted from Criterion, with minimal dependencies. The rationale for this is to enable alternative analysis front-ends.
This Haskell package provides an abstract interface to highly-parameterizable queues/deques.
Background: There exists a feature space for queues that extends between:
Simple, single-ended, non-concurrent, bounded queues
Double-ended, thread-safe, growable queues with important points in between (such as the queues used for work stealing).
This package includes an interface for Deques that allows the programmer to use a single API for all of the above, while using the type system to select an efficient implementation given the requirements (using type families).
This package also includes a simple reference implementation based on IORef and Data.Sequence.
This is a library for testing code involving bottoms or infinite values. For the underlying theory and a larger example involving use of QuickCheck, see the article "Chasing Bottoms A Case Study in Program Verification in the Presence of Partial and Infinite Values".
This Haskell package aims to reexport all the non-conflicting and most general definitions from the "base" package.
This includes APIs for applicatives, arrows, monoids, foldables, traversables, exceptions, generics, ST, MVars and STM.
This package will never have any dependencies other than "base".
Versioning policy:
The versioning policy of this package deviates from PVP in the sense that its exports in part are transitively determined by the version of "base". Therefore it's recommended for the users of ghc-base-prelude to specify the bounds of "base" as well.
This package contains the C sources of LPeg, as well as some tiny Haskell helper to load the package. . <http://www.inf.puc-rio.br/~roberto/lpeg/>
This Haskell package contains Template Haskell functions for generating functions similar to those in Data.List for tuples of statically known size.
Using the API Annotations available from GHC 7.10.2, this library provides a means to round-trip any code that can be compiled by GHC, currently excluding .lhs files.
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.
Word8 library to be used with Data.ByteString.
Find text patterns, replace the patterns, split on the patterns. Use Megaparsec monadic parsers instead of regular expressions for pattern matching.
This package provides a pure interface for compressing and decompressing LZMA streams of data represented as lazy ByteStrings. A monadic incremental interface is provided as well.
This library provides a framework for size-based enumerations.
Random shuffle implementation, on immutable lists. Based on perfect shuffle implementation by Oleg Kiselyov.
The HMatrix package provides a Haskell library for dealing with linear systems, matrix decompositions, and other numerical computations based on BLAS and LAPACK.
An implementation of the git-lfs protocol.
Pandoc is a Haskell library for converting from one markup format to another, and a command-line tool that uses this library. It can read and write Markdown and (subsets of) other formats, such as HTML, reStructuredText, LaTeX, DocBook, and many more.
Pandoc extends standard Markdown syntax with footnotes, embedded LaTeX, definition lists, tables, and other features. A compatibility mode is provided for those who need a drop-in replacement for Markdown.pl.
This Haskell package provides a validator that can validate an email address string against RFC 5322.
With this package you can build a Storable instance of a record type from Storable instances of its elements in an elegant way. It does not do any magic, just a bit arithmetic to compute the right offsets, that would be otherwise done manually or by a preprocessor like C2HS. There is no guarantee that the generated memory layout is compatible with that of a corresponding C struct. However, the module generates the smallest layout that is possible with respect to the alignment of the record elements.
This library provides parsers and printers for bencoded data. Bencode is the encoding used by the peer-to-peer file sharing system BitTorrent for storing and transmitting loosely structured data.
This library provides extra functions for the standard Haskell libraries. Most functions are simple additions, filling out missing functionality. A few functions are available in later versions of GHC, but this package makes them available back to GHC 7.2.
This package provides a library for parallel programming.