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 Common Lisp bindings to the pango text layout library.
This is a purely math-related utility kit, providing functions which can be useful for games, 3D, and GL in general.
THE-COST-OF-NOTHING is a library for measuring the run time of Common Lisp code. It provides macros and functions for accurate benchmarking and lightweight monitoring. Furthermore, it provides predefined benchmarks to determine the cost of certain actions on a given platform and implementation.
Trivia is a pattern matching compiler that is compatible with Optima, another pattern matching library for Common Lisp. It is meant to be faster and more extensible than Optima.
A JSON Object Signing and Encryption (JOSE) implementation for Common Lisp.
This is a Common Lisp library to handle the IBM PC version of the IXF (Integration Exchange Format) file format.
This library implements the let+ macro, which is a dectructuring extension of let*. It features:
Clean, consistent syntax and small implementation (less than 300 LOC, not counting tests)
Placeholder macros allow editor hints and syntax highlighting
&ignfor ignored values (in forms where that makes sense)Very easy to extend
This package provides a library for parsing MIME types, in the spirit of http://code.google.com/p/mimeparse/, with a Common Lisp flavor.
RTG-MATH provides a selection of the math routines most commonly needed for making realtime graphics in Lisp.
This library allows you to define custom indentation hints for your macros if the one recognised by SLIME automatically produces unwanted results.
HTML-TEMPLATE is a Common Lisp library which can be used to fill templates with arbitrary (string) values at runtime. The result does not have to be HTML.
It is loosely modeled after the Perl module HTML::Template and partially compatible with a its syntax, though both libraries contain some extensions that the other does not support.
HTML-TEMPLATE translates templates into efficient closures which can be re-used as often as needed. It uses a cache mechanism so you can update templates while your program is running and have the changes take effect immediately.
Nodgui (No Drama GUI) is a Common Lisp binding for the Tk GUI toolkit. It also provides a few additional widgets more than the standard Tk ones.
This package is a Python Numpy clone implemented in pure Common Lisp.
One of the many things that didn't quite get into the Common Lisp standard was how to get a Lisp to output its call stack when something has gone wrong. As such, each Lisp has developed its own notion of what to display, how to display it, and what sort of arguments can be used to customize it. trivial-backtrace is a simple solution to generating a backtrace portably.
This is a small Common Lisp library that finds an open port within a range.
This is a system implementing an advanced dialogue system that is capable of complex dialogue flow including choice trees and conditional branching. Speechless was first developed for the "Kandria" (https://kandria.com) game, and has since been separated and made public in the hopes that it may find use elsewhere or inspire other developers to build similar systems.
Speechless is based on the "Markless" (https://shirakumo.github.io/markless) document standard for its syntax and makes use of Markless' ability to be extended to add additional constructs useful for dialogue systems.
Speechless can compile dialogue from its base textual form into an efficient instruction set, which is then executed when the game is run. Execution of the dialogue is completely engine-agnostic, and only requires some simple integration with a client protocol to run.
Thanks to Markless' extensibility, Speechless can also be further extended to include additional syntax and constructs that may be useful for your particular game.
This data structure can be used to store the history of visited paths or URLs with a file or web browser, in a way that no “forward” element is ever forgotten.
The history tree is “global” in the sense that multiple owners (e.g. tabs) can have overlapping histories. On top of that, an owner can spawn another one, starting from one of its nodes (typically when you open a URL in a new tab).
core-gp is a Common Lisp library for genetic programming (GP) algorithms. It allows standard GP, strongly-typed GP, grammatical evolution as well as standard genetic algorithms.
Simple library to create temporary directories.
This Common Lisp library implements object prevalence (see https://en.wikipedia.org/wiki/System_prevalence). It allows for (de)serializing to and from s-exps as well as XML. Serialization of arbitrary classes and cyclic data structures are supported.
This Common Lisp library focuses on the small set of basic color manipulations (lightening, compliments, etc.) you might use to generate a color palette for a GUI or web page.
Periods is a Common Lisp library providing a set of utilities for manipulating times, distances between times, and both contiguous and discontiguous ranges of time.
This library implements special functions and has a focus on high accuracy double-float calculations using the latest algorithms.
In Common Lisp, a special variable that is never dynamically bound typically serves as a stand-in for a global variable. The global-vars library provides true global variables that are implemented by some compilers. An attempt to rebind a global variable properly results in a compiler error. That is, a global variable cannot be dynamically bound.
Global variables therefore allow us to communicate an intended usage that differs from special variables. Global variables are also more efficient than special variables, especially in the presence of threads.