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.
CF is a Common Lisp library for doing computations using continued fractions.
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.
Simplified-Types is a library that provides functions for simplifying Common Lisp type specifiers. The API consists of two functions:
simplify-typetakes a type specifier and, optionally, an environment, and returns the corresponding simplified type.simplified-type-oftakes an object and returns the simplified type of that object.
CL-PUNCH is a Scala-like anonymous lambda literal.
MGL-GPR is a library of evolutionary algorithms such as Genetic Programming (evolving typed expressions from a set of operators and constants) and Differential Evolution.
(X)HTMLambda is yet another (X)HTML library which emphasizes programmability and user-friendliness. Each (X)HTML element is a structured object and pretty-printing of (X)HTML trees is well defined to provide properly indented human-readable output even for complex recursive arrangements.
cl-change-case is a library to convert strings between camelCase, PascalCase, snake_case, param-case, CONSTANT_CASE and more.
This package provides supports for unicode normalization, RFC8264 and RFC7564.
EXTERNAL-PROGRAM enables running programs outside the Lisp process. It is an attempt to make the RUN-PROGRAM functionality in implementations like SBCL and CCL as portable as possible without sacrificing much in the way of power.
Schemeish implements several useful Scheme constructs for Common Lisp. These include named-let, define, scheme argument lists, and a shortcut to FUNCALL with [] instead of ().
Montezuma is a text search engine library for Lisp based on the Ferret library for Ruby, which is itself based on the Lucene library for Java.
CL-DISKSPACE is a Common Lisp library to list disks with the command line tool df and get disk space information using statvfs.
EASY-ROUTES is yet another routes handling system on top of Hunchentoot. It's just glue code for Restas routing subsystem (CL-ROUTES).
It supports:
dispatch based on HTTP method
arguments extraction from the url path
decorators
URL generation from route names
This package provides EASY-ROUTES, EASY-ROUTES+DJULA and EASY-ROUTES+ERRORS systems.
My Way is a Sinatra-compatible URL routing library.
Optima is a fast pattern matching library which uses optimizing techniques widely used in the functional programming world.
This package exports the following function to parse floating-point values from a string in Common Lisp.
This package provides a configuration library that adds the ability for Lem to manage packages within the user configuration directory.
This library is a universal interface to the operating system package manager. It has extensive support for Guix, among others:
package listing and searching;
package installation and uninstallation;
package file listing;
profile listing;
manifest listing and installation;
generation listing, switching and deletion.
This package provides a Common Lisp system which wraps the BORDEAUX-THREADS system to be able to run things in the main thread of the implementation, for example drawing calls of GUI applications.
This package provides a general-purpose connection pooling library for Common Lisp.
This is a bindings library to libout123 which allows easy cross-platform audio playback.
40ants-plantuml provides a wrapper around the PlantUML jar library.
This library is a collection of pseudo random number generators.
While Common Lisp does provide a RANDOM function, it does not allow the user to pass an explicit SEED, nor to portably exchange the random state between implementations. This can be a headache in cases like games, where a controlled seeding process can be very useful.
For both curiosity and convenience, this library offers multiple algorithms to generate random numbers, as well as a bunch of generally useful methods to produce desired ranges.
Trivial-Benchmark runs a block of code many times and outputs some statistical data for it. On SBCL this includes the data from time, for all other implementations just the real-time and run-time data. However, you can extend the system by adding your own metrics to it, or even by adding additional statistical computeations.