This package provides a keyboard-driven divide-and-conquer mouse control mode for StumpWM.

This is futures implementation for Common Lisp. It plugs in nicely to cl-async.

cl-alexandria-plus is a conservative set of extensions to cl-alexandria utilities.

This library provides almost the same code as used inside Quicklisp for drawning progress bars

This package provides some condition classes, functions and macros which may be useful when building slightly complex systems.

cl-quicklisp-stats is a system that fetches and performs basic operations on the Quicklisp download statistics.

This package provides Doug Hoyte's "Production" version of macros from the Let Over Lambda book, including community updates.

The main purpose of this n+2nd reimplementation of quasiquote is enable matching of quasiquoted patterns, using Optima or Trivia.

DEFPACKAGE-PLUS is an extensible DEFPACKAGE variant with predictable cross-platform behavior and some utilities useful for versioning.

This library is a portable socket interface that allows CL programs to open connected (client) stream sockets to network services.

with-user-abort is a Common Lisp portability library providing a like-named macro that catches the SIGINT signal.

This is a small OS portability library to retrieve and set file attributes not supported by the Common Lisp standard functions.

trivial-garbage provides a portable API to finalizers, weak hash-tables and weak pointers on all major implementations of the Common Lisp programming language.

This library is an SDL wrapper as part of an umbrella project that provides cross-platform packages for building large, interactive applications in Common Lisp.

This package provides Common Lisp bindings to POSIX message queue, an IPC method that is easy to use and quick to setup.

This library allows you to implement and enforce proper finalization of compile-time constructs while building Lisp source files.

It produces two systems: asdf-finalizers and list-of.

This package provides a JSON Pointer (RFC6901) implementation for Common Lisp. This libary aims to be independent from any JSON libraries (as much as possible).

This Common Lisp library interprets escape characters the same way that most other programming language do. It provides four readtables. The default one lets you write strings like this: #"This string has a newline in it!".

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.

This library provides a uniform API, as specified in Common Lisp the Language 2, for accessing information about variable and function bindings from implementation-defined lexical environment objects. All major Common Lisp implementations are supported, even those which don't support the CLTL2 environment access API.

This project is intended as a catchall for small, general-purpose extensions to Common Lisp. It contains:

• new-let, a macro that combines and generalizes let, let* and multiple-value-bind,

• gmap, an iteration macro that generalizes map.

Agnostic Lizard is a portable implementation of a code walker and in particular of the macroexpand-all function (and macro) that makes a best effort to be correct while not expecting much beyond what the Common Lisp standard requires.

It aims to be implementation-agnostic and to climb the syntax trees.

The py-configparser package implements the ConfigParser Python module functionality in Common Lisp. In short, it implements reading and writing of .INI-file style configuration files with sections containing key/value pairs of configuration options. In line with the functionalities in the python module, does this package implement basic interpolation of option values in other options.

Hypergeometrica is a Common Lisp library for performing high-precision arithmetic, with a focus on performance. At the heart of it all are routines for multiplication. Hypergeometrica aims to support:

• In-core multiplication using various algorithms, from schoolbook to floating-point FFTs.

• In-core multiplication for large numbers using exact convolutions via number-theoretic transforms, which is enabled by 64-bit modular arithmetic.

• Out-of-core multiplication using derivatives of the original Cooley–Tukey algorithm.

On top of multiplication, one can build checkpointed algorithms for computing various classical constants, like \pi.