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.
The premise of basic-prelude is that there are a lot of very commonly desired features missing from the standard Prelude, such as commonly used operators (<$> and >=>, for instance) and imports for common datatypes (e.g., ByteString and Vector). At the same time, there are lots of other components which are more debatable, such as providing polymorphic versions of common functions.
So basic-prelude is intended to give a common foundation for a number of alternate preludes. The package provides two modules: CorePrelude provides the common ground for other preludes to build on top of, while BasicPrelude exports CorePrelude together with commonly used list functions to provide a drop-in replacement for the standard Prelude.
Users wishing to have an improved Prelude can use BasicPrelude. Developers wishing to create a new prelude should use CorePrelude.
This library provides some useful tools from the C standard library.
This library provides instances of Binary for the types defined in the vector package, making it easy to serialize vectors to and from disk. We use the generic interface to vectors, so all vector types are supported. Specific instances are provided for unboxed, boxed and storable vectors.
This library provides a type for specifying Optional function arguments.
This package provides a basic random number generation library, including the ability to split random number generators.
This package provides a means of generating tag files for Emacs and Vim.
This package provides the number parsers without the need to use a large (and unportable) token parser.
The Union/Find algorithm implements these operations in (effectively) constant-time:
Check whether two elements are in the same equivalence class.
Create a union of two equivalence classes.
Look up the descriptor of the equivalence class.
This package provides a plugin that allows you to set breakpoints for debugging purposes. See the [README](https://github.com/aaronallen8455/breakpoint#breakpoint) for details.
This package provides an URI manipulation interface. In network-2.6 the Network.URI module was split off from the network package into this package.
This library provides an efficient implementation of Int-indexed arrays (both mutable and immutable), with a powerful loop optimisation framework.
This package provides a type-safe tool for generating XML code via quasi-quoting built on top of ghc-shakespeare.
This package provides a small, efficient, and portable regex library for Perl 5 compatible regular expressions. The PCRE library is a set of functions that implement regular expression pattern matching using the same syntax and semantics as Perl 5.
Provides a small set of helper functions for testing Megaparsec parsers with Hspec.
This package enables users to expand type synonyms in Template Haskell abstract syntax trees (ASTs).
This package provides Haskell bindings to SDL2_mixer.
An implementation of the git-lfs protocol.
This package provides Haskell bindings to your system's native wcwidth and a command line tool to examine the widths assigned by it. The command line tool can compile a width table to Haskell code that assigns widths to the Char type.
This package provides a monad transformer version of the ST monad for strict state threads.
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.
ResourceT is a monad transformer which creates a region of code where you can safely allocate resources.
This library provides an interface to GSL special functions for Haskell.
This package introduces a type for paths upholding useful invariants.
A PointedList tracks the position in a non-empty list which works similarly to a zipper. A current item is always required, and therefore the list may never be empty. A circular PointedList wraps around to the other end when progressing past the actual edge.