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 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 library provides a datatype which can be interpreted by apply-refact. It exists as a separate library so that applications can specify refactorings without depending on GHC.
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 a custom prelude with no dependencies apart from the base package.
Foundation has the following goals:
provide a base like sets of modules that provide a consistent set of features and bugfixes across multiple versions of GHC (unlike base).
provide a better and more efficient prelude than base's prelude.
be self-sufficient: no external dependencies apart from base;
provide better data-types: packed unicode string by default, arrays;
Numerical classes that better represent mathematical things (no more all-in-one
Num);I/O system with less lazy IO.
This package provides Haskell bindings to the X11 graphics library. The bindings are a direct translation of the C bindings.
This is a library for testing code involving bottoms or infinite values. For the underlying theory and a larger example involving use of QuickCheck, see the article "Chasing Bottoms A Case Study in Program Verification in the Presence of Partial and Infinite Values".
This package provides a simple compatibility shim that lets you work with both binary and cereal with one chunk of serialization code.
Lightweight pure data validation based on Applicative and Selective functors.
This package attempts to provide support for using Amazon Web Services like S3 (storage), SQS (queuing) and others to Haskell programmers. The ultimate goal is to support all Amazon Web Services.
This package provides the following modules: Math.NumberTheory.Logarithms and Math.NumberTheory.Powers.Integer from the arithmoi package, GHC.Integer.Logarithms.Compat and Math.NumberTheory.Power.Natural, as well as some additional functions in migrated modules.
This package provides functionality for generalising the deriving mechanism in Haskell to arbitrary classes.
This package provides a Conduit interface for the LZMA compression algorithm used in the .xz file format.
The YAML 1.2 format provides a much richer data-model and feature-set than the JavaScript Object Notation format. However, sometimes it's desirable to ignore the extra capabilities and treat YAML as if it was merely a more convenient markup format for humans to write JSON data. To this end this module provides a compatibility layer atop ghc-hsyaml ,which allows decoding YAML documents in the more limited JSON data-model while also providing convenience by reusing ghc-aeson's FromJSON instances for decoding the YAML data into native Haskell data types.
The conduit package itself maintains relative small dependencies. The purpose of this package is to collect commonly used utility functions wrapping other library dependencies, without depending on heavier-weight dependencies. The basic idea is that this package should only depend on haskell-platform packages and conduit.
This library provides a wrapper to the Linux kernel's inotify feature, allowing applications to subscribe to notifications when a file is accessed or modified.
This package provides a basic random number generation library, including the ability to split random number generators.
This package provides a monad transformer version of the ST monad for strict state threads.
This Haskell package provides interfaces and helper functions for the ghc-persistent package.
Alex is a tool for generating lexical analysers in Haskell. It takes a description of tokens based on regular expressions and generates a Haskell module containing code for scanning text efficiently. It is similar to the tool lex or flex for C/C++.
This package defines orphan instances that mimic instances available in later versions of base to a wider (older) range of compilers.
Convenience functions and TH for working with constraints. See README.md for example usage.
This is a Haskell library for writing CGI programs.
This package provides a modular backend for rendering diagrams created with the diagrams embedded domain-specific language (EDSL) to Scalable Vector Graphics (SVG) files.
This package provides instances for QuickCheck's \"Arbitrary\" typeclass.