[Top] | [Contents] | [Index] | [ ? ] |
-- The Detailed Node Listing ---
Introduction
Scope, Purpose, and History
1.1.1 Scope and Purpose 1.1.2 History
Definitions
1.4.1 Notational Conventions 1.4.2 Error Terminology 1.4.3 Sections Not Formally Part Of This Standard 1.4.4 Interpreting Dictionary Entries
Notational Conventions
Interpreting Dictionary Entries
Conformance
1.5.1 Conforming Implementations 1.5.2 Conforming Programs
Conforming Implementations
Conforming Programs
1.5.2.1 Use of Implementation-Defined Language Features 1.5.2.2 Use of Read-Time Conditionals
Deprecated Language Features
1.8.1 Deprecated Functions 1.8.2 Deprecated Argument Conventions 1.8.3 Deprecated Variables 1.8.4 Deprecated Reader Syntax
Syntax
2.1 Character Syntax 2.2 Reader Algorithm 2.3 Interpretation of Tokens 2.4 Standard Macro Characters
Character Syntax
2.1.1 Readtables 2.1.2 Variables that affect the Lisp Reader 2.1.3 Standard Characters 2.1.4 Character Syntax Types
Readtables
2.1.1.1 The Current Readtable 2.1.1.2 The Standard Readtable 2.1.1.3 The Initial Readtable
Character Syntax Types
Interpretation of Tokens
2.3.1 Numbers as Tokens 2.3.2 Constructing Numbers from Tokens 2.3.3 The Consing Dot 2.3.4 Symbols as Tokens 2.3.5 Valid Patterns for Tokens 2.3.6 Package System Consistency Rules
Numbers as Tokens
2.3.1.1 Potential Numbers as Tokens 2.3.1.2 Escape Characters and Potential Numbers 2.3.1.3 Examples of Potential Numbers
Constructing Numbers from Tokens
2.3.2.1 Syntax of a Rational 2.3.2.2 Syntax of an Integer 2.3.2.3 Syntax of a Ratio 2.3.2.4 Syntax of a Float 2.3.2.5 Syntax of a Complex
Standard Macro Characters
2.4.1 Left-Parenthesis 2.4.2 Right-Parenthesis 2.4.3 Single-Quote 2.4.4 Semicolon 2.4.5 Double-Quote 2.4.6 Backquote 2.4.7 Comma 2.4.8 Sharpsign 2.4.9 Re-Reading Abbreviated Expressions
Single-Quote
2.4.3.1 Examples of Single-Quote
Semicolon
Backquote
2.4.6.1 Notes about Backquote
Sharpsign
Evaluation and Compilation
Evaluation
3.1.1 Introduction to Environments 3.1.2 The Evaluation Model 3.1.3 Lambda Expressions 3.1.4 Closures and Lexical Binding 3.1.5 Shadowing 3.1.6 Extent 3.1.7 Return Values
Introduction to Environments
3.1.1.1 The Global Environment 3.1.1.2 Dynamic Environments 3.1.1.3 Lexical Environments 3.1.1.4 The Null Lexical Environment 3.1.1.5 Environment Objects
The Evaluation Model
Compilation
3.2.1 Compiler Terminology 3.2.2 Compilation Semantics 3.2.3 File Compilation 3.2.4 Literal Objects in Compiled Files 3.2.5 Exceptional Situations in the Compiler
Compilation Semantics
File Compilation
3.2.3.1 Processing of Top Level Forms 3.2.3.2 Processing of Defining Macros 3.2.3.3 Constraints on Macros and Compiler Macros
Literal Objects in Compiled Files
Declarations
3.3.1 Minimal Declaration Processing Requirements 3.3.2 Declaration Specifiers 3.3.3 Declaration Identifiers 3.3.4 Declaration Scope
Declaration Identifiers
3.3.3.1 Shorthand notation for Type Declarations
Declaration Scope
3.3.4.1 Examples of Declaration Scope
Lambda Lists
Ordinary Lambda Lists
Macro Lambda Lists
Error Checking in Function Calls
3.5.1 Argument Mismatch Detection
Argument Mismatch Detection
Destructive Operations
3.7.1 Modification of Literal Objects 3.7.2 Transfer of Control during a Destructive Operation
Transfer of Control during a Destructive Operation
3.7.2.1 Examples of Transfer of Control during a Destructive Operation
Evaluation and Compilation Dictionary
Types and Classes
4.1 Introduction 4.2 Types 4.3 Classes 4.4 Types and Classes Dictionary
Types
4.2.1 Data Type Definition 4.2.2 Type Relationships 4.2.3 Type Specifiers
Classes
Introduction to Classes
4.3.1.1 Standard Metaclasses
Inheritance
4.3.4.1 Examples of Inheritance 4.3.4.2 Inheritance of Class Options
Determining the Class Precedence List
4.3.5.1 Topological Sorting 4.3.5.2 Examples of Class Precedence List Determination
Redefining Classes
4.3.6.1 Modifying the Structure of Instances 4.3.6.2 Initializing Newly Added Local Slots 4.3.6.3 Customizing Class Redefinition
Types and Classes Dictionary
Data and Control Flow
5.1 Generalized Reference 5.2 Transfer of Control to an Exit Point 5.3 Data and Control Flow Dictionary
Generalized Reference
5.1.1 Overview of Places and Generalized Reference 5.1.2 Kinds of Places 5.1.3 Treatment of Other Macros Based on SETF
Overview of Places and Generalized Reference
5.1.1.1 Evaluation of Subforms to Places 5.1.1.2 Examples of Evaluation of Subforms to Places 5.1.1.3 Setf Expansions 5.1.1.4 Examples of Setf Expansions
Kinds of Places
Data and Control Flow Dictionary
Iteration
6.1 The LOOP Facility 6.2 Iteration Dictionary
The LOOP Facility
Overview of the Loop Facility
Variable Initialization and Stepping Clauses
Value Accumulation Clauses
6.1.3.1 Examples of COLLECT clause 6.1.3.2 Examples of APPEND and NCONC clauses 6.1.3.3 Examples of COUNT clause 6.1.3.4 Examples of MAXIMIZE and MINIMIZE clauses 6.1.3.5 Examples of SUM clause
Termination Test Clauses
6.1.4.1 Examples of REPEAT clause 6.1.4.2 Examples of ALWAYS, NEVER, and THEREIS clauses 6.1.4.3 Examples of WHILE and UNTIL clauses
Unconditional Execution Clauses
6.1.5.1 Examples of unconditional execution
Conditional Execution Clauses
6.1.6.1 Examples of WHEN clause
Miscellaneous Clauses
6.1.7.1 Control Transfer Clauses 6.1.7.2 Examples of NAMED clause 6.1.7.3 Initial and Final Execution
Examples of Miscellaneous Loop Features
6.1.8.1 Examples of clause grouping
Iteration Dictionary
6.2.1 do, do* [Macro] 6.2.2 dotimes [Macro] 6.2.3 dolist [Macro] 6.2.4 loop [Macro] 6.2.5 loop-finish [Local Macro]
Objects
7.1 Object Creation and Initialization 7.2 Changing the Class of an Instance 7.3 Reinitializing an Instance 7.4 Meta-Objects 7.5 Slots 7.6 Generic Functions and Methods 7.7 Objects Dictionary
Object Creation and Initialization
Changing the Class of an Instance
7.2.1 Modifying the Structure of the Instance 7.2.2 Initializing Newly Added Local Slots 7.2.3 Customizing the Change of Class of an Instance
Reinitializing an Instance
7.3.1 Customizing Reinitialization
Meta-Objects
7.4.1 Standard Meta-objects
Slots
7.5.1 Introduction to Slots 7.5.2 Accessing Slots 7.5.3 Inheritance of Slots and Slot Options
Generic Functions and Methods
Keyword Arguments in Generic Functions and Methods
7.6.5.1 Examples of Keyword Arguments in Generic Functions and Methods
Method Selection and Combination
Objects Dictionary
Structures
8.1 Structures Dictionary
Structures Dictionary
8.1.1 defstruct [Macro] 8.1.2 copy-structure [Function]
Conditions
9.1 Condition System Concepts 9.2 Conditions Dictionary
Condition System Concepts
9.1.1 Condition Types 9.1.2 Creating Conditions 9.1.3 Printing Conditions 9.1.4 Signaling and Handling Conditions 9.1.5 Assertions 9.1.6 Notes about the Condition System's Background
Condition Types
9.1.1.1 Serious Conditions
Creating Conditions
9.1.2.1 Condition Designators
Printing Conditions
Signaling and Handling Conditions
Conditions Dictionary
Symbols
10.1 Symbol Concepts 10.2 Symbols Dictionary
Symbols Dictionary
Packages
11.1 Package Concepts 11.2 Packages Dictionary
Package Concepts
11.1.1 Introduction to Packages 11.1.2 Standardized Packages
Introduction to Packages
Standardized Packages
Packages Dictionary
Numbers
12.1 Number Concepts 12.2 Numbers Dictionary
Number Concepts
Numeric Operations
Rational Computations
12.1.3.1 Rule of Unbounded Rational Precision 12.1.3.2 Rule of Canonical Representation for Rationals 12.1.3.3 Rule of Float Substitutability
Floating-point Computations
Complex Computations
Numbers Dictionary
Characters
13.1 Character Concepts 13.2 Characters Dictionary
Character Concepts
Introduction to Scripts and Repertoires
13.1.2.1 Character Scripts 13.1.2.2 Character Repertoires
Character Categories
Characters Dictionary
Conses
14.1 Cons Concepts 14.2 Conses Dictionary
Cons Concepts
14.1.1 Conses as Trees 14.1.2 Conses as Lists
Conses as Trees
14.1.1.1 General Restrictions on Parameters that must be Trees
Conses as Lists
14.1.2.1 Lists as Association Lists 14.1.2.2 Lists as Sets 14.1.2.3 General Restrictions on Parameters that must be Lists
Conses Dictionary
Arrays
15.1 Array Concepts 15.2 Arrays Dictionary
Array Concepts
15.1.1 Array Elements 15.1.2 Specialized Arrays
Array Elements
Specialized Arrays
15.1.2.1 Array Upgrading 15.1.2.2 Required Kinds of Specialized Arrays
Arrays Dictionary
Strings
16.1 String Concepts 16.2 Strings Dictionary
String Concepts
16.1.1 Implications of Strings Being Arrays 16.1.2 Subtypes of STRING
Strings Dictionary
Sequences
17.1 Sequence Concepts 17.2 Rules about Test Functions 17.3 Sequences Dictionary
Sequence Concepts
17.1.1 General Restrictions on Parameters that must be Sequences
Rules about Test Functions
17.2.1 Satisfying a Two-Argument Test 17.2.2 Satisfying a One-Argument Test
Satisfying a Two-Argument Test
17.2.1.1 Examples of Satisfying a Two-Argument Test
Satisfying a One-Argument Test
17.2.2.1 Examples of Satisfying a One-Argument Test
Sequences Dictionary
Hash Tables
18.1 Hash Table Concepts 18.2 Hash Tables Dictionary
Hash Table Concepts
18.1.1 Hash-Table Operations 18.1.2 Modifying Hash Table Keys
Modifying Hash Table Keys
Hash Tables Dictionary
Filenames
19.1 Overview of Filenames 19.2 Pathnames 19.3 Logical Pathnames 19.4 Filenames Dictionary
Overview of Filenames
19.1.1 Namestrings as Filenames 19.1.2 Pathnames as Filenames 19.1.3 Parsing Namestrings Into Pathnames
Pathnames
19.2.1 Pathname Components 19.2.2 Interpreting Pathname Component Values 19.2.3 Merging Pathnames
Pathname Components
Interpreting Pathname Component Values
Merging Pathnames
19.2.3.1 Examples of Merging Pathnames
Logical Pathnames
19.3.1 Syntax of Logical Pathname Namestrings 19.3.2 Logical Pathname Components
Syntax of Logical Pathname Namestrings
Logical Pathname Components
19.3.2.1 Unspecific Components of a Logical Pathname 19.3.2.2 Null Strings as Components of a Logical Pathname
Filenames Dictionary
Files
20.1 File System Concepts 20.2 Files Dictionary
File System Concepts
20.1.1 Coercion of Streams to Pathnames 20.1.2 File Operations on Open and Closed Streams 20.1.3 Truenames
Truenames
20.1.3.1 Examples of Truenames
Files Dictionary
Streams
21.1 Stream Concepts 21.2 Streams Dictionary
Stream Concepts
21.1.1 Introduction to Streams 21.1.2 Stream Variables 21.1.3 Stream Arguments to Standardized Functions 21.1.4 Restrictions on Composite Streams
Introduction to Streams
Streams Dictionary
Printer
22.1 The Lisp Printer 22.2 The Lisp Pretty Printer 22.3 Formatted Output 22.4 Printer Dictionary
The Lisp Printer
22.1.1 Overview of The Lisp Printer 22.1.2 Printer Dispatching 22.1.3 Default Print-Object Methods 22.1.4 Examples of Printer Behavior
Overview of The Lisp Printer
22.1.1.1 Multiple Possible Textual Representations 22.1.1.2 Printer Escaping
Default Print-Object Methods
The Lisp Pretty Printer
22.2.1 Pretty Printer Concepts 22.2.2 Examples of using the Pretty Printer 22.2.3 Notes about the Pretty Printer's Background
Pretty Printer Concepts
22.2.1.1 Dynamic Control of the Arrangement of Output 22.2.1.2 Format Directive Interface 22.2.1.3 Compiling Format Strings 22.2.1.4 Pretty Print Dispatch Tables 22.2.1.5 Pretty Printer Margins
Formatted Output
FORMAT Basic Output
22.3.1.1 Tilde C: Character 22.3.1.2 Tilde Percent: Newline 22.3.1.3 Tilde Ampersand: Fresh-Line 22.3.1.4 Tilde Vertical-Bar: Page 22.3.1.5 Tilde Tilde: Tilde
FORMAT Radix Control
22.3.2.1 Tilde R: Radix 22.3.2.2 Tilde D: Decimal 22.3.2.3 Tilde B: Binary 22.3.2.4 Tilde O: Octal 22.3.2.5 Tilde X: Hexadecimal
FORMAT Floating-Point Printers
22.3.3.1 Tilde F: Fixed-Format Floating-Point 22.3.3.2 Tilde E: Exponential Floating-Point 22.3.3.3 Tilde G: General Floating-Point 22.3.3.4 Tilde Dollarsign: Monetary Floating-Point
FORMAT Printer Operations
22.3.4.1 Tilde A: Aesthetic 22.3.4.2 Tilde S: Standard 22.3.4.3 Tilde W: Write
FORMAT Pretty Printer Operations
22.3.5.1 Tilde Underscore: Conditional Newline 22.3.5.2 Tilde Less-Than-Sign: Logical Block 22.3.5.3 Tilde I: Indent 22.3.5.4 Tilde Slash: Call Function
FORMAT Layout Control
22.3.6.1 Tilde T: Tabulate 22.3.6.2 Tilde Less-Than-Sign: Justification 22.3.6.3 Tilde Greater-Than-Sign: End of Justification
FORMAT Control-Flow Operations
FORMAT Miscellaneous Operations
22.3.8.1 Tilde Left-Paren: Case Conversion 22.3.8.2 Tilde Right-Paren: End of Case Conversion 22.3.8.3 Tilde P: Plural
FORMAT Miscellaneous Pseudo-Operations
22.3.9.1 Tilde Semicolon: Clause Separator 22.3.9.2 Tilde Circumflex: Escape Upward 22.3.9.3 Tilde Newline: Ignored Newline
Additional Information about FORMAT Operations
22.3.10.1 Nesting of FORMAT Operations 22.3.10.2 Missing and Additional FORMAT Arguments 22.3.10.3 Additional FORMAT Parameters 22.3.10.4 Undefined FORMAT Modifier Combinations
Printer Dictionary
Reader
23.1 Reader Concepts 23.2 Reader Dictionary
Reader Concepts
23.1.1 Dynamic Control of the Lisp Reader 23.1.2 Effect of Readtable Case on the Lisp Reader 23.1.3 Argument Conventions of Some Reader Functions
Effect of Readtable Case on the Lisp Reader
23.1.2.1 Examples of Effect of Readtable Case on the Lisp Reader
Argument Conventions of Some Reader Functions
23.1.3.1 The EOF-ERROR-P argument 23.1.3.2 The RECURSIVE-P argument
Reader Dictionary
System Construction
24.1 System Construction Concepts 24.2 System Construction Dictionary
System Construction Concepts
24.1.1 Loading 24.1.2 Features
Features
24.1.2.1 Feature Expressions 24.1.2.2 Examples of Feature Expressions
System Construction Dictionary
Environment
25.1 The External Environment 25.2 Environment Dictionary
The External Environment
25.1.1 Top level loop 25.1.2 Debugging Utilities 25.1.3 Environment Inquiry 25.1.4 Time
Time
25.1.4.1 Decoded Time 25.1.4.2 Universal Time 25.1.4.3 Internal Time 25.1.4.4 Seconds
Environment Dictionary
Glossary
26.1 Glossary
Appendix
27.1 Removed Language Features
Removed Language Features