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 package provides tools to parse Haskell sources to the template-haskell abstract syntax.
Utilities to package up Haskell functions and values into a Lua module. . This package is part of HsLua, a Haskell framework built around the embeddable scripting language <https://lua.org Lua>.
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 introduces a type for paths upholding useful invariants.
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 provides a plugin that allows you to set breakpoints for debugging purposes. See the [README](https://github.com/aaronallen8455/breakpoint#breakpoint) for details.
This library provides some useful tools from the C standard library.
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.
Haskell library for both generating and consuming project templates.
ost IDEs provide the concept of a project template: instead of writing all of the code for a project from scratch, you select a template, answer a few questions, and a bunch of files are automatically generated.
project-template tries to provide a canonical Haskell library for implementing the ideal templating system.
This package provides semigroups for Haskell. In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative binary operation. A semigroup generalizes a monoid in that there might not exist an identity element. It also (originally) generalized a group (a monoid with all inverses) to a type where every element did not have to have an inverse, thus the name semigroup.
This Haskell package contains code for generating high quality random numbers that follow either a uniform or normal distribution. The generated numbers are suitable for use in statistical applications.
The uniform PRNG uses Marsaglia's MWC256 (also known as MWC8222) multiply-with-carry generator, which has a period of 2^8222 and fares well in tests of randomness. It is also extremely fast, between 2 and 3 times faster than the Mersenne Twister.
This is library provides utility to use Netlink from Haskell. The scope of this package extends over general Netlink support to specific implementations of Netlink families.
This Haskell package provides a family of type-safe templates with simple variable interpolation. Shakespeare templates can be used inline with a quasi-quoter or in an external file and it interpolates variables according to the type being inserted.
SmallCheck is a testing library that verifies properties for all test cases up to some depth. The test cases are generated automatically by SmallCheck.
This package provides a library implementing the XDG Base Directory spec.
Provides a small set of helper functions for testing Megaparsec parsers with Hspec.
This library provides adjunctions and representable functors for Haskell.
LeanCheck support for test-framework. This package can be used to incorporate LeanCheck tests into test-framework test suites.
This Haskell library offers (among other things) the following selection of synchronisation primitives:
Broadcast: Wake multiple threads by broadcasting a value.Event: Wake multiple threads by signalling an event.Lock: Enforce exclusive access to a resource. Also known as a binary semaphore or mutex. The package additionally provides an alternative that works in the STM monad.RLock: A lock which can be acquired multiple times by the same thread. Also known as a reentrant mutex.ReadWriteLock: Multiple-reader, single-writer locks. Used to protect shared resources which may be concurrently read, but only sequentially written.ReadWriteVar: Concurrent read, sequential write variables.
Please consult the API documentation of the individual modules for more detailed information.
This package was inspired by the concurrency libraries of Java and Python.
This library provides core modules of a markup combinator library for Haskell.
This is a modified version of wl-pprint, which was based on Wadler's paper "A Prettier Printer". This version allows the library user to annotate the text with semantic information, which can later be rendered in a variety of ways.
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 provides the tldr command and a Haskell client library allowing users to update and view tldr pages from a shell. The tldr pages are a community effort to simplify the man pages with practical examples.
This package provides a pretty printing class similar to Show, based on the HughesPJ pretty printing library. It provides the pretty printing class and instances for the Prelude types.