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.
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.
This package provides tests that can be used with any queue implementation that satisfies the `abstract-deque` interface.
This package lacks a description. Run "info '(guix) Synopses and Descriptions'" for more information.
This package exposes internal types and functions that can be used to extend Hspec's functionality.
Bindings for Atk, autogenerated by haskell-gi.
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.
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.
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@.
Bindings for HarfBuzz, autogenerated by haskell-gi.
C-structs lets you create correct C structs in Haskell. These can be used for FFI calls, import as well as exports. This package is part of the development efforts for the Python library Pythas. Pythas provides an interface to import Haskell modules. . Note: As of GHC 9.2 structs cannot be passed by value, only by reference.
Time, clocks and calendars.
Bindings for Graphene, autogenerated by haskell-gi.
This package provides functionality for manipulating @FilePath@ values, and is shipped with <https://www.haskell.org/ghc/ GHC>. It provides two variants for filepaths: . 1. legacy filepaths: @type FilePath = String@ . 2. operating system abstracted filepaths (@OsPath@): internally unpinned @ShortByteString@ (platform-dependent encoding) . It is recommended to use @OsPath@ when possible, because it is more correct. . For each variant there are three main modules: . * "System.FilePath.Posix" / "System.OsPath.Posix" manipulates POSIX\/Linux style @FilePath@ values (with @\/@ as the path separator). . * "System.FilePath.Windows" / "System.OsPath.Windows" manipulates Windows style @FilePath@ values (with either @\\@ or @\/@ as the path separator, and deals with drives). . * "System.FilePath" / "System.OsPath" for dealing with current platform-specific filepaths . For more powerful string manipulation of @OsPath@, you can use the <https://hackage.haskell.org/package/os-string os-string package> (@OsPath@ is a type synonym for @OsString@). . An introduction into the new API can be found in this <https://hasufell.github.io/posts/2022-06-29-fixing-haskell-filepaths.html blog post>. Code examples for the new API can be found <https://github.com/hasufell/filepath-examples here>.
Bindings for GLib, autogenerated by haskell-gi.
In many cases, it is useful (either for error checking or documentation reasons) to define input and output types as having a particular unit of time. In addition, by creating a type class defining type units, this library should make it easier to separate the units of time the developer wants to think in versus the units of time the library author wants to think in.
This package provides first class functional references in Van Laarhoven style supporting the following optics: . * Lenses (view, over) . * Traversals (toListOf, matching, over) . * Setters (over) . * Grates (zipWithOf, under, review) . * Resetters (under) . * Adapters (view, review) . * Grids (toListOf, over / under, review) . * Prisms (matching, over / under, review) . * Getters (view) . * Folders (toListOf) . * Reviewers (review).
Haskell bindings for libarchive. Provides the ability to unpack archives, including the ability to unpack archives lazily.
Parser and writer for handling sectioned config files in Haskell. . The ConfigFile module works with configuration files in a standard format that is easy for the user to edit, easy for the programmer to work with, yet remains powerful and flexible. It is inspired by, and compatible with, Python's ConfigParser module. It uses files that resemble Windows .INI-style files, but with numerous improvements. . ConfigFile provides simple calls to both read and write config files. It's possible to make a config file parsable by this module, the Unix shell, and make.
Bindings for Gsk, autogenerated by haskell-gi.
Bindings for GModule, autogenerated by haskell-gi.
This package lacks a description. Run "info '(guix) Synopses and Descriptions'" for more information.
Various useful functions on tuples, overloaded on tuple size.
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.