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.
CL-random-forest is an implementation of Random Forest for multiclass classification and univariate regression written in Common Lisp. It also includes an implementation of Global Refinement of Random Forest.
This system implements binding threading macros -- a kind of threading macros with different semantics than classical, Clojure core threading macros or their extension, swiss-arrows. Two Common Lisp implementations of those are arrows and arrow-macros.
This system is a fork of arrows with changes in semantics that make it impossible to merge back upstream.
CL-FAST-ECS is a Common Lisp library providing an implementation of the ECS pattern, primarily focused on speed and interactive development.
ECS is an architectural data-oriented design pattern that allows for the effective processing of a large number of in-game objects while keeping the code and data separated. This provides flexibility in the way that game objects are built at runtime.
Arrow-macros provides clojure-like arrow macros (ex. ->, ->>) and diamond wands in swiss-arrows.
This is a Common Lisp version of UglifyJS, a JavaScript compressor. It works on data produced by parse-js to generate a minified version of the code. Currently it can:
reduce variable names (usually to single letters)
join consecutive
varstatementsresolve simple binary expressions
group most consecutive statements using the
sequenceoperator (comma)remove unnecessary blocks
convert
IFexpressions in various ways that result in smaller coderemove some unreachable code
This package defines a simple extensible protocol for computing a guess using advisors.
A common lisp library that provides extensible function result caching based on arguments (an expanded form of memoization).
The variates package provides portable random number generation as well as numerous distributions.
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.
cl-flamegraph is a wrapper around SBCL's statistical profiler. It saves stack traces of profiled code in a form suitable for processing by the flamegraph.pl script, which is available in the Guix package flamegraph.
40ants-plantuml provides a wrapper around the PlantUML jar library.
Common Lisp comes with quite some functions to compare objects for equality, yet none is applicable in every situation and in general this is hard, as equality of objects depends on the semantics of operations on them. As consequence, users find themselves regularly in a situation where they have to roll their own specialized equality test.
This module provides one of many possible equivalence relations between standard Common Lisp objects. However, it can be extended for new objects through a simple CLOS protocol. The rules when two objects are considered equivalent distinguish between mutating and frozen objects. A frozen object is promised not to be mutated in the future in a way that operations on it can notice the difference.
We have chosen to compare mutating objects only for identity (pointer equality), to avoid various problems. Equivalence for frozen objects on the other hand is established by recursing on the objects' constituent parts and checking their equivalence. Hence, two objects are equivalent under the OBJECT= relation, if they are either identical, or if they are frozen and structurally equivalent, i.e. their constituents are point-wise equivalent.
Since many objects are potentially mutable, but are not necessarily mutated from a certain point in their life time on, it is possible to promise to the equivalence relation that they remain frozen for the rest of their life time, thus enabling coarser equivalence than the often too fine-grained pointer equality.
This package provides a Common Lisp Twitter client featuring full API coverage.
Trivial-features ensures that *FEATURES* is consistent across multiple Common Lisp implementations.
Hunchentoot is a web server written in Common Lisp and at the same time a toolkit for building dynamic websites. As a stand-alone web server, Hunchentoot is capable of HTTP/1.1 chunking (both directions), persistent connections (keep-alive), and SSL.
MAP-BIND is a macro that allows visual grouping of variables with their corresponding values in calls to mapping operators when using an inline LAMBDA.
This is a Common Lisp bindings library to libfond, a simple OpenGL text rendering engine.
This library extends LOG4CL system in a few ways:
* It helps with configuration of multiple appenders and layouts. * Has a facility to catch context fields and to log them. * Has a macro to log unhandled errors. * Adds a layout to write messages as JSON, which is useful for production as makes easier to parse and process such logs. * Uses the appenders which are not disabled in case of some error which again, should be useful for production.
This is a string/octets parser library for Common Lisp with speed and readability in mind. Unlike other libraries, the code is not a pattern-matching-like, but a char-by-char procedural parser.
An implementation of the exponential backoff algorithm in Common Lisp. Inspired by the implementation found in Chromium. Read the header file to learn about each of the parameters.
This package provides a configuration library that adds the ability for Lem to manage packages within the user configuration directory.
This package provides a grab bag of miscellaneous Common Lisp utilities.
It's very basic implementation of channels and queue for Common Lisp.
This package provides a JSON Pointer (RFC6901) implementation for Common Lisp. This library aims to be independent from any JSON libraries (as much as possible).