Clqr a4 Booklet All

26
      Co mm o n Li sp Qu ick Ref erence Revis ion 132 [20 11 -10 -23 ] Copyright © 2008, 2009, 2010, 2011 Bert Burgemeister L A T E X source: http://clqr.boundp.org Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front- Cover Texts and no Back-Cover Texts. http://www .gnu.org/licen ses/fdl.html Quick Reference cl Common lisp Bert Burgemeister

Transcript of Clqr a4 Booklet All

Page 1: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 1/26

    c  l

Co mmon L is p Quic k Re fe re nc e Revi sio n 132 [2 01 1-1 0-2 3]

Copyright © 2008, 2009, 2010, 2011 Bert Burgemeister

LATEX source: http://clqr.boundp.org

Permission is granted to copy, distribute and/or modify this document under the

terms of the GNU Free Documentation License, Version 1.2 or any later version

published by the Free Software Foundation; with no Invariant Sections, no Front-

Cover Texts and no Back-Cover Texts. http://www.gnu.org/licenses/fdl.html

Quick Reference

clCommon

lispBert Burgemeister

Page 2: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 2/26

Common Lisp Quick Reference 

Contents 

1 Numbers 3

1.1 Predicates . . . . 31.2 Numeric Functns . 31.3 Logic Functions . 41.4 Integer Functions . 51.5 Implementation-

Dependent . . . . 6

2 Characters 63 Strings 7

4 Conses 8

4.1 Predicates . . . . 84.2 Lists . . . . . . 84.3 Association Lists . 94.4 Trees . . . . . . 104.5 Sets . . . . . . 10

5 Arrays 10

5.1 Predicates . . . . 105.2 Array Functions . 105.3 Vector Functions . 11

6 Sequences 12

6.1 Seq. Predicates . . 12

6.2 Seq. Functions . . 12

7 Hash Tables 14

8 Structures 15

9 Control Structure 15

9.1 Predicates . . . . 159.2 Variables . . . . 169.3 Functions . . . . 169.4 Macros . . . . . 18

9.5 Control Flow . . . 199.6 Iteration . . . . 209.7 Loop Facility . . . 21

10 CLOS 23

10.1 Classes . . . . . 2310.2 Generic Functns . 2510.3 Method Combi-

nation Types . . . 2611 Conditions and Errors 27

12 Types and Classes 29

13 Input/Output 31

13.1 Predicates . . . . 3113.2 Reader . . . . . 3113.3 Character Syntax . 3313.4 Printer . . . . . 3413.5 Format . . . . . 3613.6 Streams . . . . . 3813.7 Paths and Files . . 40

14 Packages and Symbols 41

14.1 Predicates . . . . 41

14.2 Packages . . . . 4114.3 Symbols . . . . . 4314.4 Std Packages . . 43

15 Compiler 43

15.1 Predicates . . . . 4315.2 Compilation . . . 4315.3 REPL & Debug . 4515.4 Declarations . . . 46

16 External Environment 46

Typographic Conventions name;

Funame;

Mname;

sOname;

gFname;

var∗name∗;

coname

⊲ Symbol defined in Common Lisp; esp. function, macro,special operator, generic function, variable, constant.

them  ⊲ Placeholder for actual code.

 me ⊲ Literal text.

[ foo bar ] ⊲ Either one foo or nothing; defaults to bar.

 foo∗; { foo}∗ ⊲ Zero or more foos.

 foo+; { foo}+ ⊲ One or more foos.

 foos ⊲ English plural denotes a list argument.

{  foo bar baz }; foo

bar 

baz 

⊲ Either foo, or bar , or baz .

 foo

bar 

baz 

⊲ Anything from none to each of  foo, bar , and baz .

  foo ⊲ Argument foo is not evaluated.

bar  ⊲ Argument bar  is possibly modified.

 fooP∗ ⊲ foo∗ is evaluated as in

sOprogn; see p. 19.

 foo;2bar ;

baz  ⊲ Primary, secondary, and n th return value.

T; NIL ⊲ t, or truth in general; and nil or ().

Page 3: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 3/26

Page 4: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 4/26

Page 5: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 5/26

Page 6: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 6/26

Common Lisp Quick Reference 

1.5 Implementation-Dependent co

short-floatco

single-floatco

double-floatco

long-float

-

epsilonnegative-epsilon

⊲ Smallest possible number making a difference whenadded or subtracted, respectively.

coleast-negative

coleast-negative-normalized

co

least-positivecoleast-positive-normalized

-

short-floatsingle-float

double-floatlong-float

⊲ Available numbers closest to −0 or +0, respectively.

comost-negative

comost-positive

-

short-floatsingle-floatdouble-floatlong-floatfixnum

⊲ Available numbers closest to −∞ or +∞, respectively.

(Fu

decode-float n )(

Fuinteger-decode-float n )

⊲ Return significand,2exponent, and

3sign of  float n .

(Fu

scale-float n  [i ]) ⊲ With n ’s radix b, return nbi.

(Fu

float-radix n )(

Fufloat-digits n )

(Fu

float-precision n )⊲ Radix, number of digits in that radix, or precision in thatradix, respectively, of float n .

(Fu

upgraded-complex-part-type foo [environment NIL ])⊲ Type of most specialized complex number able to holdparts of type foo.

2 Characters 

The standard-char type comprises a-z, A-Z, 0-9, Newline, Space, and!?$"’‘.:,;*+-/|\

~^<=>#%@&()[]

{}.

(Fu

characterp foo)(

Fustandard-char-p char )

⊲ T if argument is of indicated type.

(Fu

graphic-char-p character )(

Fualpha-char-p character )

(Fu

alphanumericp character )⊲ T if  character  is visible, alphabetic, or alphanumeric, re-spectively.

(Fu

upper-case-p character )(

Fulower-case-p character )

(Fu

both-case-p character )⊲ Return T if  character  is uppercase, lowercase, or able tobe in another case, respectively.

(Fu

digit-char-p character  [radix 10 ])⊲ Return its weight if character  is a digit, or NIL otherwise.

(Fu

char= character +)(

Fuchar/= character +)

⊲ Return T if all character s, or none, respectively, are equal.

(Fu

char-equal character +)(

Fuchar-not-equal character +)

⊲ Return T if all character s, or none, respectively, are equalignoring case.

(Fu

char> character +)(

Fuchar>= character +)

(Fu

char< character +)(

Fuchar<= character +)

⊲ Return T if  character s are monotonically decreasing,monotonically non-increasing, monotonically increasing, ormonotonically non-decreasing, respectively.

Common Lisp Quick Reference 

Index ” 33’ 33( 33() 43) 33∗ 3, 30, 31, 40, 45∗∗ 40, 45∗∗∗ 45∗BREAK-

ON-SIGNALS∗ 29∗COMPILE-FILE-

PATHNAME∗ 44∗COMPILE-FILE-

TRUENAME∗ 44∗COMPILE-PRINT∗ 44∗COMPILE-

VERBOSE∗ 44∗DEBUG-IO∗ 39∗DEBUGGER-HOOK∗

29∗DEFAULT-

PATHNAME-DEFAULTS∗ 40

∗ERROR-OUTPUT∗ 39∗FEATURES∗ 33∗GENSYM-

COUNTER∗ 43∗LOAD-PATHNAME∗

44∗LOAD-PRINT∗ 44∗LOAD-TRUENAME∗

44∗LOAD-VERBOSE∗ 44∗MACROEXPAND-

HOOK∗ 45∗MODULES∗ 42∗PACKAGE∗ 42∗PRINT-ARRAY∗ 35

∗PRINT-BASE∗ 35∗PRINT-CASE∗ 35∗PRINT-CIRCLE∗ 35∗PRINT-ESCAPE∗ 35∗PRINT-GENSYM∗ 35∗PRINT-LENGTH∗ 35∗PRINT-LEVEL∗ 35∗PRINT-LINES∗ 35∗PRINT-

MISER-WIDTH∗ 35∗PRINT-PPRINT-

DISPATCH∗ 36∗PRINT-PRETTY∗ 35∗PRINT-RADIX∗ 35∗PRINT-READABLY∗

35∗PRINT-RIGHT-

MARGIN∗ 35∗QUERY-IO∗ 39∗RANDOM-STATE∗ 4∗READ-BASE∗ 32∗READ-DEFAULT-

FLOAT-FORMAT∗32

∗READ-EVAL

∗33∗READ-SUPPRESS∗32

∗READTABLE∗ 32∗STANDARD-INPUT∗

39∗STANDARD-

OUTPUT∗ 39∗TERMINAL-IO∗ 39∗TRACE-OUTPUT∗ 45+ 3, 26, 45++ 45+++ 45, 33,. 33,@ 33– 3, 45. 33/ 3, 33, 45// 45/// 45/= 3: 41:: 41:ALLOW-

OTHER-KEYS 19

; 33< 3<= 3= 3, 21> 3>= 3\ 33# 38#\ 33#’ 33#( 33#∗ 33#+ 33#– 33#. 33#: 33#< 33#= 33#A 33#B 33#C( 33#O 33#P 33#R 33

#S( 33#X 33## 33#| | # 33

&ALLOW-OTHER-KEYS 19

&AUX 19&BODY 19&ENVIRONMENT 19&KEY 19&OPTIONAL 19&REST 19&WHOLE 19∼( ∼) 37∼∗ 37∼/ / 38∼< ∼:> 37

∼< ∼> 37∼? 38∼A 36∼B 36∼C 36∼D 36∼E 36∼F 36∼G 36∼I 37∼O 36∼P 37∼R 36∼S 36∼T 37∼W 38∼X 36∼[ ∼] 37∼$ 36∼% 37∼& 37∼ˆ 37∼ 37∼| 37∼{ ∼} 37

∼∼ 37∼←֓ 37` 33| | 331+ 31– 3

ABORT 28ABOVE 21ABS 4ACONS 9ACOS 3ACOSH 4ACROSS 21ADD-METHOD 25ADJOIN 9ADJUST-ARRAY 10ADJUSTABLE-

ARRAY-P 10ALLOCATE-INSTANCE

24ALPHA-CHAR-P 6ALPHANUMERICP 6ALWAYS 23

AND19, 21, 23, 26, 31, 33APPEND 9, 23, 26APPENDING 23APPLY 17APROPOS 45APROPOS-LIST 45AREF 10ARITHMETIC-ERROR

30ARITHMETIC-ERROR-

OPERANDS 29ARITHMETIC-ERROR-

OPERATION 29ARRAY 30ARRAY-DIMENSION 11ARRAY-DIMENSION-

LIMIT 11ARRAY-DIMENSIONS

11ARRAY-

DISPLACEMENT 11ARRAY-

ELEMENT-TYPE 29ARRAY-HAS-

FILL-POINTER-P 10ARRAY-IN-BOUNDS-P

10ARRAY-RANK 11ARRAY-RANK-LIMIT

11ARRAY-ROW-

MAJOR-INDEX 11ARRAY-TOTAL-SIZE

11ARRAY-TOTAL-

SIZE-LIMIT 11ARRAYP 10AS 21ASH 5ASIN 3ASINH 4ASSERT 28ASSOC 9ASSOC-IF 9ASSOC-IF-NOT 9ATAN 3ATANH 4ATOM 8, 30

BASE-CHAR 30BASE-STRING 30BEING 21

BELOW 21BIGNUM 30BIT 11, 30BIT-AND 11BIT-ANDC1 11BIT-ANDC2 11BIT-EQV 11BIT-IOR 11BIT-NAND 11BIT-NOR 11BIT-NOT 11BIT-ORC1 11BIT-ORC2 11

BIT-VECTOR 30BIT-VECTOR-P 10BIT-XOR 11BLOCK 20BOOLE 4BOOLE-1 4BOOLE-2 4BOOLE-AND 5BOOLE-ANDC1 5BOOLE-ANDC2 5BOOLE-C1 4BOOLE-C2 4BOOLE-CLR 4BOOLE-EQV 5BOOLE-IOR 5BOOLE-NAND 5BOOLE-NOR 5BOOLE-ORC1 5BOOLE-ORC2 5BOOLE-SET 4BOOLE-XOR 5BOOLEAN 30BOTH-CASE-P 6BOUNDP 15BREAK 45

BROADCAST-STREAM 30

BROADCAST-STREAM-STREAMS38

BUILT-IN-CLASS 30BUTLAST 9BY 21BYTE 5BYTE-POSITION 5BYTE-SIZE 5

CAAR 8CADR 8CALL-ARGUMENTS-

LIMIT 17CALL-METHOD 27CALL-NEXT-METHOD

26CAR 8CASE 19CATCH 20CCASE 19CDAR 8

CDDR 8CDR 8CEILING 4CELL-ERROR 30CELL-ERROR-NAME

29CERROR 27CHANGE-CLASS 24CHAR 8CHAR-CODE 7CHAR-CODE-LIMIT 7CHAR-DOWNCASE 7CHAR-EQUAL 6CHAR-GREATERP 7CHAR-INT 7CHAR-LESSP 7CHAR-NAME 7CHAR-NOT-EQUAL 6CHAR-

NOT-GREATERP 7CHAR-NOT-LESSP 7CHAR-UPCASE 7CHAR/= 6CHAR< 6CHAR<= 6CHAR= 6CHAR> 6CHAR>= 6CHARACTER 7, 30, 33CHARACTERP 6CHECK-TYPE 29CIS 4CL 43CL-USER 43CLASS 30CLASS-NAME 24CLASS-OF 24CLEAR-INPUT 39CLEAR-OUTPUT 39CLOSE 39CLQR 1CLRHASH 14CODE-CHAR 7COERCE 29COLLECT 23COLLECTING 23COMMON-LISP 43COMMON-LISP-USER

43

COMPILATION-SPEED46COMPILE 43COMPILE-FILE 44

COMPILE-FILE-PATHNAME 44

COMPILED-FUNCTION 30

COMPILED-FUNCTION-P 43

COMPILER-MACRO 43COMPILER-MACRO-

FUNCTION 44COMPLEMENT 17COMPLEX 4, 30, 33COMPLEXP 3COMPUTE-

APPLICABLE-METHODS 25

COMPUTE-RESTARTS28

CONCATENATE 12CONCATENATED-

STREAM 30CONCATENATED-

STREAM-STREAMS38

COND 19CONDITION 30CONJUGATE 4CONS 8, 30CONSP 8CONSTANTLY 17CONSTANTP 15CONTINUE 28CONTROL-ERROR 30COPY-ALIST 9COPY-LIST 9COPY-PPRINT-

DISPATCH 36COPY-READTABLE 32COPY-SEQ 14

COPY-STRUCTURE 15COPY-SYMBOL 43COPY-TREE 10COS 3COSH 3COUNT 12, 23COUNT-IF 12COUNT-IF-NOT 12COUNTING 23CTYPECASE 29

DEBUG 46DECF 3DECLAIM 46DECLARATION 46DECLARE 46DECODE-FLOAT 6DECODE-UNIVERSAL-

TIME 46DEFCLASS 23DEFCONSTANT 16DEFGENERIC 25DEFINE-COMPILER-

MACRO 18DEFINE-CONDITION

27DEFINE-METHOD-

COMBINATION 26DEFINE-MODIFY-

MACRO 19DEFINE-SETF-

EXPANDER 18DEFINE-SYMBOL-

MACRO 18DEFMACRO 18DEFMETHOD 25DEFPACKAGE 41DEFPARAMETER 16DEFSETF 18DEFSTRUCT 15DEFTYPE 31DEFUN 17DEFVAR 16DELETE 13DELETE-DUPLICATES

13DELETE-FILE 41DELETE-IF 13

DELETE-IF-NOT 13DELETE-PACKAGE 42DENOMINATOR 4DEPOSIT-FIELD 5DESCRIBE 45DESCRIBE-OBJECT 45DESTRUCTURING-

BIND 20DIGIT-CHAR 7DIGIT-CHAR-P 6DIRECTORY 41DIRECTORY-

NAMESTRING 40DISASSEMBLE 45DIVISION-BY-ZERO 30DO 20, 23DO-ALL-SYMBOLS 42DO-EXTERNAL-

SYMBOLS 42DO-SYMBOLS 42DO∗ 20DOCUMENTATION 43DOING 23DOLIST 21

DOTIMES 21DOUBLE-FLOAT 30, 33DOUBLE-

FLOAT-EPSILON 6

47 

Page 7: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 7/26

Page 8: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 8/26

Page 9: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 9/26

Page 10: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 10/26

Page 11: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 11/26

Page 12: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 12/26

Page 13: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 13/26

Page 14: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 14/26

Page 15: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 15/26

Page 16: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 16/26

Page 17: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 17/26

Page 18: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 18/26

Page 19: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 19/26

Page 20: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 20/26

Page 21: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 21/26

Page 22: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 22/26

Page 23: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 23/26

Common Lisp Quick Reference 

       T

   a    t   o   m

   r   e   a    d    t   a    b    l   e

   p   a   c    k   a   g   e

   s   y   m    b   o    l

    k   e   y   w   o   r    d

    b   o   o    l   e   a   n

   r   e   s    t   a   r    t

   r   a   n    d   o   m  -   s    t   a    t   e

    h   a   s    h  -    t   a    b    l   e

   s    t   r   u   c    t   u   r   e  -   o    b    j   e   c    t

   s    t   a   n    d   a   r    d  -   o    b    j   e   c    t

   n   u    l    l

   c    l   a   s   s

b   u    i    l    t  -    i   n  -   c    l   a   s   s

   s    t   a   n    d   a   r    d  -   c    l   a   s   s

   s    t   r   u   c    t   u   r   e  -   c    l   a   s   s

   m   e    t    h   o    d

   s    t   a   n    d   a   r    d  -   m   e    t    h   o    d

   m   e    t    h   o    d  -   c   o   m    b    i   n   a    t    i   o   n

   c    h   a   r   a   c    t   e   r

    f   u   n   c    t    i   o   n

         a   r   g  -    t   y   p   e   s            [   v   a    l   u   e  -    t   y   p   e   s            ]      

   c   o   m   p    i    l   e    d  -    f   u   n   c    t    i   o   n

   g   e   n   e   r    i   c  -    f   u   n   c    t    i   o   n

   s    t   a   n    d   a   r    d  -   g   e   n   e   r    i   c  -    f   u   n   c    t    i   o   n

   p   a    t    h   n   a   m   e

    l   o   g    i   c   a    l  -   p   a    t    h   n   a   m   e

   n   u   m    b   e   r

   c   o   m   p    l   e   x            [    t   y   p   e      ∗

            ]

   r   e   a    l          l   o   w   e   r  -    l    i   m    i    t      ∗

            [   u   p   p   e   r  -    l    i   m    i    t      ∗

            ]      

    fl   o   a    t          l   o   w   e   r  -

    l    i   m    i    t      ∗

            [   u   p   p   e   r  -    l    i   m    i    t      ∗

            ]      

   s    h   o   r    t  -    fl   o   a    t          l   o   w   e   r  -    l    i   m    i    t      ∗

            [   u   p   p   e   r  -    l    i   m    i    t      ∗

            ]      

   s    i   n   g    l   e  -    fl   o   a    t          l   o   w   e   r  -    l    i   m    i    t      ∗

            [   u   p   p   e   r  -    l    i   m    i    t      ∗

            ]      

    d   o   u    b    l   e  -    fl   o   a    t          l   o   w   e   r  -    l    i   m    i    t      ∗

            [   u   p   p   e   r  -    l    i   m    i    t      ∗

            ]      

    l   o   n   g  -    fl   o   a    t          l   o   w   e   r  -    l    i   m    i    t      ∗

            [   u   p   p   e   r  -    l    i   m    i    t      ∗

            ]      

   r   a    t    i   o   n   a    l          l   o   w   e   r  -    l    i   m    i    t      ∗

            [   u   p   p   e   r  -    l    i   m    i    t      ∗

            ]      

    i   n    t   e   g   e   r

          l   o   w   e   r  -    l    i   m    i    t      ∗

            [   u   p   p   e   r  -    l    i   m    i    t      ∗

            ]      

   r   a    t    i   o

   s    i   g   n   e    d  -    b   y    t   e            [   s    i   z   e      ∗

            ]

    fi   x   n   u   m

    b    i   g   n   u   m

   u   n   s    i   g   n   e    d  -    b   y    t   e            [   s    i   z   e      ∗

            ]

    b    i    t

    l    i   s    t

   s   e   q   u   e   n   c   e

   c   o   n   s

         c   a   r  -    t   y   p   e      ∗

            [   c    d   r  -    t   y   p   e      ∗

            ]      

   a   r   r   a   y

          t   y   p   e      ∗

            [   r   a   n    k      ∗

            (    d    i   m   e   n   s    i   o   n      ∗

            )            ]      

   s    i   m   p    l   e  -   a   r   r   a   y

          t   y   p   e      ∗

            [   r   a   n    k      ∗

            (    d    i   m   e   n   s    i   o   n      ∗

            )            ]      

   v   e   c    t   o   r

          t   y   p   e      ∗

            [   s    i   z   e      ∗

            ]      

   s    t   r    i   n   g            [   s    i   z   e      ∗

            ]

   s    i   m   p    l   e  -   s    t   r    i   n   g            [   s    i   z   e      ∗

            ]

    b   a   s   e  -   s    t   r    i   n   g            [   s    i   z   e      ∗

            ]

   s    i   m   p    l   e  -    b   a   s   e  -   s    t   r    i   n   g            [   s    i   z   e      ∗

            ]

   s    i   m   p    l   e  -   v   e   c    t   o   r            [   s    i   z   e      ∗

            ]

    b    i    t  -   v   e   c    t   o   r            [   s    i   z   e      ∗

            ]

   s    i   m   p    l   e  -    b    i    t  -   v   e   c    t   o   r            [   s    i   z   e      ∗

            ]

   s    t   r   e   a   m

    fi    l   e  -   s    t   r   e   a   m

    t   w   o  -   w   a   y  -   s    t   r   e   a   m

   s   y   n   o   n   y   m

  -   s    t   r   e   a   m

   s    t   r    i   n   g  -   s    t   r   e   a   m

    b   r   o   a    d   c   a   s    t  -   s    t   r   e   a   m

   c   o   n   c   a    t   e   n   a    t   e    d  -   s    t   r   e   a   m

   e   c    h   o  -   s    t   r   e   a   m

   e   x    t   e   n    d   e    d  -   c    h   a   r

    b   a   s   e  -   c    h   a   r

   s    t   a   n    d   a   r    d  -   c    h   a   r

   c   o   n    d    i    t    i   o   n

   s   e   r    i   o   u   s  -   c   o   n    d    i    t    i   o   n

   s    t   o   r   a   g   e  -   c   o   n    d    i    t    i   o   n

   s    i   m   p    l   e  -    t   y   p   e  -   e   r   r   o   r

    t   y   p   e  -   e   r   r   o   r

   e   r   r   o   r p

   r   o   g   r   a   m  -   e   r   r   o

   r

   c   o   n    t   r   o    l  -   e   r   r   o   r

   p   a   c    k   a   g   e  -   e   r   r   o   r

   p   r    i   n    t  -   n   o    t  -   r   e   a    d   a    b    l   e

   s    t   r   e   a   m  -   e   r   r   o   r

   p   a   r   s   e  -   e   r   r   o   r

   c   e    l    l  -   e   r   r   o   r

    fi    l   e  -   e   r   r   o   r

   a   r    i    t    h   m   e    t    i   c  -   e   r   r   o   r

   s    i   m   p    l   e  -   c   o   n    d    i    t    i   o   n

   w   a   r   n    i   n   g

   s    t   y    l   e  -   w   a   r   n    i   n   g

   s    i   m   p    l   e  -   e   r   r   o   r

   s    i   m   p    l   e  -   w   a   r   n    i   n   g

   e   n    d  -   o    f  -    fi    l   e

   r   e   a    d   e   r  -   e   r   r   o   r

   u   n    b   o   u   n    d  -   v   a   r    i   a    b    l   e

   u   n    d   e    fi   n   e    d  -    f   u   n   c    t    i   o   n

   u   n    b   o   u   n    d  -   s    l   o    t

    d    i   v    i   s    i   o   n  -    b   y  -   z   e   r   o

    fl   o   a    t    i   n   g  -   p   o    i

   n    t  -    i   n   e   x   a   c    t

    fl   o   a    t    i   n   g  -   p   o    i

   n    t  -   o   v   e   r    fl   o   w

    fl   o   a    t    i   n   g  -   p   o    i

   n    t  -   u   n    d   e   r    fl   o   w

    fl   o   a    t    i   n   g  -   p   o    i

   n    t  -    i   n   v   a    l    i    d  -   o   p   e   r   a    t    i   o   n

Figure 2: Precedence Order of System Classes ( ), Classes ( ),Types ( ), and Condition Types ( ).

30 

Common Lisp Quick Reference 

{do doing} form +

⊲ Evaluate form s in every iteration.

{if when unless} test i-clause {and j-clause}∗ [elsek-clause {and l-clause}∗] [end]⊲ If  test  returns T, T, or NIL, respectively, evaluatei-clause and j-clauses; otherwise, evaluate k-clause andl-clauses.

it ⊲ Inside i-clause or k-clause: value of  test .

return { form  it}⊲ Return immediately, skipping any finally parts, withvalues of  form  or it.

{collect collecting} { form  it} [into list ]⊲ Collect values of  form  or it into list . If no list  isgiven, collect into an anonymous list which is returnedafter termination.

{append appending nconc nconcing} { form  it} [into list ]⊲ Concatenate values of  form  or it, which should belists, into list  by the means of 

Fuappend or

Funconc, respec-

tively. If no list  is given, collect into an anonymous listwhich is returned after termination.

{count counting} { form  it} [into n ] [type]⊲ Count the number of times the value of  form  or of  it

is T. If no n  is given, count into an anonymous variablewhich is returned after termination.

{sum summing} { form  it} [into sum ] [type ]⊲ Calculate the sum of the primary values of  form  or of it. If no sum  is given, sum into an anonymous variablewhich is returned after termination.

{maximize maximizing minimize minimizing} { form  it} [intomax-min ] [type]⊲ Determine the maximum or minimum, respectively,of the primary values of  form  or of  it. If no max-min 

is given, use an anonymous variable which is returnedafter termination.

{initially finally} form +

⊲ Evaluate form s before begin, or after end, respec-

tively, of iterations.repeat num 

⊲ TerminateM

loop after num  iterations; num  is evalu-ated once.

{while until} test 

⊲ Continue iteration until test  returns NIL or T, respec-tively.

{always never} test 

⊲ TerminateM

loop returning NIL and skipping any finallyparts as soon as test  is NIL or T, respectively. Otherwisecontinue

Mloop with its default return value set to T.

thereis test 

⊲ TerminateM

loop when test  is T and return value of test ,skipping any finally parts. Otherwise continue

Mloop with

its default return value set to NIL.

(M

loop-finish)⊲ Terminate

Mloop immediately executing any finally

clauses and returning any accumulated results.

10 CLOS 

10.1 Classes 

(Fu

slot-exists-p foo bar ) ⊲ T if  foo has a slot bar .

(Fu

slot-boundp instance slot ) ⊲ T if  slot  in instance is bound.

(M

defclass foo (superclass∗ standard-object )

23 

Page 24: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 24/26

Page 25: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 25/26

Page 26: Clqr a4 Booklet All

8/3/2019 Clqr a4 Booklet All

http://slidepdf.com/reader/full/clqr-a4-booklet-all 26/26