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.
A clone of wl-pprint for use with the text library.
The doctest program checks examples in source code comments. It is modeled after doctest for Python (<https://docs.python.org/3/library/doctest.html>). . Documentation is at <https://github.com/martijnbastiaan/doctest-parallel#readme>.
This package provides pure-Haskell utilities for dealing with XML with the conduit package.
This package provides a new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means. . See original paper: "Computing extremely accurate quantiles using t-digest" by Ted Dunning and Otmar Ertl for more details <https://github.com/tdunning/t-digest/blob/07b8f2ca2be8d0a9f04df2feadad5ddc1bb73c88/docs/t-digest-paper/histo.pdf>.
This package provides optimized functions to determine the edit distances for fuzzy matching, including Levenshtein and restricted Damerau-Levenshtein algorithms.
This package (formerly binary-serialise-cbor) provides an efficient implementation of the Concise Binary Object Representation (CBOR), as specified by RFC 7049 at https://tools.ietf.org/html/rfc7049.
If you are looking for a library for serialisation of Haskell values, have a look at the https://hackage.haskell.org/package/serialise package, which is built upon this library.
An implementation of the standard bijection between CBOR and JSON is provided by the https://hackage.haskell.org/package/cborg-json package.
Also see https://hackage.haskell.org/package/cbor-tool for a convenient command-line utility for working with CBOR data.
Provides an efficient Haskell implementation of Peano numbers
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.
An integration library for hspec and hedgehog.
This package provides a minimal host for SDL2-based Reflex applications.
Utilities to parse, print, diff, and analyse data in CoNLL-U, a format used in linguistics to represent the syntactic annotation of sentences. See https://universaldependencies.org/format.html
This package defines a Language.Haskell.TH.Syntax.Compat module, which backports the Quote and Code types to work across a wide range of template-haskell versions. On recent versions of template-haskell (2.17.0.0 or later), this module simply re-exports Quote and Code from Language.Haskell.TH.Syntax.
This package contains the generics system described in the /Scrap Your Boilerplate/ papers (see the website). It defines the Data class of types permitting folding and unfolding of constructor applications, instances of this class for primitive types, and a variety of traversals.
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 package provides a Haskell library for globbing: matching patterns against file paths.
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.
This package provides a simple applicative parser in Parsec style.
MissingH is a library of all sorts of utility functions for Haskell programmers. It is written in pure Haskell and thus should be extremely portable and easy to use.
This package provides orphan instances for Template Haskell datatypes. In particular, instances for Ord and Lift, as well as a few missing Show and Eq instances. These instances used to live in the haskell-src-meta package, and that's where the version number started.
__This package is deprecated__. Please, use genByteString from the [random package (version >=1.2)](https://hackage.haskell.org/package/random) instead. . Efficient generation of random bytestrings. The implementation populates uninitialized memory with uniformily distributed random 64 bit words (and 8 bit words for remaining bytes at the end of the bytestring). . Random words are generated using the PRNG from the [mwc-random](https://hackage.haskell.org/package/mwc-random) package or the [pcg-random](https://hackage.haskell.org/package/pcg-random) package. It is also possible to use a custom PRNG by providing an instance for the RandomWords type class and using the function generate from the module "Data.ByteString.Random.Internal". . The generated byte strings are suitable for statistical applications. They are /not/ suitable for cryptographic applications. .  . 
This package enables integration of terminal screen state in html pages.
Skylighting is a syntax highlighting library with support for over one hundred languages. It derives its tokenizers from XML syntax definitions used by KDE's KSyntaxHighlighting framework, so any syntax supported by that framework can be added. An optional command-line program is provided. Skylighting is intended to be the successor to highlighting-kate.
inline-c lets you seamlessly call C libraries and embed high-performance inline C code in Haskell modules. Haskell and C can be freely intermixed in the same source file, and data passed to and from code in either language with minimal overhead. No FFI required.
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.