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 Haskell package provides compatibility layer for ghc-aeson.
FoldMap lists are lists represented by their foldMap function. FoldMap lists have O(1) cons, snoc and append, just like DLists, but other operations might have favorable performance characteristics as well. These wild claims are still completely unverified though.
Manipulate identifiers and structurally non-complex pieces of text by delimiting word boundaries via a combination of whitespace, control-characters, and case-sensitivity.
Has support for common idioms like casing of programmatic variable names, taking, dropping, and splitting by word, and modifying the first character of a piece of text.
Caution: this library makes heavy use of the text library's internal loop optimisation framework. Since internal modules are not guaranteed to have a stable API there is potential for build breakage when the text dependency is upgraded. Consider yourself warned!
This library provides free monads, which are useful for many tree-like structures and domain specific languages. If f is a Functor then the free Monad on f is the type of trees whose nodes are labeled with the constructors of f. The word "free" is used in the sense of "unrestricted" rather than "zero-cost": Free f makes no constraining assumptions beyond those given by f and the definition of Monad.
This package provides a string interpolation library for Haskell.
Regex-tdfa is a pure Haskell regular expression library implementing POSIX extended regular expressions. It is a "tagged" DFA regex engine. It is inspired by libtre.
Shelly provides convenient systems programming in Haskell, similar in spirit to POSIX shells. Shelly is originally forked from the Shellish package.
This Haskell library provides utilities creating, comparing, parsing and printing Universally Unique Identifiers or UUIDs.
This package implements selective applicative functors, which allow you to declare your effects statically, and select which to execute dynamically. See the paper on selective functors for more details.
MissingH is a library of all sorts of utility functions for Haskell programmers. It is written in pure Haskell and thus should be extremely portable and easy to use.
LeanCheck is a simple enumerative property-based testing library. Properties are defined as Haskell functions returning a boolean value which should be true for all possible choices of argument values. LeanCheck applies enumerated argument values to these properties in search for a counterexample. Properties can be viewed as parameterized unit tests. LeanCheck works by producing tiers of test values: a possibly infinite list of finite sublists of same-and-increasingly-sized values.
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.
Efficient hashing-based container types. The containers have been optimized for performance critical use, both in terms of large data quantities and high speed.
This package defines a class, Hashable, for types that can be converted to a hash value. This class exists for the benefit of hashing-based data structures. The package provides instances for basic types and a way to combine hash values.
The mockery package provides support functions for automated testing.
C->Haskell assists in the development of Haskell bindings to C libraries. It extracts interface information from C header files and generates Haskell code with foreign imports and marshaling. Unlike writing foreign imports by hand (or using hsc2hs), this ensures that C functions are imported with the correct Haskell types.
ANSI terminal backend for the prettyprinter package.
This package implements the bijection between JSON and CBOR defined in the CBOR specification, RFC 7049.
This package provides a new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means. . See original paper: "Computing extremely accurate quantiles using t-digest" by Ted Dunning and Otmar Ertl for more details <https://github.com/tdunning/t-digest/blob/07b8f2ca2be8d0a9f04df2feadad5ddc1bb73c88/docs/t-digest-paper/histo.pdf>.
This package provides the Network.Multicast Haskell module for sending UDP datagrams over multicast (class D) addresses.
A package for convenient access to high-resolution clock and timer functions of different operating systems via a unified API.
This library provides the POSIX regex backend used by the Haskell library regex-base.
This library contains simple and easy-to-use primitives for I/O using streams.
This package provides Haskell bindings to the setlocale C function.