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 is a package somewhat like cdeps which scans .chs files for dependencies.
For upgrading to streamly-0.9.0+ please read the <https://github.com/composewell/streamly/blob/streamly-0.10.0/docs/User/Project/Upgrading-0.8-to-0.9.md Streamly-0.9.0 upgrade guide>. . Streamly is a standard library for Haskell that focuses on C-like performance, modular combinators, and streaming data flow model. Streamly consists of two packages: "streamly-core" and "streamly". <https://hackage.haskell.org/package/streamly-core streamly-core> provides basic features, and depends only on GHC boot libraries (see note below), while <https://hackage.haskell.org/package/streamly streamly> provides higher-level features like concurrency, time, lifted exceptions, and networking. For documentation, visit the <https://streamly.composewell.com Streamly website>. . The streamly-core package provides the following functionality: . * Streams as composable producers of a sequence of values. * Streams provide all the functionality provided by Haskell lists but in an effectful, streaming fashion with better performance. * Streams provide ListT and logic programming functionality as well. * Folds as composable stream consumers that reduce the streams to a single value or reduce segments of streams to transform the stream. * Parsers as more powerful, composable stream consumers supporting standard parser combinators with backtracking but in a streaming fashion. * Arrays with streaming interfaces providing high performance, modularity, and concise interface as all streaming operations can be performed on arrays. * Arrays can be immutable or mutable, unboxed or boxed, pinned or unpinned. * Arrays generalize the functionality provided by @bytestring@ and @text@ packages. * Interoperability with @bytestring@ and @text@ is provided via separate packages. * Arrays and folds provide natural builder functionality so there are no separate builder modules. * High performance binary serialization with configurable JSON like features. * Streaming combinators for unicode text processing, providing functionality equivalent to the @text@ package. * String interpolation for convenient construction of strings. * Streaming console IO (stdin/stdout) operations. * Streaming file and directory IO operations. . This package covers some or all of the functionality covered by @streaming, pipes, conduit, list-t, logic-t, foldl, attoparsec, array, primitive, vector, vector-algorithms, binary, cereal, store, bytestring, text, stringsearch, interpolate@. Streamly provides a consistent, concise, modular and performant interface for all this functionality. . Note: The dependencies "heaps" and "monad-control" are included in the package solely for backward compatibility, and will be removed in future versions.
Many recursive functions share the same structure, e.g. pattern-match on the input and, depending on the data constructor, either recur on a smaller input or terminate the recursion with the base case. Another one: start with a seed value, use it to produce the first element of an infinite list, and recur on a modified seed in order to produce the rest of the list. Such a structure is called a recursion scheme. Using higher-order functions to implement those recursion schemes makes your code clearer, faster, and safer. See README for details.
Tasty is a modern testing framework for Haskell. It lets you combine your unit tests, golden tests, QuickCheck/SmallCheck properties, and any other types of tests into a single test suite.
This package provides a pure interface for compressing and decompressing LZMA (Lempel–Ziv–Markov chain algorithm) streams of data represented as lazy ByteStrings. A monadic incremental interface is provided as well. This package relies on the liblzma C library.
This library contains glue code used to interconnect Haskell GI and Cairo
Unaligned access to primitive arrays. The offsets are given in bytes rather than elements.
Bindings for Pango, autogenerated by haskell-gi.
This library allows an application to extend the 'global state' hidden inside the IO monad with semi-arbitrary data. Data is required to be 'Typeable'. The library provides an essentially unbounded number of key-value stores indexed by strings, with each key within the stores also being a string.
This library provides an interface to portably work with byte arrays whose contents are known to be of a fixed endianness. There are two ways to use this module. See the `System.ByteOrder` module for more documentation.
Haskell bindings for libarchive. Provides the ability to unpack archives, including the ability to unpack archives lazily.
QuickCheck support for the Tasty test framework. .
Michael and Scott queues are described in their PODC 1996 paper: . <http://dl.acm.org/citation.cfm?id=248052.248106> . These are single-ended concurrent queues based on a singlly linked list and using atomic CAS instructions to swap the tail pointers. As a well-known efficient algorithm they became the basis for Java's @ConcurrentLinkedQueue@.
Haskell bindings for libarchive. Provides the ability to unpack archives, including the ability to unpack archives lazily.
Bindings for Gdk, autogenerated by haskell-gi.
Cairo is a library to render high quality vector graphics. There exist various backends that allows rendering to Gtk windows, PDF, PS, PNG and SVG documents, amongst others.
Bindings for HarfBuzz, autogenerated by haskell-gi.
This library implements the SHA suite of message digest functions, according to NIST FIPS 180-2 (with the SHA-224 addendum), as well as the SHA-based HMAC routines. The functions have been tested against most of the NIST and RFC test vectors for the various functions. While some attention has been paid to performance, these do not presently reach the speed of well-tuned libraries, like OpenSSL.
Dyre implements dynamic reconfiguration facilities after the style of Xmonad. Dyre aims to be as simple as possible without sacrificing features, and places an emphasis on simplicity of integration with an application. A full introduction with a complete example project can be found in the documentation for 'Config.Dyre'
This library provides common functions and values used for testing SMT-LIB backends, as provided by the smtlib-backends library.
Bindings for Libsoup 3.x, autogenerated by haskell-gi.
This is an industrial-strength monadic parser combinator library. Megaparsec is a feature-rich package that tries to find a nice balance between speed, flexibility, and quality of parse errors.
Control overloading support in haskell-gi generated bindings
Bindings for JavaScriptCore 6.x, autogenerated by haskell-gi.