Table of Contents

1. The Library System

1.1 Feature
1.2 Require
1.3 Library Catalogs
1.4 Catalog Creation
1.5 Catalog Vicinities
1.6 Compiling Scheme

1.6.1 Module Conventions
1.6.2 Module Manifests
1.6.3 Module Semantics
1.6.4 Top-level Variable References
1.6.5 Module Analysis

2. Universal SLIB Procedures

2.1 Vicinity
2.2 Configuration
2.3 Input/Output
2.4 System
2.5 Miscellany

2.5.1 Mutual Exclusion
2.5.2 Legacy

3. Scheme Syntax Extension Packages

3.1 Defmacro

3.1.1 Defmacroexpand

3.2 R4RS Macros
3.3 Macro by Example

3.3.1 Caveat

3.4 Macros That Work

3.4.1 Definitions
3.4.2 Restrictions

3.5 Syntactic Closures

3.5.1 Syntactic Closure Macro Facility

3.5.1.1 Terminology
3.5.1.2 Transformer Definition
3.5.1.3 Identifiers
3.5.1.4 Acknowledgements

3.6 Syntax-Case Macros

3.6.1 Notes
3.6.2 Note from SLIB maintainer

3.7 Fluid-Let
3.8 Yasos

3.8.1 Terms
3.8.2 Interface
3.8.3 Setters
3.8.4 Examples

4. Textual Conversion Packages

4.1 Precedence Parsing

4.1.1 Precedence Parsing Overview
4.1.2 Rule Types
4.1.3 Ruleset Definition and Use
4.1.4 Token definition
4.1.5 Nud and Led Definition
4.1.6 Grammar Rule Definition

4.2 Format (version 3.0)
4.3 Standard Formatted I/O

4.3.1 stdio
4.3.2 Standard Formatted Output

4.3.2.1 Exact Conversions
4.3.2.2 Inexact Conversions
4.3.2.3 Other Conversions

4.3.3 Standard Formatted Input

4.4 Program and Arguments

4.4.1 Getopt
4.4.2 Getopt---
4.4.3 Command Line
4.4.4 Parameter lists
4.4.5 Getopt Parameter lists
4.4.6 Filenames
4.4.7 Batch

4.5 HTML
4.6 HTML Forms
4.7 HTML Tables

4.7.1 HTML editing tables
4.7.2 HTML databases

4.8 HTTP and CGI
4.9 Parsing HTML
4.10 URI
4.11 Printing Scheme

4.11.1 Generic-Write
4.11.2 Object-To-String
4.11.3 Pretty-Print

4.12 Time and Date

4.12.1 Time Zone
4.12.2 Posix Time
4.12.3 Common-Lisp Time

4.13 NCBI-DNA
4.14 Schmooz

5. Mathematical Packages

5.1 Bit-Twiddling

5.1.1 Bitwise Operations
5.1.2 Bit Within Word
5.1.3 Fields of Bits
5.1.4 Bit order and Lamination
5.1.5 Gray code

5.2 Modular Arithmetic
5.3 Prime Numbers
5.4 Random Numbers

5.4.1 Exact Random Numbers
5.4.2 Inexact Random Numbers

5.5 Fast Fourier Transform
5.6 Cyclic Checksum
5.7 Graphing

5.7.1 Character Plotting
5.7.2 PostScript Graphing

5.7.2.1 Column Ranges
5.7.2.2 Drawing the Graph
5.7.2.3 Graphics Context
5.7.2.4 Rectangles
5.7.2.5 Legending
5.7.2.6 Legacy Plotting
5.7.2.7 Example Graph

5.8 Solid Modeling
5.9 Color

5.9.1 Color Data-Type

5.9.1.1 External Representation
5.9.1.2 White

5.9.2 Color Spaces
5.9.3 Spectra
5.9.4 Color Difference Metrics
5.9.5 Color Conversions
5.9.6 Color Names
5.9.7 Daylight

5.10 Root Finding
5.11 Minimizing
5.12 Commutative Rings
5.13 Rules and Rulesets
5.14 How to Create a Commutative Ring
5.15 Matrix Algebra

6. Database Packages

6.1 Relational Database

6.1.1 Using Databases
6.1.2 Table Operations

6.1.2.1 Single Row Operations
6.1.2.2 Match-Keys
6.1.2.3 Multi-Row Operations
6.1.2.4 Indexed Sequential Access Methods
6.1.2.5 Sequential Index Operations
6.1.2.6 Table Administration

6.1.3 Database Interpolation
6.1.4 Embedded Commands

6.1.4.1 Database Extension
6.1.4.2 Command Intrinsics
6.1.4.3 Define-tables Example
6.1.4.4 The *commands* Table
6.1.4.5 Command Service
6.1.4.6 Command Example

6.1.5 Database Macros

6.1.5.1 Within-database Example

6.1.6 Database Browser

6.2 Relational Infrastructure

6.2.1 Base Table

6.2.1.1 The Base
6.2.1.2 Base Tables
6.2.1.3 Base Field Types
6.2.1.4 Composite Keys
6.2.1.5 Base Record Operations
6.2.1.6 Match Keys
6.2.1.7 Aggregate Base Operations
6.2.1.8 Base ISAM Operations

6.2.2 Catalog Representation
6.2.3 Relational Database Objects
6.2.4 Database Operations

6.3 Weight-Balanced Trees

6.3.1 Construction of Weight-Balanced Trees
6.3.2 Basic Operations on Weight-Balanced Trees
6.3.3 Advanced Operations on Weight-Balanced Trees
6.3.4 Indexing Operations on Weight-Balanced Trees

7. Other Packages

7.1 Data Structures

7.1.1 Arrays
7.1.2 Subarrays
7.1.3 Array Mapping
7.1.4 Association Lists
7.1.5 Byte
7.1.6 Byte/Number Conversions
7.1.7 MAT-File Format
7.1.8 Portable Image Files
7.1.9 Collections
7.1.10 Dynamic Data Type
7.1.11 Hash Tables
7.1.12 Macroless Object System
7.1.13 Concepts
7.1.14 Procedures
7.1.15 Examples

7.1.15.1 Inverter Documentation
7.1.15.2 Number Documention
7.1.15.3 Inverter code

7.1.16 Priority Queues
7.1.17 Queues
7.1.18 Records

7.2 Sorting and Searching

7.2.1 Common List Functions

7.2.1.1 List construction
7.2.1.2 Lists as sets
7.2.1.3 Lists as sequences
7.2.1.4 Destructive list operations
7.2.1.5 Non-List functions

7.2.2 Tree operations
7.2.3 Chapter Ordering
7.2.4 Sorting
7.2.5 Topological Sort
7.2.6 Hashing
7.2.7 Space-Filling Curves

7.2.7.1 Peano-Hilbert Space-Filling Curve
7.2.7.2 Sierpinski Curve

7.2.8 Soundex
7.2.9 String Search
7.2.10 Sequence Comparison

7.3 Procedures

7.3.1 Type Coercion
7.3.2 String-Case
7.3.3 String Ports
7.3.4 Line I/O
7.3.5 Multi-Processing
7.3.6 Metric Units

7.3.6.1 SI Prefixes
7.3.6.2 Binary Prefixes
7.3.6.3 Unit Symbols

7.4 Standards Support

7.4.1 RnRS
7.4.2 With-File
7.4.3 Transcripts
7.4.4 Rev2 Procedures
7.4.5 Rev4 Optional Procedures
7.4.6 Multi-argument / and -
7.4.7 Multi-argument Apply
7.4.8 Rationalize
7.4.9 Promises
7.4.10 Dynamic-Wind
7.4.11 Eval
7.4.12 Values
7.4.13 SRFI

7.4.13.1 SRFI-1
7.4.13.2 SRFI-2
7.4.13.3 SRFI-8
7.4.13.4 SRFI-9

7.5 Session Support

7.5.1 Repl
7.5.2 Quick Print
7.5.3 Debug
7.5.4 Breakpoints
7.5.5 Tracing

7.6 System Interface

7.6.1 Directories
7.6.2 Transactions
7.6.3 CVS

7.7 Extra-SLIB Packages

8. About SLIB

8.1 Installation

8.1.1 Unpacking the SLIB Distribution
8.1.2 Configure Scheme Implementation to Locate SLIB
8.1.3 Loading SLIB Initialization File
8.1.4 Build New SLIB Catalog for Implementation
8.1.5 Implementation-specific Instructions

8.2 Porting
8.3 Coding Guidelines

8.3.1 Modifications

8.4 Copyrights

8.4.1 Putting code into the Public Domain
8.4.2 Explicit copying terms
8.4.3 Example: Company Copyright Disclaimer

8.5 About this manual

Procedure and Macro Index
Variable Index
Concept and Feature Index