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 library defines an existential type Some'. . @ data Some f where \ Some :: f a -> Some f @ . in few variants, and utilities to work with it. . If you are unsure which variant to use, use the one in "Data.Some" module.
This Haskell library provides a purely functional interface for statistics based on hmatrix and GSL.
This package provides ordered containers of intervals, with efficient search for all keys containing a point or overlapping an interval. See the example code on the home page for a quick introduction.
Parse jira wiki text into an abstract syntax tree for easy transformation to other formats.
This library provides higher order versions of Prelude classes to ease programming with polymorphic recursion and reduce UndecidableInstances.
For examples and an introduction to the library please take a look at the <https://github.com/CRogers/should-not-typecheck#should-not-typecheck- README> on github.
This Haskell package supports the definition of generic functions. Datatypes are viewed in a uniform, structured way: the choice between constructors is represented using an n-ary sum, and the arguments of each constructor are represented using an n-ary product.
* @Boring@ types are isomorphic to @()@. . * @Absurd@ types are isomorphic to @Void@. . See [What does () mean in Haskell -answer by Conor McBride](https://stackoverflow.com/questions/33112439/what-does-mean-in-haskell/33115522#33115522)
This library provides Pure Haskell solver routines for use by the diagrams framework. It currently includes routines for finding real roots of low-degree (n < 5) polynomials, and solving tridiagonal and cyclic tridiagonal linear systems.
This Haskell package provides some useful control operators for looping.
This Haskell package provides extras for the ghc-contravariant package.
This Haskell package provides a validator that can validate an email address string against RFC 5322.
Various tasty helpers and utilities to test HsLua oparations. Built on top of tasty-hunit.
This library provides the POSIX regex backend used by the Haskell library regex-base.
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 package provides an implementation of n-ary sums and n-ary products. The module Data.SOP is the main module of this library and contains more detailed documentation. The main use case of this package is to serve as the core of generics-sop.
This library provides some useful extensions for ghc-commonmark to parser core commonmark syntax: smart quotes, definition lists, tables, footnotes, math, and more.
A cross-platform library with functions for adjusting code pages on Windows. On all other operating systems, the library does nothing.
This library implements the GHC API. It is like the compiler-provided ghc package, but it can be loaded on many compiler versions.
This package provides Data.Scientific, which provides the number type Scientific. Scientific numbers are arbitrary precision and space efficient. They are represented using scientific notation.
This Haskell library contains type definitions for Universally Unique Identifiers or UUIDs, and basic conversion functions.
A UTF8 layer for Strings. The utf8-string package provides operations for encoding UTF8 strings to Word8 lists and back, and for reading and writing UTF8 without truncation.
This package is a Haskell library for the representation, parsing, and pretty-printing of GLSL 1.50 code.
Rose (n-ary) trees with both upwards- (i.e. cached) and downwards-traveling (i.e. accumulating) monoidal annotations. This is used as the core data structure underlying the diagrams framework, but potentially has other applications as well.