This package provides an implementation of SRFI 146 for Guile. SRFI 146 defines datastructures that implement mappings (finite sets of associations consisting of a key and a value). Two types of mappings are defined: One using a comparator to define an order on the keys and another using a hash function on the keys. The datastructures and procedures are by default purely-functional. This package re-uses the SRFI sample implementation that is based on red-black trees and Hash Array Mapped Trie (HAMT).

This package provides functions to generate Guix manifests interactively. It works by scanning an alist of package categories, to ask the user which package sets would they like to install from it.

This is an R6RS Scheme library that provides a reader with some extra features not found in the standard read procedure such as a compatible mode with support for other RnRS standards and a tolerant mode that continues on errors.

Procedures in this SRFI are drawn primarily from SRFI 69 and R6RS. In addition, the following sources are acknowledged:

• hash-table-mutable? procedure and the second argument of hash-table-copy (which allows the creation of immutable hash tables) are from R6RS, renamed in the style of this SRFI.

• hash-table-intern! procedure is from Racket, renamed in the style of this SRFI.

• hash-table-find procedure is a modified version of table-search in Gambit.

• procedures hash-table-unfold and hash-table-count were suggested by SRFI 1.

• procedures hash-table=? and hash-table-map were suggested by Haskell's Data.Map.Strict module.

• procedure hash-table-map->list is from Guile.

The procedures hash-table-empty?, hash-table-empty-copy, hash-table-pop!, hash-table-map!, hash-table-intersection!, hash-table-difference!, and hash-table-xor! were added for convenience and completeness.

Guile-XOSD provides Guile bindings for libxosd, the X On Screen Display library.

Fibers is a Guile library that implements a a lightweight concurrency facility, inspired by systems like Concurrent ML, Go, and Erlang. A fiber is like a "goroutine" from the Go language: a lightweight thread-like abstraction. Systems built with Fibers can scale up to millions of concurrent fibers, tens of thousands of concurrent socket connections, and many parallel cores. The Fibers library also provides Concurrent ML-like channels for communication between fibers.

Note that Fibers makes use of some Guile 2.1/2.2-specific features and is not available for Guile 2.0.

This package contains helper functions for working with file system locations.

guile-dbi is a library for Guile that provides a convenient interface to SQL databases. This package implements the interface for MySQL.

This package provides bindings for Newt, a programming library for color text mode, widget based user interfaces. The bindings are written in pure Scheme by using Guile’s foreign function interface.

bewaking provides functionalities to (double) encrypt and decrypt data, aided by a custom obfuscation algorithm.

It also provides a DSL to be used for Authorization and Authentication for your Guile Scheme projects with a simple user permission system.

Data is protected through multiple layers of cryptography techniques and obfuscation tricks, producing secure files and tokens one can use.

Guile-DSV is a GNU Guile module for working with the delimiter-separated values (DSV) data format. Guile-DSV supports the Unix-style DSV format and RFC 4180 style format. Also Guile-DSV includes a console program named dsv that allows to view and process DSV data, including such operations as delimiter change, conversion from one DSV standard to another and printing the data as pseudographics tables.

This package provides purely functional data structures written in R6RS Scheme and compiled for Guile. It has been tested with Racket, Guile 2, Vicare Scheme and IronScheme. Right now it contains:

• queues

• deques

• bbtrees

• sets

• dlists

• priority search queues (PSQs)

• finger trees

• sequences

• heaps

• hash array mapped tries (HAMTs).

GNU Mcron is a complete replacement for Vixie cron. It is used to run tasks on a schedule, such as every hour or every Monday. Mcron is written in Guile, so its configuration can be written in Scheme; the original cron format is also supported.

guile-custom-port overrides Guile's port modules to bring the custom ports from Guile 3.10 to previous versions.

GNU 8sync (pronounced "eight-sync") is an asynchronous programming library for GNU Guile based on the actor model.

guile-ncurses provides Guile language bindings for the ncurses library.

Guile-Lib is intended as an accumulation place for pure-scheme Guile modules, allowing for people to cooperate integrating their generic Guile modules into a coherent library. Think "a down-scaled, limited-scope CPAN for Guile". It provides the following modules:

• (apicheck) Describe and verify library programming interfaces.

• (config load) Loading configuration files.

• (container async-queue) A thread-safe message queue.

• (container nodal-tree) A tree consisting of nodes with attributes.

• (container delay-tree) A nodal tree with lazily evaluated fields.

• (debugging assert) Helpful assert macro.

• (debugging time) A simple macro to time the execution of an expression.

• (graph topological-sort) Routines to perform topological sorts.

• (htmlprag) Neil Van Dyke's permissive ("pragmatic") HTML parser.

• (io string) SLIB's IO routines dealing with strings.

• (logging logger) A flexible logging system.

• (logging port-log) A logger that outputs to a port.

• (logging rotating-log) A logger that rotates its output files.

• (match-bind) Nifty and concise regular expression routines.

• (math minima) A golden-section minimum finder.

• (math primes) Functions related to prime numbers and factorization.

• (os process) Spawning processes and capturing their output.

• (scheme documentation) Macros to define different kinds of variables with documentation.

• (scheme kwargs) Defining functions with flexible keyword arguments.

• (search basic) Classic search functions.

• (string completion) Building blocks for tab completion.

• (string soundex) The SOUNDEX string categorization algorithm.

• (string transform) Beyond SRFI-13.

• (string wrap) A versatile string formatter.

• (term ansi-color) Generate ANSI color escape sequences.

• (unit-test) A JUnit-style unit testing framework.

This Guile library provides instrumentation code intended to be used with the Prometheus time series service. Counter, gauge and histogram metric types are supported.

This package provides a functional parser combinator library that supports backtracking and a small logical framework. The idea is to build up chunks that are memoized and there is no clear scanner/parser separation, chunks can be expressions as well as simple tokens.

This SRFI defines two disjoint immutable container types known as Maybe and Either, both of which can contain objects collectively known as their payload. A Maybe object is either a Just object or the unique object Nothing (which has no payload); an Either object is either a Right object or a Left object. Maybe represents the concept of optional values; Either represents the concept of values which are either correct (Right) or errors (Left).

This package provides bindings for GNU Parted library, a C library allowing disk partition tables creation and manipulation. The bindings are written in pure Scheme by using Guile's foreign function interface.

G-Golf port of (a subset of) the upstream gtk4-demo examples in the gtk:bin Guix package output. Run guix edit g-golf-gtk-4-examples for inspiration how to wrap G-Golf applications when writing a Guix package.

This package implements RFC 9562 UUIDs, and can generate versions 1 and 3-8 from that specification. It also provides parsing for UUIDs in standard hex-and-dash format of any variant and version. Conversion between binary and hex-and-dash string UUIDs is also included.

This SRFI contains various procedures that accept and return procedures, as well as a few others, drawn from an earlier version of Chicken. Common Lisp has a few of them too, and more come from the Standard Prelude from Programming Praxis. Using these procedures helps to keep code terse and reduce the need for ad hoc lambdas.