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 implements a language similar to YAML or JSON but with fewer special cases and fewer dependencies. It emphasizes layout structure for sections and lists, and requires quotes around strings.
This package provides a Storable instance for pairs and triples which should be binary compatible with C99 and C++. The only purpose of this package is to provide a standard location for this instance so that other packages needing this instance can play nicely together.
This package provides Haskell library for matching files using patterns such as \"src\/**\/*.png\" for all @file.png files recursively under the @filesrc directory.
Some of its features include:
All matching is O(n).
Most functions pre-compute some information given only one argument.
Uses
matchandsubstituteto extract suitable strings from the*and**matches, and substitutes them back into other patterns.Uses
stepandmatchManyto perform bulk matching of many patterns against many paths simultaneously.Uses
System.FilePattern.Directoryto perform optimised directory traverals using patterns.
This Haskell library provides utilities creating, comparing, parsing and printing Universally Unique Identifiers or UUIDs.
A clean and powerful stream processing library that lets you build and connect reusable streaming components. Advantages over traditional streaming libraries:
Concise API: Use simple commands like
for, (>->),await, andyieldBlazing fast: Implementation tuned for speed, including shortcut fusion
Lightweight Dependency: pipes is small and compiles very rapidly, including dependencies
Elegant semantics: Use practical category theory
ListT: Correct implementation of
ListTthat interconverts with pipesBidirectionality: Implement duplex channels
This module allows tokens produced by skylighting-core to be rendered as HTML.
Cross platform library for file creation, modification, and deletion notification. This library builds upon existing libraries for platform specific Windows, Mac, and Linux file system event notification.
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
Lifted-base exports IO operations from the base library lifted to any instance of MonadBase or MonadBaseControl. Note that not all modules from base are converted yet. The package includes a copy of the monad-peel test suite written by Anders Kaseorg.
This package allows simple reflection of expressions containing variables. Reflection here means that a Haskell expression is turned into a string. The primary aim of this package is teaching and understanding; there are no options for manipulating the reflected expressions beyond showing them.
This library provides functions for use in parsing indentation sensitive contexts. It parses blocks of lines all indented to the same level as well as lines continued at an indented level below.
Random shuffle implementation, on immutable lists. Based on perfect shuffle implementation by Oleg Kiselyov.
The conduit package is a solution to the streaming data problem, allowing for production, transformation, and consumption of streams of data in constant memory. It is an alternative to lazy I/O which guarantees deterministic resource handling, and fits in the same general solution space as enumerator/iteratee and pipes.
Runtime exceptions - as exposed in base by the Control.Exception module - have long been an intimidating part of the Haskell ecosystem. This package is intended to overcome this. It provides a safe and simple API on top of the existing exception handling machinery. The API is equivalent to the underlying implementation in terms of power but encourages best practices to minimize the chances of getting the exception handling wrong.
Manipulate identifiers and structurally non-complex pieces of text by delimiting word boundaries via a combination of whitespace, control-characters, and case-sensitivity.
Has support for common idioms like casing of programmatic variable names, taking, dropping, and splitting by word, and modifying the first character of a piece of text.
Caution: this library makes heavy use of the text library's internal loop optimisation framework. Since internal modules are not guaranteed to have a stable API there is potential for build breakage when the text dependency is upgraded. Consider yourself warned!
This package backports the Control.Monad.Except module from mtl (if using mtl-2.2.0.1 or earlier), which reexports the ExceptT monad transformer and the MonadError class.
This package should only be used if there is a need to use the Control.Monad.Except module specifically. If you just want the mtl class instances for ExceptT, use transformers-compat instead, since mtl-compat does nothing but reexport the instances from that package.
Note that unlike how mtl-2.2 or later works, the Control.Monad.Except module defined in this package exports all of ExceptT's monad class instances. Therefore, you may have to declare import Control.Monad.Except () at the top of your file to get all of the ExceptT instances in scope.
This library provides functions to read, write and manipulate MIDI, WAVE and SoundFont2 multimedia files. It is written entirely in Haskell (without any FFI). It uses efficient parsing and building combinators for binary data stored in ByteStrings (based on the one in binary package).
This package provides a Pure Haskell implementation of the SplitMix pseudorandom number generator. SplitMix is a "splittable" pseudorandom number generator that is quite fast: 9 64-bit arithmetic/logical operations per 64 bits generated. SplitMix is tested with two standard statistical test suites (DieHarder and TestU01, this implementation only using the former) and it appears to be adequate for "everyday" use, such as Monte Carlo algorithms and randomized data structures where speed is important. In particular, it should not be used for cryptographic or security applications, because generated sequences of pseudorandom values are too predictable (the mixing functions are easily inverted, and two successive outputs suffice to reconstruct the internal state).
This library provides finger trees, a general sequence representation with arbitrary annotations, for use as a base for implementations of various collection types. It includes examples, as described in section 4 of Ralf Hinze and Ross Paterson, "Finger trees: a simple general-purpose data structure".
This package provides extensible exceptions for both new and old versions of GHC (i.e., < 6.10).
Expose Haskell objects to Lua with an object oriented interface.
The doctest program checks examples in source code comments. It is modeled after doctest for Python, see the Doctest website.
This package enables integration of terminal screen state in html pages.
Compatibility layer for Data.Array.Byte providing boxed wrappers for ByteArray and MutableByteArray and relevant instances for GHC < 9.4.