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 search send a patch to ~whereiseveryone/toys@lists.sr.ht adding your channel as an entry in channels.scm.
This is a Common Lisp library for simplifying packaging and loading of compiled foreign library collection.
This package provides a stream based JSON parser/writer, well suited as building block for higher level libraries.
This is a small library to help you with managing the Common Lisp docstrings for your library.
This package provides a SuperCollider client for Common Lisp.
This lisp library handles physical quantities which consist of
value / magnitude
uncertainty / error
unit
where the type of the value can be any subtype of real. For the uncertainty, both absolute and relative values are possible. Combinations of lisp symbols or strings are used to describe units. User defined units including abbreviations and prefixes are supported. Error propagation and unit checking is performed for all defined operations.
A utility for running external programs, built on UIOP. Cmd is designed to be natural to use, protect against shell interpolation and be usable from multi-threaded programs.
lparallel is a library for parallel programming in Common Lisp, featuring:
a simple model of task submission with receiving queue,
constructs for expressing fine-grained parallelism,
asynchronous condition handling across thread boundaries,
parallel versions of map, reduce, sort, remove, and many others,
promises, futures, and delayed evaluation constructs,
computation trees for parallelizing interconnected tasks,
bounded and unbounded FIFO queues,
high and low priority tasks,
task killing by category,
integrated timeouts.
Calispel is a Common Lisp library for thread-safe message-passing channels, in the style of the occam programming language, also known as communicating sequential processes (CSP). See https://en.wikipedia.org/wiki/Communicating_sequential_processes.
Calispel channels let one thread communicate with another, facilitating unidirectional communication of any Lisp object. Channels may be unbuffered, where a sender waits for a receiver (or vice versa) before either operation can continue, or channels may be buffered with flexible policy options.
Because sending and receiving on a channel may block, either operation can time out after a specified amount of time.
A syntax for alternation is provided (like ALT in occam, or Unix select()): given a sequence of operations, any or all of which may block, alternation selects the first operation that doesn't block and executes associated code. Alternation can also time out, executing an "otherwise" clause if no operation becomes available within a set amount of time.
Calispel is a message-passing library, and as such leaves the role of threading abstractions and utilities left to be filled by complementary libraries such as Bordeaux-Threads and Eager Future.
This library provides a modern project skeleton generator. In contract with other generators, CL-Project generates one package per file and encourages unit testing by generating a system for unit testing, so you can begin writing unit tests as soon as the project is generated.
On Cliki.net <http://www.cliki.net/Common%20Lisp%20Utilities>, there is a collection of Common Lisp Utilities, things that everybody writes since they're not part of the official standard. There are some very useful things there; the only problems are that they aren't implemented as well as you'd like (some aren't implemented at all) and they aren't conveniently packaged and maintained. It takes quite a bit of work to carefully implement utilities for common use, commented and documented, with error checking placed everywhere some dumb user might make a mistake.
This package parses and prints dates in RFC-1123 format.
This library is a fork of SSL-CMUCL. The original SSL-CMUCL source code was written by Eric Marsden and includes contributions by Jochen Schmidt. Development into CL+SSL was done by David Lichteblau.
Manual translation from C to Common Lisp of some random number generation functions from the GSL library.
This package provides a Common Lisp system CHLOROPHYLL which implements an ANSI escape code functionality.
This library provides payment API wrappers over BTCPay, Paypal, and Stripe.
This is a Common Lisp implementation for the Mustache template system. More details on the standard are available at https://mustache.github.io.
MAGICFFI is a Common Lisp CFFI interface to libmagic(3), the file type determination library using magic numbers.
This package makes it possible to name classes by lists of symbols instead of symbols.
cl-charms is an interface to libcurses in Common Lisp. It provides both a raw, low-level interface to libcurses via CFFI, and a more higher-level lispier interface.
This package provides the terminal-size:size function to get the size of the terminal from Common Lisp.
This is a Common Lisp library providing lambda shorthand macros aiming to be used in cases where the word lambda and the arguments are longer than the body of the lambda.
This library provides a wrapper type for secret values, to reduce the risk of accidentally revealing them.
Command-Line-Args provides a main macro (command) that wraps a defun form and creates a new function that parses the command line arguments. It has support for command-line options, positional, and variadic arguments. It also generates a basic help message. The interface is meant to be easy and non-intrusive.
The purpose of this library is to provide a collection of implementations of trees.
In contrast to existing libraries such as cl-containers, it does not impose a particular use for the trees. Instead, it aims for a stratified design, allowing client code to choose between different levels of abstraction.
As a consequence of this policy, low-level interfaces are provided where the concrete representation is exposed, but also high level interfaces where the trees can be used as search trees or as trees that represent sequences of objects.