Mito is yet another object relational mapper, and it aims to be a successor of Integral.
Support MySQL, PostgreSQL and SQLite3.
Add id (serial/uuid primary key), created_at and updated_at by default like Ruby's ActiveRecord.
Migrations.
Database schema versioning.
Clip is an attempt at a templating library that allows you to write templates in a way that is both accessible to direct webdesign and flexible. The main idea is to incorporate transformation commands into an HTML file through tags and attributes. Clip is heavily dependent on Plump and lQuery.
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 web framework for building GUI applications. CLOG can take the place, or work along side, most cross platform GUI frameworks and website frameworks. The CLOG package starts up the connectivity to the browser or other websocket client (often a browser embedded in a native template application).
FSet is a functional set-theoretic collections library for Common Lisp. Functional means that all update operations return a new collection rather than modifying an existing one in place. Set-theoretic means that collections may be nested arbitrarily with no additional programmer effort; for instance, sets may contain sets, maps may be keyed by sets, etc.
This is a utility library providing access to the mmap family of functions in a portable way. It allows you to directly map a file into the address space of your process without having to manually read it into memory sequentially. Typically this is much more efficient for files that are larger than a few Kb.
The LIsp Framework for Testing (LIFT) is a unit and system test tool for LISP. Though inspired by SUnit and JUnit, it's built with Lisp in mind. In LIFT, testcases are organized into hierarchical testsuites each of which can have its own fixture. When run, a testcase can succeed, fail, or error. LIFT supports randomized testing, benchmarking, profiling, and reporting.
FXML is a secure-by-default, error-recovering XML parser and serializer. It is a fork of CXML.
You should use FXML instead of CXML if:
You are parsing potentially ill-formed XML.
You are parsing potentially malicious XML.
You need to use Klacks with namespaces.
FXML’s API is very close to CXML's, and for the most part you can refer to the CXML documentation for usage.
CEPL (Code Evaluate Play Loop ) is a lispy and REPL-friendly Common Lisp library for working with OpenGL.
Its definition of success is making the user feel that GPU programming has always been part of the languages standard.
The usual approach to using CEPL is to start it at the beginning of your Lisp session and leave it open for the duration of your work. You can then treat the window it creates as just another output for your graphics, analogous to how *standard-output*
is treated for text.
The GNU Scientific Library for Lisp (GSLL) allows the use of the GNU Scientific Library (GSL) from Common Lisp. This library provides a full range of common mathematical operations useful to scientific and engineering applications. The design of the GSLL interface is such that access to most of the GSL library is possible in a Lisp-natural way; the intent is that the user not be hampered by the restrictions of the C language in which GSL has been written. GSLL thus provides interactive use of GSL for getting quick answers, even for someone not intending to program in Lisp.
FLOW is a flowchart graph library. Unlike other graphing libraries, this one focuses on nodes in a graph having distinct ports
through which connections to other nodes are formed. This helps in many concrete scenarios where it is important to distinguish not only which nodes are connected, but also how they are connected to each other.
Particularly, a lot of data flow and exchange problems can be reduced to such a flowchart
. For example, an audio processing library may present its pipeline as a flowchart of segments that communicate with each other through audio sample buffers. Flow gives a convenient view onto this kind of problem, and even allows the generic visualisation of graphs in this format.
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.
This Common Lisp package provides a regular expression engine.
CLAWK is an AWK implementation embedded into Common Lisp.
My Way is a Sinatra-compatible URL routing library.
This package provides a KDL reader/writer for Common Lisp.
PARSE is a simple token parsing library for Common Lisp.
Flute is an easily composable HTML5 generation library in Common Lisp.
This package provides a Common Lisp Twitter client featuring full API coverage.
This package is a Python Numpy clone implemented in pure Common Lisp.
This package provides the Common Lisp part of the emacs-slite test runner.
This package provides an implementation of the which
UNIX command in Common Lisp.
This library is an implementation of the XML Path Language (XPath) Version 1.0.
This package implements binary trees of various kinds, presenting a uniform interface to them all.