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.
Happy is a parser generator for Haskell. Given a grammar specification in BNF, Happy generates Haskell code to parse the grammar. Happy works in a similar way to the yacc tool for C.
This package provides a simple text templating system used by pandoc.
Utilities for dealing with IEEE floating point numbers, ported from the Tango math library; approximate and exact equality comparisons for general types.
This Haskell package lets you automatically generate lenses for data types; code was extracted from the lens package, and therefore generated lenses are fully compatible with ones generated by lens (and can be used both from lens and microlens).
This package addresses the 'configuration problem' which is propagating configurations that are available at run-time, allowing multiple configurations to coexist without resorting to mutable global variables or System.IO.Unsafe.unsafePerformIO.
This library provides functions available in later versions of base to a wider range of compilers, without requiring you to use CPP pragmas in your code. This package provides the same API as the base-compat library, but depends on compatibility packages (such as semigroups) to offer a wider support window than base-compat, which has no dependencies.
This is a pretty printing library based on Wadler's paper "A Prettier Printer". It has been enhanced with support for ANSI terminal colored output using the ansi-terminal package.
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.
Please see the README and documentation at <https://www.stackage.org/package/githash>
This package defines orphan instances that mimic instances available in later versions of base to a wider (older) range of compilers.
The ListLike module provides a common interface to the various Haskell types that are list-like. Predefined interfaces include standard Haskell lists, Arrays, ByteStrings, and lazy ByteStrings. Custom types can easily be made ListLike instances as well.
ListLike also provides for String-like types, such as String and ByteString, for types that support input and output, and for types that can handle infinite lists.
This library implements a technique to catch all exceptions raised within an enclosed computation, while remaining responsive to (external) asynchronous exceptions.
This package provides a functional library for creating efficient memo functions using tries.
This package provides a monad transformer version of the ST monad for strict state threads.
This library provides the Data.Primitive.Addr module that was a part of the primitive library before primitive-0.7.0.0.
The mockery package provides support functions for automated testing.
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 Haskell package offers a collection of channel types, similar to Control.Concurrent.STM.{TChan,TQueue} but with additional features.
Annotations are useful for coloring. This is a limited version of wl-pprint-extras without support for point effects and without the free monad. Like in annotated-wl-pprint, only annotations are supported. Compared to annotated-wl-pprint this library provides a slightly modernized interface.
This library provides a pure Haskell implementation of the Unicode Collation Algorithm described at http://www.unicode.org/reports/tr10/. It is not as fully-featured or as performant as text-icu, but it avoids a dependency on a large C library. Locale-specific tailorings are also provided.
This package provides a version of ghc-hspec-expectations generalized to MonadIO.
This haskell library provides validity and validity-based testing for ghc-hspec.
Contravariant functors for Haskell.
This package provides a fast, reliable priority queue implementation based on a binomial heap.