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 provides a standard interface to the various package lock implementations of Common Lisp.
This package provides a standard way to canonicalize slot values.
repl-utilities is a set of utilities which ease life at the REPL. It includes three sorts of features: introspective procedures, miscellaneous utility functions, and, pulling them together, methods to conveniently keep these symbols and optionally additional symbols available in whichever package you switch to.
GARBAGE-POOLS is Common Lisp re-implementation of the APR Pools for resource management.
This package provides a noise library for Common Lisp.
This package provides a Common Lisp system implementing event bus.
concurrent-hash-tables is a Common Lisp portability library wrapping some implementations of concurrent hash tables which do not have to be entirely locked in their operation, including 42nd-at-threadmill, luckless, and a fallback, segmented hash table.
Datafly is a lightweight database library for 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 is a packrat parser for Common Lisp. In addition to regular Packrat / Parsing Grammar / TDPL features ESRAP supports:
dynamic redefinition of nonterminals
inline grammars
semantic predicates
introspective facilities (describing grammars, tracing, setting breaks)
left-recursive grammars
functions as terminals
accurate, customizable parse error reports
This is a Common Lisp library to handle the IBM PC version of the IXF (Integration Exchange Format) file format.
This is a Common Lisp library to build and compose SXQL queries dynamically.
cl-strings is a small, portable, dependency-free set of utilities that make it even easier to manipulate text in Common Lisp. It has 100% test coverage and works at least on sbcl, ecl, ccl, abcl and clisp.
LTK is a Common Lisp binding for the Tk graphics toolkit. It is written in pure Common Lisp and does not require any Tk knowledge for its usage.
bubble-operator-upwards is a function that bubbles an operator upwards in a form, demultiplexing all alternative branches by way of cartesian product.
Supertrace provides a superior Common Lisp trace functionality for debugging and profiling real world applications.
HTTP-Body parses HTTP POST data and returns POST parameters. It supports application/x-www-form-urlencoded, application/json, and multipart/form-data.
This library provides almost the same code as used inside Quicklisp for drawning progress bars
This package provides a JSON-RPC 2.0 server/client for Common Lisp.
ORG-SAMPLER allows using Lisp docstrings and reflection to make org-mode text for inclusion into a larger document.
Screamer is an extension of Common Lisp that adds support for nondeterministic programming. Screamer consists of two levels. The basic nondeterministic level adds support for backtracking and undoable side effects. On top of this nondeterministic substrate, Screamer provides a comprehensive constraint programming language in which one can formulate and solve mixed systems of numeric and symbolic constraints. Together, these two levels augment Common Lisp with practically all of the functionality of both Prolog and constraint logic programming languages such as CHiP and CLP(R). Furthermore, Screamer is fully integrated with Common Lisp. Screamer programs can coexist and interoperate with other extensions to as CLIM and Iterate.
Funds provides portable, purely functional data structures in Common Lisp. It includes tree based implementations for Array, Hash, Queue, Stack, and Heap.
STMX is a high-performance implementation of composable Transactional Memory, which is a concurrency control mechanism aimed at making concurrent programming easier to write and understand. Instead of traditional lock-based programming, one programs with atomic memory transactions, which can be composed together to make larger atomic memory transactions.
A memory transaction gets committed if it returns normally, while it gets rolled back if it signals an error (and the error is propagated to the caller).
Finally, memory transactions can safely run in parallel in different threads, are re-executed from the beginning in case of conflicts or if consistent reads cannot be guaranteed, and their effects are not visible from other threads until they commit.
Memory transactions give freedom from deadlocks, are immune to thread-safety bugs and race conditions, provide automatic roll-back on failure, and aim at resolving the tension between granularity and concurrency.
Quicksearch is a search-engine-interface for Common Lisp. The goal of Quicksearch is to find the Common Lisp library quickly. For example, if you will find the library about json, just type (qs:? 'json) at REPL.
The function quicksearch searches for Common Lisp projects in Quicklisp, Cliki, GitHub and BitBucket, then outputs results in REPL. The function ? is abbreviation wrapper for quicksearch.