Commit | Line | Data |
---|---|---|
4009494e | 1 | \input texinfo @c -*-texinfo-*- |
db78a8cb | 2 | @setfilename ../../info/cl |
4009494e | 3 | @settitle Common Lisp Extensions |
8d6510b9 | 4 | @include emacsver.texi |
4009494e GM |
5 | |
6 | @copying | |
7 | This file documents the GNU Emacs Common Lisp emulation package. | |
8 | ||
44e97401 | 9 | Copyright @copyright{} 1993, 2001-2012 Free Software Foundation, Inc. |
4009494e GM |
10 | |
11 | @quotation | |
12 | Permission is granted to copy, distribute and/or modify this document | |
6a2c4aec | 13 | under the terms of the GNU Free Documentation License, Version 1.3 or |
4009494e | 14 | any later version published by the Free Software Foundation; with no |
debf4439 GM |
15 | Invariant Sections, with the Front-Cover texts being ``A GNU Manual'', |
16 | and with the Back-Cover Texts as in (a) below. A copy of the license | |
17 | is included in the section entitled ``GNU Free Documentation License''. | |
4009494e | 18 | |
6f093307 GM |
19 | (a) The FSF's Back-Cover Text is: ``You have the freedom to copy and |
20 | modify this GNU manual. Buying copies from the FSF supports it in | |
21 | developing GNU and promoting software freedom.'' | |
4009494e GM |
22 | @end quotation |
23 | @end copying | |
24 | ||
0c973505 | 25 | @dircategory Emacs lisp libraries |
4009494e | 26 | @direntry |
9360256a | 27 | * CL: (cl). Partial Common Lisp support for Emacs Lisp. |
4009494e GM |
28 | @end direntry |
29 | ||
30 | @finalout | |
31 | ||
32 | @titlepage | |
33 | @sp 6 | |
34 | @center @titlefont{Common Lisp Extensions} | |
35 | @sp 4 | |
36 | @center For GNU Emacs Lisp | |
37 | @sp 1 | |
8d6510b9 | 38 | @center as distributed with Emacs @value{EMACSVER} |
4009494e GM |
39 | @sp 5 |
40 | @center Dave Gillespie | |
41 | @center daveg@@synaptics.com | |
42 | @page | |
43 | @vskip 0pt plus 1filll | |
44 | @insertcopying | |
45 | @end titlepage | |
46 | ||
5dc584b5 KB |
47 | @contents |
48 | ||
5dc584b5 | 49 | @ifnottex |
1d5b82ef GM |
50 | @node Top |
51 | @top GNU Emacs Common Lisp Emulation | |
52 | ||
5dc584b5 KB |
53 | @insertcopying |
54 | @end ifnottex | |
55 | ||
4009494e | 56 | @menu |
8d6510b9 GM |
57 | * Overview:: Basics, usage, etc. |
58 | * Program Structure:: Arglists, @code{cl-eval-when}, @code{defalias}. | |
59 | * Predicates:: @code{cl-typep} and @code{cl-equalp}. | |
5887564d | 60 | * Control Structure:: @code{cl-do}, @code{cl-loop}, etc. |
8d6510b9 GM |
61 | * Macros:: Destructuring, @code{cl-define-compiler-macro}. |
62 | * Declarations:: @code{cl-proclaim}, @code{cl-declare}, etc. | |
63 | * Symbols:: Property lists, @code{cl-gensym}. | |
64 | * Numbers:: Predicates, functions, random numbers. | |
65 | * Sequences:: Mapping, functions, searching, sorting. | |
66 | * Lists:: @code{cl-caddr}, @code{cl-sublis}, @code{cl-member}, @code{cl-assoc}, etc. | |
67 | * Structures:: @code{cl-defstruct}. | |
a6880551 | 68 | * Assertions:: @code{cl-check-type}, @code{cl-assert}. |
8d6510b9 GM |
69 | |
70 | * Efficiency Concerns:: Hints and techniques. | |
71 | * Common Lisp Compatibility:: All known differences with Steele. | |
8d6510b9 | 72 | * Porting Common Lisp:: Hints for porting Common Lisp code. |
3c0c6155 | 73 | * Obsolete Features:: Obsolete features. |
4009494e GM |
74 | |
75 | * GNU Free Documentation License:: The license for this documentation. | |
76 | * Function Index:: | |
77 | * Variable Index:: | |
78 | @end menu | |
79 | ||
1d5b82ef | 80 | @node Overview |
4009494e | 81 | @chapter Overview |
4009494e GM |
82 | |
83 | @noindent | |
1d5b82ef GM |
84 | This document describes a set of Emacs Lisp facilities borrowed from |
85 | Common Lisp. All the facilities are described here in detail. While | |
86 | this document does not assume any prior knowledge of Common Lisp, it | |
87 | does assume a basic familiarity with Emacs Lisp. | |
88 | ||
4009494e GM |
89 | Common Lisp is a huge language, and Common Lisp systems tend to be |
90 | massive and extremely complex. Emacs Lisp, by contrast, is rather | |
91 | minimalist in the choice of Lisp features it offers the programmer. | |
92 | As Emacs Lisp programmers have grown in number, and the applications | |
93 | they write have grown more ambitious, it has become clear that Emacs | |
94 | Lisp could benefit from many of the conveniences of Common Lisp. | |
95 | ||
8d6510b9 | 96 | The @code{CL} package adds a number of Common Lisp functions and |
4009494e | 97 | control structures to Emacs Lisp. While not a 100% complete |
8d6510b9 | 98 | implementation of Common Lisp, @code{CL} adds enough functionality |
4009494e GM |
99 | to make Emacs Lisp programming significantly more convenient. |
100 | ||
4009494e GM |
101 | Some Common Lisp features have been omitted from this package |
102 | for various reasons: | |
103 | ||
104 | @itemize @bullet | |
105 | @item | |
106 | Some features are too complex or bulky relative to their benefit | |
107 | to Emacs Lisp programmers. CLOS and Common Lisp streams are fine | |
108 | examples of this group. | |
109 | ||
110 | @item | |
111 | Other features cannot be implemented without modification to the | |
112 | Emacs Lisp interpreter itself, such as multiple return values, | |
8d6510b9 GM |
113 | case-insensitive symbols, and complex numbers. |
114 | The @code{CL} package generally makes no attempt to emulate these | |
4009494e GM |
115 | features. |
116 | ||
4009494e GM |
117 | @end itemize |
118 | ||
a05cb6e3 GM |
119 | This package was originally written by Dave Gillespie, |
120 | @file{daveg@@synaptics.com}, as a total rewrite of an earlier 1986 | |
121 | @file{cl.el} package by Cesar Quiroz. Care has been taken to ensure | |
122 | that each function is defined efficiently, concisely, and with minimal | |
123 | impact on the rest of the Emacs environment. Stefan Monnier added the | |
124 | file @file{cl-lib.el} and rationalized the namespace for Emacs 24.3. | |
4009494e GM |
125 | |
126 | @menu | |
8d6510b9 | 127 | * Usage:: How to use the CL package. |
a05cb6e3 | 128 | * Organization:: The package's component files. |
8d6510b9 | 129 | * Naming Conventions:: Notes on CL function names. |
4009494e GM |
130 | @end menu |
131 | ||
1d5b82ef | 132 | @node Usage |
4009494e GM |
133 | @section Usage |
134 | ||
135 | @noindent | |
8d6510b9 GM |
136 | The @code{CL} package is distributed with Emacs, so there is no need |
137 | to install any additional files in order to start using it. Lisp code | |
138 | that uses features from the @code{CL} package should simply include at | |
139 | the beginning: | |
4009494e GM |
140 | |
141 | @example | |
8d6510b9 | 142 | (require 'cl-lib) |
4009494e GM |
143 | @end example |
144 | ||
145 | @noindent | |
8d6510b9 GM |
146 | You may wish to add such a statement to your init file, if you |
147 | make frequent use of CL features. | |
4009494e | 148 | |
1d5b82ef | 149 | @node Organization |
4009494e GM |
150 | @section Organization |
151 | ||
152 | @noindent | |
8d6510b9 | 153 | The Common Lisp package is organized into four main files: |
4009494e GM |
154 | |
155 | @table @file | |
8d6510b9 GM |
156 | @item cl-lib.el |
157 | This is the main file, which contains basic functions | |
158 | and information about the package. This file is relatively compact. | |
4009494e GM |
159 | |
160 | @item cl-extra.el | |
161 | This file contains the larger, more complex or unusual functions. | |
162 | It is kept separate so that packages which only want to use Common | |
8d6510b9 | 163 | Lisp fundamentals like the @code{cl-incf} function won't need to pay |
4009494e GM |
164 | the overhead of loading the more advanced functions. |
165 | ||
166 | @item cl-seq.el | |
167 | This file contains most of the advanced functions for operating | |
8d6510b9 | 168 | on sequences or lists, such as @code{cl-delete-if} and @code{cl-assoc}. |
4009494e GM |
169 | |
170 | @item cl-macs.el | |
8d6510b9 GM |
171 | This file contains the features that are macros instead of functions. |
172 | Macros expand when the caller is compiled, not when it is run, so the | |
173 | macros generally only need to be present when the byte-compiler is | |
174 | running (or when the macros are used in uncompiled code). Most of the | |
175 | macros of this package are isolated in @file{cl-macs.el} so that they | |
176 | won't take up memory unless you are compiling. | |
4009494e GM |
177 | @end table |
178 | ||
8d6510b9 | 179 | The file @file{cl-lib.el} includes all necessary @code{autoload} |
4009494e | 180 | commands for the functions and macros in the other three files. |
8d6510b9 | 181 | All you have to do is @code{(require 'cl-lib)}, and @file{cl-lib.el} |
4009494e GM |
182 | will take care of pulling in the other files when they are |
183 | needed. | |
184 | ||
d3094168 GM |
185 | There is another file, @file{cl.el}, which was the main entry point to |
186 | the CL package prior to Emacs 24.3. Nowadays, it is replaced by | |
187 | @file{cl-lib.el}. The two provide the same features (in most cases), | |
188 | but use different function names (in fact, @file{cl.el} mainly just | |
189 | defines aliases to the @file{cl-lib.el} definitions). Where | |
190 | @file{cl-lib.el} defines a function called, for example, | |
191 | @code{cl-incf}, @file{cl.el} uses the same name but without the | |
192 | @samp{cl-} prefix, e.g. @code{incf} in this example. There are a few | |
193 | exceptions to this. First, functions such as @code{cl-defun} where | |
194 | the unprefixed version was already used for a standard Emacs Lisp | |
195 | function. In such cases, the @file{cl.el} version adds a @samp{*} | |
196 | suffix, e.g. @code{defun*}. Second, there are some obsolete features | |
197 | that are only implemented in @file{cl.el}, not in @file{cl-lib.el}, | |
198 | because they are replaced by other standard Emacs Lisp features. | |
199 | Finally, in a very few cases the old @file{cl.el} versions do not | |
200 | behave in exactly the same way as the @file{cl-lib.el} versions. | |
201 | @xref{Obsolete Features}. | |
f43a5263 GM |
202 | @c There is also cl-mapc, which was called cl-mapc even before cl-lib.el. |
203 | @c But not autoloaded, so maybe not much used? | |
d3094168 GM |
204 | |
205 | Since the old @file{cl.el} does not use a clean namespace, Emacs has a | |
206 | policy that packages distributed with Emacs must not load @code{cl} at | |
207 | run time. (It is ok for them to load @code{cl} at @emph{compile} | |
208 | time, with @code{eval-when-compile}, and use the macros it provides.) | |
209 | There is no such restriction on the use of @code{cl-lib}. New code | |
210 | should use @code{cl-lib} rather than @code{cl}. | |
8d6510b9 GM |
211 | |
212 | There is one more file, @file{cl-compat.el}, which defines some | |
a6880551 GM |
213 | routines from the older Quiroz CL package that are not otherwise |
214 | present in the new package. This file is obsolete and should not be | |
215 | used in new code. | |
4009494e | 216 | |
1d5b82ef | 217 | @node Naming Conventions |
4009494e GM |
218 | @section Naming Conventions |
219 | ||
220 | @noindent | |
221 | Except where noted, all functions defined by this package have the | |
8d6510b9 GM |
222 | same calling conventions as their Common Lisp counterparts, and |
223 | names that are those of Common Lisp plus a @samp{cl-} prefix. | |
4009494e GM |
224 | |
225 | Internal function and variable names in the package are prefixed | |
8d6510b9 GM |
226 | by @code{cl--}. Here is a complete list of functions prefixed by |
227 | @code{cl-} that were not taken from Common Lisp: | |
4009494e GM |
228 | |
229 | @example | |
8d6510b9 GM |
230 | cl-callf cl-callf2 cl-defsubst |
231 | cl-floatp-safe cl-letf cl-letf* | |
4009494e GM |
232 | @end example |
233 | ||
8d6510b9 | 234 | The following simple functions and macros are defined in @file{cl-lib.el}; |
4009494e GM |
235 | they do not cause other components like @file{cl-extra} to be loaded. |
236 | ||
237 | @example | |
8d6510b9 GM |
238 | cl-floatp-safe cl-endp |
239 | cl-evenp cl-oddp cl-plusp cl-minusp | |
240 | cl-caaar .. cl-cddddr | |
241 | cl-list* cl-ldiff cl-rest cl-first .. cl-tenth | |
242 | cl-copy-list cl-subst cl-mapcar [2] | |
243 | cl-adjoin [3] cl-acons cl-pairlis | |
244 | cl-pushnew [3,4] cl-incf [4] cl-decf [4] | |
245 | cl-proclaim cl-declaim | |
4009494e GM |
246 | @end example |
247 | ||
248 | @noindent | |
249 | [2] Only for one sequence argument or two list arguments. | |
250 | ||
251 | @noindent | |
252 | [3] Only if @code{:test} is @code{eq}, @code{equal}, or unspecified, | |
253 | and @code{:key} is not used. | |
254 | ||
255 | @noindent | |
256 | [4] Only when @var{place} is a plain variable name. | |
257 | ||
1d5b82ef | 258 | @node Program Structure |
4009494e GM |
259 | @chapter Program Structure |
260 | ||
261 | @noindent | |
8d6510b9 | 262 | This section describes features of the @code{CL} package that have to |
4009494e | 263 | do with programs as a whole: advanced argument lists for functions, |
8d6510b9 | 264 | and the @code{cl-eval-when} construct. |
4009494e GM |
265 | |
266 | @menu | |
8d6510b9 GM |
267 | * Argument Lists:: @code{&key}, @code{&aux}, @code{cl-defun}, @code{cl-defmacro}. |
268 | * Time of Evaluation:: The @code{cl-eval-when} construct. | |
4009494e GM |
269 | @end menu |
270 | ||
1d5b82ef | 271 | @node Argument Lists |
4009494e GM |
272 | @section Argument Lists |
273 | ||
274 | @noindent | |
275 | Emacs Lisp's notation for argument lists of functions is a subset of | |
276 | the Common Lisp notation. As well as the familiar @code{&optional} | |
277 | and @code{&rest} markers, Common Lisp allows you to specify default | |
278 | values for optional arguments, and it provides the additional markers | |
279 | @code{&key} and @code{&aux}. | |
280 | ||
281 | Since argument parsing is built-in to Emacs, there is no way for | |
282 | this package to implement Common Lisp argument lists seamlessly. | |
283 | Instead, this package defines alternates for several Lisp forms | |
284 | which you must use if you need Common Lisp argument lists. | |
285 | ||
e1117425 | 286 | @defmac cl-defun name arglist body... |
4009494e GM |
287 | This form is identical to the regular @code{defun} form, except |
288 | that @var{arglist} is allowed to be a full Common Lisp argument | |
289 | list. Also, the function body is enclosed in an implicit block | |
290 | called @var{name}; @pxref{Blocks and Exits}. | |
e1117425 | 291 | @end defmac |
4009494e | 292 | |
e1117425 | 293 | @defmac cl-defsubst name arglist body... |
8d6510b9 | 294 | This is just like @code{cl-defun}, except that the function that |
4009494e GM |
295 | is defined is automatically proclaimed @code{inline}, i.e., |
296 | calls to it may be expanded into in-line code by the byte compiler. | |
297 | This is analogous to the @code{defsubst} form; | |
8d6510b9 | 298 | @code{cl-defsubst} uses a different method (compiler macros) which |
da0bbbc4 | 299 | works in all versions of Emacs, and also generates somewhat more |
8d6510b9 | 300 | efficient inline expansions. In particular, @code{cl-defsubst} |
4009494e GM |
301 | arranges for the processing of keyword arguments, default values, |
302 | etc., to be done at compile-time whenever possible. | |
e1117425 | 303 | @end defmac |
4009494e | 304 | |
e1117425 | 305 | @defmac cl-defmacro name arglist body... |
4009494e GM |
306 | This is identical to the regular @code{defmacro} form, |
307 | except that @var{arglist} is allowed to be a full Common Lisp | |
308 | argument list. The @code{&environment} keyword is supported as | |
309 | described in Steele. The @code{&whole} keyword is supported only | |
310 | within destructured lists (see below); top-level @code{&whole} | |
311 | cannot be implemented with the current Emacs Lisp interpreter. | |
312 | The macro expander body is enclosed in an implicit block called | |
313 | @var{name}. | |
e1117425 | 314 | @end defmac |
4009494e | 315 | |
e1117425 | 316 | @defmac cl-function symbol-or-lambda |
4009494e GM |
317 | This is identical to the regular @code{function} form, |
318 | except that if the argument is a @code{lambda} form then that | |
319 | form may use a full Common Lisp argument list. | |
e1117425 | 320 | @end defmac |
4009494e | 321 | |
8d6510b9 | 322 | Also, all forms (such as @code{cl-flet} and @code{cl-labels}) defined |
4009494e GM |
323 | in this package that include @var{arglist}s in their syntax allow |
324 | full Common Lisp argument lists. | |
325 | ||
8d6510b9 GM |
326 | Note that it is @emph{not} necessary to use @code{cl-defun} in |
327 | order to have access to most @code{CL} features in your function. | |
328 | These features are always present; @code{cl-defun}'s only | |
4009494e GM |
329 | difference from @code{defun} is its more flexible argument |
330 | lists and its implicit block. | |
331 | ||
332 | The full form of a Common Lisp argument list is | |
333 | ||
334 | @example | |
335 | (@var{var}... | |
336 | &optional (@var{var} @var{initform} @var{svar})... | |
337 | &rest @var{var} | |
338 | &key ((@var{keyword} @var{var}) @var{initform} @var{svar})... | |
339 | &aux (@var{var} @var{initform})...) | |
340 | @end example | |
341 | ||
342 | Each of the five argument list sections is optional. The @var{svar}, | |
343 | @var{initform}, and @var{keyword} parts are optional; if they are | |
344 | omitted, then @samp{(@var{var})} may be written simply @samp{@var{var}}. | |
345 | ||
346 | The first section consists of zero or more @dfn{required} arguments. | |
347 | These arguments must always be specified in a call to the function; | |
348 | there is no difference between Emacs Lisp and Common Lisp as far as | |
349 | required arguments are concerned. | |
350 | ||
351 | The second section consists of @dfn{optional} arguments. These | |
352 | arguments may be specified in the function call; if they are not, | |
353 | @var{initform} specifies the default value used for the argument. | |
354 | (No @var{initform} means to use @code{nil} as the default.) The | |
355 | @var{initform} is evaluated with the bindings for the preceding | |
356 | arguments already established; @code{(a &optional (b (1+ a)))} | |
357 | matches one or two arguments, with the second argument defaulting | |
358 | to one plus the first argument. If the @var{svar} is specified, | |
359 | it is an auxiliary variable which is bound to @code{t} if the optional | |
360 | argument was specified, or to @code{nil} if the argument was omitted. | |
361 | If you don't use an @var{svar}, then there will be no way for your | |
362 | function to tell whether it was called with no argument, or with | |
363 | the default value passed explicitly as an argument. | |
364 | ||
365 | The third section consists of a single @dfn{rest} argument. If | |
366 | more arguments were passed to the function than are accounted for | |
367 | by the required and optional arguments, those extra arguments are | |
368 | collected into a list and bound to the ``rest'' argument variable. | |
369 | Common Lisp's @code{&rest} is equivalent to that of Emacs Lisp. | |
370 | Common Lisp accepts @code{&body} as a synonym for @code{&rest} in | |
371 | macro contexts; this package accepts it all the time. | |
372 | ||
373 | The fourth section consists of @dfn{keyword} arguments. These | |
374 | are optional arguments which are specified by name rather than | |
375 | positionally in the argument list. For example, | |
376 | ||
377 | @example | |
8d6510b9 | 378 | (cl-defun foo (a &optional b &key c d (e 17))) |
4009494e GM |
379 | @end example |
380 | ||
381 | @noindent | |
382 | defines a function which may be called with one, two, or more | |
383 | arguments. The first two arguments are bound to @code{a} and | |
384 | @code{b} in the usual way. The remaining arguments must be | |
385 | pairs of the form @code{:c}, @code{:d}, or @code{:e} followed | |
386 | by the value to be bound to the corresponding argument variable. | |
387 | (Symbols whose names begin with a colon are called @dfn{keywords}, | |
388 | and they are self-quoting in the same way as @code{nil} and | |
389 | @code{t}.) | |
390 | ||
391 | For example, the call @code{(foo 1 2 :d 3 :c 4)} sets the five | |
392 | arguments to 1, 2, 4, 3, and 17, respectively. If the same keyword | |
393 | appears more than once in the function call, the first occurrence | |
394 | takes precedence over the later ones. Note that it is not possible | |
395 | to specify keyword arguments without specifying the optional | |
396 | argument @code{b} as well, since @code{(foo 1 :c 2)} would bind | |
397 | @code{b} to the keyword @code{:c}, then signal an error because | |
398 | @code{2} is not a valid keyword. | |
399 | ||
09094f28 CY |
400 | You can also explicitly specify the keyword argument; it need not be |
401 | simply the variable name prefixed with a colon. For example, | |
402 | ||
403 | @example | |
8d6510b9 | 404 | (cl-defun bar (&key (a 1) ((baz b) 4))) |
09094f28 CY |
405 | @end example |
406 | ||
407 | @noindent | |
408 | ||
409 | specifies a keyword @code{:a} that sets the variable @code{a} with | |
410 | default value 1, as well as a keyword @code{baz} that sets the | |
411 | variable @code{b} with default value 4. In this case, because | |
412 | @code{baz} is not self-quoting, you must quote it explicitly in the | |
413 | function call, like this: | |
414 | ||
415 | @example | |
416 | (bar :a 10 'baz 42) | |
417 | @end example | |
418 | ||
419 | Ordinarily, it is an error to pass an unrecognized keyword to | |
4009494e GM |
420 | a function, e.g., @code{(foo 1 2 :c 3 :goober 4)}. You can ask |
421 | Lisp to ignore unrecognized keywords, either by adding the | |
422 | marker @code{&allow-other-keys} after the keyword section | |
423 | of the argument list, or by specifying an @code{:allow-other-keys} | |
424 | argument in the call whose value is non-@code{nil}. If the | |
425 | function uses both @code{&rest} and @code{&key} at the same time, | |
426 | the ``rest'' argument is bound to the keyword list as it appears | |
427 | in the call. For example: | |
428 | ||
429 | @smallexample | |
8d6510b9 GM |
430 | (cl-defun find-thing (thing &rest rest &key need &allow-other-keys) |
431 | (or (apply 'cl-member thing thing-list :allow-other-keys t rest) | |
4009494e GM |
432 | (if need (error "Thing not found")))) |
433 | @end smallexample | |
434 | ||
435 | @noindent | |
436 | This function takes a @code{:need} keyword argument, but also | |
437 | accepts other keyword arguments which are passed on to the | |
8d6510b9 GM |
438 | @code{cl-member} function. @code{allow-other-keys} is used to |
439 | keep both @code{find-thing} and @code{cl-member} from complaining | |
4009494e GM |
440 | about each others' keywords in the arguments. |
441 | ||
442 | The fifth section of the argument list consists of @dfn{auxiliary | |
443 | variables}. These are not really arguments at all, but simply | |
444 | variables which are bound to @code{nil} or to the specified | |
445 | @var{initforms} during execution of the function. There is no | |
446 | difference between the following two functions, except for a | |
447 | matter of stylistic taste: | |
448 | ||
449 | @example | |
8d6510b9 | 450 | (cl-defun foo (a b &aux (c (+ a b)) d) |
4009494e GM |
451 | @var{body}) |
452 | ||
8d6510b9 | 453 | (cl-defun foo (a b) |
4009494e GM |
454 | (let ((c (+ a b)) d) |
455 | @var{body})) | |
456 | @end example | |
457 | ||
458 | Argument lists support @dfn{destructuring}. In Common Lisp, | |
459 | destructuring is only allowed with @code{defmacro}; this package | |
8d6510b9 | 460 | allows it with @code{cl-defun} and other argument lists as well. |
4009494e GM |
461 | In destructuring, any argument variable (@var{var} in the above |
462 | diagram) can be replaced by a list of variables, or more generally, | |
463 | a recursive argument list. The corresponding argument value must | |
464 | be a list whose elements match this recursive argument list. | |
465 | For example: | |
466 | ||
467 | @example | |
8d6510b9 | 468 | (cl-defmacro dolist ((var listform &optional resultform) |
4009494e GM |
469 | &rest body) |
470 | ...) | |
471 | @end example | |
472 | ||
473 | This says that the first argument of @code{dolist} must be a list | |
474 | of two or three items; if there are other arguments as well as this | |
475 | list, they are stored in @code{body}. All features allowed in | |
476 | regular argument lists are allowed in these recursive argument lists. | |
477 | In addition, the clause @samp{&whole @var{var}} is allowed at the | |
478 | front of a recursive argument list. It binds @var{var} to the | |
479 | whole list being matched; thus @code{(&whole all a b)} matches | |
480 | a list of two things, with @code{a} bound to the first thing, | |
481 | @code{b} bound to the second thing, and @code{all} bound to the | |
482 | list itself. (Common Lisp allows @code{&whole} in top-level | |
483 | @code{defmacro} argument lists as well, but Emacs Lisp does not | |
484 | support this usage.) | |
485 | ||
486 | One last feature of destructuring is that the argument list may be | |
487 | dotted, so that the argument list @code{(a b . c)} is functionally | |
488 | equivalent to @code{(a b &rest c)}. | |
489 | ||
490 | If the optimization quality @code{safety} is set to 0 | |
491 | (@pxref{Declarations}), error checking for wrong number of | |
492 | arguments and invalid keyword arguments is disabled. By default, | |
493 | argument lists are rigorously checked. | |
494 | ||
1d5b82ef | 495 | @node Time of Evaluation |
4009494e GM |
496 | @section Time of Evaluation |
497 | ||
498 | @noindent | |
499 | Normally, the byte-compiler does not actually execute the forms in | |
500 | a file it compiles. For example, if a file contains @code{(setq foo t)}, | |
501 | the act of compiling it will not actually set @code{foo} to @code{t}. | |
502 | This is true even if the @code{setq} was a top-level form (i.e., not | |
503 | enclosed in a @code{defun} or other form). Sometimes, though, you | |
504 | would like to have certain top-level forms evaluated at compile-time. | |
505 | For example, the compiler effectively evaluates @code{defmacro} forms | |
506 | at compile-time so that later parts of the file can refer to the | |
507 | macros that are defined. | |
508 | ||
e1117425 | 509 | @defmac cl-eval-when (situations...) forms... |
4009494e GM |
510 | This form controls when the body @var{forms} are evaluated. |
511 | The @var{situations} list may contain any set of the symbols | |
512 | @code{compile}, @code{load}, and @code{eval} (or their long-winded | |
513 | ANSI equivalents, @code{:compile-toplevel}, @code{:load-toplevel}, | |
514 | and @code{:execute}). | |
515 | ||
8d6510b9 | 516 | The @code{cl-eval-when} form is handled differently depending on |
4009494e GM |
517 | whether or not it is being compiled as a top-level form. |
518 | Specifically, it gets special treatment if it is being compiled | |
519 | by a command such as @code{byte-compile-file} which compiles files | |
520 | or buffers of code, and it appears either literally at the | |
521 | top level of the file or inside a top-level @code{progn}. | |
522 | ||
8d6510b9 | 523 | For compiled top-level @code{cl-eval-when}s, the body @var{forms} are |
4009494e GM |
524 | executed at compile-time if @code{compile} is in the @var{situations} |
525 | list, and the @var{forms} are written out to the file (to be executed | |
526 | at load-time) if @code{load} is in the @var{situations} list. | |
527 | ||
528 | For non-compiled-top-level forms, only the @code{eval} situation is | |
529 | relevant. (This includes forms executed by the interpreter, forms | |
530 | compiled with @code{byte-compile} rather than @code{byte-compile-file}, | |
8d6510b9 | 531 | and non-top-level forms.) The @code{cl-eval-when} acts like a |
4009494e GM |
532 | @code{progn} if @code{eval} is specified, and like @code{nil} |
533 | (ignoring the body @var{forms}) if not. | |
534 | ||
8d6510b9 | 535 | The rules become more subtle when @code{cl-eval-when}s are nested; |
4009494e GM |
536 | consult Steele (second edition) for the gruesome details (and |
537 | some gruesome examples). | |
538 | ||
539 | Some simple examples: | |
540 | ||
541 | @example | |
542 | ;; Top-level forms in foo.el: | |
8d6510b9 GM |
543 | (cl-eval-when (compile) (setq foo1 'bar)) |
544 | (cl-eval-when (load) (setq foo2 'bar)) | |
545 | (cl-eval-when (compile load) (setq foo3 'bar)) | |
546 | (cl-eval-when (eval) (setq foo4 'bar)) | |
547 | (cl-eval-when (eval compile) (setq foo5 'bar)) | |
548 | (cl-eval-when (eval load) (setq foo6 'bar)) | |
549 | (cl-eval-when (eval compile load) (setq foo7 'bar)) | |
4009494e GM |
550 | @end example |
551 | ||
552 | When @file{foo.el} is compiled, these variables will be set during | |
553 | the compilation itself: | |
554 | ||
555 | @example | |
556 | foo1 foo3 foo5 foo7 ; `compile' | |
557 | @end example | |
558 | ||
559 | When @file{foo.elc} is loaded, these variables will be set: | |
560 | ||
561 | @example | |
562 | foo2 foo3 foo6 foo7 ; `load' | |
563 | @end example | |
564 | ||
565 | And if @file{foo.el} is loaded uncompiled, these variables will | |
566 | be set: | |
567 | ||
568 | @example | |
569 | foo4 foo5 foo6 foo7 ; `eval' | |
570 | @end example | |
571 | ||
8d6510b9 | 572 | If these seven @code{cl-eval-when}s had been, say, inside a @code{defun}, |
4009494e GM |
573 | then the first three would have been equivalent to @code{nil} and the |
574 | last four would have been equivalent to the corresponding @code{setq}s. | |
575 | ||
8d6510b9 | 576 | Note that @code{(cl-eval-when (load eval) @dots{})} is equivalent |
4009494e GM |
577 | to @code{(progn @dots{})} in all contexts. The compiler treats |
578 | certain top-level forms, like @code{defmacro} (sort-of) and | |
a05cb6e3 | 579 | @code{require}, as if they were wrapped in @code{(cl-eval-when |
4009494e | 580 | (compile load eval) @dots{})}. |
e1117425 | 581 | @end defmac |
4009494e | 582 | |
8d6510b9 | 583 | Emacs includes two special forms related to @code{cl-eval-when}. |
4009494e | 584 | One of these, @code{eval-when-compile}, is not quite equivalent to |
a05cb6e3 | 585 | any @code{cl-eval-when} construct and is described below. |
4009494e GM |
586 | |
587 | The other form, @code{(eval-and-compile @dots{})}, is exactly | |
a05cb6e3 | 588 | equivalent to @samp{(cl-eval-when (compile load eval) @dots{})} and |
4009494e GM |
589 | so is not itself defined by this package. |
590 | ||
e1117425 | 591 | @defmac eval-when-compile forms... |
4009494e GM |
592 | The @var{forms} are evaluated at compile-time; at execution time, |
593 | this form acts like a quoted constant of the resulting value. Used | |
594 | at top-level, @code{eval-when-compile} is just like @samp{eval-when | |
595 | (compile eval)}. In other contexts, @code{eval-when-compile} | |
596 | allows code to be evaluated once at compile-time for efficiency | |
597 | or other reasons. | |
598 | ||
599 | This form is similar to the @samp{#.} syntax of true Common Lisp. | |
e1117425 | 600 | @end defmac |
4009494e | 601 | |
e1117425 | 602 | @defmac cl-load-time-value form |
4009494e GM |
603 | The @var{form} is evaluated at load-time; at execution time, |
604 | this form acts like a quoted constant of the resulting value. | |
605 | ||
606 | Early Common Lisp had a @samp{#,} syntax that was similar to | |
607 | this, but ANSI Common Lisp replaced it with @code{load-time-value} | |
608 | and gave it more well-defined semantics. | |
609 | ||
8d6510b9 | 610 | In a compiled file, @code{cl-load-time-value} arranges for @var{form} |
4009494e GM |
611 | to be evaluated when the @file{.elc} file is loaded and then used |
612 | as if it were a quoted constant. In code compiled by | |
613 | @code{byte-compile} rather than @code{byte-compile-file}, the | |
614 | effect is identical to @code{eval-when-compile}. In uncompiled | |
8d6510b9 | 615 | code, both @code{eval-when-compile} and @code{cl-load-time-value} |
4009494e GM |
616 | act exactly like @code{progn}. |
617 | ||
618 | @example | |
619 | (defun report () | |
620 | (insert "This function was executed on: " | |
621 | (current-time-string) | |
622 | ", compiled on: " | |
623 | (eval-when-compile (current-time-string)) | |
624 | ;; or '#.(current-time-string) in real Common Lisp | |
625 | ", and loaded on: " | |
8d6510b9 | 626 | (cl-load-time-value (current-time-string)))) |
4009494e GM |
627 | @end example |
628 | ||
629 | @noindent | |
630 | Byte-compiled, the above defun will result in the following code | |
631 | (or its compiled equivalent, of course) in the @file{.elc} file: | |
632 | ||
633 | @example | |
634 | (setq --temp-- (current-time-string)) | |
635 | (defun report () | |
636 | (insert "This function was executed on: " | |
637 | (current-time-string) | |
638 | ", compiled on: " | |
639 | '"Wed Jun 23 18:33:43 1993" | |
640 | ", and loaded on: " | |
641 | --temp--)) | |
642 | @end example | |
e1117425 | 643 | @end defmac |
4009494e | 644 | |
1d5b82ef | 645 | @node Predicates |
4009494e GM |
646 | @chapter Predicates |
647 | ||
648 | @noindent | |
649 | This section describes functions for testing whether various | |
650 | facts are true or false. | |
651 | ||
652 | @menu | |
8d6510b9 GM |
653 | * Type Predicates:: @code{cl-typep}, @code{cl-deftype}, and @code{cl-coerce}. |
654 | * Equality Predicates:: @code{cl-equalp}. | |
4009494e GM |
655 | @end menu |
656 | ||
1d5b82ef | 657 | @node Type Predicates |
4009494e GM |
658 | @section Type Predicates |
659 | ||
8d6510b9 | 660 | @defun cl-typep object type |
4009494e GM |
661 | Check if @var{object} is of type @var{type}, where @var{type} is a |
662 | (quoted) type name of the sort used by Common Lisp. For example, | |
8d6510b9 | 663 | @code{(cl-typep foo 'integer)} is equivalent to @code{(integerp foo)}. |
4009494e GM |
664 | @end defun |
665 | ||
666 | The @var{type} argument to the above function is either a symbol | |
667 | or a list beginning with a symbol. | |
668 | ||
669 | @itemize @bullet | |
670 | @item | |
671 | If the type name is a symbol, Emacs appends @samp{-p} to the | |
672 | symbol name to form the name of a predicate function for testing | |
673 | the type. (Built-in predicates whose names end in @samp{p} rather | |
674 | than @samp{-p} are used when appropriate.) | |
675 | ||
676 | @item | |
677 | The type symbol @code{t} stands for the union of all types. | |
8d6510b9 | 678 | @code{(cl-typep @var{object} t)} is always true. Likewise, the |
4009494e | 679 | type symbol @code{nil} stands for nothing at all, and |
8d6510b9 | 680 | @code{(cl-typep @var{object} nil)} is always false. |
4009494e GM |
681 | |
682 | @item | |
683 | The type symbol @code{null} represents the symbol @code{nil}. | |
8d6510b9 | 684 | Thus @code{(cl-typep @var{object} 'null)} is equivalent to |
4009494e GM |
685 | @code{(null @var{object})}. |
686 | ||
687 | @item | |
688 | The type symbol @code{atom} represents all objects that are not cons | |
8d6510b9 | 689 | cells. Thus @code{(cl-typep @var{object} 'atom)} is equivalent to |
4009494e GM |
690 | @code{(atom @var{object})}. |
691 | ||
692 | @item | |
693 | The type symbol @code{real} is a synonym for @code{number}, and | |
694 | @code{fixnum} is a synonym for @code{integer}. | |
695 | ||
696 | @item | |
697 | The type symbols @code{character} and @code{string-char} match | |
698 | integers in the range from 0 to 255. | |
699 | ||
700 | @item | |
8d6510b9 | 701 | The type symbol @code{float} uses the @code{cl-floatp-safe} predicate |
4009494e GM |
702 | defined by this package rather than @code{floatp}, so it will work |
703 | correctly even in Emacs versions without floating-point support. | |
704 | ||
705 | @item | |
706 | The type list @code{(integer @var{low} @var{high})} represents all | |
707 | integers between @var{low} and @var{high}, inclusive. Either bound | |
708 | may be a list of a single integer to specify an exclusive limit, | |
709 | or a @code{*} to specify no limit. The type @code{(integer * *)} | |
710 | is thus equivalent to @code{integer}. | |
711 | ||
712 | @item | |
713 | Likewise, lists beginning with @code{float}, @code{real}, or | |
714 | @code{number} represent numbers of that type falling in a particular | |
715 | range. | |
716 | ||
717 | @item | |
718 | Lists beginning with @code{and}, @code{or}, and @code{not} form | |
719 | combinations of types. For example, @code{(or integer (float 0 *))} | |
720 | represents all objects that are integers or non-negative floats. | |
721 | ||
722 | @item | |
8d6510b9 | 723 | Lists beginning with @code{member} or @code{cl-member} represent |
4009494e GM |
724 | objects @code{eql} to any of the following values. For example, |
725 | @code{(member 1 2 3 4)} is equivalent to @code{(integer 1 4)}, | |
726 | and @code{(member nil)} is equivalent to @code{null}. | |
727 | ||
728 | @item | |
729 | Lists of the form @code{(satisfies @var{predicate})} represent | |
730 | all objects for which @var{predicate} returns true when called | |
731 | with that object as an argument. | |
732 | @end itemize | |
733 | ||
734 | The following function and macro (not technically predicates) are | |
8d6510b9 | 735 | related to @code{cl-typep}. |
4009494e | 736 | |
8d6510b9 | 737 | @defun cl-coerce object type |
4009494e GM |
738 | This function attempts to convert @var{object} to the specified |
739 | @var{type}. If @var{object} is already of that type as determined by | |
a05cb6e3 | 740 | @code{cl-typep}, it is simply returned. Otherwise, certain types of |
4009494e GM |
741 | conversions will be made: If @var{type} is any sequence type |
742 | (@code{string}, @code{list}, etc.) then @var{object} will be | |
743 | converted to that type if possible. If @var{type} is | |
744 | @code{character}, then strings of length one and symbols with | |
745 | one-character names can be coerced. If @var{type} is @code{float}, | |
746 | then integers can be coerced in versions of Emacs that support | |
8d6510b9 | 747 | floats. In all other circumstances, @code{cl-coerce} signals an |
4009494e GM |
748 | error. |
749 | @end defun | |
750 | ||
e1117425 | 751 | @defmac cl-deftype name arglist forms... |
4009494e GM |
752 | This macro defines a new type called @var{name}. It is similar |
753 | to @code{defmacro} in many ways; when @var{name} is encountered | |
754 | as a type name, the body @var{forms} are evaluated and should | |
755 | return a type specifier that is equivalent to the type. The | |
756 | @var{arglist} is a Common Lisp argument list of the sort accepted | |
8d6510b9 | 757 | by @code{cl-defmacro}. The type specifier @samp{(@var{name} @var{args}...)} |
4009494e GM |
758 | is expanded by calling the expander with those arguments; the type |
759 | symbol @samp{@var{name}} is expanded by calling the expander with | |
760 | no arguments. The @var{arglist} is processed the same as for | |
8d6510b9 | 761 | @code{cl-defmacro} except that optional arguments without explicit |
4009494e GM |
762 | defaults use @code{*} instead of @code{nil} as the ``default'' |
763 | default. Some examples: | |
764 | ||
765 | @example | |
8d6510b9 GM |
766 | (cl-deftype null () '(satisfies null)) ; predefined |
767 | (cl-deftype list () '(or null cons)) ; predefined | |
768 | (cl-deftype unsigned-byte (&optional bits) | |
4009494e GM |
769 | (list 'integer 0 (if (eq bits '*) bits (1- (lsh 1 bits))))) |
770 | (unsigned-byte 8) @equiv{} (integer 0 255) | |
771 | (unsigned-byte) @equiv{} (integer 0 *) | |
772 | unsigned-byte @equiv{} (integer 0 *) | |
773 | @end example | |
774 | ||
775 | @noindent | |
776 | The last example shows how the Common Lisp @code{unsigned-byte} | |
777 | type specifier could be implemented if desired; this package does | |
778 | not implement @code{unsigned-byte} by default. | |
e1117425 | 779 | @end defmac |
4009494e | 780 | |
8d6510b9 GM |
781 | The @code{cl-typecase} and @code{cl-check-type} macros also use type |
782 | names. @xref{Conditionals}. @xref{Assertions}. The @code{cl-map}, | |
783 | @code{cl-concatenate}, and @code{cl-merge} functions take type-name | |
4009494e GM |
784 | arguments to specify the type of sequence to return. @xref{Sequences}. |
785 | ||
1d5b82ef | 786 | @node Equality Predicates |
4009494e GM |
787 | @section Equality Predicates |
788 | ||
789 | @noindent | |
8d6510b9 | 790 | This package defines the Common Lisp predicate @code{cl-equalp}. |
4009494e | 791 | |
8d6510b9 | 792 | @defun cl-equalp a b |
4009494e GM |
793 | This function is a more flexible version of @code{equal}. In |
794 | particular, it compares strings case-insensitively, and it compares | |
8d6510b9 | 795 | numbers without regard to type (so that @code{(cl-equalp 3 3.0)} is |
4009494e GM |
796 | true). Vectors and conses are compared recursively. All other |
797 | objects are compared as if by @code{equal}. | |
798 | ||
799 | This function differs from Common Lisp @code{equalp} in several | |
800 | respects. First, Common Lisp's @code{equalp} also compares | |
801 | @emph{characters} case-insensitively, which would be impractical | |
802 | in this package since Emacs does not distinguish between integers | |
803 | and characters. In keeping with the idea that strings are less | |
8d6510b9 | 804 | vector-like in Emacs Lisp, this package's @code{cl-equalp} also will |
4009494e GM |
805 | not compare strings against vectors of integers. |
806 | @end defun | |
807 | ||
808 | Also note that the Common Lisp functions @code{member} and @code{assoc} | |
809 | use @code{eql} to compare elements, whereas Emacs Lisp follows the | |
810 | MacLisp tradition and uses @code{equal} for these two functions. | |
8d6510b9 GM |
811 | In Emacs, use @code{memq} (or @code{cl-member}) and @code{assq} (or |
812 | @code{cl-assoc}) to get functions which use @code{eql} for comparisons. | |
4009494e | 813 | |
1d5b82ef | 814 | @node Control Structure |
4009494e GM |
815 | @chapter Control Structure |
816 | ||
817 | @noindent | |
818 | The features described in the following sections implement | |
5887564d GM |
819 | various advanced control structures, including extensions to the |
820 | standard @code{setf} facility, and a number of looping and conditional | |
4009494e GM |
821 | constructs. |
822 | ||
823 | @menu | |
8d6510b9 | 824 | * Assignment:: The @code{cl-psetq} form. |
5887564d | 825 | * Generalized Variables:: Extensions to generalized variables. |
69c1c2e6 | 826 | * Variable Bindings:: @code{cl-progv}, @code{cl-flet}, @code{cl-macrolet}. |
8d6510b9 GM |
827 | * Conditionals:: @code{cl-case}, @code{cl-typecase}. |
828 | * Blocks and Exits:: @code{cl-block}, @code{cl-return}, @code{cl-return-from}. | |
829 | * Iteration:: @code{cl-do}, @code{cl-dotimes}, @code{cl-dolist}, @code{cl-do-symbols}. | |
830 | * Loop Facility:: The Common Lisp @code{cl-loop} macro. | |
f94b04fc | 831 | * Multiple Values:: @code{cl-values}, @code{cl-multiple-value-bind}, etc. |
4009494e GM |
832 | @end menu |
833 | ||
1d5b82ef | 834 | @node Assignment |
4009494e GM |
835 | @section Assignment |
836 | ||
837 | @noindent | |
8d6510b9 | 838 | The @code{cl-psetq} form is just like @code{setq}, except that multiple |
4009494e GM |
839 | assignments are done in parallel rather than sequentially. |
840 | ||
e1117425 | 841 | @defmac cl-psetq [symbol form]@dots{} |
4009494e GM |
842 | This special form (actually a macro) is used to assign to several |
843 | variables simultaneously. Given only one @var{symbol} and @var{form}, | |
844 | it has the same effect as @code{setq}. Given several @var{symbol} | |
845 | and @var{form} pairs, it evaluates all the @var{form}s in advance | |
846 | and then stores the corresponding variables afterwards. | |
847 | ||
848 | @example | |
849 | (setq x 2 y 3) | |
850 | (setq x (+ x y) y (* x y)) | |
851 | x | |
852 | @result{} 5 | |
853 | y ; @r{@code{y} was computed after @code{x} was set.} | |
854 | @result{} 15 | |
855 | (setq x 2 y 3) | |
8d6510b9 | 856 | (cl-psetq x (+ x y) y (* x y)) |
4009494e GM |
857 | x |
858 | @result{} 5 | |
859 | y ; @r{@code{y} was computed before @code{x} was set.} | |
860 | @result{} 6 | |
861 | @end example | |
862 | ||
8d6510b9 GM |
863 | The simplest use of @code{cl-psetq} is @code{(cl-psetq x y y x)}, which |
864 | exchanges the values of two variables. (The @code{cl-rotatef} form | |
4009494e GM |
865 | provides an even more convenient way to swap two variables; |
866 | @pxref{Modify Macros}.) | |
867 | ||
8d6510b9 | 868 | @code{cl-psetq} always returns @code{nil}. |
e1117425 | 869 | @end defmac |
4009494e | 870 | |
1d5b82ef | 871 | @node Generalized Variables |
4009494e GM |
872 | @section Generalized Variables |
873 | ||
5887564d GM |
874 | A @dfn{generalized variable} or @dfn{place form} is one of the many |
875 | places in Lisp memory where values can be stored. The simplest place | |
876 | form is a regular Lisp variable. But the cars and cdrs of lists, | |
877 | elements of arrays, properties of symbols, and many other locations | |
878 | are also places where Lisp values are stored. For basic information, | |
879 | @pxref{Generalized Variables,,,elisp,GNU Emacs Lisp Reference Manual}. | |
880 | This package provides several additional features related to | |
881 | generalized variables. | |
4009494e GM |
882 | |
883 | @menu | |
5887564d | 884 | * Setf Extensions:: Additional @code{setf} places. |
4ddedf94 | 885 | * Modify Macros:: @code{cl-incf}, @code{cl-rotatef}, @code{cl-letf}, @code{cl-callf}, etc. |
4009494e GM |
886 | @end menu |
887 | ||
5887564d GM |
888 | @node Setf Extensions |
889 | @subsection Setf Extensions | |
4009494e | 890 | |
5887564d GM |
891 | Several standard (e.g. @code{car}) and Emacs-specific |
892 | (e.g. @code{window-point}) Lisp functions are @code{setf}-able by default. | |
893 | This package defines @code{setf} handlers for several additional functions: | |
4009494e | 894 | |
5887564d | 895 | @itemize |
4009494e | 896 | @item |
5887564d | 897 | Functions from @code{CL} itself: |
4009494e | 898 | @smallexample |
5887564d GM |
899 | cl-caaar .. cl-cddddr cl-first .. cl-tenth |
900 | cl-rest cl-get cl-getf cl-subseq | |
4009494e GM |
901 | @end smallexample |
902 | ||
516e1a08 GM |
903 | @noindent |
904 | Note that for @code{cl-getf} (as for @code{nthcdr}), the list argument | |
905 | of the function must itself be a valid @var{place} form. | |
906 | ||
4009494e | 907 | @item |
5887564d | 908 | General Emacs Lisp functions: |
4009494e | 909 | @smallexample |
5887564d GM |
910 | buffer-file-name getenv |
911 | buffer-modified-p global-key-binding | |
912 | buffer-name local-key-binding | |
913 | buffer-string mark | |
914 | buffer-substring mark-marker | |
915 | current-buffer marker-position | |
916 | current-case-table mouse-position | |
917 | current-column point | |
918 | current-global-map point-marker | |
919 | current-input-mode point-max | |
920 | current-local-map point-min | |
921 | current-window-configuration read-mouse-position | |
922 | default-file-modes screen-height | |
923 | documentation-property screen-width | |
924 | face-background selected-window | |
925 | face-background-pixmap selected-screen | |
926 | face-font selected-frame | |
927 | face-foreground standard-case-table | |
928 | face-underline-p syntax-table | |
929 | file-modes visited-file-modtime | |
930 | frame-height window-height | |
931 | frame-parameters window-width | |
932 | frame-visible-p x-get-secondary-selection | |
933 | frame-width x-get-selection | |
934 | get-register | |
4009494e GM |
935 | @end smallexample |
936 | ||
937 | Most of these have directly corresponding ``set'' functions, like | |
938 | @code{use-local-map} for @code{current-local-map}, or @code{goto-char} | |
939 | for @code{point}. A few, like @code{point-min}, expand to longer | |
5887564d GM |
940 | sequences of code when they are used with @code{setf} |
941 | (@code{(narrow-to-region x (point-max))} in this case). | |
4009494e GM |
942 | |
943 | @item | |
944 | A call of the form @code{(substring @var{subplace} @var{n} [@var{m}])}, | |
945 | where @var{subplace} is itself a valid generalized variable whose | |
946 | current value is a string, and where the value stored is also a | |
947 | string. The new string is spliced into the specified part of the | |
948 | destination string. For example: | |
949 | ||
950 | @example | |
951 | (setq a (list "hello" "world")) | |
952 | @result{} ("hello" "world") | |
953 | (cadr a) | |
954 | @result{} "world" | |
955 | (substring (cadr a) 2 4) | |
956 | @result{} "rl" | |
957 | (setf (substring (cadr a) 2 4) "o") | |
958 | @result{} "o" | |
959 | (cadr a) | |
960 | @result{} "wood" | |
961 | a | |
962 | @result{} ("hello" "wood") | |
963 | @end example | |
964 | ||
965 | The generalized variable @code{buffer-substring}, listed above, | |
966 | also works in this way by replacing a portion of the current buffer. | |
967 | ||
5887564d GM |
968 | @c FIXME? Also `eq'? (see cl-lib.el) |
969 | ||
a3c5b619 GM |
970 | @c Currently commented out in cl.el. |
971 | @ignore | |
4009494e GM |
972 | @item |
973 | A call of the form @code{(apply '@var{func} @dots{})} or | |
974 | @code{(apply (function @var{func}) @dots{})}, where @var{func} | |
975 | is a @code{setf}-able function whose store function is ``suitable'' | |
976 | in the sense described in Steele's book; since none of the standard | |
977 | Emacs place functions are suitable in this sense, this feature is | |
978 | only interesting when used with places you define yourself with | |
979 | @code{define-setf-method} or the long form of @code{defsetf}. | |
d55911cf | 980 | @xref{Obsolete Setf Customization}. |
a3c5b619 | 981 | @end ignore |
4009494e GM |
982 | |
983 | @item | |
984 | A macro call, in which case the macro is expanded and @code{setf} | |
985 | is applied to the resulting form. | |
986 | ||
987 | @item | |
988 | Any form for which a @code{defsetf} or @code{define-setf-method} | |
a3c5b619 | 989 | has been made. @xref{Obsolete Setf Customization}. |
4009494e GM |
990 | @end itemize |
991 | ||
5887564d GM |
992 | @c FIXME should this be in lispref? It seems self-evident. |
993 | @c Contrast with the cl-incf example later on. | |
994 | @c Here it really only serves as a constrast to wrong-order. | |
4009494e GM |
995 | The @code{setf} macro takes care to evaluate all subforms in |
996 | the proper left-to-right order; for example, | |
997 | ||
998 | @example | |
39a58b5b | 999 | (setf (aref vec (cl-incf i)) i) |
4009494e GM |
1000 | @end example |
1001 | ||
1002 | @noindent | |
39a58b5b | 1003 | looks like it will evaluate @code{(cl-incf i)} exactly once, before the |
4009494e GM |
1004 | following access to @code{i}; the @code{setf} expander will insert |
1005 | temporary variables as necessary to ensure that it does in fact work | |
1006 | this way no matter what setf-method is defined for @code{aref}. | |
1007 | (In this case, @code{aset} would be used and no such steps would | |
1008 | be necessary since @code{aset} takes its arguments in a convenient | |
1009 | order.) | |
1010 | ||
1011 | However, if the @var{place} form is a macro which explicitly | |
1012 | evaluates its arguments in an unusual order, this unusual order | |
1013 | will be preserved. Adapting an example from Steele, given | |
1014 | ||
1015 | @example | |
1016 | (defmacro wrong-order (x y) (list 'aref y x)) | |
1017 | @end example | |
1018 | ||
1019 | @noindent | |
1020 | the form @code{(setf (wrong-order @var{a} @var{b}) 17)} will | |
1021 | evaluate @var{b} first, then @var{a}, just as in an actual call | |
1022 | to @code{wrong-order}. | |
4009494e | 1023 | |
1d5b82ef | 1024 | @node Modify Macros |
4009494e GM |
1025 | @subsection Modify Macros |
1026 | ||
1027 | @noindent | |
5887564d GM |
1028 | This package defines a number of macros that operate on generalized |
1029 | variables. Many are interesting and useful even when the @var{place} | |
1030 | is just a variable name. | |
4009494e | 1031 | |
e1117425 | 1032 | @defmac cl-psetf [place form]@dots{} |
8d6510b9 | 1033 | This macro is to @code{setf} what @code{cl-psetq} is to @code{setq}: |
4009494e GM |
1034 | When several @var{place}s and @var{form}s are involved, the |
1035 | assignments take place in parallel rather than sequentially. | |
1036 | Specifically, all subforms are evaluated from left to right, then | |
1037 | all the assignments are done (in an undefined order). | |
e1117425 | 1038 | @end defmac |
4009494e | 1039 | |
e1117425 | 1040 | @defmac cl-incf place &optional x |
4009494e GM |
1041 | This macro increments the number stored in @var{place} by one, or |
1042 | by @var{x} if specified. The incremented value is returned. For | |
39a58b5b GM |
1043 | example, @code{(cl-incf i)} is equivalent to @code{(setq i (1+ i))}, and |
1044 | @code{(cl-incf (car x) 2)} is equivalent to @code{(setcar x (+ (car x) 2))}. | |
4009494e | 1045 | |
5887564d GM |
1046 | As with @code{setf}, care is taken to preserve the ``apparent'' order |
1047 | of evaluation. For example, | |
4009494e GM |
1048 | |
1049 | @example | |
39a58b5b | 1050 | (cl-incf (aref vec (cl-incf i))) |
4009494e GM |
1051 | @end example |
1052 | ||
1053 | @noindent | |
1054 | appears to increment @code{i} once, then increment the element of | |
1055 | @code{vec} addressed by @code{i}; this is indeed exactly what it | |
1056 | does, which means the above form is @emph{not} equivalent to the | |
1057 | ``obvious'' expansion, | |
1058 | ||
1059 | @example | |
a05cb6e3 GM |
1060 | (setf (aref vec (cl-incf i)) |
1061 | (1+ (aref vec (cl-incf i)))) ; wrong! | |
4009494e GM |
1062 | @end example |
1063 | ||
1064 | @noindent | |
1065 | but rather to something more like | |
1066 | ||
1067 | @example | |
39a58b5b | 1068 | (let ((temp (cl-incf i))) |
4009494e GM |
1069 | (setf (aref vec temp) (1+ (aref vec temp)))) |
1070 | @end example | |
1071 | ||
1072 | @noindent | |
39a58b5b | 1073 | Again, all of this is taken care of automatically by @code{cl-incf} and |
4009494e GM |
1074 | the other generalized-variable macros. |
1075 | ||
39a58b5b GM |
1076 | As a more Emacs-specific example of @code{cl-incf}, the expression |
1077 | @code{(cl-incf (point) @var{n})} is essentially equivalent to | |
4009494e | 1078 | @code{(forward-char @var{n})}. |
e1117425 | 1079 | @end defmac |
4009494e | 1080 | |
e1117425 | 1081 | @defmac cl-decf place &optional x |
4009494e GM |
1082 | This macro decrements the number stored in @var{place} by one, or |
1083 | by @var{x} if specified. | |
e1117425 | 1084 | @end defmac |
4009494e | 1085 | |
e1117425 | 1086 | @defmac cl-pushnew x place @t{&key :test :test-not :key} |
4009494e GM |
1087 | This macro inserts @var{x} at the front of the list stored in |
1088 | @var{place}, but only if @var{x} was not @code{eql} to any | |
1089 | existing element of the list. The optional keyword arguments | |
a05cb6e3 | 1090 | are interpreted in the same way as for @code{cl-adjoin}. |
4009494e | 1091 | @xref{Lists as Sets}. |
e1117425 | 1092 | @end defmac |
4009494e | 1093 | |
e1117425 | 1094 | @defmac cl-shiftf place@dots{} newvalue |
4009494e GM |
1095 | This macro shifts the @var{place}s left by one, shifting in the |
1096 | value of @var{newvalue} (which may be any Lisp expression, not just | |
1097 | a generalized variable), and returning the value shifted out of | |
5887564d | 1098 | the first @var{place}. Thus, @code{(cl-shiftf @var{a} @var{b} @var{c} |
4009494e GM |
1099 | @var{d})} is equivalent to |
1100 | ||
1101 | @example | |
1102 | (prog1 | |
1103 | @var{a} | |
5887564d GM |
1104 | (cl-psetf @var{a} @var{b} |
1105 | @var{b} @var{c} | |
1106 | @var{c} @var{d})) | |
4009494e GM |
1107 | @end example |
1108 | ||
1109 | @noindent | |
1110 | except that the subforms of @var{a}, @var{b}, and @var{c} are actually | |
1111 | evaluated only once each and in the apparent order. | |
e1117425 | 1112 | @end defmac |
4009494e | 1113 | |
e1117425 | 1114 | @defmac cl-rotatef place@dots{} |
4009494e | 1115 | This macro rotates the @var{place}s left by one in circular fashion. |
a05cb6e3 | 1116 | Thus, @code{(cl-rotatef @var{a} @var{b} @var{c} @var{d})} is equivalent to |
4009494e GM |
1117 | |
1118 | @example | |
5887564d GM |
1119 | (cl-psetf @var{a} @var{b} |
1120 | @var{b} @var{c} | |
1121 | @var{c} @var{d} | |
1122 | @var{d} @var{a}) | |
4009494e GM |
1123 | @end example |
1124 | ||
1125 | @noindent | |
a05cb6e3 GM |
1126 | except for the evaluation of subforms. @code{cl-rotatef} always |
1127 | returns @code{nil}. Note that @code{(cl-rotatef @var{a} @var{b})} | |
4009494e | 1128 | conveniently exchanges @var{a} and @var{b}. |
e1117425 | 1129 | @end defmac |
4009494e GM |
1130 | |
1131 | The following macros were invented for this package; they have no | |
1132 | analogues in Common Lisp. | |
1133 | ||
4ddedf94 | 1134 | @defmac cl-letf (bindings@dots{}) forms@dots{} |
4009494e GM |
1135 | This macro is analogous to @code{let}, but for generalized variables |
1136 | rather than just symbols. Each @var{binding} should be of the form | |
1137 | @code{(@var{place} @var{value})}; the original contents of the | |
1138 | @var{place}s are saved, the @var{value}s are stored in them, and | |
1139 | then the body @var{form}s are executed. Afterwards, the @var{places} | |
1140 | are set back to their original saved contents. This cleanup happens | |
1141 | even if the @var{form}s exit irregularly due to a @code{throw} or an | |
1142 | error. | |
1143 | ||
1144 | For example, | |
1145 | ||
1146 | @example | |
4ddedf94 GM |
1147 | (cl-letf (((point) (point-min)) |
1148 | (a 17)) | |
1149 | ...) | |
4009494e GM |
1150 | @end example |
1151 | ||
1152 | @noindent | |
4ddedf94 | 1153 | moves point in the current buffer to the beginning of the buffer, |
4009494e GM |
1154 | and also binds @code{a} to 17 (as if by a normal @code{let}, since |
1155 | @code{a} is just a regular variable). After the body exits, @code{a} | |
1156 | is set back to its original value and point is moved back to its | |
1157 | original position. | |
1158 | ||
4ddedf94 | 1159 | Note that @code{cl-letf} on @code{(point)} is not quite like a |
4009494e GM |
1160 | @code{save-excursion}, as the latter effectively saves a marker |
1161 | which tracks insertions and deletions in the buffer. Actually, | |
4ddedf94 | 1162 | a @code{cl-letf} of @code{(point-marker)} is much closer to this |
4009494e GM |
1163 | behavior. (@code{point} and @code{point-marker} are equivalent |
1164 | as @code{setf} places; each will accept either an integer or a | |
1165 | marker as the stored value.) | |
1166 | ||
1167 | Since generalized variables look like lists, @code{let}'s shorthand | |
1168 | of using @samp{foo} for @samp{(foo nil)} as a @var{binding} would | |
4ddedf94 | 1169 | be ambiguous in @code{cl-letf} and is not allowed. |
4009494e GM |
1170 | |
1171 | However, a @var{binding} specifier may be a one-element list | |
1172 | @samp{(@var{place})}, which is similar to @samp{(@var{place} | |
1173 | @var{place})}. In other words, the @var{place} is not disturbed | |
4ddedf94 GM |
1174 | on entry to the body, and the only effect of the @code{cl-letf} is |
1175 | to restore the original value of @var{place} afterwards. | |
1176 | @c I suspect this may no longer be true; either way it's | |
1177 | @c implementation detail and so not essential to document. | |
1178 | @ignore | |
1179 | (The redundant access-and-store suggested by the @code{(@var{place} | |
4009494e | 1180 | @var{place})} example does not actually occur.) |
4ddedf94 | 1181 | @end ignore |
4009494e | 1182 | |
4ddedf94 GM |
1183 | Note that in this case, and in fact almost every case, @var{place} |
1184 | must have a well-defined value outside the @code{cl-letf} body. | |
1185 | There is essentially only one exception to this, which is @var{place} | |
1186 | a plain variable with a specified @var{value} (such as @code{(a 17)} | |
1187 | in the above example). | |
1188 | @c See http://debbugs.gnu.org/12758 | |
1189 | @c Some or all of this was true for cl.el, but not for cl-lib.el. | |
1190 | @ignore | |
1191 | The only exceptions are plain variables and calls to | |
1192 | @code{symbol-value} and @code{symbol-function}. If the symbol is not | |
1193 | bound on entry, it is simply made unbound by @code{makunbound} or | |
1194 | @code{fmakunbound} on exit. | |
1195 | @end ignore | |
e1117425 | 1196 | @end defmac |
4009494e | 1197 | |
e1117425 | 1198 | @defmac cl-letf* (bindings@dots{}) forms@dots{} |
4ddedf94 | 1199 | This macro is to @code{cl-letf} what @code{let*} is to @code{let}: |
4009494e | 1200 | It does the bindings in sequential rather than parallel order. |
e1117425 | 1201 | @end defmac |
4009494e | 1202 | |
e1117425 | 1203 | @defmac cl-callf @var{function} @var{place} @var{args}@dots{} |
4009494e GM |
1204 | This is the ``generic'' modify macro. It calls @var{function}, |
1205 | which should be an unquoted function name, macro name, or lambda. | |
1206 | It passes @var{place} and @var{args} as arguments, and assigns the | |
39a58b5b | 1207 | result back to @var{place}. For example, @code{(cl-incf @var{place} |
a05cb6e3 | 1208 | @var{n})} is the same as @code{(cl-callf + @var{place} @var{n})}. |
4009494e GM |
1209 | Some more examples: |
1210 | ||
1211 | @example | |
a05cb6e3 GM |
1212 | (cl-callf abs my-number) |
1213 | (cl-callf concat (buffer-name) "<" (number-to-string n) ">") | |
1214 | (cl-callf cl-union happy-people (list joe bob) :test 'same-person) | |
4009494e GM |
1215 | @end example |
1216 | ||
d571e9c3 | 1217 | Note again that @code{cl-callf} is an extension to standard Common Lisp. |
e1117425 | 1218 | @end defmac |
4009494e | 1219 | |
e1117425 | 1220 | @defmac cl-callf2 @var{function} @var{arg1} @var{place} @var{args}@dots{} |
a05cb6e3 | 1221 | This macro is like @code{cl-callf}, except that @var{place} is |
4009494e GM |
1222 | the @emph{second} argument of @var{function} rather than the |
1223 | first. For example, @code{(push @var{x} @var{place})} is | |
a05cb6e3 | 1224 | equivalent to @code{(cl-callf2 cons @var{x} @var{place})}. |
e1117425 | 1225 | @end defmac |
4009494e | 1226 | |
a05cb6e3 | 1227 | The @code{cl-callf} and @code{cl-callf2} macros serve as building |
d55911cf | 1228 | blocks for other macros like @code{cl-incf}, and @code{cl-pushnew}. |
4ddedf94 | 1229 | The @code{cl-letf} and @code{cl-letf*} macros are used in the processing |
d55911cf | 1230 | of symbol macros; @pxref{Macro Bindings}. |
4009494e | 1231 | |
4009494e | 1232 | |
1d5b82ef | 1233 | @node Variable Bindings |
4009494e GM |
1234 | @section Variable Bindings |
1235 | ||
1236 | @noindent | |
1237 | These Lisp forms make bindings to variables and function names, | |
1238 | analogous to Lisp's built-in @code{let} form. | |
1239 | ||
4ddedf94 | 1240 | @xref{Modify Macros}, for the @code{cl-letf} and @code{cl-letf*} forms which |
4009494e GM |
1241 | are also related to variable bindings. |
1242 | ||
1243 | @menu | |
39a58b5b | 1244 | * Dynamic Bindings:: The @code{cl-progv} form. |
69c1c2e6 | 1245 | * Function Bindings:: @code{cl-flet} and @code{cl-labels}. |
39a58b5b | 1246 | * Macro Bindings:: @code{cl-macrolet} and @code{cl-symbol-macrolet}. |
4009494e GM |
1247 | @end menu |
1248 | ||
1d5b82ef | 1249 | @node Dynamic Bindings |
4009494e GM |
1250 | @subsection Dynamic Bindings |
1251 | ||
1252 | @noindent | |
1253 | The standard @code{let} form binds variables whose names are known | |
39a58b5b | 1254 | at compile-time. The @code{cl-progv} form provides an easy way to |
4009494e GM |
1255 | bind variables whose names are computed at run-time. |
1256 | ||
e1117425 | 1257 | @defmac cl-progv symbols values forms@dots{} |
4009494e GM |
1258 | This form establishes @code{let}-style variable bindings on a |
1259 | set of variables computed at run-time. The expressions | |
1260 | @var{symbols} and @var{values} are evaluated, and must return lists | |
1261 | of symbols and values, respectively. The symbols are bound to the | |
1262 | corresponding values for the duration of the body @var{form}s. | |
1263 | If @var{values} is shorter than @var{symbols}, the last few symbols | |
a05cb6e3 | 1264 | are bound to @code{nil}. |
4009494e GM |
1265 | If @var{symbols} is shorter than @var{values}, the excess values |
1266 | are ignored. | |
e1117425 | 1267 | @end defmac |
4009494e | 1268 | |
1d5b82ef | 1269 | @node Function Bindings |
4009494e GM |
1270 | @subsection Function Bindings |
1271 | ||
1272 | @noindent | |
1273 | These forms make @code{let}-like bindings to functions instead | |
1274 | of variables. | |
1275 | ||
69c1c2e6 | 1276 | @defmac cl-flet (bindings@dots{}) forms@dots{} |
4009494e GM |
1277 | This form establishes @code{let}-style bindings on the function |
1278 | cells of symbols rather than on the value cells. Each @var{binding} | |
1279 | must be a list of the form @samp{(@var{name} @var{arglist} | |
1280 | @var{forms}@dots{})}, which defines a function exactly as if | |
a05cb6e3 | 1281 | it were a @code{cl-defun} form. The function @var{name} is defined |
69c1c2e6 | 1282 | accordingly for the duration of the body of the @code{cl-flet}; then |
4009494e GM |
1283 | the old function definition, or lack thereof, is restored. |
1284 | ||
69c1c2e6 | 1285 | You can use @code{cl-flet} to disable or modify the behavior of a |
4009494e GM |
1286 | function in a temporary fashion. This will even work on Emacs |
1287 | primitives, although note that some calls to primitive functions | |
1288 | internal to Emacs are made without going through the symbol's | |
69c1c2e6 | 1289 | function cell, and so will not be affected by @code{cl-flet}. For |
4009494e GM |
1290 | example, |
1291 | ||
1292 | @example | |
69c1c2e6 GM |
1293 | (cl-flet ((message (&rest args) (push args saved-msgs))) |
1294 | (do-something)) | |
4009494e GM |
1295 | @end example |
1296 | ||
1297 | This code attempts to replace the built-in function @code{message} | |
1298 | with a function that simply saves the messages in a list rather | |
1299 | than displaying them. The original definition of @code{message} | |
1300 | will be restored after @code{do-something} exits. This code will | |
1301 | work fine on messages generated by other Lisp code, but messages | |
1302 | generated directly inside Emacs will not be caught since they make | |
1303 | direct C-language calls to the message routines rather than going | |
1304 | through the Lisp @code{message} function. | |
1305 | ||
69c1c2e6 | 1306 | Functions defined by @code{cl-flet} may use the full Common Lisp |
39a58b5b GM |
1307 | argument notation supported by @code{cl-defun}; also, the function |
1308 | body is enclosed in an implicit block as if by @code{cl-defun}. | |
4009494e | 1309 | @xref{Program Structure}. |
e1117425 | 1310 | @end defmac |
4009494e | 1311 | |
69c1c2e6 GM |
1312 | @defmac cl-labels (bindings@dots{}) forms@dots{} |
1313 | The @code{cl-labels} form is like @code{cl-flet}, except that | |
1314 | the function bindings can be recursive. The scoping is lexical, | |
1315 | but you can only capture functions in closures if | |
1316 | @code{lexical-binding} is non-@code{nil}. | |
1317 | @xref{Closures,,,elisp,GNU Emacs Lisp Reference Manual}, and | |
1318 | @ref{Using Lexical Binding,,,elisp,GNU Emacs Lisp Reference Manual}. | |
4009494e GM |
1319 | |
1320 | Lexical scoping means that all references to the named | |
1321 | functions must appear physically within the body of the | |
69c1c2e6 GM |
1322 | @code{cl-labels} form. References may appear both in the body |
1323 | @var{forms} of @code{cl-labels} itself, and in the bodies of | |
1324 | the functions themselves. Thus, @code{cl-labels} can define | |
1325 | local recursive functions, or mutually-recursive sets of functions. | |
4009494e GM |
1326 | |
1327 | A ``reference'' to a function name is either a call to that | |
1328 | function, or a use of its name quoted by @code{quote} or | |
1329 | @code{function} to be passed on to, say, @code{mapcar}. | |
e1117425 | 1330 | @end defmac |
4009494e | 1331 | |
1d5b82ef | 1332 | @node Macro Bindings |
4009494e GM |
1333 | @subsection Macro Bindings |
1334 | ||
1335 | @noindent | |
a05cb6e3 | 1336 | These forms create local macros and ``symbol macros''. |
4009494e | 1337 | |
e1117425 | 1338 | @defmac cl-macrolet (bindings@dots{}) forms@dots{} |
69c1c2e6 | 1339 | This form is analogous to @code{cl-flet}, but for macros instead of |
4009494e | 1340 | functions. Each @var{binding} is a list of the same form as the |
39a58b5b | 1341 | arguments to @code{cl-defmacro} (i.e., a macro name, argument list, |
4009494e | 1342 | and macro-expander forms). The macro is defined accordingly for |
39a58b5b | 1343 | use within the body of the @code{cl-macrolet}. |
4009494e | 1344 | |
3c0c6155 GM |
1345 | @c FIXME this should be modified to say ``even when lexical-binding |
1346 | @c is code{nil}'', but is that true? The doc of cl-macrolet just | |
1347 | @c refers us to cl-flet, which refers to cl-labels, which says that it | |
1348 | @c behaves differently according to whether l-b is true or not. | |
39a58b5b GM |
1349 | Because of the nature of macros, @code{cl-macrolet} is lexically |
1350 | scoped even in Emacs Lisp: The @code{cl-macrolet} binding will | |
4009494e GM |
1351 | affect only calls that appear physically within the body |
1352 | @var{forms}, possibly after expansion of other macros in the | |
1353 | body. | |
e1117425 | 1354 | @end defmac |
4009494e | 1355 | |
e1117425 | 1356 | @defmac cl-symbol-macrolet (bindings@dots{}) forms@dots{} |
4009494e GM |
1357 | This form creates @dfn{symbol macros}, which are macros that look |
1358 | like variable references rather than function calls. Each | |
1359 | @var{binding} is a list @samp{(@var{var} @var{expansion})}; | |
1360 | any reference to @var{var} within the body @var{forms} is | |
1361 | replaced by @var{expansion}. | |
1362 | ||
1363 | @example | |
1364 | (setq bar '(5 . 9)) | |
39a58b5b GM |
1365 | (cl-symbol-macrolet ((foo (car bar))) |
1366 | (cl-incf foo)) | |
4009494e GM |
1367 | bar |
1368 | @result{} (6 . 9) | |
1369 | @end example | |
1370 | ||
1371 | A @code{setq} of a symbol macro is treated the same as a @code{setf}. | |
1372 | I.e., @code{(setq foo 4)} in the above would be equivalent to | |
1373 | @code{(setf foo 4)}, which in turn expands to @code{(setf (car bar) 4)}. | |
1374 | ||
1375 | Likewise, a @code{let} or @code{let*} binding a symbol macro is | |
4ddedf94 | 1376 | treated like a @code{cl-letf} or @code{cl-letf*}. This differs from true |
3c0c6155 | 1377 | @c FIXME does it work like this in Emacs with lexical-binding = t? |
4009494e | 1378 | Common Lisp, where the rules of lexical scoping cause a @code{let} |
39a58b5b | 1379 | binding to shadow a @code{cl-symbol-macrolet} binding. In this package, |
3c0c6155 | 1380 | @c FIXME obsolete. |
4009494e GM |
1381 | only @code{lexical-let} and @code{lexical-let*} will shadow a symbol |
1382 | macro. | |
1383 | ||
1384 | There is no analogue of @code{defmacro} for symbol macros; all symbol | |
39a58b5b | 1385 | macros are local. A typical use of @code{cl-symbol-macrolet} is in the |
4009494e GM |
1386 | expansion of another macro: |
1387 | ||
1388 | @example | |
39a58b5b | 1389 | (cl-defmacro my-dolist ((x list) &rest body) |
4009494e | 1390 | (let ((var (gensym))) |
39a58b5b | 1391 | (list 'cl-loop 'for var 'on list 'do |
a05cb6e3 GM |
1392 | (cl-list* 'cl-symbol-macrolet |
1393 | (list (list x (list 'car var))) | |
1394 | body)))) | |
4009494e GM |
1395 | |
1396 | (setq mylist '(1 2 3 4)) | |
39a58b5b | 1397 | (my-dolist (x mylist) (cl-incf x)) |
4009494e GM |
1398 | mylist |
1399 | @result{} (2 3 4 5) | |
1400 | @end example | |
1401 | ||
1402 | @noindent | |
1403 | In this example, the @code{my-dolist} macro is similar to @code{dolist} | |
1404 | (@pxref{Iteration}) except that the variable @code{x} becomes a true | |
1405 | reference onto the elements of the list. The @code{my-dolist} call | |
1406 | shown here expands to | |
1407 | ||
1408 | @example | |
39a58b5b GM |
1409 | (cl-loop for G1234 on mylist do |
1410 | (cl-symbol-macrolet ((x (car G1234))) | |
1411 | (cl-incf x))) | |
4009494e GM |
1412 | @end example |
1413 | ||
1414 | @noindent | |
1415 | which in turn expands to | |
1416 | ||
1417 | @example | |
39a58b5b | 1418 | (cl-loop for G1234 on mylist do (cl-incf (car G1234))) |
4009494e GM |
1419 | @end example |
1420 | ||
39a58b5b | 1421 | @xref{Loop Facility}, for a description of the @code{cl-loop} macro. |
4009494e GM |
1422 | This package defines a nonstandard @code{in-ref} loop clause that |
1423 | works much like @code{my-dolist}. | |
e1117425 | 1424 | @end defmac |
4009494e | 1425 | |
1d5b82ef | 1426 | @node Conditionals |
4009494e GM |
1427 | @section Conditionals |
1428 | ||
1429 | @noindent | |
1430 | These conditional forms augment Emacs Lisp's simple @code{if}, | |
1431 | @code{and}, @code{or}, and @code{cond} forms. | |
1432 | ||
e1117425 | 1433 | @defmac cl-case keyform clause@dots{} |
4009494e GM |
1434 | This macro evaluates @var{keyform}, then compares it with the key |
1435 | values listed in the various @var{clause}s. Whichever clause matches | |
1436 | the key is executed; comparison is done by @code{eql}. If no clause | |
39a58b5b | 1437 | matches, the @code{cl-case} form returns @code{nil}. The clauses are |
4009494e GM |
1438 | of the form |
1439 | ||
1440 | @example | |
1441 | (@var{keylist} @var{body-forms}@dots{}) | |
1442 | @end example | |
1443 | ||
1444 | @noindent | |
1445 | where @var{keylist} is a list of key values. If there is exactly | |
1446 | one value, and it is not a cons cell or the symbol @code{nil} or | |
1447 | @code{t}, then it can be used by itself as a @var{keylist} without | |
a05cb6e3 | 1448 | being enclosed in a list. All key values in the @code{cl-case} form |
4009494e GM |
1449 | must be distinct. The final clauses may use @code{t} in place of |
1450 | a @var{keylist} to indicate a default clause that should be taken | |
1451 | if none of the other clauses match. (The symbol @code{otherwise} | |
1452 | is also recognized in place of @code{t}. To make a clause that | |
1453 | matches the actual symbol @code{t}, @code{nil}, or @code{otherwise}, | |
1454 | enclose the symbol in a list.) | |
1455 | ||
1456 | For example, this expression reads a keystroke, then does one of | |
1457 | four things depending on whether it is an @samp{a}, a @samp{b}, | |
1458 | a @key{RET} or @kbd{C-j}, or anything else. | |
1459 | ||
1460 | @example | |
39a58b5b | 1461 | (cl-case (read-char) |
4009494e GM |
1462 | (?a (do-a-thing)) |
1463 | (?b (do-b-thing)) | |
1464 | ((?\r ?\n) (do-ret-thing)) | |
1465 | (t (do-other-thing))) | |
1466 | @end example | |
e1117425 | 1467 | @end defmac |
4009494e | 1468 | |
e1117425 | 1469 | @defmac cl-ecase keyform clause@dots{} |
39a58b5b | 1470 | This macro is just like @code{cl-case}, except that if the key does |
4009494e GM |
1471 | not match any of the clauses, an error is signaled rather than |
1472 | simply returning @code{nil}. | |
e1117425 | 1473 | @end defmac |
4009494e | 1474 | |
e1117425 | 1475 | @defmac cl-typecase keyform clause@dots{} |
39a58b5b | 1476 | This macro is a version of @code{cl-case} that checks for types |
4009494e GM |
1477 | rather than values. Each @var{clause} is of the form |
1478 | @samp{(@var{type} @var{body}...)}. @xref{Type Predicates}, | |
1479 | for a description of type specifiers. For example, | |
1480 | ||
1481 | @example | |
39a58b5b | 1482 | (cl-typecase x |
4009494e GM |
1483 | (integer (munch-integer x)) |
1484 | (float (munch-float x)) | |
1485 | (string (munch-integer (string-to-int x))) | |
1486 | (t (munch-anything x))) | |
1487 | @end example | |
1488 | ||
1489 | The type specifier @code{t} matches any type of object; the word | |
1490 | @code{otherwise} is also allowed. To make one clause match any of | |
1491 | several types, use an @code{(or ...)} type specifier. | |
e1117425 | 1492 | @end defmac |
4009494e | 1493 | |
e1117425 | 1494 | @defmac cl-etypecase keyform clause@dots{} |
39a58b5b | 1495 | This macro is just like @code{cl-typecase}, except that if the key does |
4009494e GM |
1496 | not match any of the clauses, an error is signaled rather than |
1497 | simply returning @code{nil}. | |
e1117425 | 1498 | @end defmac |
4009494e | 1499 | |
1d5b82ef | 1500 | @node Blocks and Exits |
4009494e GM |
1501 | @section Blocks and Exits |
1502 | ||
1503 | @noindent | |
1504 | Common Lisp @dfn{blocks} provide a non-local exit mechanism very | |
1505 | similar to @code{catch} and @code{throw}, but lexically rather than | |
39a58b5b | 1506 | dynamically scoped. This package actually implements @code{cl-block} |
4009494e GM |
1507 | in terms of @code{catch}; however, the lexical scoping allows the |
1508 | optimizing byte-compiler to omit the costly @code{catch} step if the | |
39a58b5b | 1509 | body of the block does not actually @code{cl-return-from} the block. |
4009494e | 1510 | |
e1117425 | 1511 | @defmac cl-block name forms@dots{} |
4009494e | 1512 | The @var{forms} are evaluated as if by a @code{progn}. However, |
39a58b5b GM |
1513 | if any of the @var{forms} execute @code{(cl-return-from @var{name})}, |
1514 | they will jump out and return directly from the @code{cl-block} form. | |
1515 | The @code{cl-block} returns the result of the last @var{form} unless | |
1516 | a @code{cl-return-from} occurs. | |
4009494e | 1517 | |
39a58b5b | 1518 | The @code{cl-block}/@code{cl-return-from} mechanism is quite similar to |
4009494e GM |
1519 | the @code{catch}/@code{throw} mechanism. The main differences are |
1520 | that block @var{name}s are unevaluated symbols, rather than forms | |
1521 | (such as quoted symbols) which evaluate to a tag at run-time; and | |
1522 | also that blocks are lexically scoped whereas @code{catch}/@code{throw} | |
1523 | are dynamically scoped. This means that functions called from the | |
1524 | body of a @code{catch} can also @code{throw} to the @code{catch}, | |
39a58b5b | 1525 | but the @code{cl-return-from} referring to a block name must appear |
4009494e GM |
1526 | physically within the @var{forms} that make up the body of the block. |
1527 | They may not appear within other called functions, although they may | |
1528 | appear within macro expansions or @code{lambda}s in the body. Block | |
1529 | names and @code{catch} names form independent name-spaces. | |
1530 | ||
1531 | In true Common Lisp, @code{defun} and @code{defmacro} surround | |
1532 | the function or expander bodies with implicit blocks with the | |
1533 | same name as the function or macro. This does not occur in Emacs | |
39a58b5b | 1534 | Lisp, but this package provides @code{cl-defun} and @code{cl-defmacro} |
4009494e GM |
1535 | forms which do create the implicit block. |
1536 | ||
1537 | The Common Lisp looping constructs defined by this package, | |
39a58b5b | 1538 | such as @code{cl-loop} and @code{cl-dolist}, also create implicit blocks |
4009494e GM |
1539 | just as in Common Lisp. |
1540 | ||
1541 | Because they are implemented in terms of Emacs Lisp @code{catch} | |
1542 | and @code{throw}, blocks have the same overhead as actual | |
1543 | @code{catch} constructs (roughly two function calls). However, | |
1544 | the optimizing byte compiler will optimize away the @code{catch} | |
1545 | if the block does | |
39a58b5b GM |
1546 | not in fact contain any @code{cl-return} or @code{cl-return-from} calls |
1547 | that jump to it. This means that @code{cl-do} loops and @code{cl-defun} | |
1548 | functions which don't use @code{cl-return} don't pay the overhead to | |
4009494e | 1549 | support it. |
e1117425 | 1550 | @end defmac |
4009494e | 1551 | |
e1117425 | 1552 | @defmac cl-return-from name [result] |
4009494e GM |
1553 | This macro returns from the block named @var{name}, which must be |
1554 | an (unevaluated) symbol. If a @var{result} form is specified, it | |
1555 | is evaluated to produce the result returned from the @code{block}. | |
1556 | Otherwise, @code{nil} is returned. | |
e1117425 | 1557 | @end defmac |
4009494e | 1558 | |
e1117425 | 1559 | @defmac cl-return [result] |
39a58b5b GM |
1560 | This macro is exactly like @code{(cl-return-from nil @var{result})}. |
1561 | Common Lisp loops like @code{cl-do} and @code{cl-dolist} implicitly enclose | |
4009494e | 1562 | themselves in @code{nil} blocks. |
e1117425 | 1563 | @end defmac |
4009494e | 1564 | |
1d5b82ef | 1565 | @node Iteration |
4009494e GM |
1566 | @section Iteration |
1567 | ||
1568 | @noindent | |
1569 | The macros described here provide more sophisticated, high-level | |
1570 | looping constructs to complement Emacs Lisp's basic @code{while} | |
1571 | loop. | |
1572 | ||
e1117425 | 1573 | @defmac cl-loop forms@dots{} |
8d6510b9 | 1574 | The @code{CL} package supports both the simple, old-style meaning of |
4009494e GM |
1575 | @code{loop} and the extremely powerful and flexible feature known as |
1576 | the @dfn{Loop Facility} or @dfn{Loop Macro}. This more advanced | |
1577 | facility is discussed in the following section; @pxref{Loop Facility}. | |
1578 | The simple form of @code{loop} is described here. | |
1579 | ||
39a58b5b GM |
1580 | If @code{cl-loop} is followed by zero or more Lisp expressions, |
1581 | then @code{(cl-loop @var{exprs}@dots{})} simply creates an infinite | |
4009494e GM |
1582 | loop executing the expressions over and over. The loop is |
1583 | enclosed in an implicit @code{nil} block. Thus, | |
1584 | ||
1585 | @example | |
39a58b5b | 1586 | (cl-loop (foo) (if (no-more) (return 72)) (bar)) |
4009494e GM |
1587 | @end example |
1588 | ||
1589 | @noindent | |
1590 | is exactly equivalent to | |
1591 | ||
1592 | @example | |
39a58b5b | 1593 | (cl-block nil (while t (foo) (if (no-more) (return 72)) (bar))) |
4009494e GM |
1594 | @end example |
1595 | ||
1596 | If any of the expressions are plain symbols, the loop is instead | |
1597 | interpreted as a Loop Macro specification as described later. | |
1598 | (This is not a restriction in practice, since a plain symbol | |
1599 | in the above notation would simply access and throw away the | |
1600 | value of a variable.) | |
e1117425 | 1601 | @end defmac |
4009494e | 1602 | |
e1117425 | 1603 | @defmac cl-do (spec@dots{}) (end-test [result@dots{}]) forms@dots{} |
4009494e GM |
1604 | This macro creates a general iterative loop. Each @var{spec} is |
1605 | of the form | |
1606 | ||
1607 | @example | |
1608 | (@var{var} [@var{init} [@var{step}]]) | |
1609 | @end example | |
1610 | ||
1611 | The loop works as follows: First, each @var{var} is bound to the | |
1612 | associated @var{init} value as if by a @code{let} form. Then, in | |
1613 | each iteration of the loop, the @var{end-test} is evaluated; if | |
1614 | true, the loop is finished. Otherwise, the body @var{forms} are | |
1615 | evaluated, then each @var{var} is set to the associated @var{step} | |
8d6510b9 | 1616 | expression (as if by a @code{cl-psetq} form) and the next iteration |
4009494e GM |
1617 | begins. Once the @var{end-test} becomes true, the @var{result} |
1618 | forms are evaluated (with the @var{var}s still bound to their | |
a05cb6e3 | 1619 | values) to produce the result returned by @code{cl-do}. |
4009494e | 1620 | |
39a58b5b GM |
1621 | The entire @code{cl-do} loop is enclosed in an implicit @code{nil} |
1622 | block, so that you can use @code{(cl-return)} to break out of the | |
4009494e GM |
1623 | loop at any time. |
1624 | ||
1625 | If there are no @var{result} forms, the loop returns @code{nil}. | |
1626 | If a given @var{var} has no @var{step} form, it is bound to its | |
a05cb6e3 | 1627 | @var{init} value but not otherwise modified during the @code{cl-do} |
4009494e GM |
1628 | loop (unless the code explicitly modifies it); this case is just |
1629 | a shorthand for putting a @code{(let ((@var{var} @var{init})) @dots{})} | |
1630 | around the loop. If @var{init} is also omitted it defaults to | |
1631 | @code{nil}, and in this case a plain @samp{@var{var}} can be used | |
1632 | in place of @samp{(@var{var})}, again following the analogy with | |
1633 | @code{let}. | |
1634 | ||
1635 | This example (from Steele) illustrates a loop which applies the | |
1636 | function @code{f} to successive pairs of values from the lists | |
1637 | @code{foo} and @code{bar}; it is equivalent to the call | |
39a58b5b | 1638 | @code{(cl-mapcar 'f foo bar)}. Note that this loop has no body |
4009494e GM |
1639 | @var{forms} at all, performing all its work as side effects of |
1640 | the rest of the loop. | |
1641 | ||
1642 | @example | |
39a58b5b GM |
1643 | (cl-do ((x foo (cdr x)) |
1644 | (y bar (cdr y)) | |
1645 | (z nil (cons (f (car x) (car y)) z))) | |
1646 | ((or (null x) (null y)) | |
1647 | (nreverse z))) | |
4009494e | 1648 | @end example |
e1117425 | 1649 | @end defmac |
4009494e | 1650 | |
e1117425 | 1651 | @defmac cl-do* (spec@dots{}) (end-test [result@dots{}]) forms@dots{} |
39a58b5b | 1652 | This is to @code{cl-do} what @code{let*} is to @code{let}. In |
4009494e GM |
1653 | particular, the initial values are bound as if by @code{let*} |
1654 | rather than @code{let}, and the steps are assigned as if by | |
8d6510b9 | 1655 | @code{setq} rather than @code{cl-psetq}. |
4009494e GM |
1656 | |
1657 | Here is another way to write the above loop: | |
1658 | ||
1659 | @example | |
39a58b5b GM |
1660 | (cl-do* ((xp foo (cdr xp)) |
1661 | (yp bar (cdr yp)) | |
1662 | (x (car xp) (car xp)) | |
1663 | (y (car yp) (car yp)) | |
1664 | z) | |
4009494e GM |
1665 | ((or (null xp) (null yp)) |
1666 | (nreverse z)) | |
1667 | (push (f x y) z)) | |
1668 | @end example | |
e1117425 | 1669 | @end defmac |
4009494e | 1670 | |
e1117425 | 1671 | @defmac cl-dolist (var list [result]) forms@dots{} |
4009494e GM |
1672 | This is a more specialized loop which iterates across the elements |
1673 | of a list. @var{list} should evaluate to a list; the body @var{forms} | |
1674 | are executed with @var{var} bound to each element of the list in | |
1675 | turn. Finally, the @var{result} form (or @code{nil}) is evaluated | |
1676 | with @var{var} bound to @code{nil} to produce the result returned by | |
677c1109 | 1677 | the loop. Unlike with Emacs's built in @code{dolist}, the loop is |
4009494e | 1678 | surrounded by an implicit @code{nil} block. |
e1117425 | 1679 | @end defmac |
4009494e | 1680 | |
e1117425 | 1681 | @defmac cl-dotimes (var count [result]) forms@dots{} |
4009494e GM |
1682 | This is a more specialized loop which iterates a specified number |
1683 | of times. The body is executed with @var{var} bound to the integers | |
1684 | from zero (inclusive) to @var{count} (exclusive), in turn. Then | |
1685 | the @code{result} form is evaluated with @var{var} bound to the total | |
1686 | number of iterations that were done (i.e., @code{(max 0 @var{count})}) | |
677c1109 | 1687 | to get the return value for the loop form. Unlike with Emacs's built in |
4009494e | 1688 | @code{dolist}, the loop is surrounded by an implicit @code{nil} block. |
e1117425 | 1689 | @end defmac |
4009494e | 1690 | |
e1117425 | 1691 | @defmac cl-do-symbols (var [obarray [result]]) forms@dots{} |
4009494e GM |
1692 | This loop iterates over all interned symbols. If @var{obarray} |
1693 | is specified and is not @code{nil}, it loops over all symbols in | |
1694 | that obarray. For each symbol, the body @var{forms} are evaluated | |
1695 | with @var{var} bound to that symbol. The symbols are visited in | |
1696 | an unspecified order. Afterward the @var{result} form, if any, | |
1697 | is evaluated (with @var{var} bound to @code{nil}) to get the return | |
1698 | value. The loop is surrounded by an implicit @code{nil} block. | |
e1117425 | 1699 | @end defmac |
4009494e | 1700 | |
e1117425 | 1701 | @defmac cl-do-all-symbols (var [result]) forms@dots{} |
39a58b5b | 1702 | This is identical to @code{cl-do-symbols} except that the @var{obarray} |
4009494e | 1703 | argument is omitted; it always iterates over the default obarray. |
e1117425 | 1704 | @end defmac |
4009494e GM |
1705 | |
1706 | @xref{Mapping over Sequences}, for some more functions for | |
1707 | iterating over vectors or lists. | |
1708 | ||
1d5b82ef | 1709 | @node Loop Facility |
4009494e GM |
1710 | @section Loop Facility |
1711 | ||
1712 | @noindent | |
1713 | A common complaint with Lisp's traditional looping constructs is | |
1714 | that they are either too simple and limited, such as Common Lisp's | |
1715 | @code{dotimes} or Emacs Lisp's @code{while}, or too unreadable and | |
1716 | obscure, like Common Lisp's @code{do} loop. | |
1717 | ||
1718 | To remedy this, recent versions of Common Lisp have added a new | |
a05cb6e3 | 1719 | construct called the ``Loop Facility'' or ``@code{loop} macro'', |
4009494e GM |
1720 | with an easy-to-use but very powerful and expressive syntax. |
1721 | ||
1722 | @menu | |
39a58b5b GM |
1723 | * Loop Basics:: @code{cl-loop} macro, basic clause structure. |
1724 | * Loop Examples:: Working examples of @code{cl-loop} macro. | |
8d6510b9 | 1725 | * For Clauses:: Clauses introduced by @code{for} or @code{as}. |
53eced6d GM |
1726 | * Iteration Clauses:: @code{repeat}, @code{while}, @code{thereis}, etc. |
1727 | * Accumulation Clauses:: @code{collect}, @code{sum}, @code{maximize}, etc. | |
8d6510b9 | 1728 | * Other Clauses:: @code{with}, @code{if}, @code{initially}, @code{finally}. |
4009494e GM |
1729 | @end menu |
1730 | ||
1d5b82ef | 1731 | @node Loop Basics |
4009494e GM |
1732 | @subsection Loop Basics |
1733 | ||
1734 | @noindent | |
39a58b5b | 1735 | The @code{cl-loop} macro essentially creates a mini-language within |
4009494e GM |
1736 | Lisp that is specially tailored for describing loops. While this |
1737 | language is a little strange-looking by the standards of regular Lisp, | |
1738 | it turns out to be very easy to learn and well-suited to its purpose. | |
1739 | ||
39a58b5b GM |
1740 | Since @code{cl-loop} is a macro, all parsing of the loop language |
1741 | takes place at byte-compile time; compiled @code{cl-loop}s are just | |
4009494e GM |
1742 | as efficient as the equivalent @code{while} loops written longhand. |
1743 | ||
e1117425 | 1744 | @defmac cl-loop clauses@dots{} |
4009494e GM |
1745 | A loop construct consists of a series of @var{clause}s, each |
1746 | introduced by a symbol like @code{for} or @code{do}. Clauses | |
39a58b5b | 1747 | are simply strung together in the argument list of @code{cl-loop}, |
4009494e GM |
1748 | with minimal extra parentheses. The various types of clauses |
1749 | specify initializations, such as the binding of temporary | |
1750 | variables, actions to be taken in the loop, stepping actions, | |
1751 | and final cleanup. | |
1752 | ||
1753 | Common Lisp specifies a certain general order of clauses in a | |
1754 | loop: | |
1755 | ||
1756 | @example | |
39a58b5b GM |
1757 | (cl-loop @var{name-clause} |
1758 | @var{var-clauses}@dots{} | |
1759 | @var{action-clauses}@dots{}) | |
4009494e GM |
1760 | @end example |
1761 | ||
1762 | The @var{name-clause} optionally gives a name to the implicit | |
1763 | block that surrounds the loop. By default, the implicit block | |
1764 | is named @code{nil}. The @var{var-clauses} specify what | |
1765 | variables should be bound during the loop, and how they should | |
1766 | be modified or iterated throughout the course of the loop. The | |
1767 | @var{action-clauses} are things to be done during the loop, such | |
1768 | as computing, collecting, and returning values. | |
1769 | ||
39a58b5b | 1770 | The Emacs version of the @code{cl-loop} macro is less restrictive about |
4009494e GM |
1771 | the order of clauses, but things will behave most predictably if |
1772 | you put the variable-binding clauses @code{with}, @code{for}, and | |
1773 | @code{repeat} before the action clauses. As in Common Lisp, | |
1774 | @code{initially} and @code{finally} clauses can go anywhere. | |
1775 | ||
1776 | Loops generally return @code{nil} by default, but you can cause | |
1777 | them to return a value by using an accumulation clause like | |
1778 | @code{collect}, an end-test clause like @code{always}, or an | |
1779 | explicit @code{return} clause to jump out of the implicit block. | |
1780 | (Because the loop body is enclosed in an implicit block, you can | |
a05cb6e3 | 1781 | also use regular Lisp @code{cl-return} or @code{cl-return-from} to |
4009494e | 1782 | break out of the loop.) |
e1117425 | 1783 | @end defmac |
4009494e GM |
1784 | |
1785 | The following sections give some examples of the Loop Macro in | |
1786 | action, and describe the particular loop clauses in great detail. | |
1787 | Consult the second edition of Steele's @dfn{Common Lisp, the Language}, | |
1788 | for additional discussion and examples of the @code{loop} macro. | |
1789 | ||
1d5b82ef | 1790 | @node Loop Examples |
4009494e GM |
1791 | @subsection Loop Examples |
1792 | ||
1793 | @noindent | |
1794 | Before listing the full set of clauses that are allowed, let's | |
39a58b5b | 1795 | look at a few example loops just to get a feel for the @code{cl-loop} |
4009494e GM |
1796 | language. |
1797 | ||
1798 | @example | |
39a58b5b GM |
1799 | (cl-loop for buf in (buffer-list) |
1800 | collect (buffer-file-name buf)) | |
4009494e GM |
1801 | @end example |
1802 | ||
1803 | @noindent | |
1804 | This loop iterates over all Emacs buffers, using the list | |
a05cb6e3 | 1805 | returned by @code{buffer-list}. For each buffer @var{buf}, |
4009494e | 1806 | it calls @code{buffer-file-name} and collects the results into |
39a58b5b | 1807 | a list, which is then returned from the @code{cl-loop} construct. |
4009494e | 1808 | The result is a list of the file names of all the buffers in |
44e97401 | 1809 | Emacs's memory. The words @code{for}, @code{in}, and @code{collect} |
39a58b5b | 1810 | are reserved words in the @code{cl-loop} language. |
4009494e GM |
1811 | |
1812 | @example | |
39a58b5b | 1813 | (cl-loop repeat 20 do (insert "Yowsa\n")) |
4009494e GM |
1814 | @end example |
1815 | ||
1816 | @noindent | |
1817 | This loop inserts the phrase ``Yowsa'' twenty times in the | |
1818 | current buffer. | |
1819 | ||
1820 | @example | |
39a58b5b | 1821 | (cl-loop until (eobp) do (munch-line) (forward-line 1)) |
4009494e GM |
1822 | @end example |
1823 | ||
1824 | @noindent | |
1825 | This loop calls @code{munch-line} on every line until the end | |
1826 | of the buffer. If point is already at the end of the buffer, | |
1827 | the loop exits immediately. | |
1828 | ||
1829 | @example | |
39a58b5b | 1830 | (cl-loop do (munch-line) until (eobp) do (forward-line 1)) |
4009494e GM |
1831 | @end example |
1832 | ||
1833 | @noindent | |
1834 | This loop is similar to the above one, except that @code{munch-line} | |
1835 | is always called at least once. | |
1836 | ||
1837 | @example | |
39a58b5b GM |
1838 | (cl-loop for x from 1 to 100 |
1839 | for y = (* x x) | |
1840 | until (>= y 729) | |
1841 | finally return (list x (= y 729))) | |
4009494e GM |
1842 | @end example |
1843 | ||
1844 | @noindent | |
1845 | This more complicated loop searches for a number @code{x} whose | |
1846 | square is 729. For safety's sake it only examines @code{x} | |
1847 | values up to 100; dropping the phrase @samp{to 100} would | |
1848 | cause the loop to count upwards with no limit. The second | |
1849 | @code{for} clause defines @code{y} to be the square of @code{x} | |
1850 | within the loop; the expression after the @code{=} sign is | |
1851 | reevaluated each time through the loop. The @code{until} | |
1852 | clause gives a condition for terminating the loop, and the | |
1853 | @code{finally} clause says what to do when the loop finishes. | |
1854 | (This particular example was written less concisely than it | |
1855 | could have been, just for the sake of illustration.) | |
1856 | ||
1857 | Note that even though this loop contains three clauses (two | |
1858 | @code{for}s and an @code{until}) that would have been enough to | |
1859 | define loops all by themselves, it still creates a single loop | |
1860 | rather than some sort of triple-nested loop. You must explicitly | |
39a58b5b | 1861 | nest your @code{cl-loop} constructs if you want nested loops. |
4009494e | 1862 | |
1d5b82ef | 1863 | @node For Clauses |
4009494e GM |
1864 | @subsection For Clauses |
1865 | ||
1866 | @noindent | |
1867 | Most loops are governed by one or more @code{for} clauses. | |
1868 | A @code{for} clause simultaneously describes variables to be | |
1869 | bound, how those variables are to be stepped during the loop, | |
1870 | and usually an end condition based on those variables. | |
1871 | ||
1872 | The word @code{as} is a synonym for the word @code{for}. This | |
1873 | word is followed by a variable name, then a word like @code{from} | |
1874 | or @code{across} that describes the kind of iteration desired. | |
1875 | In Common Lisp, the phrase @code{being the} sometimes precedes | |
1876 | the type of iteration; in this package both @code{being} and | |
1877 | @code{the} are optional. The word @code{each} is a synonym | |
1878 | for @code{the}, and the word that follows it may be singular | |
1879 | or plural: @samp{for x being the elements of y} or | |
1880 | @samp{for x being each element of y}. Which form you use | |
1881 | is purely a matter of style. | |
1882 | ||
1883 | The variable is bound around the loop as if by @code{let}: | |
1884 | ||
1885 | @example | |
1886 | (setq i 'happy) | |
39a58b5b | 1887 | (cl-loop for i from 1 to 10 do (do-something-with i)) |
4009494e GM |
1888 | i |
1889 | @result{} happy | |
1890 | @end example | |
1891 | ||
1892 | @table @code | |
1893 | @item for @var{var} from @var{expr1} to @var{expr2} by @var{expr3} | |
1894 | This type of @code{for} clause creates a counting loop. Each of | |
1895 | the three sub-terms is optional, though there must be at least one | |
1896 | term so that the clause is marked as a counting clause. | |
1897 | ||
1898 | The three expressions are the starting value, the ending value, and | |
1899 | the step value, respectively, of the variable. The loop counts | |
1900 | upwards by default (@var{expr3} must be positive), from @var{expr1} | |
1901 | to @var{expr2} inclusively. If you omit the @code{from} term, the | |
1902 | loop counts from zero; if you omit the @code{to} term, the loop | |
1903 | counts forever without stopping (unless stopped by some other | |
1904 | loop clause, of course); if you omit the @code{by} term, the loop | |
1905 | counts in steps of one. | |
1906 | ||
1907 | You can replace the word @code{from} with @code{upfrom} or | |
1908 | @code{downfrom} to indicate the direction of the loop. Likewise, | |
1909 | you can replace @code{to} with @code{upto} or @code{downto}. | |
1910 | For example, @samp{for x from 5 downto 1} executes five times | |
1911 | with @code{x} taking on the integers from 5 down to 1 in turn. | |
1912 | Also, you can replace @code{to} with @code{below} or @code{above}, | |
1913 | which are like @code{upto} and @code{downto} respectively except | |
1914 | that they are exclusive rather than inclusive limits: | |
1915 | ||
1916 | @example | |
39a58b5b GM |
1917 | (cl-loop for x to 10 collect x) |
1918 | @result{} (0 1 2 3 4 5 6 7 8 9 10) | |
1919 | (cl-loop for x below 10 collect x) | |
1920 | @result{} (0 1 2 3 4 5 6 7 8 9) | |
4009494e GM |
1921 | @end example |
1922 | ||
1923 | The @code{by} value is always positive, even for downward-counting | |
1924 | loops. Some sort of @code{from} value is required for downward | |
1925 | loops; @samp{for x downto 5} is not a valid loop clause all by | |
1926 | itself. | |
1927 | ||
1928 | @item for @var{var} in @var{list} by @var{function} | |
1929 | This clause iterates @var{var} over all the elements of @var{list}, | |
1930 | in turn. If you specify the @code{by} term, then @var{function} | |
1931 | is used to traverse the list instead of @code{cdr}; it must be a | |
1932 | function taking one argument. For example: | |
1933 | ||
1934 | @example | |
39a58b5b GM |
1935 | (cl-loop for x in '(1 2 3 4 5 6) collect (* x x)) |
1936 | @result{} (1 4 9 16 25 36) | |
1937 | (cl-loop for x in '(1 2 3 4 5 6) by 'cddr collect (* x x)) | |
1938 | @result{} (1 9 25) | |
4009494e GM |
1939 | @end example |
1940 | ||
1941 | @item for @var{var} on @var{list} by @var{function} | |
1942 | This clause iterates @var{var} over all the cons cells of @var{list}. | |
1943 | ||
1944 | @example | |
39a58b5b GM |
1945 | (cl-loop for x on '(1 2 3 4) collect x) |
1946 | @result{} ((1 2 3 4) (2 3 4) (3 4) (4)) | |
4009494e GM |
1947 | @end example |
1948 | ||
1949 | With @code{by}, there is no real reason that the @code{on} expression | |
1950 | must be a list. For example: | |
1951 | ||
1952 | @example | |
39a58b5b | 1953 | (cl-loop for x on first-animal by 'next-animal collect x) |
4009494e GM |
1954 | @end example |
1955 | ||
1956 | @noindent | |
1957 | where @code{(next-animal x)} takes an ``animal'' @var{x} and returns | |
1958 | the next in the (assumed) sequence of animals, or @code{nil} if | |
1959 | @var{x} was the last animal in the sequence. | |
1960 | ||
1961 | @item for @var{var} in-ref @var{list} by @var{function} | |
1962 | This is like a regular @code{in} clause, but @var{var} becomes | |
1963 | a @code{setf}-able ``reference'' onto the elements of the list | |
1964 | rather than just a temporary variable. For example, | |
1965 | ||
1966 | @example | |
39a58b5b | 1967 | (cl-loop for x in-ref my-list do (cl-incf x)) |
4009494e GM |
1968 | @end example |
1969 | ||
1970 | @noindent | |
1971 | increments every element of @code{my-list} in place. This clause | |
1972 | is an extension to standard Common Lisp. | |
1973 | ||
1974 | @item for @var{var} across @var{array} | |
1975 | This clause iterates @var{var} over all the elements of @var{array}, | |
1976 | which may be a vector or a string. | |
1977 | ||
1978 | @example | |
39a58b5b GM |
1979 | (cl-loop for x across "aeiou" |
1980 | do (use-vowel (char-to-string x))) | |
4009494e GM |
1981 | @end example |
1982 | ||
1983 | @item for @var{var} across-ref @var{array} | |
1984 | This clause iterates over an array, with @var{var} a @code{setf}-able | |
1985 | reference onto the elements; see @code{in-ref} above. | |
1986 | ||
1987 | @item for @var{var} being the elements of @var{sequence} | |
1988 | This clause iterates over the elements of @var{sequence}, which may | |
1989 | be a list, vector, or string. Since the type must be determined | |
1990 | at run-time, this is somewhat less efficient than @code{in} or | |
1991 | @code{across}. The clause may be followed by the additional term | |
1992 | @samp{using (index @var{var2})} to cause @var{var2} to be bound to | |
1993 | the successive indices (starting at 0) of the elements. | |
1994 | ||
1995 | This clause type is taken from older versions of the @code{loop} macro, | |
1996 | and is not present in modern Common Lisp. The @samp{using (sequence ...)} | |
1997 | term of the older macros is not supported. | |
1998 | ||
1999 | @item for @var{var} being the elements of-ref @var{sequence} | |
2000 | This clause iterates over a sequence, with @var{var} a @code{setf}-able | |
2001 | reference onto the elements; see @code{in-ref} above. | |
2002 | ||
2003 | @item for @var{var} being the symbols [of @var{obarray}] | |
2004 | This clause iterates over symbols, either over all interned symbols | |
2005 | or over all symbols in @var{obarray}. The loop is executed with | |
2006 | @var{var} bound to each symbol in turn. The symbols are visited in | |
2007 | an unspecified order. | |
2008 | ||
2009 | As an example, | |
2010 | ||
2011 | @example | |
39a58b5b GM |
2012 | (cl-loop for sym being the symbols |
2013 | when (fboundp sym) | |
2014 | when (string-match "^map" (symbol-name sym)) | |
2015 | collect sym) | |
4009494e GM |
2016 | @end example |
2017 | ||
2018 | @noindent | |
2019 | returns a list of all the functions whose names begin with @samp{map}. | |
2020 | ||
2021 | The Common Lisp words @code{external-symbols} and @code{present-symbols} | |
2022 | are also recognized but are equivalent to @code{symbols} in Emacs Lisp. | |
2023 | ||
2024 | Due to a minor implementation restriction, it will not work to have | |
2025 | more than one @code{for} clause iterating over symbols, hash tables, | |
39a58b5b | 2026 | keymaps, overlays, or intervals in a given @code{cl-loop}. Fortunately, |
4009494e GM |
2027 | it would rarely if ever be useful to do so. It @emph{is} valid to mix |
2028 | one of these types of clauses with other clauses like @code{for ... to} | |
2029 | or @code{while}. | |
2030 | ||
2031 | @item for @var{var} being the hash-keys of @var{hash-table} | |
79414ae4 KR |
2032 | @itemx for @var{var} being the hash-values of @var{hash-table} |
2033 | This clause iterates over the entries in @var{hash-table} with | |
2034 | @var{var} bound to each key, or value. A @samp{using} clause can bind | |
2035 | a second variable to the opposite part. | |
2036 | ||
2037 | @example | |
39a58b5b GM |
2038 | (cl-loop for k being the hash-keys of h |
2039 | using (hash-values v) | |
2040 | do | |
2041 | (message "key %S -> value %S" k v)) | |
79414ae4 | 2042 | @end example |
4009494e GM |
2043 | |
2044 | @item for @var{var} being the key-codes of @var{keymap} | |
79414ae4 | 2045 | @itemx for @var{var} being the key-bindings of @var{keymap} |
4009494e | 2046 | This clause iterates over the entries in @var{keymap}. |
36374111 SM |
2047 | The iteration does not enter nested keymaps but does enter inherited |
2048 | (parent) keymaps. | |
79414ae4 KR |
2049 | A @code{using} clause can access both the codes and the bindings |
2050 | together. | |
2051 | ||
2052 | @example | |
39a58b5b GM |
2053 | (cl-loop for c being the key-codes of (current-local-map) |
2054 | using (key-bindings b) | |
2055 | do | |
2056 | (message "key %S -> binding %S" c b)) | |
79414ae4 KR |
2057 | @end example |
2058 | ||
4009494e GM |
2059 | |
2060 | @item for @var{var} being the key-seqs of @var{keymap} | |
2061 | This clause iterates over all key sequences defined by @var{keymap} | |
2062 | and its nested keymaps, where @var{var} takes on values which are | |
2063 | vectors. The strings or vectors | |
2064 | are reused for each iteration, so you must copy them if you wish to keep | |
2065 | them permanently. You can add a @samp{using (key-bindings ...)} | |
2066 | clause to get the command bindings as well. | |
2067 | ||
2068 | @item for @var{var} being the overlays [of @var{buffer}] @dots{} | |
2069 | This clause iterates over the ``overlays'' of a buffer | |
2070 | (the clause @code{extents} is synonymous | |
2071 | with @code{overlays}). If the @code{of} term is omitted, the current | |
2072 | buffer is used. | |
2073 | This clause also accepts optional @samp{from @var{pos}} and | |
2074 | @samp{to @var{pos}} terms, limiting the clause to overlays which | |
2075 | overlap the specified region. | |
2076 | ||
2077 | @item for @var{var} being the intervals [of @var{buffer}] @dots{} | |
2078 | This clause iterates over all intervals of a buffer with constant | |
2079 | text properties. The variable @var{var} will be bound to conses | |
2080 | of start and end positions, where one start position is always equal | |
2081 | to the previous end position. The clause allows @code{of}, | |
2082 | @code{from}, @code{to}, and @code{property} terms, where the latter | |
2083 | term restricts the search to just the specified property. The | |
2084 | @code{of} term may specify either a buffer or a string. | |
2085 | ||
2086 | @item for @var{var} being the frames | |
7dde1a86 GM |
2087 | This clause iterates over all Emacs frames. The clause @code{screens} is |
2088 | a synonym for @code{frames}. The frames are visited in | |
2089 | @code{next-frame} order starting from @code{selected-frame}. | |
4009494e GM |
2090 | |
2091 | @item for @var{var} being the windows [of @var{frame}] | |
2092 | This clause iterates over the windows (in the Emacs sense) of | |
7dde1a86 GM |
2093 | the current frame, or of the specified @var{frame}. It visits windows |
2094 | in @code{next-window} order starting from @code{selected-window} | |
2095 | (or @code{frame-selected-window} if you specify @var{frame}). | |
2096 | This clause treats the minibuffer window in the same way as | |
2097 | @code{next-window} does. For greater flexibility, consider using | |
2098 | @code{walk-windows} instead. | |
4009494e GM |
2099 | |
2100 | @item for @var{var} being the buffers | |
2101 | This clause iterates over all buffers in Emacs. It is equivalent | |
2102 | to @samp{for @var{var} in (buffer-list)}. | |
2103 | ||
2104 | @item for @var{var} = @var{expr1} then @var{expr2} | |
2105 | This clause does a general iteration. The first time through | |
2106 | the loop, @var{var} will be bound to @var{expr1}. On the second | |
2107 | and successive iterations it will be set by evaluating @var{expr2} | |
2108 | (which may refer to the old value of @var{var}). For example, | |
2109 | these two loops are effectively the same: | |
2110 | ||
2111 | @example | |
39a58b5b GM |
2112 | (cl-loop for x on my-list by 'cddr do ...) |
2113 | (cl-loop for x = my-list then (cddr x) while x do ...) | |
4009494e GM |
2114 | @end example |
2115 | ||
2116 | Note that this type of @code{for} clause does not imply any sort | |
2117 | of terminating condition; the above example combines it with a | |
2118 | @code{while} clause to tell when to end the loop. | |
2119 | ||
2120 | If you omit the @code{then} term, @var{expr1} is used both for | |
2121 | the initial setting and for successive settings: | |
2122 | ||
2123 | @example | |
39a58b5b | 2124 | (cl-loop for x = (random) when (> x 0) return x) |
4009494e GM |
2125 | @end example |
2126 | ||
2127 | @noindent | |
2128 | This loop keeps taking random numbers from the @code{(random)} | |
2129 | function until it gets a positive one, which it then returns. | |
2130 | @end table | |
2131 | ||
2132 | If you include several @code{for} clauses in a row, they are | |
2133 | treated sequentially (as if by @code{let*} and @code{setq}). | |
2134 | You can instead use the word @code{and} to link the clauses, | |
2135 | in which case they are processed in parallel (as if by @code{let} | |
8d6510b9 | 2136 | and @code{cl-psetq}). |
4009494e GM |
2137 | |
2138 | @example | |
39a58b5b GM |
2139 | (cl-loop for x below 5 for y = nil then x collect (list x y)) |
2140 | @result{} ((0 nil) (1 1) (2 2) (3 3) (4 4)) | |
2141 | (cl-loop for x below 5 and y = nil then x collect (list x y)) | |
2142 | @result{} ((0 nil) (1 0) (2 1) (3 2) (4 3)) | |
4009494e GM |
2143 | @end example |
2144 | ||
2145 | @noindent | |
2146 | In the first loop, @code{y} is set based on the value of @code{x} | |
2147 | that was just set by the previous clause; in the second loop, | |
2148 | @code{x} and @code{y} are set simultaneously so @code{y} is set | |
2149 | based on the value of @code{x} left over from the previous time | |
2150 | through the loop. | |
2151 | ||
39a58b5b | 2152 | Another feature of the @code{cl-loop} macro is @dfn{destructuring}, |
4009494e GM |
2153 | similar in concept to the destructuring provided by @code{defmacro}. |
2154 | The @var{var} part of any @code{for} clause can be given as a list | |
2155 | of variables instead of a single variable. The values produced | |
2156 | during loop execution must be lists; the values in the lists are | |
2157 | stored in the corresponding variables. | |
2158 | ||
2159 | @example | |
39a58b5b GM |
2160 | (cl-loop for (x y) in '((2 3) (4 5) (6 7)) collect (+ x y)) |
2161 | @result{} (5 9 13) | |
4009494e GM |
2162 | @end example |
2163 | ||
2164 | In loop destructuring, if there are more values than variables | |
2165 | the trailing values are ignored, and if there are more variables | |
2166 | than values the trailing variables get the value @code{nil}. | |
2167 | If @code{nil} is used as a variable name, the corresponding | |
2168 | values are ignored. Destructuring may be nested, and dotted | |
c0a8ae95 KR |
2169 | lists of variables like @code{(x . y)} are allowed, so for example |
2170 | to process an alist | |
2171 | ||
2172 | @example | |
39a58b5b GM |
2173 | (cl-loop for (key . value) in '((a . 1) (b . 2)) |
2174 | collect value) | |
2175 | @result{} (1 2) | |
c0a8ae95 | 2176 | @end example |
4009494e | 2177 | |
1d5b82ef | 2178 | @node Iteration Clauses |
4009494e GM |
2179 | @subsection Iteration Clauses |
2180 | ||
2181 | @noindent | |
2182 | Aside from @code{for} clauses, there are several other loop clauses | |
2183 | that control the way the loop operates. They might be used by | |
2184 | themselves, or in conjunction with one or more @code{for} clauses. | |
2185 | ||
2186 | @table @code | |
2187 | @item repeat @var{integer} | |
2188 | This clause simply counts up to the specified number using an | |
2189 | internal temporary variable. The loops | |
2190 | ||
2191 | @example | |
39a58b5b GM |
2192 | (cl-loop repeat (1+ n) do ...) |
2193 | (cl-loop for temp to n do ...) | |
4009494e GM |
2194 | @end example |
2195 | ||
2196 | @noindent | |
2197 | are identical except that the second one forces you to choose | |
2198 | a name for a variable you aren't actually going to use. | |
2199 | ||
2200 | @item while @var{condition} | |
2201 | This clause stops the loop when the specified condition (any Lisp | |
2202 | expression) becomes @code{nil}. For example, the following two | |
2203 | loops are equivalent, except for the implicit @code{nil} block | |
2204 | that surrounds the second one: | |
2205 | ||
2206 | @example | |
2207 | (while @var{cond} @var{forms}@dots{}) | |
39a58b5b | 2208 | (cl-loop while @var{cond} do @var{forms}@dots{}) |
4009494e GM |
2209 | @end example |
2210 | ||
2211 | @item until @var{condition} | |
2212 | This clause stops the loop when the specified condition is true, | |
2213 | i.e., non-@code{nil}. | |
2214 | ||
2215 | @item always @var{condition} | |
2216 | This clause stops the loop when the specified condition is @code{nil}. | |
2217 | Unlike @code{while}, it stops the loop using @code{return nil} so that | |
2218 | the @code{finally} clauses are not executed. If all the conditions | |
2219 | were non-@code{nil}, the loop returns @code{t}: | |
2220 | ||
2221 | @example | |
39a58b5b | 2222 | (if (cl-loop for size in size-list always (> size 10)) |
4009494e GM |
2223 | (some-big-sizes) |
2224 | (no-big-sizes)) | |
2225 | @end example | |
2226 | ||
2227 | @item never @var{condition} | |
2228 | This clause is like @code{always}, except that the loop returns | |
2229 | @code{t} if any conditions were false, or @code{nil} otherwise. | |
2230 | ||
2231 | @item thereis @var{condition} | |
2232 | This clause stops the loop when the specified form is non-@code{nil}; | |
2233 | in this case, it returns that non-@code{nil} value. If all the | |
2234 | values were @code{nil}, the loop returns @code{nil}. | |
2235 | @end table | |
2236 | ||
1d5b82ef | 2237 | @node Accumulation Clauses |
4009494e GM |
2238 | @subsection Accumulation Clauses |
2239 | ||
2240 | @noindent | |
2241 | These clauses cause the loop to accumulate information about the | |
2242 | specified Lisp @var{form}. The accumulated result is returned | |
2243 | from the loop unless overridden, say, by a @code{return} clause. | |
2244 | ||
2245 | @table @code | |
2246 | @item collect @var{form} | |
2247 | This clause collects the values of @var{form} into a list. Several | |
2248 | examples of @code{collect} appear elsewhere in this manual. | |
2249 | ||
2250 | The word @code{collecting} is a synonym for @code{collect}, and | |
2251 | likewise for the other accumulation clauses. | |
2252 | ||
2253 | @item append @var{form} | |
2254 | This clause collects lists of values into a result list using | |
2255 | @code{append}. | |
2256 | ||
2257 | @item nconc @var{form} | |
2258 | This clause collects lists of values into a result list by | |
2259 | destructively modifying the lists rather than copying them. | |
2260 | ||
2261 | @item concat @var{form} | |
2262 | This clause concatenates the values of the specified @var{form} | |
2263 | into a string. (It and the following clause are extensions to | |
2264 | standard Common Lisp.) | |
2265 | ||
2266 | @item vconcat @var{form} | |
2267 | This clause concatenates the values of the specified @var{form} | |
2268 | into a vector. | |
2269 | ||
2270 | @item count @var{form} | |
2271 | This clause counts the number of times the specified @var{form} | |
2272 | evaluates to a non-@code{nil} value. | |
2273 | ||
2274 | @item sum @var{form} | |
2275 | This clause accumulates the sum of the values of the specified | |
2276 | @var{form}, which must evaluate to a number. | |
2277 | ||
2278 | @item maximize @var{form} | |
2279 | This clause accumulates the maximum value of the specified @var{form}, | |
2280 | which must evaluate to a number. The return value is undefined if | |
2281 | @code{maximize} is executed zero times. | |
2282 | ||
2283 | @item minimize @var{form} | |
2284 | This clause accumulates the minimum value of the specified @var{form}. | |
2285 | @end table | |
2286 | ||
2287 | Accumulation clauses can be followed by @samp{into @var{var}} to | |
2288 | cause the data to be collected into variable @var{var} (which is | |
2289 | automatically @code{let}-bound during the loop) rather than an | |
2290 | unnamed temporary variable. Also, @code{into} accumulations do | |
2291 | not automatically imply a return value. The loop must use some | |
2292 | explicit mechanism, such as @code{finally return}, to return | |
2293 | the accumulated result. | |
2294 | ||
2295 | It is valid for several accumulation clauses of the same type to | |
2296 | accumulate into the same place. From Steele: | |
2297 | ||
2298 | @example | |
39a58b5b GM |
2299 | (cl-loop for name in '(fred sue alice joe june) |
2300 | for kids in '((bob ken) () () (kris sunshine) ()) | |
2301 | collect name | |
2302 | append kids) | |
2303 | @result{} (fred bob ken sue alice joe kris sunshine june) | |
4009494e GM |
2304 | @end example |
2305 | ||
1d5b82ef | 2306 | @node Other Clauses |
4009494e GM |
2307 | @subsection Other Clauses |
2308 | ||
2309 | @noindent | |
2310 | This section describes the remaining loop clauses. | |
2311 | ||
2312 | @table @code | |
2313 | @item with @var{var} = @var{value} | |
2314 | This clause binds a variable to a value around the loop, but | |
2315 | otherwise leaves the variable alone during the loop. The following | |
2316 | loops are basically equivalent: | |
2317 | ||
2318 | @example | |
39a58b5b GM |
2319 | (cl-loop with x = 17 do ...) |
2320 | (let ((x 17)) (cl-loop do ...)) | |
2321 | (cl-loop for x = 17 then x do ...) | |
4009494e GM |
2322 | @end example |
2323 | ||
2324 | Naturally, the variable @var{var} might be used for some purpose | |
2325 | in the rest of the loop. For example: | |
2326 | ||
2327 | @example | |
39a58b5b GM |
2328 | (cl-loop for x in my-list with res = nil do (push x res) |
2329 | finally return res) | |
4009494e GM |
2330 | @end example |
2331 | ||
2332 | This loop inserts the elements of @code{my-list} at the front of | |
2333 | a new list being accumulated in @code{res}, then returns the | |
2334 | list @code{res} at the end of the loop. The effect is similar | |
2335 | to that of a @code{collect} clause, but the list gets reversed | |
2336 | by virtue of the fact that elements are being pushed onto the | |
2337 | front of @code{res} rather than the end. | |
2338 | ||
2339 | If you omit the @code{=} term, the variable is initialized to | |
2340 | @code{nil}. (Thus the @samp{= nil} in the above example is | |
2341 | unnecessary.) | |
2342 | ||
2343 | Bindings made by @code{with} are sequential by default, as if | |
2344 | by @code{let*}. Just like @code{for} clauses, @code{with} clauses | |
2345 | can be linked with @code{and} to cause the bindings to be made by | |
2346 | @code{let} instead. | |
2347 | ||
2348 | @item if @var{condition} @var{clause} | |
2349 | This clause executes the following loop clause only if the specified | |
2350 | condition is true. The following @var{clause} should be an accumulation, | |
2351 | @code{do}, @code{return}, @code{if}, or @code{unless} clause. | |
2352 | Several clauses may be linked by separating them with @code{and}. | |
2353 | These clauses may be followed by @code{else} and a clause or clauses | |
2354 | to execute if the condition was false. The whole construct may | |
2355 | optionally be followed by the word @code{end} (which may be used to | |
2356 | disambiguate an @code{else} or @code{and} in a nested @code{if}). | |
2357 | ||
2358 | The actual non-@code{nil} value of the condition form is available | |
2359 | by the name @code{it} in the ``then'' part. For example: | |
2360 | ||
2361 | @example | |
2362 | (setq funny-numbers '(6 13 -1)) | |
2363 | @result{} (6 13 -1) | |
39a58b5b GM |
2364 | (cl-loop for x below 10 |
2365 | if (oddp x) | |
2366 | collect x into odds | |
2367 | and if (memq x funny-numbers) return (cdr it) end | |
2368 | else | |
2369 | collect x into evens | |
2370 | finally return (vector odds evens)) | |
2371 | @result{} [(1 3 5 7 9) (0 2 4 6 8)] | |
4009494e GM |
2372 | (setq funny-numbers '(6 7 13 -1)) |
2373 | @result{} (6 7 13 -1) | |
39a58b5b GM |
2374 | (cl-loop <@r{same thing again}>) |
2375 | @result{} (13 -1) | |
4009494e GM |
2376 | @end example |
2377 | ||
2378 | Note the use of @code{and} to put two clauses into the ``then'' | |
2379 | part, one of which is itself an @code{if} clause. Note also that | |
2380 | @code{end}, while normally optional, was necessary here to make | |
2381 | it clear that the @code{else} refers to the outermost @code{if} | |
2382 | clause. In the first case, the loop returns a vector of lists | |
2383 | of the odd and even values of @var{x}. In the second case, the | |
2384 | odd number 7 is one of the @code{funny-numbers} so the loop | |
2385 | returns early; the actual returned value is based on the result | |
2386 | of the @code{memq} call. | |
2387 | ||
2388 | @item when @var{condition} @var{clause} | |
2389 | This clause is just a synonym for @code{if}. | |
2390 | ||
2391 | @item unless @var{condition} @var{clause} | |
2392 | The @code{unless} clause is just like @code{if} except that the | |
2393 | sense of the condition is reversed. | |
2394 | ||
2395 | @item named @var{name} | |
2396 | This clause gives a name other than @code{nil} to the implicit | |
2397 | block surrounding the loop. The @var{name} is the symbol to be | |
2398 | used as the block name. | |
2399 | ||
2400 | @item initially [do] @var{forms}... | |
2401 | This keyword introduces one or more Lisp forms which will be | |
2402 | executed before the loop itself begins (but after any variables | |
2403 | requested by @code{for} or @code{with} have been bound to their | |
2404 | initial values). @code{initially} clauses can appear anywhere; | |
2405 | if there are several, they are executed in the order they appear | |
2406 | in the loop. The keyword @code{do} is optional. | |
2407 | ||
2408 | @item finally [do] @var{forms}... | |
2409 | This introduces Lisp forms which will be executed after the loop | |
2410 | finishes (say, on request of a @code{for} or @code{while}). | |
2411 | @code{initially} and @code{finally} clauses may appear anywhere | |
2412 | in the loop construct, but they are executed (in the specified | |
2413 | order) at the beginning or end, respectively, of the loop. | |
2414 | ||
2415 | @item finally return @var{form} | |
2416 | This says that @var{form} should be executed after the loop | |
2417 | is done to obtain a return value. (Without this, or some other | |
2418 | clause like @code{collect} or @code{return}, the loop will simply | |
2419 | return @code{nil}.) Variables bound by @code{for}, @code{with}, | |
2420 | or @code{into} will still contain their final values when @var{form} | |
2421 | is executed. | |
2422 | ||
2423 | @item do @var{forms}... | |
2424 | The word @code{do} may be followed by any number of Lisp expressions | |
2425 | which are executed as an implicit @code{progn} in the body of the | |
2426 | loop. Many of the examples in this section illustrate the use of | |
2427 | @code{do}. | |
2428 | ||
2429 | @item return @var{form} | |
2430 | This clause causes the loop to return immediately. The following | |
2431 | Lisp form is evaluated to give the return value of the @code{loop} | |
2432 | form. The @code{finally} clauses, if any, are not executed. | |
2433 | Of course, @code{return} is generally used inside an @code{if} or | |
2434 | @code{unless}, as its use in a top-level loop clause would mean | |
2435 | the loop would never get to ``loop'' more than once. | |
2436 | ||
2437 | The clause @samp{return @var{form}} is equivalent to | |
a05cb6e3 | 2438 | @c FIXME cl-do, cl-return? |
4009494e GM |
2439 | @samp{do (return @var{form})} (or @code{return-from} if the loop |
2440 | was named). The @code{return} clause is implemented a bit more | |
2441 | efficiently, though. | |
2442 | @end table | |
2443 | ||
d55911cf GM |
2444 | While there is no high-level way to add user extensions to @code{cl-loop}, |
2445 | this package does offer two properties called @code{cl-loop-handler} | |
2446 | and @code{cl-loop-for-handler} which are functions to be called when a | |
2447 | given symbol is encountered as a top-level loop clause or @code{for} | |
2448 | clause, respectively. Consult the source code in file | |
2449 | @file{cl-macs.el} for details. | |
4009494e | 2450 | |
39a58b5b | 2451 | This package's @code{cl-loop} macro is compatible with that of Common |
4009494e GM |
2452 | Lisp, except that a few features are not implemented: @code{loop-finish} |
2453 | and data-type specifiers. Naturally, the @code{for} clauses which | |
2454 | iterate over keymaps, overlays, intervals, frames, windows, and | |
2455 | buffers are Emacs-specific extensions. | |
2456 | ||
1d5b82ef | 2457 | @node Multiple Values |
4009494e GM |
2458 | @section Multiple Values |
2459 | ||
2460 | @noindent | |
2461 | Common Lisp functions can return zero or more results. Emacs Lisp | |
2462 | functions, by contrast, always return exactly one result. This | |
2463 | package makes no attempt to emulate Common Lisp multiple return | |
2464 | values; Emacs versions of Common Lisp functions that return more | |
2465 | than one value either return just the first value (as in | |
d571e9c3 GM |
2466 | @code{cl-compiler-macroexpand}) or return a list of values. |
2467 | This package @emph{does} define placeholders | |
4009494e GM |
2468 | for the Common Lisp functions that work with multiple values, but |
2469 | in Emacs Lisp these functions simply operate on lists instead. | |
f94b04fc | 2470 | The @code{cl-values} form, for example, is a synonym for @code{list} |
4009494e GM |
2471 | in Emacs. |
2472 | ||
e1117425 | 2473 | @defmac cl-multiple-value-bind (var@dots{}) values-form forms@dots{} |
4009494e GM |
2474 | This form evaluates @var{values-form}, which must return a list of |
2475 | values. It then binds the @var{var}s to these respective values, | |
2476 | as if by @code{let}, and then executes the body @var{forms}. | |
2477 | If there are more @var{var}s than values, the extra @var{var}s | |
2478 | are bound to @code{nil}. If there are fewer @var{var}s than | |
2479 | values, the excess values are ignored. | |
e1117425 | 2480 | @end defmac |
4009494e | 2481 | |
e1117425 | 2482 | @defmac cl-multiple-value-setq (var@dots{}) form |
4009494e GM |
2483 | This form evaluates @var{form}, which must return a list of values. |
2484 | It then sets the @var{var}s to these respective values, as if by | |
2485 | @code{setq}. Extra @var{var}s or values are treated the same as | |
39a58b5b | 2486 | in @code{cl-multiple-value-bind}. |
e1117425 | 2487 | @end defmac |
4009494e | 2488 | |
4009494e GM |
2489 | Since a perfect emulation is not feasible in Emacs Lisp, this |
2490 | package opts to keep it as simple and predictable as possible. | |
2491 | ||
1d5b82ef | 2492 | @node Macros |
4009494e GM |
2493 | @chapter Macros |
2494 | ||
2495 | @noindent | |
2496 | This package implements the various Common Lisp features of | |
2497 | @code{defmacro}, such as destructuring, @code{&environment}, | |
2498 | and @code{&body}. Top-level @code{&whole} is not implemented | |
2499 | for @code{defmacro} due to technical difficulties. | |
2500 | @xref{Argument Lists}. | |
2501 | ||
2502 | Destructuring is made available to the user by way of the | |
2503 | following macro: | |
2504 | ||
e1117425 | 2505 | @defmac cl-destructuring-bind arglist expr forms@dots{} |
4009494e GM |
2506 | This macro expands to code which executes @var{forms}, with |
2507 | the variables in @var{arglist} bound to the list of values | |
2508 | returned by @var{expr}. The @var{arglist} can include all | |
2509 | the features allowed for @code{defmacro} argument lists, | |
2510 | including destructuring. (The @code{&environment} keyword | |
2511 | is not allowed.) The macro expansion will signal an error | |
2512 | if @var{expr} returns a list of the wrong number of arguments | |
2513 | or with incorrect keyword arguments. | |
e1117425 | 2514 | @end defmac |
4009494e | 2515 | |
39a58b5b | 2516 | This package also includes the Common Lisp @code{cl-define-compiler-macro} |
4009494e GM |
2517 | facility, which allows you to define compile-time expansions and |
2518 | optimizations for your functions. | |
2519 | ||
e1117425 | 2520 | @defmac cl-define-compiler-macro name arglist forms@dots{} |
4009494e GM |
2521 | This form is similar to @code{defmacro}, except that it only expands |
2522 | calls to @var{name} at compile-time; calls processed by the Lisp | |
2523 | interpreter are not expanded, nor are they expanded by the | |
2524 | @code{macroexpand} function. | |
2525 | ||
2526 | The argument list may begin with a @code{&whole} keyword and a | |
2527 | variable. This variable is bound to the macro-call form itself, | |
2528 | i.e., to a list of the form @samp{(@var{name} @var{args}@dots{})}. | |
2529 | If the macro expander returns this form unchanged, then the | |
2530 | compiler treats it as a normal function call. This allows | |
2531 | compiler macros to work as optimizers for special cases of a | |
2532 | function, leaving complicated cases alone. | |
2533 | ||
2534 | For example, here is a simplified version of a definition that | |
2535 | appears as a standard part of this package: | |
2536 | ||
2537 | @example | |
39a58b5b GM |
2538 | (cl-define-compiler-macro cl-member (&whole form a list &rest keys) |
2539 | (if (and (null keys) | |
2540 | (eq (car-safe a) 'quote) | |
2541 | (not (floatp-safe (cadr a)))) | |
2542 | (list 'memq a list) | |
2543 | form)) | |
4009494e GM |
2544 | @end example |
2545 | ||
2546 | @noindent | |
39a58b5b | 2547 | This definition causes @code{(cl-member @var{a} @var{list})} to change |
4009494e GM |
2548 | to a call to the faster @code{memq} in the common case where @var{a} |
2549 | is a non-floating-point constant; if @var{a} is anything else, or | |
2550 | if there are any keyword arguments in the call, then the original | |
39a58b5b GM |
2551 | @code{cl-member} call is left intact. (The actual compiler macro |
2552 | for @code{cl-member} optimizes a number of other cases, including | |
4009494e | 2553 | common @code{:test} predicates.) |
e1117425 | 2554 | @end defmac |
4009494e | 2555 | |
39a58b5b | 2556 | @defun cl-compiler-macroexpand form |
4009494e GM |
2557 | This function is analogous to @code{macroexpand}, except that it |
2558 | expands compiler macros rather than regular macros. It returns | |
2559 | @var{form} unchanged if it is not a call to a function for which | |
2560 | a compiler macro has been defined, or if that compiler macro | |
2561 | decided to punt by returning its @code{&whole} argument. Like | |
2562 | @code{macroexpand}, it expands repeatedly until it reaches a form | |
2563 | for which no further expansion is possible. | |
2564 | @end defun | |
2565 | ||
39a58b5b GM |
2566 | @xref{Macro Bindings}, for descriptions of the @code{cl-macrolet} |
2567 | and @code{cl-symbol-macrolet} forms for making ``local'' macro | |
4009494e GM |
2568 | definitions. |
2569 | ||
1d5b82ef | 2570 | @node Declarations |
4009494e GM |
2571 | @chapter Declarations |
2572 | ||
2573 | @noindent | |
2574 | Common Lisp includes a complex and powerful ``declaration'' | |
2575 | mechanism that allows you to give the compiler special hints | |
2576 | about the types of data that will be stored in particular variables, | |
2577 | and about the ways those variables and functions will be used. This | |
2578 | package defines versions of all the Common Lisp declaration forms: | |
39a58b5b GM |
2579 | @code{cl-declare}, @code{cl-locally}, @code{cl-proclaim}, @code{cl-declaim}, |
2580 | and @code{cl-the}. | |
4009494e GM |
2581 | |
2582 | Most of the Common Lisp declarations are not currently useful in | |
2583 | Emacs Lisp, as the byte-code system provides little opportunity | |
2584 | to benefit from type information, and @code{special} declarations | |
2585 | are redundant in a fully dynamically-scoped Lisp. A few | |
2586 | declarations are meaningful when the optimizing byte | |
2587 | compiler is being used, however. Under the earlier non-optimizing | |
2588 | compiler, these declarations will effectively be ignored. | |
2589 | ||
39a58b5b | 2590 | @defun cl-proclaim decl-spec |
4009494e | 2591 | This function records a ``global'' declaration specified by |
39a58b5b | 2592 | @var{decl-spec}. Since @code{cl-proclaim} is a function, @var{decl-spec} |
4009494e GM |
2593 | is evaluated and thus should normally be quoted. |
2594 | @end defun | |
2595 | ||
e1117425 | 2596 | @defmac cl-declaim decl-specs@dots{} |
39a58b5b | 2597 | This macro is like @code{cl-proclaim}, except that it takes any number |
4009494e | 2598 | of @var{decl-spec} arguments, and the arguments are unevaluated and |
39a58b5b | 2599 | unquoted. The @code{cl-declaim} macro also puts an @code{(cl-eval-when |
4009494e GM |
2600 | (compile load eval) ...)} around the declarations so that they will |
2601 | be registered at compile-time as well as at run-time. (This is vital, | |
2602 | since normally the declarations are meant to influence the way the | |
39a58b5b | 2603 | compiler treats the rest of the file that contains the @code{cl-declaim} |
4009494e | 2604 | form.) |
e1117425 | 2605 | @end defmac |
4009494e | 2606 | |
e1117425 | 2607 | @defmac cl-declare decl-specs@dots{} |
4009494e GM |
2608 | This macro is used to make declarations within functions and other |
2609 | code. Common Lisp allows declarations in various locations, generally | |
2610 | at the beginning of any of the many ``implicit @code{progn}s'' | |
2611 | throughout Lisp syntax, such as function bodies, @code{let} bodies, | |
39a58b5b | 2612 | etc. Currently the only declaration understood by @code{cl-declare} |
4009494e | 2613 | is @code{special}. |
e1117425 | 2614 | @end defmac |
4009494e | 2615 | |
e1117425 | 2616 | @defmac cl-locally declarations@dots{} forms@dots{} |
39a58b5b | 2617 | In this package, @code{cl-locally} is no different from @code{progn}. |
e1117425 | 2618 | @end defmac |
4009494e | 2619 | |
e1117425 | 2620 | @defmac cl-the type form |
39a58b5b GM |
2621 | Type information provided by @code{cl-the} is ignored in this package; |
2622 | in other words, @code{(cl-the @var{type} @var{form})} is equivalent | |
4009494e GM |
2623 | to @var{form}. Future versions of the optimizing byte-compiler may |
2624 | make use of this information. | |
2625 | ||
2626 | For example, @code{mapcar} can map over both lists and arrays. It is | |
2627 | hard for the compiler to expand @code{mapcar} into an in-line loop | |
2628 | unless it knows whether the sequence will be a list or an array ahead | |
39a58b5b | 2629 | of time. With @code{(mapcar 'car (cl-the vector foo))}, a future |
4009494e GM |
2630 | compiler would have enough information to expand the loop in-line. |
2631 | For now, Emacs Lisp will treat the above code as exactly equivalent | |
2632 | to @code{(mapcar 'car foo)}. | |
e1117425 | 2633 | @end defmac |
4009494e | 2634 | |
39a58b5b GM |
2635 | Each @var{decl-spec} in a @code{cl-proclaim}, @code{cl-declaim}, or |
2636 | @code{cl-declare} should be a list beginning with a symbol that says | |
4009494e GM |
2637 | what kind of declaration it is. This package currently understands |
2638 | @code{special}, @code{inline}, @code{notinline}, @code{optimize}, | |
2639 | and @code{warn} declarations. (The @code{warn} declaration is an | |
2640 | extension of standard Common Lisp.) Other Common Lisp declarations, | |
2641 | such as @code{type} and @code{ftype}, are silently ignored. | |
2642 | ||
2643 | @table @code | |
2644 | @item special | |
2645 | Since all variables in Emacs Lisp are ``special'' (in the Common | |
2646 | Lisp sense), @code{special} declarations are only advisory. They | |
2647 | simply tell the optimizing byte compiler that the specified | |
2648 | variables are intentionally being referred to without being | |
2649 | bound in the body of the function. The compiler normally emits | |
2650 | warnings for such references, since they could be typographical | |
2651 | errors for references to local variables. | |
2652 | ||
39a58b5b | 2653 | The declaration @code{(cl-declare (special @var{var1} @var{var2}))} is |
4009494e GM |
2654 | equivalent to @code{(defvar @var{var1}) (defvar @var{var2})} in the |
2655 | optimizing compiler, or to nothing at all in older compilers (which | |
2656 | do not warn for non-local references). | |
2657 | ||
2658 | In top-level contexts, it is generally better to write | |
39a58b5b | 2659 | @code{(defvar @var{var})} than @code{(cl-declaim (special @var{var}))}, |
4009494e GM |
2660 | since @code{defvar} makes your intentions clearer. But the older |
2661 | byte compilers can not handle @code{defvar}s appearing inside of | |
39a58b5b | 2662 | functions, while @code{(cl-declare (special @var{var}))} takes care |
4009494e GM |
2663 | to work correctly with all compilers. |
2664 | ||
2665 | @item inline | |
2666 | The @code{inline} @var{decl-spec} lists one or more functions | |
2667 | whose bodies should be expanded ``in-line'' into calling functions | |
2668 | whenever the compiler is able to arrange for it. For example, | |
2669 | the Common Lisp function @code{cadr} is declared @code{inline} | |
2670 | by this package so that the form @code{(cadr @var{x})} will | |
2671 | expand directly into @code{(car (cdr @var{x}))} when it is called | |
2672 | in user functions, for a savings of one (relatively expensive) | |
2673 | function call. | |
2674 | ||
2675 | The following declarations are all equivalent. Note that the | |
2676 | @code{defsubst} form is a convenient way to define a function | |
2677 | and declare it inline all at once. | |
2678 | ||
2679 | @example | |
39a58b5b | 2680 | (cl-declaim (inline foo bar)) |
a05cb6e3 GM |
2681 | (cl-eval-when (compile load eval) |
2682 | (cl-proclaim '(inline foo bar))) | |
4009494e GM |
2683 | (defsubst foo (...) ...) ; instead of defun |
2684 | @end example | |
2685 | ||
2686 | @strong{Please note:} this declaration remains in effect after the | |
2687 | containing source file is done. It is correct to use it to | |
2688 | request that a function you have defined should be inlined, | |
2689 | but it is impolite to use it to request inlining of an external | |
2690 | function. | |
2691 | ||
39a58b5b | 2692 | In Common Lisp, it is possible to use @code{(cl-declare (inline @dots{}))} |
4009494e GM |
2693 | before a particular call to a function to cause just that call to |
2694 | be inlined; the current byte compilers provide no way to implement | |
39a58b5b | 2695 | this, so @code{(cl-declare (inline @dots{}))} is currently ignored by |
4009494e GM |
2696 | this package. |
2697 | ||
2698 | @item notinline | |
2699 | The @code{notinline} declaration lists functions which should | |
2700 | not be inlined after all; it cancels a previous @code{inline} | |
2701 | declaration. | |
2702 | ||
2703 | @item optimize | |
2704 | This declaration controls how much optimization is performed by | |
2705 | the compiler. Naturally, it is ignored by the earlier non-optimizing | |
2706 | compilers. | |
2707 | ||
2708 | The word @code{optimize} is followed by any number of lists like | |
2709 | @code{(speed 3)} or @code{(safety 2)}. Common Lisp defines several | |
2710 | optimization ``qualities''; this package ignores all but @code{speed} | |
2711 | and @code{safety}. The value of a quality should be an integer from | |
a05cb6e3 | 2712 | 0 to 3, with 0 meaning ``unimportant'' and 3 meaning ``very important''. |
4009494e GM |
2713 | The default level for both qualities is 1. |
2714 | ||
2715 | In this package, with the optimizing compiler, the | |
39ff2cf3 | 2716 | @code{speed} quality is tied to the @code{byte-optimize} |
4009494e GM |
2717 | flag, which is set to @code{nil} for @code{(speed 0)} and to |
2718 | @code{t} for higher settings; and the @code{safety} quality is | |
2719 | tied to the @code{byte-compile-delete-errors} flag, which is | |
39ff2cf3 | 2720 | set to @code{nil} for @code{(safety 3)} and to @code{t} for all |
4009494e GM |
2721 | lower settings. (The latter flag controls whether the compiler |
2722 | is allowed to optimize out code whose only side-effect could | |
2723 | be to signal an error, e.g., rewriting @code{(progn foo bar)} to | |
2724 | @code{bar} when it is not known whether @code{foo} will be bound | |
2725 | at run-time.) | |
2726 | ||
2727 | Note that even compiling with @code{(safety 0)}, the Emacs | |
2728 | byte-code system provides sufficient checking to prevent real | |
2729 | harm from being done. For example, barring serious bugs in | |
2730 | Emacs itself, Emacs will not crash with a segmentation fault | |
2731 | just because of an error in a fully-optimized Lisp program. | |
2732 | ||
2733 | The @code{optimize} declaration is normally used in a top-level | |
39a58b5b GM |
2734 | @code{cl-proclaim} or @code{cl-declaim} in a file; Common Lisp allows |
2735 | it to be used with @code{cl-declare} to set the level of optimization | |
4009494e | 2736 | locally for a given form, but this will not work correctly with the |
39a58b5b | 2737 | current version of the optimizing compiler. (The @code{cl-declare} |
4009494e GM |
2738 | will set the new optimization level, but that level will not |
2739 | automatically be unset after the enclosing form is done.) | |
2740 | ||
2741 | @item warn | |
2742 | This declaration controls what sorts of warnings are generated | |
2743 | by the byte compiler. Again, only the optimizing compiler | |
2744 | generates warnings. The word @code{warn} is followed by any | |
a05cb6e3 | 2745 | number of ``warning qualities'', similar in form to optimization |
4009494e GM |
2746 | qualities. The currently supported warning types are |
2747 | @code{redefine}, @code{callargs}, @code{unresolved}, and | |
2748 | @code{free-vars}; in the current system, a value of 0 will | |
2749 | disable these warnings and any higher value will enable them. | |
2750 | See the documentation for the optimizing byte compiler for details. | |
2751 | @end table | |
2752 | ||
1d5b82ef | 2753 | @node Symbols |
4009494e GM |
2754 | @chapter Symbols |
2755 | ||
2756 | @noindent | |
2757 | This package defines several symbol-related features that were | |
2758 | missing from Emacs Lisp. | |
2759 | ||
2760 | @menu | |
39a58b5b GM |
2761 | * Property Lists:: @code{cl-get}, @code{cl-remprop}, @code{cl-getf}, @code{cl-remf}. |
2762 | * Creating Symbols:: @code{cl-gensym}, @code{cl-gentemp}. | |
4009494e GM |
2763 | @end menu |
2764 | ||
1d5b82ef | 2765 | @node Property Lists |
4009494e GM |
2766 | @section Property Lists |
2767 | ||
2768 | @noindent | |
2769 | These functions augment the standard Emacs Lisp functions @code{get} | |
2770 | and @code{put} for operating on properties attached to symbols. | |
2771 | There are also functions for working with property lists as | |
2772 | first-class data structures not attached to particular symbols. | |
2773 | ||
39a58b5b | 2774 | @defun cl-get symbol property &optional default |
4009494e GM |
2775 | This function is like @code{get}, except that if the property is |
2776 | not found, the @var{default} argument provides the return value. | |
2777 | (The Emacs Lisp @code{get} function always uses @code{nil} as | |
39a58b5b | 2778 | the default; this package's @code{cl-get} is equivalent to Common |
4009494e GM |
2779 | Lisp's @code{get}.) |
2780 | ||
39a58b5b | 2781 | The @code{cl-get} function is @code{setf}-able; when used in this |
4009494e GM |
2782 | fashion, the @var{default} argument is allowed but ignored. |
2783 | @end defun | |
2784 | ||
39a58b5b | 2785 | @defun cl-remprop symbol property |
4009494e GM |
2786 | This function removes the entry for @var{property} from the property |
2787 | list of @var{symbol}. It returns a true value if the property was | |
2788 | indeed found and removed, or @code{nil} if there was no such property. | |
2789 | (This function was probably omitted from Emacs originally because, | |
2790 | since @code{get} did not allow a @var{default}, it was very difficult | |
2791 | to distinguish between a missing property and a property whose value | |
2792 | was @code{nil}; thus, setting a property to @code{nil} was close | |
39a58b5b | 2793 | enough to @code{cl-remprop} for most purposes.) |
4009494e GM |
2794 | @end defun |
2795 | ||
39a58b5b | 2796 | @defun cl-getf place property &optional default |
4009494e GM |
2797 | This function scans the list @var{place} as if it were a property |
2798 | list, i.e., a list of alternating property names and values. If | |
2799 | an even-numbered element of @var{place} is found which is @code{eq} | |
2800 | to @var{property}, the following odd-numbered element is returned. | |
2801 | Otherwise, @var{default} is returned (or @code{nil} if no default | |
2802 | is given). | |
2803 | ||
2804 | In particular, | |
2805 | ||
2806 | @example | |
516e1a08 | 2807 | (get sym prop) @equiv{} (cl-getf (symbol-plist sym) prop) |
4009494e GM |
2808 | @end example |
2809 | ||
516e1a08 | 2810 | It is valid to use @code{cl-getf} as a @code{setf} place, in which case |
4009494e GM |
2811 | its @var{place} argument must itself be a valid @code{setf} place. |
2812 | The @var{default} argument, if any, is ignored in this context. | |
2813 | The effect is to change (via @code{setcar}) the value cell in the | |
2814 | list that corresponds to @var{property}, or to cons a new property-value | |
2815 | pair onto the list if the property is not yet present. | |
2816 | ||
2817 | @example | |
516e1a08 | 2818 | (put sym prop val) @equiv{} (setf (cl-getf (symbol-plist sym) prop) val) |
4009494e GM |
2819 | @end example |
2820 | ||
39a58b5b | 2821 | The @code{get} and @code{cl-get} functions are also @code{setf}-able. |
4009494e GM |
2822 | The fact that @code{default} is ignored can sometimes be useful: |
2823 | ||
2824 | @example | |
39a58b5b | 2825 | (cl-incf (cl-get 'foo 'usage-count 0)) |
4009494e GM |
2826 | @end example |
2827 | ||
2828 | Here, symbol @code{foo}'s @code{usage-count} property is incremented | |
2829 | if it exists, or set to 1 (an incremented 0) otherwise. | |
2830 | ||
516e1a08 | 2831 | When not used as a @code{setf} form, @code{cl-getf} is just a regular |
4009494e GM |
2832 | function and its @var{place} argument can actually be any Lisp |
2833 | expression. | |
2834 | @end defun | |
2835 | ||
e1117425 | 2836 | @defmac cl-remf place property |
4009494e GM |
2837 | This macro removes the property-value pair for @var{property} from |
2838 | the property list stored at @var{place}, which is any @code{setf}-able | |
2839 | place expression. It returns true if the property was found. Note | |
2840 | that if @var{property} happens to be first on the list, this will | |
2841 | effectively do a @code{(setf @var{place} (cddr @var{place}))}, | |
2842 | whereas if it occurs later, this simply uses @code{setcdr} to splice | |
2843 | out the property and value cells. | |
e1117425 | 2844 | @end defmac |
4009494e | 2845 | |
1d5b82ef | 2846 | @node Creating Symbols |
4009494e GM |
2847 | @section Creating Symbols |
2848 | ||
2849 | @noindent | |
2850 | These functions create unique symbols, typically for use as | |
2851 | temporary variables. | |
2852 | ||
39a58b5b | 2853 | @defun cl-gensym &optional x |
4009494e GM |
2854 | This function creates a new, uninterned symbol (using @code{make-symbol}) |
2855 | with a unique name. (The name of an uninterned symbol is relevant | |
2856 | only if the symbol is printed.) By default, the name is generated | |
2857 | from an increasing sequence of numbers, @samp{G1000}, @samp{G1001}, | |
2858 | @samp{G1002}, etc. If the optional argument @var{x} is a string, that | |
2859 | string is used as a prefix instead of @samp{G}. Uninterned symbols | |
2860 | are used in macro expansions for temporary variables, to ensure that | |
2861 | their names will not conflict with ``real'' variables in the user's | |
2862 | code. | |
2863 | @end defun | |
2864 | ||
39a58b5b GM |
2865 | @defvar cl--gensym-counter |
2866 | This variable holds the counter used to generate @code{cl-gensym} names. | |
2867 | It is incremented after each use by @code{cl-gensym}. In Common Lisp | |
4009494e GM |
2868 | this is initialized with 0, but this package initializes it with a |
2869 | random (time-dependent) value to avoid trouble when two files that | |
39a58b5b | 2870 | each used @code{cl-gensym} in their compilation are loaded together. |
4009494e GM |
2871 | (Uninterned symbols become interned when the compiler writes them |
2872 | out to a file and the Emacs loader loads them, so their names have to | |
2873 | be treated a bit more carefully than in Common Lisp where uninterned | |
2874 | symbols remain uninterned after loading.) | |
2875 | @end defvar | |
2876 | ||
39a58b5b GM |
2877 | @defun cl-gentemp &optional x |
2878 | This function is like @code{cl-gensym}, except that it produces a new | |
4009494e GM |
2879 | @emph{interned} symbol. If the symbol that is generated already |
2880 | exists, the function keeps incrementing the counter and trying | |
2881 | again until a new symbol is generated. | |
2882 | @end defun | |
2883 | ||
a6880551 GM |
2884 | This package automatically creates all keywords that are called for by |
2885 | @code{&key} argument specifiers, and discourages the use of keywords | |
2886 | as data unrelated to keyword arguments, so the related function | |
2887 | @code{defkeyword} (to create self-quoting keyword symbols) is not | |
2888 | provided. | |
4009494e | 2889 | |
1d5b82ef | 2890 | @node Numbers |
4009494e GM |
2891 | @chapter Numbers |
2892 | ||
2893 | @noindent | |
2894 | This section defines a few simple Common Lisp operations on numbers | |
2895 | which were left out of Emacs Lisp. | |
2896 | ||
2897 | @menu | |
39a58b5b GM |
2898 | * Predicates on Numbers:: @code{cl-plusp}, @code{cl-oddp}, @code{cl-floatp-safe}, etc. |
2899 | * Numerical Functions:: @code{abs}, @code{cl-floor}, etc. | |
2900 | * Random Numbers:: @code{cl-random}, @code{cl-make-random-state}. | |
2901 | * Implementation Parameters:: @code{cl-most-positive-float}. | |
4009494e GM |
2902 | @end menu |
2903 | ||
1d5b82ef | 2904 | @node Predicates on Numbers |
4009494e GM |
2905 | @section Predicates on Numbers |
2906 | ||
2907 | @noindent | |
2908 | These functions return @code{t} if the specified condition is | |
2909 | true of the numerical argument, or @code{nil} otherwise. | |
2910 | ||
39a58b5b | 2911 | @defun cl-plusp number |
4009494e GM |
2912 | This predicate tests whether @var{number} is positive. It is an |
2913 | error if the argument is not a number. | |
2914 | @end defun | |
2915 | ||
39a58b5b | 2916 | @defun cl-minusp number |
4009494e GM |
2917 | This predicate tests whether @var{number} is negative. It is an |
2918 | error if the argument is not a number. | |
2919 | @end defun | |
2920 | ||
39a58b5b | 2921 | @defun cl-oddp integer |
4009494e GM |
2922 | This predicate tests whether @var{integer} is odd. It is an |
2923 | error if the argument is not an integer. | |
2924 | @end defun | |
2925 | ||
39a58b5b | 2926 | @defun cl-evenp integer |
4009494e GM |
2927 | This predicate tests whether @var{integer} is even. It is an |
2928 | error if the argument is not an integer. | |
2929 | @end defun | |
2930 | ||
39a58b5b | 2931 | @defun cl-floatp-safe object |
4009494e GM |
2932 | This predicate tests whether @var{object} is a floating-point |
2933 | number. On systems that support floating-point, this is equivalent | |
2934 | to @code{floatp}. On other systems, this always returns @code{nil}. | |
2935 | @end defun | |
2936 | ||
1d5b82ef | 2937 | @node Numerical Functions |
4009494e GM |
2938 | @section Numerical Functions |
2939 | ||
2940 | @noindent | |
2941 | These functions perform various arithmetic operations on numbers. | |
2942 | ||
39a58b5b | 2943 | @defun cl-gcd &rest integers |
4009494e GM |
2944 | This function returns the Greatest Common Divisor of the arguments. |
2945 | For one argument, it returns the absolute value of that argument. | |
2946 | For zero arguments, it returns zero. | |
2947 | @end defun | |
2948 | ||
39a58b5b | 2949 | @defun cl-lcm &rest integers |
4009494e GM |
2950 | This function returns the Least Common Multiple of the arguments. |
2951 | For one argument, it returns the absolute value of that argument. | |
2952 | For zero arguments, it returns one. | |
2953 | @end defun | |
2954 | ||
39a58b5b | 2955 | @defun cl-isqrt integer |
4009494e GM |
2956 | This function computes the ``integer square root'' of its integer |
2957 | argument, i.e., the greatest integer less than or equal to the true | |
2958 | square root of the argument. | |
2959 | @end defun | |
2960 | ||
39a58b5b GM |
2961 | @defun cl-floor number &optional divisor |
2962 | With one argument, @code{cl-floor} returns a list of two numbers: | |
4009494e GM |
2963 | The argument rounded down (toward minus infinity) to an integer, |
2964 | and the ``remainder'' which would have to be added back to the | |
2965 | first return value to yield the argument again. If the argument | |
2966 | is an integer @var{x}, the result is always the list @code{(@var{x} 0)}. | |
2967 | If the argument is a floating-point number, the first | |
2968 | result is a Lisp integer and the second is a Lisp float between | |
2969 | 0 (inclusive) and 1 (exclusive). | |
2970 | ||
39a58b5b | 2971 | With two arguments, @code{cl-floor} divides @var{number} by |
4009494e GM |
2972 | @var{divisor}, and returns the floor of the quotient and the |
2973 | corresponding remainder as a list of two numbers. If | |
39a58b5b | 2974 | @code{(cl-floor @var{x} @var{y})} returns @code{(@var{q} @var{r})}, |
4009494e GM |
2975 | then @code{@var{q}*@var{y} + @var{r} = @var{x}}, with @var{r} |
2976 | between 0 (inclusive) and @var{r} (exclusive). Also, note | |
39a58b5b GM |
2977 | that @code{(cl-floor @var{x})} is exactly equivalent to |
2978 | @code{(cl-floor @var{x} 1)}. | |
4009494e GM |
2979 | |
2980 | This function is entirely compatible with Common Lisp's @code{floor} | |
2981 | function, except that it returns the two results in a list since | |
2982 | Emacs Lisp does not support multiple-valued functions. | |
2983 | @end defun | |
2984 | ||
39a58b5b | 2985 | @defun cl-ceiling number &optional divisor |
4009494e GM |
2986 | This function implements the Common Lisp @code{ceiling} function, |
2987 | which is analogous to @code{floor} except that it rounds the | |
2988 | argument or quotient of the arguments up toward plus infinity. | |
2989 | The remainder will be between 0 and minus @var{r}. | |
2990 | @end defun | |
2991 | ||
39a58b5b | 2992 | @defun cl-truncate number &optional divisor |
4009494e GM |
2993 | This function implements the Common Lisp @code{truncate} function, |
2994 | which is analogous to @code{floor} except that it rounds the | |
2995 | argument or quotient of the arguments toward zero. Thus it is | |
39a58b5b GM |
2996 | equivalent to @code{cl-floor} if the argument or quotient is |
2997 | positive, or to @code{cl-ceiling} otherwise. The remainder has | |
4009494e GM |
2998 | the same sign as @var{number}. |
2999 | @end defun | |
3000 | ||
39a58b5b | 3001 | @defun cl-round number &optional divisor |
4009494e GM |
3002 | This function implements the Common Lisp @code{round} function, |
3003 | which is analogous to @code{floor} except that it rounds the | |
3004 | argument or quotient of the arguments to the nearest integer. | |
3005 | In the case of a tie (the argument or quotient is exactly | |
3006 | halfway between two integers), it rounds to the even integer. | |
3007 | @end defun | |
3008 | ||
39a58b5b | 3009 | @defun cl-mod number divisor |
4009494e | 3010 | This function returns the same value as the second return value |
39a58b5b | 3011 | of @code{cl-floor}. |
4009494e GM |
3012 | @end defun |
3013 | ||
39a58b5b | 3014 | @defun cl-rem number divisor |
4009494e | 3015 | This function returns the same value as the second return value |
39a58b5b | 3016 | of @code{cl-truncate}. |
4009494e GM |
3017 | @end defun |
3018 | ||
1d5b82ef | 3019 | @node Random Numbers |
4009494e GM |
3020 | @section Random Numbers |
3021 | ||
3022 | @noindent | |
3023 | This package also provides an implementation of the Common Lisp | |
3024 | random number generator. It uses its own additive-congruential | |
3025 | algorithm, which is much more likely to give statistically clean | |
3026 | random numbers than the simple generators supplied by many | |
3027 | operating systems. | |
3028 | ||
39a58b5b | 3029 | @defun cl-random number &optional state |
4009494e GM |
3030 | This function returns a random nonnegative number less than |
3031 | @var{number}, and of the same type (either integer or floating-point). | |
3032 | The @var{state} argument should be a @code{random-state} object | |
3033 | which holds the state of the random number generator. The | |
3034 | function modifies this state object as a side effect. If | |
3035 | @var{state} is omitted, it defaults to the variable | |
a05cb6e3 | 3036 | @code{cl--random-state}, which contains a pre-initialized |
4009494e GM |
3037 | @code{random-state} object. |
3038 | @end defun | |
3039 | ||
39a58b5b | 3040 | @defvar cl--random-state |
4009494e | 3041 | This variable contains the system ``default'' @code{random-state} |
39a58b5b | 3042 | object, used for calls to @code{cl-random} that do not specify an |
4009494e | 3043 | alternative state object. Since any number of programs in the |
39a58b5b | 3044 | Emacs process may be accessing @code{cl--random-state} in interleaved |
4009494e GM |
3045 | fashion, the sequence generated from this variable will be |
3046 | irreproducible for all intents and purposes. | |
3047 | @end defvar | |
3048 | ||
39a58b5b | 3049 | @defun cl-make-random-state &optional state |
4009494e GM |
3050 | This function creates or copies a @code{random-state} object. |
3051 | If @var{state} is omitted or @code{nil}, it returns a new copy of | |
39a58b5b GM |
3052 | @code{cl--random-state}. This is a copy in the sense that future |
3053 | sequences of calls to @code{(cl-random @var{n})} and | |
3054 | @code{(cl-random @var{n} @var{s})} (where @var{s} is the new | |
4009494e GM |
3055 | random-state object) will return identical sequences of random |
3056 | numbers. | |
3057 | ||
3058 | If @var{state} is a @code{random-state} object, this function | |
3059 | returns a copy of that object. If @var{state} is @code{t}, this | |
3060 | function returns a new @code{random-state} object seeded from the | |
3061 | date and time. As an extension to Common Lisp, @var{state} may also | |
3062 | be an integer in which case the new object is seeded from that | |
3063 | integer; each different integer seed will result in a completely | |
3064 | different sequence of random numbers. | |
3065 | ||
3066 | It is valid to print a @code{random-state} object to a buffer or | |
3067 | file and later read it back with @code{read}. If a program wishes | |
3068 | to use a sequence of pseudo-random numbers which can be reproduced | |
39a58b5b | 3069 | later for debugging, it can call @code{(cl-make-random-state t)} to |
4009494e GM |
3070 | get a new sequence, then print this sequence to a file. When the |
3071 | program is later rerun, it can read the original run's random-state | |
3072 | from the file. | |
3073 | @end defun | |
3074 | ||
39a58b5b | 3075 | @defun cl-random-state-p object |
4009494e GM |
3076 | This predicate returns @code{t} if @var{object} is a |
3077 | @code{random-state} object, or @code{nil} otherwise. | |
3078 | @end defun | |
3079 | ||
1d5b82ef | 3080 | @node Implementation Parameters |
4009494e GM |
3081 | @section Implementation Parameters |
3082 | ||
3083 | @noindent | |
3084 | This package defines several useful constants having to with numbers. | |
3085 | ||
3086 | The following parameters have to do with floating-point numbers. | |
3087 | This package determines their values by exercising the computer's | |
3088 | floating-point arithmetic in various ways. Because this operation | |
3089 | might be slow, the code for initializing them is kept in a separate | |
3090 | function that must be called before the parameters can be used. | |
3091 | ||
3092 | @defun cl-float-limits | |
3093 | This function makes sure that the Common Lisp floating-point parameters | |
39a58b5b | 3094 | like @code{cl-most-positive-float} have been initialized. Until it is |
4009494e GM |
3095 | called, these parameters will be @code{nil}. If this version of Emacs |
3096 | does not support floats, the parameters will remain @code{nil}. If the | |
3097 | parameters have already been initialized, the function returns | |
3098 | immediately. | |
3099 | ||
3100 | The algorithm makes assumptions that will be valid for most modern | |
3101 | machines, but will fail if the machine's arithmetic is extremely | |
3102 | unusual, e.g., decimal. | |
3103 | @end defun | |
3104 | ||
3105 | Since true Common Lisp supports up to four different floating-point | |
3106 | precisions, it has families of constants like | |
3107 | @code{most-positive-single-float}, @code{most-positive-double-float}, | |
3108 | @code{most-positive-long-float}, and so on. Emacs has only one | |
3109 | floating-point precision, so this package omits the precision word | |
3110 | from the constants' names. | |
3111 | ||
39a58b5b | 3112 | @defvar cl-most-positive-float |
4009494e GM |
3113 | This constant equals the largest value a Lisp float can hold. |
3114 | For those systems whose arithmetic supports infinities, this is | |
3115 | the largest @emph{finite} value. For IEEE machines, the value | |
3116 | is approximately @code{1.79e+308}. | |
3117 | @end defvar | |
3118 | ||
39a58b5b | 3119 | @defvar cl-most-negative-float |
4009494e | 3120 | This constant equals the most-negative value a Lisp float can hold. |
39a58b5b | 3121 | (It is assumed to be equal to @code{(- cl-most-positive-float)}.) |
4009494e GM |
3122 | @end defvar |
3123 | ||
39a58b5b | 3124 | @defvar cl-least-positive-float |
4009494e GM |
3125 | This constant equals the smallest Lisp float value greater than zero. |
3126 | For IEEE machines, it is about @code{4.94e-324} if denormals are | |
3127 | supported or @code{2.22e-308} if not. | |
3128 | @end defvar | |
3129 | ||
39a58b5b | 3130 | @defvar cl-least-positive-normalized-float |
4009494e GM |
3131 | This constant equals the smallest @emph{normalized} Lisp float greater |
3132 | than zero, i.e., the smallest value for which IEEE denormalization | |
3133 | will not result in a loss of precision. For IEEE machines, this | |
3134 | value is about @code{2.22e-308}. For machines that do not support | |
3135 | the concept of denormalization and gradual underflow, this constant | |
39a58b5b | 3136 | will always equal @code{cl-least-positive-float}. |
4009494e GM |
3137 | @end defvar |
3138 | ||
39a58b5b GM |
3139 | @defvar cl-least-negative-float |
3140 | This constant is the negative counterpart of @code{cl-least-positive-float}. | |
4009494e GM |
3141 | @end defvar |
3142 | ||
39a58b5b | 3143 | @defvar cl-least-negative-normalized-float |
4009494e | 3144 | This constant is the negative counterpart of |
39a58b5b | 3145 | @code{cl-least-positive-normalized-float}. |
4009494e GM |
3146 | @end defvar |
3147 | ||
39a58b5b | 3148 | @defvar cl-float-epsilon |
4009494e GM |
3149 | This constant is the smallest positive Lisp float that can be added |
3150 | to 1.0 to produce a distinct value. Adding a smaller number to 1.0 | |
3151 | will yield 1.0 again due to roundoff. For IEEE machines, epsilon | |
3152 | is about @code{2.22e-16}. | |
3153 | @end defvar | |
3154 | ||
39a58b5b | 3155 | @defvar cl-float-negative-epsilon |
4009494e GM |
3156 | This is the smallest positive value that can be subtracted from |
3157 | 1.0 to produce a distinct value. For IEEE machines, it is about | |
3158 | @code{1.11e-16}. | |
3159 | @end defvar | |
3160 | ||
1d5b82ef | 3161 | @node Sequences |
4009494e GM |
3162 | @chapter Sequences |
3163 | ||
3164 | @noindent | |
3165 | Common Lisp defines a number of functions that operate on | |
3166 | @dfn{sequences}, which are either lists, strings, or vectors. | |
3167 | Emacs Lisp includes a few of these, notably @code{elt} and | |
3168 | @code{length}; this package defines most of the rest. | |
3169 | ||
3170 | @menu | |
8d6510b9 | 3171 | * Sequence Basics:: Arguments shared by all sequence functions. |
39a58b5b GM |
3172 | * Mapping over Sequences:: @code{cl-mapcar}, @code{cl-mapcan}, @code{cl-map}, @code{cl-every}, etc. |
3173 | * Sequence Functions:: @code{cl-subseq}, @code{cl-remove}, @code{cl-substitute}, etc. | |
3174 | * Searching Sequences:: @code{cl-find}, @code{cl-position}, @code{cl-count}, @code{cl-search}, etc. | |
3175 | * Sorting Sequences:: @code{cl-sort}, @code{cl-stable-sort}, @code{cl-merge}. | |
4009494e GM |
3176 | @end menu |
3177 | ||
1d5b82ef | 3178 | @node Sequence Basics |
4009494e GM |
3179 | @section Sequence Basics |
3180 | ||
3181 | @noindent | |
3182 | Many of the sequence functions take keyword arguments; @pxref{Argument | |
3183 | Lists}. All keyword arguments are optional and, if specified, | |
3184 | may appear in any order. | |
3185 | ||
3186 | The @code{:key} argument should be passed either @code{nil}, or a | |
3187 | function of one argument. This key function is used as a filter | |
3188 | through which the elements of the sequence are seen; for example, | |
39a58b5b | 3189 | @code{(cl-find x y :key 'car)} is similar to @code{(cl-assoc x y)}: |
4009494e GM |
3190 | It searches for an element of the list whose @code{car} equals |
3191 | @code{x}, rather than for an element which equals @code{x} itself. | |
3192 | If @code{:key} is omitted or @code{nil}, the filter is effectively | |
3193 | the identity function. | |
3194 | ||
3195 | The @code{:test} and @code{:test-not} arguments should be either | |
3196 | @code{nil}, or functions of two arguments. The test function is | |
3197 | used to compare two sequence elements, or to compare a search value | |
3198 | with sequence elements. (The two values are passed to the test | |
3199 | function in the same order as the original sequence function | |
3200 | arguments from which they are derived, or, if they both come from | |
3201 | the same sequence, in the same order as they appear in that sequence.) | |
3202 | The @code{:test} argument specifies a function which must return | |
3203 | true (non-@code{nil}) to indicate a match; instead, you may use | |
3204 | @code{:test-not} to give a function which returns @emph{false} to | |
0a3333b5 | 3205 | indicate a match. The default test function is @code{eql}. |
4009494e GM |
3206 | |
3207 | Many functions which take @var{item} and @code{:test} or @code{:test-not} | |
3208 | arguments also come in @code{-if} and @code{-if-not} varieties, | |
3209 | where a @var{predicate} function is passed instead of @var{item}, | |
3210 | and sequence elements match if the predicate returns true on them | |
3211 | (or false in the case of @code{-if-not}). For example: | |
3212 | ||
3213 | @example | |
39a58b5b | 3214 | (cl-remove 0 seq :test '=) @equiv{} (cl-remove-if 'zerop seq) |
4009494e GM |
3215 | @end example |
3216 | ||
3217 | @noindent | |
3218 | to remove all zeros from sequence @code{seq}. | |
3219 | ||
3220 | Some operations can work on a subsequence of the argument sequence; | |
3221 | these function take @code{:start} and @code{:end} arguments which | |
3222 | default to zero and the length of the sequence, respectively. | |
3223 | Only elements between @var{start} (inclusive) and @var{end} | |
3224 | (exclusive) are affected by the operation. The @var{end} argument | |
3225 | may be passed @code{nil} to signify the length of the sequence; | |
3226 | otherwise, both @var{start} and @var{end} must be integers, with | |
3227 | @code{0 <= @var{start} <= @var{end} <= (length @var{seq})}. | |
3228 | If the function takes two sequence arguments, the limits are | |
3229 | defined by keywords @code{:start1} and @code{:end1} for the first, | |
3230 | and @code{:start2} and @code{:end2} for the second. | |
3231 | ||
3232 | A few functions accept a @code{:from-end} argument, which, if | |
3233 | non-@code{nil}, causes the operation to go from right-to-left | |
3234 | through the sequence instead of left-to-right, and a @code{:count} | |
3235 | argument, which specifies an integer maximum number of elements | |
3236 | to be removed or otherwise processed. | |
3237 | ||
3238 | The sequence functions make no guarantees about the order in | |
3239 | which the @code{:test}, @code{:test-not}, and @code{:key} functions | |
3240 | are called on various elements. Therefore, it is a bad idea to depend | |
3241 | on side effects of these functions. For example, @code{:from-end} | |
3242 | may cause the sequence to be scanned actually in reverse, or it may | |
3243 | be scanned forwards but computing a result ``as if'' it were scanned | |
39a58b5b | 3244 | backwards. (Some functions, like @code{cl-mapcar} and @code{cl-every}, |
4009494e GM |
3245 | @emph{do} specify exactly the order in which the function is called |
3246 | so side effects are perfectly acceptable in those cases.) | |
3247 | ||
3248 | Strings may contain ``text properties'' as well | |
3249 | as character data. Except as noted, it is undefined whether or | |
3250 | not text properties are preserved by sequence functions. For | |
39a58b5b | 3251 | example, @code{(cl-remove ?A @var{str})} may or may not preserve |
4009494e GM |
3252 | the properties of the characters copied from @var{str} into the |
3253 | result. | |
3254 | ||
1d5b82ef | 3255 | @node Mapping over Sequences |
4009494e GM |
3256 | @section Mapping over Sequences |
3257 | ||
3258 | @noindent | |
3259 | These functions ``map'' the function you specify over the elements | |
3260 | of lists or arrays. They are all variations on the theme of the | |
3261 | built-in function @code{mapcar}. | |
3262 | ||
39a58b5b | 3263 | @defun cl-mapcar function seq &rest more-seqs |
4009494e GM |
3264 | This function calls @var{function} on successive parallel sets of |
3265 | elements from its argument sequences. Given a single @var{seq} | |
3266 | argument it is equivalent to @code{mapcar}; given @var{n} sequences, | |
3267 | it calls the function with the first elements of each of the sequences | |
3268 | as the @var{n} arguments to yield the first element of the result | |
3269 | list, then with the second elements, and so on. The mapping stops as | |
3270 | soon as the shortest sequence runs out. The argument sequences may | |
3271 | be any mixture of lists, strings, and vectors; the return sequence | |
3272 | is always a list. | |
3273 | ||
3274 | Common Lisp's @code{mapcar} accepts multiple arguments but works | |
3275 | only on lists; Emacs Lisp's @code{mapcar} accepts a single sequence | |
39a58b5b | 3276 | argument. This package's @code{cl-mapcar} works as a compatible |
4009494e GM |
3277 | superset of both. |
3278 | @end defun | |
3279 | ||
39a58b5b | 3280 | @defun cl-map result-type function seq &rest more-seqs |
4009494e | 3281 | This function maps @var{function} over the argument sequences, |
39a58b5b | 3282 | just like @code{cl-mapcar}, but it returns a sequence of type |
4009494e GM |
3283 | @var{result-type} rather than a list. @var{result-type} must |
3284 | be one of the following symbols: @code{vector}, @code{string}, | |
3285 | @code{list} (in which case the effect is the same as for | |
a05cb6e3 | 3286 | @code{cl-mapcar}), or @code{nil} (in which case the results are |
39a58b5b | 3287 | thrown away and @code{cl-map} returns @code{nil}). |
4009494e GM |
3288 | @end defun |
3289 | ||
39a58b5b | 3290 | @defun cl-maplist function list &rest more-lists |
4009494e GM |
3291 | This function calls @var{function} on each of its argument lists, |
3292 | then on the @code{cdr}s of those lists, and so on, until the | |
3293 | shortest list runs out. The results are returned in the form | |
39a58b5b | 3294 | of a list. Thus, @code{cl-maplist} is like @code{cl-mapcar} except |
4009494e GM |
3295 | that it passes in the list pointers themselves rather than the |
3296 | @code{car}s of the advancing pointers. | |
3297 | @end defun | |
3298 | ||
b695beda | 3299 | @defun cl-mapc function seq &rest more-seqs |
39a58b5b | 3300 | This function is like @code{cl-mapcar}, except that the values returned |
4009494e | 3301 | by @var{function} are ignored and thrown away rather than being |
b695beda | 3302 | collected into a list. The return value of @code{cl-mapc} is @var{seq}, |
4009494e | 3303 | the first sequence. This function is more general than the Emacs |
f43a5263 | 3304 | primitive @code{mapc}. (Note that this function is called |
86a7968c | 3305 | @code{cl-mapc} even in @file{cl.el}, rather than @code{mapc*} as you |
f43a5263 GM |
3306 | might expect.) |
3307 | @c http://debbugs.gnu.org/6575 | |
4009494e GM |
3308 | @end defun |
3309 | ||
39a58b5b GM |
3310 | @defun cl-mapl function list &rest more-lists |
3311 | This function is like @code{cl-maplist}, except that it throws away | |
4009494e GM |
3312 | the values returned by @var{function}. |
3313 | @end defun | |
3314 | ||
39a58b5b GM |
3315 | @defun cl-mapcan function seq &rest more-seqs |
3316 | This function is like @code{cl-mapcar}, except that it concatenates | |
4009494e GM |
3317 | the return values (which must be lists) using @code{nconc}, |
3318 | rather than simply collecting them into a list. | |
3319 | @end defun | |
3320 | ||
39a58b5b GM |
3321 | @defun cl-mapcon function list &rest more-lists |
3322 | This function is like @code{cl-maplist}, except that it concatenates | |
4009494e GM |
3323 | the return values using @code{nconc}. |
3324 | @end defun | |
3325 | ||
39a58b5b | 3326 | @defun cl-some predicate seq &rest more-seqs |
4009494e GM |
3327 | This function calls @var{predicate} on each element of @var{seq} |
3328 | in turn; if @var{predicate} returns a non-@code{nil} value, | |
3329 | @code{some} returns that value, otherwise it returns @code{nil}. | |
3330 | Given several sequence arguments, it steps through the sequences | |
3331 | in parallel until the shortest one runs out, just as in | |
39a58b5b | 3332 | @code{cl-mapcar}. You can rely on the left-to-right order in which |
4009494e GM |
3333 | the elements are visited, and on the fact that mapping stops |
3334 | immediately as soon as @var{predicate} returns non-@code{nil}. | |
3335 | @end defun | |
3336 | ||
39a58b5b | 3337 | @defun cl-every predicate seq &rest more-seqs |
4009494e GM |
3338 | This function calls @var{predicate} on each element of the sequence(s) |
3339 | in turn; it returns @code{nil} as soon as @var{predicate} returns | |
3340 | @code{nil} for any element, or @code{t} if the predicate was true | |
3341 | for all elements. | |
3342 | @end defun | |
3343 | ||
39a58b5b | 3344 | @defun cl-notany predicate seq &rest more-seqs |
4009494e GM |
3345 | This function calls @var{predicate} on each element of the sequence(s) |
3346 | in turn; it returns @code{nil} as soon as @var{predicate} returns | |
3347 | a non-@code{nil} value for any element, or @code{t} if the predicate | |
3348 | was @code{nil} for all elements. | |
3349 | @end defun | |
3350 | ||
39a58b5b | 3351 | @defun cl-notevery predicate seq &rest more-seqs |
4009494e GM |
3352 | This function calls @var{predicate} on each element of the sequence(s) |
3353 | in turn; it returns a non-@code{nil} value as soon as @var{predicate} | |
3354 | returns @code{nil} for any element, or @code{t} if the predicate was | |
3355 | true for all elements. | |
3356 | @end defun | |
3357 | ||
39a58b5b | 3358 | @defun cl-reduce function seq @t{&key :from-end :start :end :initial-value :key} |
4009494e GM |
3359 | This function combines the elements of @var{seq} using an associative |
3360 | binary operation. Suppose @var{function} is @code{*} and @var{seq} is | |
3361 | the list @code{(2 3 4 5)}. The first two elements of the list are | |
3362 | combined with @code{(* 2 3) = 6}; this is combined with the next | |
3363 | element, @code{(* 6 4) = 24}, and that is combined with the final | |
3364 | element: @code{(* 24 5) = 120}. Note that the @code{*} function happens | |
3365 | to be self-reducing, so that @code{(* 2 3 4 5)} has the same effect as | |
39a58b5b | 3366 | an explicit call to @code{cl-reduce}. |
4009494e GM |
3367 | |
3368 | If @code{:from-end} is true, the reduction is right-associative instead | |
3369 | of left-associative: | |
3370 | ||
3371 | @example | |
39a58b5b GM |
3372 | (cl-reduce '- '(1 2 3 4)) |
3373 | @equiv{} (- (- (- 1 2) 3) 4) @result{} -8 | |
3374 | (cl-reduce '- '(1 2 3 4) :from-end t) | |
3375 | @equiv{} (- 1 (- 2 (- 3 4))) @result{} -2 | |
4009494e GM |
3376 | @end example |
3377 | ||
3378 | If @code{:key} is specified, it is a function of one argument which | |
3379 | is called on each of the sequence elements in turn. | |
3380 | ||
3381 | If @code{:initial-value} is specified, it is effectively added to the | |
3382 | front (or rear in the case of @code{:from-end}) of the sequence. | |
3383 | The @code{:key} function is @emph{not} applied to the initial value. | |
3384 | ||
3385 | If the sequence, including the initial value, has exactly one element | |
3386 | then that element is returned without ever calling @var{function}. | |
3387 | If the sequence is empty (and there is no initial value), then | |
3388 | @var{function} is called with no arguments to obtain the return value. | |
3389 | @end defun | |
3390 | ||
3391 | All of these mapping operations can be expressed conveniently in | |
39a58b5b | 3392 | terms of the @code{cl-loop} macro. In compiled code, @code{cl-loop} will |
4009494e GM |
3393 | be faster since it generates the loop as in-line code with no |
3394 | function calls. | |
3395 | ||
1d5b82ef | 3396 | @node Sequence Functions |
4009494e GM |
3397 | @section Sequence Functions |
3398 | ||
3399 | @noindent | |
3400 | This section describes a number of Common Lisp functions for | |
3401 | operating on sequences. | |
3402 | ||
39a58b5b | 3403 | @defun cl-subseq sequence start &optional end |
4009494e GM |
3404 | This function returns a given subsequence of the argument |
3405 | @var{sequence}, which may be a list, string, or vector. | |
3406 | The indices @var{start} and @var{end} must be in range, and | |
3407 | @var{start} must be no greater than @var{end}. If @var{end} | |
3408 | is omitted, it defaults to the length of the sequence. The | |
3409 | return value is always a copy; it does not share structure | |
3410 | with @var{sequence}. | |
3411 | ||
3412 | As an extension to Common Lisp, @var{start} and/or @var{end} | |
3413 | may be negative, in which case they represent a distance back | |
3414 | from the end of the sequence. This is for compatibility with | |
39a58b5b | 3415 | Emacs's @code{substring} function. Note that @code{cl-subseq} is |
4009494e GM |
3416 | the @emph{only} sequence function that allows negative |
3417 | @var{start} and @var{end}. | |
3418 | ||
39a58b5b | 3419 | You can use @code{setf} on a @code{cl-subseq} form to replace a |
4009494e | 3420 | specified range of elements with elements from another sequence. |
39a58b5b | 3421 | The replacement is done as if by @code{cl-replace}, described below. |
4009494e GM |
3422 | @end defun |
3423 | ||
39a58b5b | 3424 | @defun cl-concatenate result-type &rest seqs |
4009494e GM |
3425 | This function concatenates the argument sequences together to |
3426 | form a result sequence of type @var{result-type}, one of the | |
3427 | symbols @code{vector}, @code{string}, or @code{list}. The | |
3428 | arguments are always copied, even in cases such as | |
39a58b5b | 3429 | @code{(cl-concatenate 'list '(1 2 3))} where the result is |
4009494e GM |
3430 | identical to an argument. |
3431 | @end defun | |
3432 | ||
39a58b5b | 3433 | @defun cl-fill seq item @t{&key :start :end} |
4009494e GM |
3434 | This function fills the elements of the sequence (or the specified |
3435 | part of the sequence) with the value @var{item}. | |
3436 | @end defun | |
3437 | ||
39a58b5b | 3438 | @defun cl-replace seq1 seq2 @t{&key :start1 :end1 :start2 :end2} |
4009494e GM |
3439 | This function copies part of @var{seq2} into part of @var{seq1}. |
3440 | The sequence @var{seq1} is not stretched or resized; the amount | |
3441 | of data copied is simply the shorter of the source and destination | |
3442 | (sub)sequences. The function returns @var{seq1}. | |
3443 | ||
3444 | If @var{seq1} and @var{seq2} are @code{eq}, then the replacement | |
3445 | will work correctly even if the regions indicated by the start | |
3446 | and end arguments overlap. However, if @var{seq1} and @var{seq2} | |
3447 | are lists which share storage but are not @code{eq}, and the | |
3448 | start and end arguments specify overlapping regions, the effect | |
3449 | is undefined. | |
3450 | @end defun | |
3451 | ||
39a58b5b | 3452 | @defun cl-remove item seq @t{&key :test :test-not :key :count :start :end :from-end} |
4009494e GM |
3453 | This returns a copy of @var{seq} with all elements matching |
3454 | @var{item} removed. The result may share storage with or be | |
3455 | @code{eq} to @var{seq} in some circumstances, but the original | |
3456 | @var{seq} will not be modified. The @code{:test}, @code{:test-not}, | |
3457 | and @code{:key} arguments define the matching test that is used; | |
3458 | by default, elements @code{eql} to @var{item} are removed. The | |
3459 | @code{:count} argument specifies the maximum number of matching | |
3460 | elements that can be removed (only the leftmost @var{count} matches | |
3461 | are removed). The @code{:start} and @code{:end} arguments specify | |
3462 | a region in @var{seq} in which elements will be removed; elements | |
3463 | outside that region are not matched or removed. The @code{:from-end} | |
3464 | argument, if true, says that elements should be deleted from the | |
3465 | end of the sequence rather than the beginning (this matters only | |
3466 | if @var{count} was also specified). | |
3467 | @end defun | |
3468 | ||
39a58b5b | 3469 | @defun cl-delete item seq @t{&key :test :test-not :key :count :start :end :from-end} |
4009494e GM |
3470 | This deletes all elements of @var{seq} which match @var{item}. |
3471 | It is a destructive operation. Since Emacs Lisp does not support | |
39a58b5b GM |
3472 | stretchable strings or vectors, this is the same as @code{cl-remove} |
3473 | for those sequence types. On lists, @code{cl-remove} will copy the | |
4009494e | 3474 | list if necessary to preserve the original list, whereas |
39a58b5b | 3475 | @code{cl-delete} will splice out parts of the argument list. |
4009494e GM |
3476 | Compare @code{append} and @code{nconc}, which are analogous |
3477 | non-destructive and destructive list operations in Emacs Lisp. | |
3478 | @end defun | |
3479 | ||
39a58b5b GM |
3480 | @findex cl-remove-if |
3481 | @findex cl-remove-if-not | |
3482 | @findex cl-delete-if | |
3483 | @findex cl-delete-if-not | |
3484 | The predicate-oriented functions @code{cl-remove-if}, @code{cl-remove-if-not}, | |
3485 | @code{cl-delete-if}, and @code{cl-delete-if-not} are defined similarly. | |
4009494e | 3486 | |
39a58b5b | 3487 | @defun cl-remove-duplicates seq @t{&key :test :test-not :key :start :end :from-end} |
4009494e GM |
3488 | This function returns a copy of @var{seq} with duplicate elements |
3489 | removed. Specifically, if two elements from the sequence match | |
3490 | according to the @code{:test}, @code{:test-not}, and @code{:key} | |
3491 | arguments, only the rightmost one is retained. If @code{:from-end} | |
3492 | is true, the leftmost one is retained instead. If @code{:start} or | |
3493 | @code{:end} is specified, only elements within that subsequence are | |
3494 | examined or removed. | |
3495 | @end defun | |
3496 | ||
39a58b5b | 3497 | @defun cl-delete-duplicates seq @t{&key :test :test-not :key :start :end :from-end} |
4009494e | 3498 | This function deletes duplicate elements from @var{seq}. It is |
39a58b5b | 3499 | a destructive version of @code{cl-remove-duplicates}. |
4009494e GM |
3500 | @end defun |
3501 | ||
39a58b5b | 3502 | @defun cl-substitute new old seq @t{&key :test :test-not :key :count :start :end :from-end} |
4009494e GM |
3503 | This function returns a copy of @var{seq}, with all elements |
3504 | matching @var{old} replaced with @var{new}. The @code{:count}, | |
3505 | @code{:start}, @code{:end}, and @code{:from-end} arguments may be | |
3506 | used to limit the number of substitutions made. | |
3507 | @end defun | |
3508 | ||
39a58b5b GM |
3509 | @defun cl-nsubstitute new old seq @t{&key :test :test-not :key :count :start :end :from-end} |
3510 | This is a destructive version of @code{cl-substitute}; it performs | |
4009494e GM |
3511 | the substitution using @code{setcar} or @code{aset} rather than |
3512 | by returning a changed copy of the sequence. | |
3513 | @end defun | |
3514 | ||
39a58b5b GM |
3515 | @findex cl-substitute-if |
3516 | @findex cl-substitute-if-not | |
3517 | @findex cl-nsubstitute-if | |
3518 | @findex cl-nsubstitute-if-not | |
a05cb6e3 GM |
3519 | The functions @code{cl-substitute-if}, @code{cl-substitute-if-not}, |
3520 | @code{cl-nsubstitute-if}, and @code{cl-nsubstitute-if-not} are defined | |
3521 | similarly. For these, a @var{predicate} is given in place of the | |
3522 | @var{old} argument. | |
4009494e | 3523 | |
1d5b82ef | 3524 | @node Searching Sequences |
4009494e GM |
3525 | @section Searching Sequences |
3526 | ||
3527 | @noindent | |
3528 | These functions search for elements or subsequences in a sequence. | |
39a58b5b | 3529 | (See also @code{cl-member} and @code{cl-assoc}; @pxref{Lists}.) |
4009494e | 3530 | |
39a58b5b | 3531 | @defun cl-find item seq @t{&key :test :test-not :key :start :end :from-end} |
4009494e GM |
3532 | This function searches @var{seq} for an element matching @var{item}. |
3533 | If it finds a match, it returns the matching element. Otherwise, | |
3534 | it returns @code{nil}. It returns the leftmost match, unless | |
3535 | @code{:from-end} is true, in which case it returns the rightmost | |
3536 | match. The @code{:start} and @code{:end} arguments may be used to | |
3537 | limit the range of elements that are searched. | |
3538 | @end defun | |
3539 | ||
39a58b5b GM |
3540 | @defun cl-position item seq @t{&key :test :test-not :key :start :end :from-end} |
3541 | This function is like @code{cl-find}, except that it returns the | |
4009494e GM |
3542 | integer position in the sequence of the matching item rather than |
3543 | the item itself. The position is relative to the start of the | |
3544 | sequence as a whole, even if @code{:start} is non-zero. The function | |
3545 | returns @code{nil} if no matching element was found. | |
3546 | @end defun | |
3547 | ||
39a58b5b | 3548 | @defun cl-count item seq @t{&key :test :test-not :key :start :end} |
4009494e GM |
3549 | This function returns the number of elements of @var{seq} which |
3550 | match @var{item}. The result is always a nonnegative integer. | |
3551 | @end defun | |
3552 | ||
39a58b5b GM |
3553 | @findex cl-find-if |
3554 | @findex cl-find-if-not | |
3555 | @findex cl-position-if | |
3556 | @findex cl-position-if-not | |
3557 | @findex cl-count-if | |
3558 | @findex cl-count-if-not | |
3559 | The @code{cl-find-if}, @code{cl-find-if-not}, @code{cl-position-if}, | |
3560 | @code{cl-position-if-not}, @code{cl-count-if}, and @code{cl-count-if-not} | |
4009494e GM |
3561 | functions are defined similarly. |
3562 | ||
39a58b5b | 3563 | @defun cl-mismatch seq1 seq2 @t{&key :test :test-not :key :start1 :end1 :start2 :end2 :from-end} |
4009494e GM |
3564 | This function compares the specified parts of @var{seq1} and |
3565 | @var{seq2}. If they are the same length and the corresponding | |
3566 | elements match (according to @code{:test}, @code{:test-not}, | |
3567 | and @code{:key}), the function returns @code{nil}. If there is | |
3568 | a mismatch, the function returns the index (relative to @var{seq1}) | |
3569 | of the first mismatching element. This will be the leftmost pair of | |
3570 | elements which do not match, or the position at which the shorter of | |
3571 | the two otherwise-matching sequences runs out. | |
3572 | ||
3573 | If @code{:from-end} is true, then the elements are compared from right | |
3574 | to left starting at @code{(1- @var{end1})} and @code{(1- @var{end2})}. | |
3575 | If the sequences differ, then one plus the index of the rightmost | |
3576 | difference (relative to @var{seq1}) is returned. | |
3577 | ||
39a58b5b | 3578 | An interesting example is @code{(cl-mismatch str1 str2 :key 'upcase)}, |
4009494e GM |
3579 | which compares two strings case-insensitively. |
3580 | @end defun | |
3581 | ||
39a58b5b | 3582 | @defun cl-search seq1 seq2 @t{&key :test :test-not :key :from-end :start1 :end1 :start2 :end2} |
4009494e GM |
3583 | This function searches @var{seq2} for a subsequence that matches |
3584 | @var{seq1} (or part of it specified by @code{:start1} and | |
3585 | @code{:end1}.) Only matches which fall entirely within the region | |
3586 | defined by @code{:start2} and @code{:end2} will be considered. | |
3587 | The return value is the index of the leftmost element of the | |
3588 | leftmost match, relative to the start of @var{seq2}, or @code{nil} | |
3589 | if no matches were found. If @code{:from-end} is true, the | |
3590 | function finds the @emph{rightmost} matching subsequence. | |
3591 | @end defun | |
3592 | ||
1d5b82ef | 3593 | @node Sorting Sequences |
4009494e GM |
3594 | @section Sorting Sequences |
3595 | ||
39a58b5b | 3596 | @defun clsort seq predicate @t{&key :key} |
4009494e GM |
3597 | This function sorts @var{seq} into increasing order as determined |
3598 | by using @var{predicate} to compare pairs of elements. @var{predicate} | |
3599 | should return true (non-@code{nil}) if and only if its first argument | |
3600 | is less than (not equal to) its second argument. For example, | |
3601 | @code{<} and @code{string-lessp} are suitable predicate functions | |
3602 | for sorting numbers and strings, respectively; @code{>} would sort | |
3603 | numbers into decreasing rather than increasing order. | |
3604 | ||
44e97401 | 3605 | This function differs from Emacs's built-in @code{sort} in that it |
4009494e GM |
3606 | can operate on any type of sequence, not just lists. Also, it |
3607 | accepts a @code{:key} argument which is used to preprocess data | |
3608 | fed to the @var{predicate} function. For example, | |
3609 | ||
3610 | @example | |
39a58b5b | 3611 | (setq data (cl-sort data 'string-lessp :key 'downcase)) |
4009494e GM |
3612 | @end example |
3613 | ||
3614 | @noindent | |
3615 | sorts @var{data}, a sequence of strings, into increasing alphabetical | |
3616 | order without regard to case. A @code{:key} function of @code{car} | |
3617 | would be useful for sorting association lists. It should only be a | |
3618 | simple accessor though, it's used heavily in the current | |
3619 | implementation. | |
3620 | ||
39a58b5b | 3621 | The @code{cl-sort} function is destructive; it sorts lists by actually |
4009494e GM |
3622 | rearranging the @code{cdr} pointers in suitable fashion. |
3623 | @end defun | |
3624 | ||
39a58b5b | 3625 | @defun cl-stable-sort seq predicate @t{&key :key} |
4009494e GM |
3626 | This function sorts @var{seq} @dfn{stably}, meaning two elements |
3627 | which are equal in terms of @var{predicate} are guaranteed not to | |
3628 | be rearranged out of their original order by the sort. | |
3629 | ||
39a58b5b | 3630 | In practice, @code{cl-sort} and @code{cl-stable-sort} are equivalent |
4009494e GM |
3631 | in Emacs Lisp because the underlying @code{sort} function is |
3632 | stable by default. However, this package reserves the right to | |
39a58b5b | 3633 | use non-stable methods for @code{cl-sort} in the future. |
4009494e GM |
3634 | @end defun |
3635 | ||
39a58b5b | 3636 | @defun cl-merge type seq1 seq2 predicate @t{&key :key} |
4009494e GM |
3637 | This function merges two sequences @var{seq1} and @var{seq2} by |
3638 | interleaving their elements. The result sequence, of type @var{type} | |
39a58b5b | 3639 | (in the sense of @code{cl-concatenate}), has length equal to the sum |
4009494e GM |
3640 | of the lengths of the two input sequences. The sequences may be |
3641 | modified destructively. Order of elements within @var{seq1} and | |
3642 | @var{seq2} is preserved in the interleaving; elements of the two | |
3643 | sequences are compared by @var{predicate} (in the sense of | |
3644 | @code{sort}) and the lesser element goes first in the result. | |
3645 | When elements are equal, those from @var{seq1} precede those from | |
3646 | @var{seq2} in the result. Thus, if @var{seq1} and @var{seq2} are | |
3647 | both sorted according to @var{predicate}, then the result will be | |
3648 | a merged sequence which is (stably) sorted according to | |
3649 | @var{predicate}. | |
3650 | @end defun | |
3651 | ||
1d5b82ef | 3652 | @node Lists |
4009494e GM |
3653 | @chapter Lists |
3654 | ||
3655 | @noindent | |
3656 | The functions described here operate on lists. | |
3657 | ||
3658 | @menu | |
39a58b5b GM |
3659 | * List Functions:: @code{cl-caddr}, @code{cl-first}, @code{cl-list*}, etc. |
3660 | * Substitution of Expressions:: @code{cl-subst}, @code{cl-sublis}, etc. | |
3661 | * Lists as Sets:: @code{cl-member}, @code{cl-adjoin}, @code{cl-union}, etc. | |
3662 | * Association Lists:: @code{cl-assoc}, @code{cl-rassoc}, @code{cl-acons}, @code{cl-pairlis}. | |
4009494e GM |
3663 | @end menu |
3664 | ||
1d5b82ef | 3665 | @node List Functions |
4009494e GM |
3666 | @section List Functions |
3667 | ||
3668 | @noindent | |
3669 | This section describes a number of simple operations on lists, | |
3670 | i.e., chains of cons cells. | |
3671 | ||
39a58b5b | 3672 | @defun cl-caddr x |
4009494e GM |
3673 | This function is equivalent to @code{(car (cdr (cdr @var{x})))}. |
3674 | Likewise, this package defines all 28 @code{c@var{xxx}r} functions | |
3675 | where @var{xxx} is up to four @samp{a}s and/or @samp{d}s. | |
3676 | All of these functions are @code{setf}-able, and calls to them | |
3677 | are expanded inline by the byte-compiler for maximum efficiency. | |
3678 | @end defun | |
3679 | ||
39a58b5b | 3680 | @defun cl-first x |
4009494e | 3681 | This function is a synonym for @code{(car @var{x})}. Likewise, |
39a58b5b GM |
3682 | the functions @code{cl-second}, @code{cl-third}, @dots{}, through |
3683 | @code{cl-tenth} return the given element of the list @var{x}. | |
4009494e GM |
3684 | @end defun |
3685 | ||
39a58b5b | 3686 | @defun cl-rest x |
4009494e GM |
3687 | This function is a synonym for @code{(cdr @var{x})}. |
3688 | @end defun | |
3689 | ||
39a58b5b | 3690 | @defun cl-endp x |
4009494e GM |
3691 | Common Lisp defines this function to act like @code{null}, but |
3692 | signaling an error if @code{x} is neither a @code{nil} nor a | |
39a58b5b | 3693 | cons cell. This package simply defines @code{cl-endp} as a synonym |
4009494e GM |
3694 | for @code{null}. |
3695 | @end defun | |
3696 | ||
39a58b5b | 3697 | @defun cl-list-length x |
4009494e GM |
3698 | This function returns the length of list @var{x}, exactly like |
3699 | @code{(length @var{x})}, except that if @var{x} is a circular | |
3700 | list (where the cdr-chain forms a loop rather than terminating | |
3701 | with @code{nil}), this function returns @code{nil}. (The regular | |
3702 | @code{length} function would get stuck if given a circular list.) | |
3703 | @end defun | |
3704 | ||
39a58b5b | 3705 | @defun cl-list* arg &rest others |
4009494e GM |
3706 | This function constructs a list of its arguments. The final |
3707 | argument becomes the @code{cdr} of the last cell constructed. | |
39a58b5b | 3708 | Thus, @code{(cl-list* @var{a} @var{b} @var{c})} is equivalent to |
4009494e | 3709 | @code{(cons @var{a} (cons @var{b} @var{c}))}, and |
39a58b5b | 3710 | @code{(cl-list* @var{a} @var{b} nil)} is equivalent to |
4009494e | 3711 | @code{(list @var{a} @var{b})}. |
4009494e GM |
3712 | @end defun |
3713 | ||
39a58b5b | 3714 | @defun cl-ldiff list sublist |
4009494e GM |
3715 | If @var{sublist} is a sublist of @var{list}, i.e., is @code{eq} to |
3716 | one of the cons cells of @var{list}, then this function returns | |
3717 | a copy of the part of @var{list} up to but not including | |
39a58b5b | 3718 | @var{sublist}. For example, @code{(cl-ldiff x (cddr x))} returns |
4009494e GM |
3719 | the first two elements of the list @code{x}. The result is a |
3720 | copy; the original @var{list} is not modified. If @var{sublist} | |
3721 | is not a sublist of @var{list}, a copy of the entire @var{list} | |
3722 | is returned. | |
3723 | @end defun | |
3724 | ||
39a58b5b | 3725 | @defun cl-copy-list list |
4009494e GM |
3726 | This function returns a copy of the list @var{list}. It copies |
3727 | dotted lists like @code{(1 2 . 3)} correctly. | |
3728 | @end defun | |
3729 | ||
3730 | @defun copy-tree x &optional vecp | |
3731 | This function returns a copy of the tree of cons cells @var{x}. | |
39a58b5b GM |
3732 | @c FIXME? cl-copy-list is not an alias of copy-sequence. |
3733 | Unlike @code{copy-sequence} (and its alias @code{cl-copy-list}), | |
4009494e GM |
3734 | which copies only along the @code{cdr} direction, this function |
3735 | copies (recursively) along both the @code{car} and the @code{cdr} | |
3736 | directions. If @var{x} is not a cons cell, the function simply | |
3737 | returns @var{x} unchanged. If the optional @var{vecp} argument | |
3738 | is true, this function copies vectors (recursively) as well as | |
3739 | cons cells. | |
3740 | @end defun | |
3741 | ||
39a58b5b | 3742 | @defun cl-tree-equal x y @t{&key :test :test-not :key} |
4009494e GM |
3743 | This function compares two trees of cons cells. If @var{x} and |
3744 | @var{y} are both cons cells, their @code{car}s and @code{cdr}s are | |
3745 | compared recursively. If neither @var{x} nor @var{y} is a cons | |
3746 | cell, they are compared by @code{eql}, or according to the | |
3747 | specified test. The @code{:key} function, if specified, is | |
3748 | applied to the elements of both trees. @xref{Sequences}. | |
3749 | @end defun | |
3750 | ||
1d5b82ef | 3751 | @node Substitution of Expressions |
4009494e GM |
3752 | @section Substitution of Expressions |
3753 | ||
3754 | @noindent | |
3755 | These functions substitute elements throughout a tree of cons | |
39a58b5b | 3756 | cells. (@xref{Sequence Functions}, for the @code{cl-substitute} |
4009494e GM |
3757 | function, which works on just the top-level elements of a list.) |
3758 | ||
39a58b5b | 3759 | @defun cl-subst new old tree @t{&key :test :test-not :key} |
4009494e GM |
3760 | This function substitutes occurrences of @var{old} with @var{new} |
3761 | in @var{tree}, a tree of cons cells. It returns a substituted | |
3762 | tree, which will be a copy except that it may share storage with | |
3763 | the argument @var{tree} in parts where no substitutions occurred. | |
3764 | The original @var{tree} is not modified. This function recurses | |
3765 | on, and compares against @var{old}, both @code{car}s and @code{cdr}s | |
3766 | of the component cons cells. If @var{old} is itself a cons cell, | |
3767 | then matching cells in the tree are substituted as usual without | |
3768 | recursively substituting in that cell. Comparisons with @var{old} | |
3769 | are done according to the specified test (@code{eql} by default). | |
3770 | The @code{:key} function is applied to the elements of the tree | |
3771 | but not to @var{old}. | |
3772 | @end defun | |
3773 | ||
39a58b5b GM |
3774 | @defun cl-nsubst new old tree @t{&key :test :test-not :key} |
3775 | This function is like @code{cl-subst}, except that it works by | |
4009494e GM |
3776 | destructive modification (by @code{setcar} or @code{setcdr}) |
3777 | rather than copying. | |
3778 | @end defun | |
3779 | ||
39a58b5b GM |
3780 | @findex cl-subst-if |
3781 | @findex cl-subst-if-not | |
3782 | @findex cl-nsubst-if | |
3783 | @findex cl-nsubst-if-not | |
3784 | The @code{cl-subst-if}, @code{cl-subst-if-not}, @code{cl-nsubst-if}, and | |
3785 | @code{cl-nsubst-if-not} functions are defined similarly. | |
4009494e | 3786 | |
39a58b5b GM |
3787 | @defun cl-sublis alist tree @t{&key :test :test-not :key} |
3788 | This function is like @code{cl-subst}, except that it takes an | |
4009494e GM |
3789 | association list @var{alist} of @var{old}-@var{new} pairs. |
3790 | Each element of the tree (after applying the @code{:key} | |
3791 | function, if any), is compared with the @code{car}s of | |
3792 | @var{alist}; if it matches, it is replaced by the corresponding | |
3793 | @code{cdr}. | |
3794 | @end defun | |
3795 | ||
39a58b5b GM |
3796 | @defun cl-nsublis alist tree @t{&key :test :test-not :key} |
3797 | This is a destructive version of @code{cl-sublis}. | |
4009494e GM |
3798 | @end defun |
3799 | ||
1d5b82ef | 3800 | @node Lists as Sets |
4009494e GM |
3801 | @section Lists as Sets |
3802 | ||
3803 | @noindent | |
3804 | These functions perform operations on lists which represent sets | |
3805 | of elements. | |
3806 | ||
39a58b5b | 3807 | @defun cl-member item list @t{&key :test :test-not :key} |
4009494e GM |
3808 | This function searches @var{list} for an element matching @var{item}. |
3809 | If a match is found, it returns the cons cell whose @code{car} was | |
3810 | the matching element. Otherwise, it returns @code{nil}. Elements | |
3811 | are compared by @code{eql} by default; you can use the @code{:test}, | |
3812 | @code{:test-not}, and @code{:key} arguments to modify this behavior. | |
3813 | @xref{Sequences}. | |
3814 | ||
39a58b5b GM |
3815 | The standard Emacs lisp function @code{member} uses @code{equal} for |
3816 | comparisons; it is equivalent to @code{(cl-member @var{item} @var{list} | |
3817 | :test 'equal)}. | |
4009494e GM |
3818 | @end defun |
3819 | ||
39a58b5b GM |
3820 | @findex cl-member-if |
3821 | @findex cl-member-if-not | |
3822 | The @code{cl-member-if} and @code{cl-member-if-not} functions | |
4009494e GM |
3823 | analogously search for elements which satisfy a given predicate. |
3824 | ||
39a58b5b | 3825 | @defun cl-tailp sublist list |
4009494e GM |
3826 | This function returns @code{t} if @var{sublist} is a sublist of |
3827 | @var{list}, i.e., if @var{sublist} is @code{eql} to @var{list} or to | |
3828 | any of its @code{cdr}s. | |
3829 | @end defun | |
3830 | ||
39a58b5b | 3831 | @defun cl-adjoin item list @t{&key :test :test-not :key} |
4009494e GM |
3832 | This function conses @var{item} onto the front of @var{list}, |
3833 | like @code{(cons @var{item} @var{list})}, but only if @var{item} | |
39a58b5b | 3834 | is not already present on the list (as determined by @code{cl-member}). |
4009494e GM |
3835 | If a @code{:key} argument is specified, it is applied to |
3836 | @var{item} as well as to the elements of @var{list} during | |
3837 | the search, on the reasoning that @var{item} is ``about'' to | |
3838 | become part of the list. | |
3839 | @end defun | |
3840 | ||
39a58b5b | 3841 | @defun cl-union list1 list2 @t{&key :test :test-not :key} |
4009494e GM |
3842 | This function combines two lists which represent sets of items, |
3843 | returning a list that represents the union of those two sets. | |
3844 | The result list will contain all items which appear in @var{list1} | |
3845 | or @var{list2}, and no others. If an item appears in both | |
3846 | @var{list1} and @var{list2} it will be copied only once. If | |
3847 | an item is duplicated in @var{list1} or @var{list2}, it is | |
3848 | undefined whether or not that duplication will survive in the | |
3849 | result list. The order of elements in the result list is also | |
3850 | undefined. | |
3851 | @end defun | |
3852 | ||
39a58b5b GM |
3853 | @defun cl-nunion list1 list2 @t{&key :test :test-not :key} |
3854 | This is a destructive version of @code{cl-union}; rather than copying, | |
4009494e GM |
3855 | it tries to reuse the storage of the argument lists if possible. |
3856 | @end defun | |
3857 | ||
39a58b5b | 3858 | @defun cl-intersection list1 list2 @t{&key :test :test-not :key} |
4009494e GM |
3859 | This function computes the intersection of the sets represented |
3860 | by @var{list1} and @var{list2}. It returns the list of items | |
3861 | which appear in both @var{list1} and @var{list2}. | |
3862 | @end defun | |
3863 | ||
39a58b5b GM |
3864 | @defun cl-nintersection list1 list2 @t{&key :test :test-not :key} |
3865 | This is a destructive version of @code{cl-intersection}. It | |
4009494e GM |
3866 | tries to reuse storage of @var{list1} rather than copying. |
3867 | It does @emph{not} reuse the storage of @var{list2}. | |
3868 | @end defun | |
3869 | ||
39a58b5b | 3870 | @defun cl-set-difference list1 list2 @t{&key :test :test-not :key} |
4009494e GM |
3871 | This function computes the ``set difference'' of @var{list1} |
3872 | and @var{list2}, i.e., the set of elements that appear in | |
3873 | @var{list1} but @emph{not} in @var{list2}. | |
3874 | @end defun | |
3875 | ||
39a58b5b GM |
3876 | @defun cl-nset-difference list1 list2 @t{&key :test :test-not :key} |
3877 | This is a destructive @code{cl-set-difference}, which will try | |
4009494e GM |
3878 | to reuse @var{list1} if possible. |
3879 | @end defun | |
3880 | ||
39a58b5b | 3881 | @defun cl-set-exclusive-or list1 list2 @t{&key :test :test-not :key} |
4009494e GM |
3882 | This function computes the ``set exclusive or'' of @var{list1} |
3883 | and @var{list2}, i.e., the set of elements that appear in | |
3884 | exactly one of @var{list1} and @var{list2}. | |
3885 | @end defun | |
3886 | ||
39a58b5b GM |
3887 | @defun cl-nset-exclusive-or list1 list2 @t{&key :test :test-not :key} |
3888 | This is a destructive @code{cl-set-exclusive-or}, which will try | |
4009494e GM |
3889 | to reuse @var{list1} and @var{list2} if possible. |
3890 | @end defun | |
3891 | ||
39a58b5b | 3892 | @defun cl-subsetp list1 list2 @t{&key :test :test-not :key} |
4009494e GM |
3893 | This function checks whether @var{list1} represents a subset |
3894 | of @var{list2}, i.e., whether every element of @var{list1} | |
3895 | also appears in @var{list2}. | |
3896 | @end defun | |
3897 | ||
1d5b82ef | 3898 | @node Association Lists |
4009494e GM |
3899 | @section Association Lists |
3900 | ||
3901 | @noindent | |
3902 | An @dfn{association list} is a list representing a mapping from | |
3903 | one set of values to another; any list whose elements are cons | |
3904 | cells is an association list. | |
3905 | ||
39a58b5b | 3906 | @defun cl-assoc item a-list @t{&key :test :test-not :key} |
4009494e GM |
3907 | This function searches the association list @var{a-list} for an |
3908 | element whose @code{car} matches (in the sense of @code{:test}, | |
3909 | @code{:test-not}, and @code{:key}, or by comparison with @code{eql}) | |
3910 | a given @var{item}. It returns the matching element, if any, | |
3911 | otherwise @code{nil}. It ignores elements of @var{a-list} which | |
3912 | are not cons cells. (This corresponds to the behavior of | |
3913 | @code{assq} and @code{assoc} in Emacs Lisp; Common Lisp's | |
3914 | @code{assoc} ignores @code{nil}s but considers any other non-cons | |
3915 | elements of @var{a-list} to be an error.) | |
3916 | @end defun | |
3917 | ||
39a58b5b | 3918 | @defun cl-rassoc item a-list @t{&key :test :test-not :key} |
4009494e GM |
3919 | This function searches for an element whose @code{cdr} matches |
3920 | @var{item}. If @var{a-list} represents a mapping, this applies | |
3921 | the inverse of the mapping to @var{item}. | |
3922 | @end defun | |
3923 | ||
39a58b5b GM |
3924 | @findex cl-assoc-if |
3925 | @findex cl-assoc-if-not | |
3926 | @findex cl-rassoc-if | |
3927 | @findex cl-rassoc-if-not | |
3928 | The @code{cl-assoc-if}, @code{cl-assoc-if-not}, @code{cl-rassoc-if}, | |
3929 | and @code{cl-rassoc-if-not} functions are defined similarly. | |
4009494e GM |
3930 | |
3931 | Two simple functions for constructing association lists are: | |
3932 | ||
39a58b5b | 3933 | @defun cl-acons key value alist |
4009494e GM |
3934 | This is equivalent to @code{(cons (cons @var{key} @var{value}) @var{alist})}. |
3935 | @end defun | |
3936 | ||
39a58b5b GM |
3937 | @defun cl-pairlis keys values &optional alist |
3938 | This is equivalent to @code{(nconc (cl-mapcar 'cons @var{keys} @var{values}) | |
4009494e GM |
3939 | @var{alist})}. |
3940 | @end defun | |
3941 | ||
1d5b82ef | 3942 | @node Structures |
4009494e GM |
3943 | @chapter Structures |
3944 | ||
3945 | @noindent | |
3946 | The Common Lisp @dfn{structure} mechanism provides a general way | |
3947 | to define data types similar to C's @code{struct} types. A | |
3948 | structure is a Lisp object containing some number of @dfn{slots}, | |
3949 | each of which can hold any Lisp data object. Functions are | |
3950 | provided for accessing and setting the slots, creating or copying | |
3951 | structure objects, and recognizing objects of a particular structure | |
3952 | type. | |
3953 | ||
3954 | In true Common Lisp, each structure type is a new type distinct | |
3955 | from all existing Lisp types. Since the underlying Emacs Lisp | |
3956 | system provides no way to create new distinct types, this package | |
3957 | implements structures as vectors (or lists upon request) with a | |
3958 | special ``tag'' symbol to identify them. | |
3959 | ||
e1117425 | 3960 | @defmac cl-defstruct name slots@dots{} |
39a58b5b | 3961 | The @code{cl-defstruct} form defines a new structure type called |
4009494e GM |
3962 | @var{name}, with the specified @var{slots}. (The @var{slots} |
3963 | may begin with a string which documents the structure type.) | |
3964 | In the simplest case, @var{name} and each of the @var{slots} | |
3965 | are symbols. For example, | |
3966 | ||
3967 | @example | |
39a58b5b | 3968 | (cl-defstruct person name age sex) |
4009494e GM |
3969 | @end example |
3970 | ||
3971 | @noindent | |
3972 | defines a struct type called @code{person} which contains three | |
3973 | slots. Given a @code{person} object @var{p}, you can access those | |
3974 | slots by calling @code{(person-name @var{p})}, @code{(person-age @var{p})}, | |
3975 | and @code{(person-sex @var{p})}. You can also change these slots by | |
3976 | using @code{setf} on any of these place forms: | |
3977 | ||
3978 | @example | |
39a58b5b | 3979 | (cl-incf (person-age birthday-boy)) |
4009494e GM |
3980 | @end example |
3981 | ||
3982 | You can create a new @code{person} by calling @code{make-person}, | |
3983 | which takes keyword arguments @code{:name}, @code{:age}, and | |
3984 | @code{:sex} to specify the initial values of these slots in the | |
3985 | new object. (Omitting any of these arguments leaves the corresponding | |
a05cb6e3 | 3986 | slot ``undefined'', according to the Common Lisp standard; in Emacs |
4009494e GM |
3987 | Lisp, such uninitialized slots are filled with @code{nil}.) |
3988 | ||
3989 | Given a @code{person}, @code{(copy-person @var{p})} makes a new | |
3990 | object of the same type whose slots are @code{eq} to those of @var{p}. | |
3991 | ||
3992 | Given any Lisp object @var{x}, @code{(person-p @var{x})} returns | |
3993 | true if @var{x} looks like a @code{person}, false otherwise. (Again, | |
3994 | in Common Lisp this predicate would be exact; in Emacs Lisp the | |
3995 | best it can do is verify that @var{x} is a vector of the correct | |
3996 | length which starts with the correct tag symbol.) | |
3997 | ||
3998 | Accessors like @code{person-name} normally check their arguments | |
3999 | (effectively using @code{person-p}) and signal an error if the | |
4000 | argument is the wrong type. This check is affected by | |
4001 | @code{(optimize (safety @dots{}))} declarations. Safety level 1, | |
4002 | the default, uses a somewhat optimized check that will detect all | |
4003 | incorrect arguments, but may use an uninformative error message | |
4004 | (e.g., ``expected a vector'' instead of ``expected a @code{person}''). | |
4005 | Safety level 0 omits all checks except as provided by the underlying | |
4006 | @code{aref} call; safety levels 2 and 3 do rigorous checking that will | |
4007 | always print a descriptive error message for incorrect inputs. | |
4008 | @xref{Declarations}. | |
4009 | ||
4010 | @example | |
4011 | (setq dave (make-person :name "Dave" :sex 'male)) | |
4012 | @result{} [cl-struct-person "Dave" nil male] | |
4013 | (setq other (copy-person dave)) | |
4014 | @result{} [cl-struct-person "Dave" nil male] | |
4015 | (eq dave other) | |
4016 | @result{} nil | |
4017 | (eq (person-name dave) (person-name other)) | |
4018 | @result{} t | |
4019 | (person-p dave) | |
4020 | @result{} t | |
4021 | (person-p [1 2 3 4]) | |
4022 | @result{} nil | |
4023 | (person-p "Bogus") | |
4024 | @result{} nil | |
4025 | (person-p '[cl-struct-person counterfeit person object]) | |
4026 | @result{} t | |
4027 | @end example | |
4028 | ||
4029 | In general, @var{name} is either a name symbol or a list of a name | |
4030 | symbol followed by any number of @dfn{struct options}; each @var{slot} | |
4031 | is either a slot symbol or a list of the form @samp{(@var{slot-name} | |
4032 | @var{default-value} @var{slot-options}@dots{})}. The @var{default-value} | |
4033 | is a Lisp form which is evaluated any time an instance of the | |
4034 | structure type is created without specifying that slot's value. | |
4035 | ||
4036 | Common Lisp defines several slot options, but the only one | |
4037 | implemented in this package is @code{:read-only}. A non-@code{nil} | |
4038 | value for this option means the slot should not be @code{setf}-able; | |
4039 | the slot's value is determined when the object is created and does | |
4040 | not change afterward. | |
4041 | ||
4042 | @example | |
39a58b5b GM |
4043 | (cl-defstruct person |
4044 | (name nil :read-only t) | |
4045 | age | |
4046 | (sex 'unknown)) | |
4009494e GM |
4047 | @end example |
4048 | ||
4049 | Any slot options other than @code{:read-only} are ignored. | |
4050 | ||
4051 | For obscure historical reasons, structure options take a different | |
4052 | form than slot options. A structure option is either a keyword | |
4053 | symbol, or a list beginning with a keyword symbol possibly followed | |
4054 | by arguments. (By contrast, slot options are key-value pairs not | |
4055 | enclosed in lists.) | |
4056 | ||
4057 | @example | |
39a58b5b GM |
4058 | (cl-defstruct (person (:constructor create-person) |
4059 | (:type list) | |
4060 | :named) | |
4061 | name age sex) | |
4009494e GM |
4062 | @end example |
4063 | ||
4064 | The following structure options are recognized. | |
4065 | ||
4066 | @table @code | |
4009494e GM |
4067 | @item :conc-name |
4068 | The argument is a symbol whose print name is used as the prefix for | |
4069 | the names of slot accessor functions. The default is the name of | |
4070 | the struct type followed by a hyphen. The option @code{(:conc-name p-)} | |
4071 | would change this prefix to @code{p-}. Specifying @code{nil} as an | |
4072 | argument means no prefix, so that the slot names themselves are used | |
4073 | to name the accessor functions. | |
4074 | ||
4075 | @item :constructor | |
4076 | In the simple case, this option takes one argument which is an | |
4077 | alternate name to use for the constructor function. The default | |
4078 | is @code{make-@var{name}}, e.g., @code{make-person}. The above | |
4079 | example changes this to @code{create-person}. Specifying @code{nil} | |
4080 | as an argument means that no standard constructor should be | |
4081 | generated at all. | |
4082 | ||
4083 | In the full form of this option, the constructor name is followed | |
4084 | by an arbitrary argument list. @xref{Program Structure}, for a | |
4085 | description of the format of Common Lisp argument lists. All | |
4086 | options, such as @code{&rest} and @code{&key}, are supported. | |
4087 | The argument names should match the slot names; each slot is | |
4088 | initialized from the corresponding argument. Slots whose names | |
4089 | do not appear in the argument list are initialized based on the | |
4090 | @var{default-value} in their slot descriptor. Also, @code{&optional} | |
4091 | and @code{&key} arguments which don't specify defaults take their | |
4092 | defaults from the slot descriptor. It is valid to include arguments | |
4093 | which don't correspond to slot names; these are useful if they are | |
4094 | referred to in the defaults for optional, keyword, or @code{&aux} | |
4095 | arguments which @emph{do} correspond to slots. | |
4096 | ||
4097 | You can specify any number of full-format @code{:constructor} | |
4098 | options on a structure. The default constructor is still generated | |
4099 | as well unless you disable it with a simple-format @code{:constructor} | |
4100 | option. | |
4101 | ||
4102 | @example | |
39a58b5b GM |
4103 | (cl-defstruct |
4104 | (person | |
4105 | (:constructor nil) ; no default constructor | |
a05cb6e3 GM |
4106 | (:constructor new-person |
4107 | (name sex &optional (age 0))) | |
39a58b5b GM |
4108 | (:constructor new-hound (&key (name "Rover") |
4109 | (dog-years 0) | |
4110 | &aux (age (* 7 dog-years)) | |
4111 | (sex 'canine)))) | |
4112 | name age sex) | |
4009494e GM |
4113 | @end example |
4114 | ||
4115 | The first constructor here takes its arguments positionally rather | |
4116 | than by keyword. (In official Common Lisp terminology, constructors | |
4117 | that work By Order of Arguments instead of by keyword are called | |
a05cb6e3 | 4118 | ``BOA constructors''. No, I'm not making this up.) For example, |
4009494e GM |
4119 | @code{(new-person "Jane" 'female)} generates a person whose slots |
4120 | are @code{"Jane"}, 0, and @code{female}, respectively. | |
4121 | ||
4122 | The second constructor takes two keyword arguments, @code{:name}, | |
4123 | which initializes the @code{name} slot and defaults to @code{"Rover"}, | |
4124 | and @code{:dog-years}, which does not itself correspond to a slot | |
4125 | but which is used to initialize the @code{age} slot. The @code{sex} | |
4126 | slot is forced to the symbol @code{canine} with no syntax for | |
4127 | overriding it. | |
4128 | ||
4129 | @item :copier | |
4130 | The argument is an alternate name for the copier function for | |
4131 | this type. The default is @code{copy-@var{name}}. @code{nil} | |
4132 | means not to generate a copier function. (In this implementation, | |
4133 | all copier functions are simply synonyms for @code{copy-sequence}.) | |
4134 | ||
4135 | @item :predicate | |
4136 | The argument is an alternate name for the predicate which recognizes | |
4137 | objects of this type. The default is @code{@var{name}-p}. @code{nil} | |
4138 | means not to generate a predicate function. (If the @code{:type} | |
4139 | option is used without the @code{:named} option, no predicate is | |
4140 | ever generated.) | |
4141 | ||
4142 | In true Common Lisp, @code{typep} is always able to recognize a | |
4143 | structure object even if @code{:predicate} was used. In this | |
a05cb6e3 | 4144 | package, @code{cl-typep} simply looks for a function called |
4009494e GM |
4145 | @code{@var{typename}-p}, so it will work for structure types |
4146 | only if they used the default predicate name. | |
4147 | ||
4148 | @item :include | |
4149 | This option implements a very limited form of C++-style inheritance. | |
4150 | The argument is the name of another structure type previously | |
39a58b5b | 4151 | created with @code{cl-defstruct}. The effect is to cause the new |
4009494e GM |
4152 | structure type to inherit all of the included structure's slots |
4153 | (plus, of course, any new slots described by this struct's slot | |
4154 | descriptors). The new structure is considered a ``specialization'' | |
4155 | of the included one. In fact, the predicate and slot accessors | |
4156 | for the included type will also accept objects of the new type. | |
4157 | ||
4158 | If there are extra arguments to the @code{:include} option after | |
4159 | the included-structure name, these options are treated as replacement | |
4160 | slot descriptors for slots in the included structure, possibly with | |
4161 | modified default values. Borrowing an example from Steele: | |
4162 | ||
4163 | @example | |
39a58b5b GM |
4164 | (cl-defstruct person name (age 0) sex) |
4165 | @result{} person | |
4166 | (cl-defstruct (astronaut (:include person (age 45))) | |
4167 | helmet-size | |
4168 | (favorite-beverage 'tang)) | |
4169 | @result{} astronaut | |
4009494e GM |
4170 | |
4171 | (setq joe (make-person :name "Joe")) | |
4172 | @result{} [cl-struct-person "Joe" 0 nil] | |
4173 | (setq buzz (make-astronaut :name "Buzz")) | |
4174 | @result{} [cl-struct-astronaut "Buzz" 45 nil nil tang] | |
4175 | ||
4176 | (list (person-p joe) (person-p buzz)) | |
4177 | @result{} (t t) | |
4178 | (list (astronaut-p joe) (astronaut-p buzz)) | |
4179 | @result{} (nil t) | |
4180 | ||
4181 | (person-name buzz) | |
4182 | @result{} "Buzz" | |
4183 | (astronaut-name joe) | |
4184 | @result{} error: "astronaut-name accessing a non-astronaut" | |
4185 | @end example | |
4186 | ||
4187 | Thus, if @code{astronaut} is a specialization of @code{person}, | |
4188 | then every @code{astronaut} is also a @code{person} (but not the | |
4189 | other way around). Every @code{astronaut} includes all the slots | |
4190 | of a @code{person}, plus extra slots that are specific to | |
4191 | astronauts. Operations that work on people (like @code{person-name}) | |
4192 | work on astronauts just like other people. | |
4193 | ||
4194 | @item :print-function | |
4195 | In full Common Lisp, this option allows you to specify a function | |
4196 | which is called to print an instance of the structure type. The | |
4197 | Emacs Lisp system offers no hooks into the Lisp printer which would | |
4198 | allow for such a feature, so this package simply ignores | |
4199 | @code{:print-function}. | |
4200 | ||
4201 | @item :type | |
4202 | The argument should be one of the symbols @code{vector} or @code{list}. | |
4203 | This tells which underlying Lisp data type should be used to implement | |
4204 | the new structure type. Vectors are used by default, but | |
4205 | @code{(:type list)} will cause structure objects to be stored as | |
4206 | lists instead. | |
4207 | ||
4208 | The vector representation for structure objects has the advantage | |
4209 | that all structure slots can be accessed quickly, although creating | |
4210 | vectors is a bit slower in Emacs Lisp. Lists are easier to create, | |
4211 | but take a relatively long time accessing the later slots. | |
4212 | ||
4213 | @item :named | |
4214 | This option, which takes no arguments, causes a characteristic ``tag'' | |
4215 | symbol to be stored at the front of the structure object. Using | |
4216 | @code{:type} without also using @code{:named} will result in a | |
4217 | structure type stored as plain vectors or lists with no identifying | |
4218 | features. | |
4219 | ||
4220 | The default, if you don't specify @code{:type} explicitly, is to | |
4221 | use named vectors. Therefore, @code{:named} is only useful in | |
4222 | conjunction with @code{:type}. | |
4223 | ||
4224 | @example | |
39a58b5b GM |
4225 | (cl-defstruct (person1) name age sex) |
4226 | (cl-defstruct (person2 (:type list) :named) name age sex) | |
4227 | (cl-defstruct (person3 (:type list)) name age sex) | |
4009494e GM |
4228 | |
4229 | (setq p1 (make-person1)) | |
4230 | @result{} [cl-struct-person1 nil nil nil] | |
4231 | (setq p2 (make-person2)) | |
4232 | @result{} (person2 nil nil nil) | |
4233 | (setq p3 (make-person3)) | |
4234 | @result{} (nil nil nil) | |
4235 | ||
4236 | (person1-p p1) | |
4237 | @result{} t | |
4238 | (person2-p p2) | |
4239 | @result{} t | |
4240 | (person3-p p3) | |
4241 | @result{} error: function person3-p undefined | |
4242 | @end example | |
4243 | ||
39a58b5b | 4244 | Since unnamed structures don't have tags, @code{cl-defstruct} is not |
4009494e GM |
4245 | able to make a useful predicate for recognizing them. Also, |
4246 | accessors like @code{person3-name} will be generated but they | |
4247 | will not be able to do any type checking. The @code{person3-name} | |
4248 | function, for example, will simply be a synonym for @code{car} in | |
4249 | this case. By contrast, @code{person2-name} is able to verify | |
4250 | that its argument is indeed a @code{person2} object before | |
4251 | proceeding. | |
4252 | ||
4253 | @item :initial-offset | |
4254 | The argument must be a nonnegative integer. It specifies a | |
4255 | number of slots to be left ``empty'' at the front of the | |
4256 | structure. If the structure is named, the tag appears at the | |
4257 | specified position in the list or vector; otherwise, the first | |
4258 | slot appears at that position. Earlier positions are filled | |
4259 | with @code{nil} by the constructors and ignored otherwise. If | |
4260 | the type @code{:include}s another type, then @code{:initial-offset} | |
4261 | specifies a number of slots to be skipped between the last slot | |
4262 | of the included type and the first new slot. | |
4263 | @end table | |
e1117425 | 4264 | @end defmac |
4009494e | 4265 | |
39a58b5b | 4266 | Except as noted, the @code{cl-defstruct} facility of this package is |
4009494e GM |
4267 | entirely compatible with that of Common Lisp. |
4268 | ||
1d5b82ef | 4269 | @node Assertions |
4009494e GM |
4270 | @chapter Assertions and Errors |
4271 | ||
4272 | @noindent | |
4273 | This section describes two macros that test @dfn{assertions}, i.e., | |
4274 | conditions which must be true if the program is operating correctly. | |
4275 | Assertions never add to the behavior of a Lisp program; they simply | |
4276 | make ``sanity checks'' to make sure everything is as it should be. | |
4277 | ||
4278 | If the optimization property @code{speed} has been set to 3, and | |
4279 | @code{safety} is less than 3, then the byte-compiler will optimize | |
4280 | away the following assertions. Because assertions might be optimized | |
4281 | away, it is a bad idea for them to include side-effects. | |
4282 | ||
e1117425 | 4283 | @defmac cl-assert test-form [show-args string args@dots{}] |
4009494e GM |
4284 | This form verifies that @var{test-form} is true (i.e., evaluates to |
4285 | a non-@code{nil} value). If so, it returns @code{nil}. If the test | |
39a58b5b | 4286 | is not satisfied, @code{cl-assert} signals an error. |
4009494e GM |
4287 | |
4288 | A default error message will be supplied which includes @var{test-form}. | |
4289 | You can specify a different error message by including a @var{string} | |
4290 | argument plus optional extra arguments. Those arguments are simply | |
4291 | passed to @code{error} to signal the error. | |
4292 | ||
4293 | If the optional second argument @var{show-args} is @code{t} instead | |
4294 | of @code{nil}, then the error message (with or without @var{string}) | |
4295 | will also include all non-constant arguments of the top-level | |
4296 | @var{form}. For example: | |
4297 | ||
4298 | @example | |
39a58b5b | 4299 | (cl-assert (> x 10) t "x is too small: %d") |
4009494e GM |
4300 | @end example |
4301 | ||
4302 | This usage of @var{show-args} is an extension to Common Lisp. In | |
4303 | true Common Lisp, the second argument gives a list of @var{places} | |
4304 | which can be @code{setf}'d by the user before continuing from the | |
4305 | error. Since Emacs Lisp does not support continuable errors, it | |
4306 | makes no sense to specify @var{places}. | |
e1117425 | 4307 | @end defmac |
4009494e | 4308 | |
e1117425 | 4309 | @defmac cl-check-type form type [string] |
4009494e | 4310 | This form verifies that @var{form} evaluates to a value of type |
39a58b5b | 4311 | @var{type}. If so, it returns @code{nil}. If not, @code{cl-check-type} |
4009494e GM |
4312 | signals a @code{wrong-type-argument} error. The default error message |
4313 | lists the erroneous value along with @var{type} and @var{form} | |
4314 | themselves. If @var{string} is specified, it is included in the | |
4315 | error message in place of @var{type}. For example: | |
4316 | ||
4317 | @example | |
39a58b5b | 4318 | (cl-check-type x (integer 1 *) "a positive integer") |
4009494e GM |
4319 | @end example |
4320 | ||
4321 | @xref{Type Predicates}, for a description of the type specifiers | |
4322 | that may be used for @var{type}. | |
4323 | ||
4324 | Note that in Common Lisp, the first argument to @code{check-type} | |
4325 | must be a @var{place} suitable for use by @code{setf}, because | |
4326 | @code{check-type} signals a continuable error that allows the | |
4327 | user to modify @var{place}. | |
e1117425 | 4328 | @end defmac |
4009494e | 4329 | |
1d5b82ef | 4330 | @node Efficiency Concerns |
4009494e GM |
4331 | @appendix Efficiency Concerns |
4332 | ||
4333 | @appendixsec Macros | |
4334 | ||
4335 | @noindent | |
39a58b5b | 4336 | Many of the advanced features of this package, such as @code{cl-defun}, |
5887564d | 4337 | @code{cl-loop}, etc., are implemented as Lisp macros. In |
4009494e GM |
4338 | byte-compiled code, these complex notations will be expanded into |
4339 | equivalent Lisp code which is simple and efficient. For example, | |
5887564d | 4340 | the form |
4009494e GM |
4341 | |
4342 | @example | |
39a58b5b | 4343 | (cl-incf i n) |
4009494e GM |
4344 | @end example |
4345 | ||
4346 | @noindent | |
5887564d | 4347 | is expanded at compile-time to the Lisp form |
4009494e GM |
4348 | |
4349 | @example | |
4350 | (setq i (+ i n)) | |
4009494e GM |
4351 | @end example |
4352 | ||
4353 | @noindent | |
5887564d | 4354 | which is the most efficient ways of doing this operation |
4009494e | 4355 | in Lisp. Thus, there is no performance penalty for using the more |
5887564d | 4356 | readable @code{cl-incf} form in your compiled code. |
4009494e GM |
4357 | |
4358 | @emph{Interpreted} code, on the other hand, must expand these macros | |
4359 | every time they are executed. For this reason it is strongly | |
4360 | recommended that code making heavy use of macros be compiled. | |
e1117425 GM |
4361 | A loop using @code{cl-incf} a hundred times will execute considerably |
4362 | faster if compiled, and will also garbage-collect less because the | |
4363 | macro expansion will not have to be generated, used, and thrown away a | |
4364 | hundred times. | |
4009494e GM |
4365 | |
4366 | You can find out how a macro expands by using the | |
4367 | @code{cl-prettyexpand} function. | |
4368 | ||
4369 | @defun cl-prettyexpand form &optional full | |
4370 | This function takes a single Lisp form as an argument and inserts | |
4371 | a nicely formatted copy of it in the current buffer (which must be | |
4372 | in Lisp mode so that indentation works properly). It also expands | |
4373 | all Lisp macros which appear in the form. The easiest way to use | |
a05cb6e3 | 4374 | this function is to go to the @file{*scratch*} buffer and type, say, |
4009494e GM |
4375 | |
4376 | @example | |
5887564d | 4377 | (cl-prettyexpand '(cl-loop for x below 10 collect x)) |
4009494e GM |
4378 | @end example |
4379 | ||
4380 | @noindent | |
4381 | and type @kbd{C-x C-e} immediately after the closing parenthesis; | |
4382 | the expansion | |
4383 | ||
4384 | @example | |
39a58b5b GM |
4385 | (cl-block nil |
4386 | (let* ((x 0) | |
4387 | (G1004 nil)) | |
4388 | (while (< x 10) | |
4389 | (setq G1004 (cons x G1004)) | |
4390 | (setq x (+ x 1))) | |
4391 | (nreverse G1004))) | |
4009494e GM |
4392 | @end example |
4393 | ||
4394 | @noindent | |
39a58b5b | 4395 | will be inserted into the buffer. (The @code{cl-block} macro is |
4009494e GM |
4396 | expanded differently in the interpreter and compiler, so |
4397 | @code{cl-prettyexpand} just leaves it alone. The temporary | |
39a58b5b | 4398 | variable @code{G1004} was created by @code{cl-gensym}.) |
4009494e GM |
4399 | |
4400 | If the optional argument @var{full} is true, then @emph{all} | |
39a58b5b | 4401 | macros are expanded, including @code{cl-block}, @code{cl-eval-when}, |
4009494e GM |
4402 | and compiler macros. Expansion is done as if @var{form} were |
4403 | a top-level form in a file being compiled. For example, | |
4404 | ||
4405 | @example | |
39a58b5b GM |
4406 | (cl-prettyexpand '(cl-pushnew 'x list)) |
4407 | @print{} (setq list (cl-adjoin 'x list)) | |
4408 | (cl-prettyexpand '(cl-pushnew 'x list) t) | |
4009494e | 4409 | @print{} (setq list (if (memq 'x list) list (cons 'x list))) |
39a58b5b | 4410 | (cl-prettyexpand '(caddr (cl-member 'a list)) t) |
4009494e GM |
4411 | @print{} (car (cdr (cdr (memq 'a list)))) |
4412 | @end example | |
4413 | ||
39a58b5b | 4414 | Note that @code{cl-adjoin}, @code{cl-caddr}, and @code{cl-member} all |
4009494e GM |
4415 | have built-in compiler macros to optimize them in common cases. |
4416 | @end defun | |
4417 | ||
4418 | @ifinfo | |
4419 | @example | |
4420 | ||
4421 | @end example | |
4422 | @end ifinfo | |
4423 | @appendixsec Error Checking | |
4424 | ||
4425 | @noindent | |
4426 | Common Lisp compliance has in general not been sacrificed for the | |
4427 | sake of efficiency. A few exceptions have been made for cases | |
4428 | where substantial gains were possible at the expense of marginal | |
4429 | incompatibility. | |
4430 | ||
4431 | The Common Lisp standard (as embodied in Steele's book) uses the | |
4432 | phrase ``it is an error if'' to indicate a situation which is not | |
4433 | supposed to arise in complying programs; implementations are strongly | |
4434 | encouraged but not required to signal an error in these situations. | |
4435 | This package sometimes omits such error checking in the interest of | |
39a58b5b | 4436 | compactness and efficiency. For example, @code{cl-do} variable |
4009494e GM |
4437 | specifiers are supposed to be lists of one, two, or three forms; |
4438 | extra forms are ignored by this package rather than signaling a | |
39a58b5b | 4439 | syntax error. The @code{cl-endp} function is simply a synonym for |
4009494e GM |
4440 | @code{null} in this package. Functions taking keyword arguments |
4441 | will accept an odd number of arguments, treating the trailing | |
4442 | keyword as if it were followed by the value @code{nil}. | |
4443 | ||
39a58b5b | 4444 | Argument lists (as processed by @code{cl-defun} and friends) |
4009494e GM |
4445 | @emph{are} checked rigorously except for the minor point just |
4446 | mentioned; in particular, keyword arguments are checked for | |
4447 | validity, and @code{&allow-other-keys} and @code{:allow-other-keys} | |
4448 | are fully implemented. Keyword validity checking is slightly | |
4449 | time consuming (though not too bad in byte-compiled code); | |
4450 | you can use @code{&allow-other-keys} to omit this check. Functions | |
39a58b5b | 4451 | defined in this package such as @code{cl-find} and @code{cl-member} |
4009494e GM |
4452 | do check their keyword arguments for validity. |
4453 | ||
4454 | @ifinfo | |
4455 | @example | |
4456 | ||
4457 | @end example | |
4458 | @end ifinfo | |
4459 | @appendixsec Optimizing Compiler | |
4460 | ||
4461 | @noindent | |
4462 | Use of the optimizing Emacs compiler is highly recommended; many of the Common | |
4463 | Lisp macros emit | |
4464 | code which can be improved by optimization. In particular, | |
39a58b5b GM |
4465 | @code{cl-block}s (whether explicit or implicit in constructs like |
4466 | @code{cl-defun} and @code{cl-loop}) carry a fair run-time penalty; the | |
4467 | optimizing compiler removes @code{cl-block}s which are not actually | |
4468 | referenced by @code{cl-return} or @code{cl-return-from} inside the block. | |
4009494e | 4469 | |
1d5b82ef | 4470 | @node Common Lisp Compatibility |
4009494e GM |
4471 | @appendix Common Lisp Compatibility |
4472 | ||
4473 | @noindent | |
4474 | Following is a list of all known incompatibilities between this | |
4475 | package and Common Lisp as documented in Steele (2nd edition). | |
4476 | ||
39a58b5b | 4477 | The word @code{cl-defun} is required instead of @code{defun} in order |
4009494e | 4478 | to use extended Common Lisp argument lists in a function. Likewise, |
39a58b5b | 4479 | @code{cl-defmacro} and @code{cl-function} are versions of those forms |
4009494e GM |
4480 | which understand full-featured argument lists. The @code{&whole} |
4481 | keyword does not work in @code{defmacro} argument lists (except | |
4482 | inside recursive argument lists). | |
4483 | ||
0a3333b5 | 4484 | The @code{equal} predicate does not distinguish |
39a58b5b | 4485 | between IEEE floating-point plus and minus zero. The @code{cl-equalp} |
4009494e GM |
4486 | predicate has several differences with Common Lisp; @pxref{Predicates}. |
4487 | ||
d3094168 | 4488 | @c FIXME no longer provided by cl. |
4009494e GM |
4489 | The @code{setf} mechanism is entirely compatible, except that |
4490 | setf-methods return a list of five values rather than five | |
4491 | values directly. Also, the new ``@code{setf} function'' concept | |
4492 | (typified by @code{(defun (setf foo) @dots{})}) is not implemented. | |
4493 | ||
39a58b5b | 4494 | The @code{cl-do-all-symbols} form is the same as @code{cl-do-symbols} |
4009494e GM |
4495 | with no @var{obarray} argument. In Common Lisp, this form would |
4496 | iterate over all symbols in all packages. Since Emacs obarrays | |
4497 | are not a first-class package mechanism, there is no way for | |
39a58b5b | 4498 | @code{cl-do-all-symbols} to locate any but the default obarray. |
4009494e | 4499 | |
39a58b5b | 4500 | The @code{cl-loop} macro is complete except that @code{loop-finish} |
4009494e GM |
4501 | and type specifiers are unimplemented. |
4502 | ||
4503 | The multiple-value return facility treats lists as multiple | |
4504 | values, since Emacs Lisp cannot support multiple return values | |
4505 | directly. The macros will be compatible with Common Lisp if | |
f94b04fc | 4506 | @code{cl-values} or @code{cl-values-list} is always used to return to |
39a58b5b | 4507 | a @code{cl-multiple-value-bind} or other multiple-value receiver; |
f94b04fc | 4508 | if @code{cl-values} is used without @code{cl-multiple-value-@dots{}} |
4009494e GM |
4509 | or vice-versa the effect will be different from Common Lisp. |
4510 | ||
4511 | Many Common Lisp declarations are ignored, and others match | |
4512 | the Common Lisp standard in concept but not in detail. For | |
4513 | example, local @code{special} declarations, which are purely | |
4514 | advisory in Emacs Lisp, do not rigorously obey the scoping rules | |
4515 | set down in Steele's book. | |
4516 | ||
39a58b5b | 4517 | The variable @code{cl--gensym-counter} starts out with a pseudo-random |
4009494e GM |
4518 | value rather than with zero. This is to cope with the fact that |
4519 | generated symbols become interned when they are written to and | |
4520 | loaded back from a file. | |
4521 | ||
39a58b5b | 4522 | The @code{cl-defstruct} facility is compatible, except that structures |
4009494e GM |
4523 | are of type @code{:type vector :named} by default rather than some |
4524 | special, distinct type. Also, the @code{:type} slot option is ignored. | |
4525 | ||
39a58b5b | 4526 | The second argument of @code{cl-check-type} is treated differently. |
4009494e | 4527 | |
1d5b82ef | 4528 | @node Porting Common Lisp |
4009494e GM |
4529 | @appendix Porting Common Lisp |
4530 | ||
4531 | @noindent | |
4532 | This package is meant to be used as an extension to Emacs Lisp, | |
4533 | not as an Emacs implementation of true Common Lisp. Some of the | |
4534 | remaining differences between Emacs Lisp and Common Lisp make it | |
4535 | difficult to port large Common Lisp applications to Emacs. For | |
4536 | one, some of the features in this package are not fully compliant | |
4537 | with ANSI or Steele; @pxref{Common Lisp Compatibility}. But there | |
4538 | are also quite a few features that this package does not provide | |
4539 | at all. Here are some major omissions that you will want to watch out | |
4540 | for when bringing Common Lisp code into Emacs. | |
4541 | ||
4542 | @itemize @bullet | |
4543 | @item | |
4544 | Case-insensitivity. Symbols in Common Lisp are case-insensitive | |
4545 | by default. Some programs refer to a function or variable as | |
4546 | @code{foo} in one place and @code{Foo} or @code{FOO} in another. | |
4547 | Emacs Lisp will treat these as three distinct symbols. | |
4548 | ||
4549 | Some Common Lisp code is written entirely in upper case. While Emacs | |
4550 | is happy to let the program's own functions and variables use | |
4551 | this convention, calls to Lisp builtins like @code{if} and | |
4552 | @code{defun} will have to be changed to lower case. | |
4553 | ||
4554 | @item | |
4555 | Lexical scoping. In Common Lisp, function arguments and @code{let} | |
3c0c6155 GM |
4556 | bindings apply only to references physically within their bodies (or |
4557 | within macro expansions in their bodies). Traditionally, Emacs Lisp | |
4558 | uses @dfn{dynamic scoping} wherein a binding to a variable is visible | |
9c52d61d GM |
4559 | even inside functions called from the body. |
4560 | @xref{Dynamic Binding,,,elisp,GNU Emacs Lisp Reference Manual}. | |
4561 | Lexical binding is available since Emacs 24.1, so be sure to set | |
4562 | @code{lexical-binding} to @code{t} if you need to emulate this aspect | |
4563 | of Common Lisp. @xref{Lexical Binding,,,elisp,GNU Emacs Lisp Reference Manual}. | |
4009494e | 4564 | |
3c0c6155 GM |
4565 | Here is an example of a Common Lisp code fragment that would fail in |
4566 | Emacs Lisp if @code{lexical-binding} were set to @code{nil}: | |
4009494e GM |
4567 | |
4568 | @example | |
4569 | (defun map-odd-elements (func list) | |
4570 | (loop for x in list | |
4571 | for flag = t then (not flag) | |
4572 | collect (if flag x (funcall func x)))) | |
4573 | ||
4574 | (defun add-odd-elements (list x) | |
db7a4b66 | 4575 | (map-odd-elements (lambda (a) (+ a x)) list)) |
4009494e GM |
4576 | @end example |
4577 | ||
4578 | @noindent | |
3c0c6155 GM |
4579 | With lexical binding, the two functions' usages of @code{x} are |
4580 | completely independent. With dynamic binding, the binding to @code{x} | |
4581 | made by @code{add-odd-elements} will have been hidden by the binding | |
4582 | in @code{map-odd-elements} by the time the @code{(+ a x)} function is | |
4583 | called. | |
4009494e | 4584 | |
3c0c6155 | 4585 | Internally, this package uses lexical binding so that such problems do |
69c1c2e6 | 4586 | not occur. @xref{Obsolete Lexical Binding}, for a description of the obsolete |
3c0c6155 GM |
4587 | @code{lexical-let} form that emulates a Common Lisp-style lexical |
4588 | binding when dynamic binding is in use. | |
4009494e GM |
4589 | |
4590 | @item | |
4591 | Reader macros. Common Lisp includes a second type of macro that | |
4592 | works at the level of individual characters. For example, Common | |
4593 | Lisp implements the quote notation by a reader macro called @code{'}, | |
4594 | whereas Emacs Lisp's parser just treats quote as a special case. | |
4595 | Some Lisp packages use reader macros to create special syntaxes | |
4596 | for themselves, which the Emacs parser is incapable of reading. | |
4597 | ||
4009494e GM |
4598 | @item |
4599 | Other syntactic features. Common Lisp provides a number of | |
4600 | notations beginning with @code{#} that the Emacs Lisp parser | |
4601 | won't understand. For example, @samp{#| ... |#} is an | |
4602 | alternate comment notation, and @samp{#+lucid (foo)} tells | |
4603 | the parser to ignore the @code{(foo)} except in Lucid Common | |
4604 | Lisp. | |
4605 | ||
4606 | @item | |
4607 | Packages. In Common Lisp, symbols are divided into @dfn{packages}. | |
4608 | Symbols that are Lisp built-ins are typically stored in one package; | |
4609 | symbols that are vendor extensions are put in another, and each | |
4610 | application program would have a package for its own symbols. | |
4611 | Certain symbols are ``exported'' by a package and others are | |
4612 | internal; certain packages ``use'' or import the exported symbols | |
4613 | of other packages. To access symbols that would not normally be | |
4614 | visible due to this importing and exporting, Common Lisp provides | |
4615 | a syntax like @code{package:symbol} or @code{package::symbol}. | |
4616 | ||
4617 | Emacs Lisp has a single namespace for all interned symbols, and | |
4618 | then uses a naming convention of putting a prefix like @code{cl-} | |
4619 | in front of the name. Some Emacs packages adopt the Common Lisp-like | |
4620 | convention of using @code{cl:} or @code{cl::} as the prefix. | |
4621 | However, the Emacs parser does not understand colons and just | |
4622 | treats them as part of the symbol name. Thus, while @code{mapcar} | |
4623 | and @code{lisp:mapcar} may refer to the same symbol in Common | |
4624 | Lisp, they are totally distinct in Emacs Lisp. Common Lisp | |
4625 | programs which refer to a symbol by the full name sometimes | |
4626 | and the short name other times will not port cleanly to Emacs. | |
4627 | ||
a05cb6e3 | 4628 | Emacs Lisp does have a concept of ``obarrays'', which are |
4009494e GM |
4629 | package-like collections of symbols, but this feature is not |
4630 | strong enough to be used as a true package mechanism. | |
4631 | ||
4632 | @item | |
4633 | The @code{format} function is quite different between Common | |
4634 | Lisp and Emacs Lisp. It takes an additional ``destination'' | |
4635 | argument before the format string. A destination of @code{nil} | |
4636 | means to format to a string as in Emacs Lisp; a destination | |
4637 | of @code{t} means to write to the terminal (similar to | |
4638 | @code{message} in Emacs). Also, format control strings are | |
4639 | utterly different; @code{~} is used instead of @code{%} to | |
4640 | introduce format codes, and the set of available codes is | |
4641 | much richer. There are no notations like @code{\n} for | |
4642 | string literals; instead, @code{format} is used with the | |
4643 | ``newline'' format code, @code{~%}. More advanced formatting | |
4644 | codes provide such features as paragraph filling, case | |
4645 | conversion, and even loops and conditionals. | |
4646 | ||
4647 | While it would have been possible to implement most of Common | |
a05cb6e3 | 4648 | Lisp @code{format} in this package (under the name @code{cl-format}, |
4009494e GM |
4649 | of course), it was not deemed worthwhile. It would have required |
4650 | a huge amount of code to implement even a decent subset of | |
a05cb6e3 | 4651 | @code{cl-format}, yet the functionality it would provide over |
4009494e GM |
4652 | Emacs Lisp's @code{format} would rarely be useful. |
4653 | ||
4654 | @item | |
4655 | Vector constants use square brackets in Emacs Lisp, but | |
4656 | @code{#(a b c)} notation in Common Lisp. To further complicate | |
4657 | matters, Emacs has its own @code{#(} notation for | |
4658 | something entirely different---strings with properties. | |
4659 | ||
4660 | @item | |
0a3333b5 RS |
4661 | Characters are distinct from integers in Common Lisp. The notation |
4662 | for character constants is also different: @code{#\A} in Common Lisp | |
4663 | where Emacs Lisp uses @code{?A}. Also, @code{string=} and | |
4664 | @code{string-equal} are synonyms in Emacs Lisp, whereas the latter is | |
4665 | case-insensitive in Common Lisp. | |
4009494e GM |
4666 | |
4667 | @item | |
4668 | Data types. Some Common Lisp data types do not exist in Emacs | |
4669 | Lisp. Rational numbers and complex numbers are not present, | |
4670 | nor are large integers (all integers are ``fixnums''). All | |
4671 | arrays are one-dimensional. There are no readtables or pathnames; | |
4672 | streams are a set of existing data types rather than a new data | |
4673 | type of their own. Hash tables, random-states, structures, and | |
4674 | packages (obarrays) are built from Lisp vectors or lists rather | |
4675 | than being distinct types. | |
4676 | ||
4677 | @item | |
4678 | The Common Lisp Object System (CLOS) is not implemented, | |
4679 | nor is the Common Lisp Condition System. However, the EIEIO package | |
159e3ad5 | 4680 | (@pxref{Top, , Introduction, eieio, EIEIO}) does implement some |
4009494e GM |
4681 | CLOS functionality. |
4682 | ||
4683 | @item | |
4684 | Common Lisp features that are completely redundant with Emacs | |
4685 | Lisp features of a different name generally have not been | |
4686 | implemented. For example, Common Lisp writes @code{defconstant} | |
4687 | where Emacs Lisp uses @code{defconst}. Similarly, @code{make-list} | |
4688 | takes its arguments in different ways in the two Lisps but does | |
4689 | exactly the same thing, so this package has not bothered to | |
4690 | implement a Common Lisp-style @code{make-list}. | |
4691 | ||
4692 | @item | |
4693 | A few more notable Common Lisp features not included in this | |
4694 | package: @code{compiler-let}, @code{tagbody}, @code{prog}, | |
4695 | @code{ldb/dpb}, @code{parse-integer}, @code{cerror}. | |
4696 | ||
4697 | @item | |
4698 | Recursion. While recursion works in Emacs Lisp just like it | |
4699 | does in Common Lisp, various details of the Emacs Lisp system | |
4700 | and compiler make recursion much less efficient than it is in | |
4701 | most Lisps. Some schools of thought prefer to use recursion | |
4702 | in Lisp over other techniques; they would sum a list of | |
4703 | numbers using something like | |
4704 | ||
4705 | @example | |
4706 | (defun sum-list (list) | |
4707 | (if list | |
4708 | (+ (car list) (sum-list (cdr list))) | |
4709 | 0)) | |
4710 | @end example | |
4711 | ||
4712 | @noindent | |
4713 | where a more iteratively-minded programmer might write one of | |
4714 | these forms: | |
4715 | ||
4716 | @example | |
39a58b5b | 4717 | (let ((total 0)) (dolist (x my-list) (cl-incf total x)) total) |
5887564d | 4718 | (cl-loop for x in my-list sum x) |
4009494e GM |
4719 | @end example |
4720 | ||
4721 | While this would be mainly a stylistic choice in most Common Lisps, | |
4722 | in Emacs Lisp you should be aware that the iterative forms are | |
4723 | much faster than recursion. Also, Lisp programmers will want to | |
4724 | note that the current Emacs Lisp compiler does not optimize tail | |
4725 | recursion. | |
4726 | @end itemize | |
4727 | ||
3c0c6155 GM |
4728 | @node Obsolete Features |
4729 | @appendix Obsolete Features | |
4730 | ||
4731 | This section describes some features of the package that are obsolete | |
f94b04fc GM |
4732 | and should not be used in new code. They are either only provided by |
4733 | the old @file{cl.el} entry point, not by the newer @file{cl-lib.el}; | |
4734 | or where versions with a @samp{cl-} prefix do exist they do not behave | |
4735 | in exactly the same way. | |
3c0c6155 GM |
4736 | |
4737 | @menu | |
69c1c2e6 GM |
4738 | * Obsolete Lexical Binding:: An approximation of lexical binding. |
4739 | * Obsolete Macros:: Obsolete macros. | |
f94b04fc | 4740 | * Obsolete Setf Customization:: Obsolete ways to customize setf. |
3c0c6155 GM |
4741 | @end menu |
4742 | ||
69c1c2e6 GM |
4743 | @node Obsolete Lexical Binding |
4744 | @appendixsec Obsolete Lexical Binding | |
3c0c6155 GM |
4745 | |
4746 | The following macros are extensions to Common Lisp, where all bindings | |
4747 | are lexical unless declared otherwise. These features are likewise | |
4748 | obsolete since the introduction of true lexical binding in Emacs 24.1. | |
4749 | ||
4750 | @defmac lexical-let (bindings@dots{}) forms@dots{} | |
4751 | This form is exactly like @code{let} except that the bindings it | |
4752 | establishes are purely lexical. | |
4753 | @end defmac | |
4754 | ||
4755 | @c FIXME remove this and refer to elisp manual. | |
4756 | @c Maybe merge some stuff from here to there? | |
4757 | @noindent | |
4758 | Lexical bindings are similar to local variables in a language like C: | |
4759 | Only the code physically within the body of the @code{lexical-let} | |
4760 | (after macro expansion) may refer to the bound variables. | |
4761 | ||
4762 | @example | |
4763 | (setq a 5) | |
4764 | (defun foo (b) (+ a b)) | |
4765 | (let ((a 2)) (foo a)) | |
4766 | @result{} 4 | |
4767 | (lexical-let ((a 2)) (foo a)) | |
4768 | @result{} 7 | |
4769 | @end example | |
4770 | ||
4771 | @noindent | |
4772 | In this example, a regular @code{let} binding of @code{a} actually | |
4773 | makes a temporary change to the global variable @code{a}, so @code{foo} | |
4774 | is able to see the binding of @code{a} to 2. But @code{lexical-let} | |
4775 | actually creates a distinct local variable @code{a} for use within its | |
4776 | body, without any effect on the global variable of the same name. | |
4777 | ||
4778 | The most important use of lexical bindings is to create @dfn{closures}. | |
4779 | A closure is a function object that refers to an outside lexical | |
9c52d61d GM |
4780 | variable (@pxref{Closures,,,elisp,GNU Emacs Lisp Reference Manual}). |
4781 | For example: | |
3c0c6155 GM |
4782 | |
4783 | @example | |
4784 | (defun make-adder (n) | |
4785 | (lexical-let ((n n)) | |
4786 | (function (lambda (m) (+ n m))))) | |
4787 | (setq add17 (make-adder 17)) | |
4788 | (funcall add17 4) | |
4789 | @result{} 21 | |
4790 | @end example | |
4791 | ||
4792 | @noindent | |
4793 | The call @code{(make-adder 17)} returns a function object which adds | |
4794 | 17 to its argument. If @code{let} had been used instead of | |
4795 | @code{lexical-let}, the function object would have referred to the | |
4796 | global @code{n}, which would have been bound to 17 only during the | |
4797 | call to @code{make-adder} itself. | |
4798 | ||
4799 | @example | |
4800 | (defun make-counter () | |
4801 | (lexical-let ((n 0)) | |
4802 | (cl-function (lambda (&optional (m 1)) (cl-incf n m))))) | |
4803 | (setq count-1 (make-counter)) | |
4804 | (funcall count-1 3) | |
4805 | @result{} 3 | |
4806 | (funcall count-1 14) | |
4807 | @result{} 17 | |
4808 | (setq count-2 (make-counter)) | |
4809 | (funcall count-2 5) | |
4810 | @result{} 5 | |
4811 | (funcall count-1 2) | |
4812 | @result{} 19 | |
4813 | (funcall count-2) | |
4814 | @result{} 6 | |
4815 | @end example | |
4816 | ||
4817 | @noindent | |
4818 | Here we see that each call to @code{make-counter} creates a distinct | |
4819 | local variable @code{n}, which serves as a private counter for the | |
4820 | function object that is returned. | |
4821 | ||
4822 | Closed-over lexical variables persist until the last reference to | |
4823 | them goes away, just like all other Lisp objects. For example, | |
4824 | @code{count-2} refers to a function object which refers to an | |
4825 | instance of the variable @code{n}; this is the only reference | |
4826 | to that variable, so after @code{(setq count-2 nil)} the garbage | |
4827 | collector would be able to delete this instance of @code{n}. | |
4828 | Of course, if a @code{lexical-let} does not actually create any | |
4829 | closures, then the lexical variables are free as soon as the | |
4830 | @code{lexical-let} returns. | |
4831 | ||
4832 | Many closures are used only during the extent of the bindings they | |
4833 | refer to; these are known as ``downward funargs'' in Lisp parlance. | |
4834 | When a closure is used in this way, regular Emacs Lisp dynamic | |
4835 | bindings suffice and will be more efficient than @code{lexical-let} | |
4836 | closures: | |
4837 | ||
4838 | @example | |
4839 | (defun add-to-list (x list) | |
4840 | (mapcar (lambda (y) (+ x y))) list) | |
4841 | (add-to-list 7 '(1 2 5)) | |
4842 | @result{} (8 9 12) | |
4843 | @end example | |
4844 | ||
4845 | @noindent | |
4846 | Since this lambda is only used while @code{x} is still bound, | |
4847 | it is not necessary to make a true closure out of it. | |
4848 | ||
4849 | You can use @code{defun} or @code{flet} inside a @code{lexical-let} | |
4850 | to create a named closure. If several closures are created in the | |
4851 | body of a single @code{lexical-let}, they all close over the same | |
4852 | instance of the lexical variable. | |
4853 | ||
4854 | @defmac lexical-let* (bindings@dots{}) forms@dots{} | |
4855 | This form is just like @code{lexical-let}, except that the bindings | |
4856 | are made sequentially in the manner of @code{let*}. | |
4857 | @end defmac | |
4858 | ||
69c1c2e6 GM |
4859 | @node Obsolete Macros |
4860 | @appendixsec Obsolete Macros | |
f94b04fc | 4861 | |
69c1c2e6 GM |
4862 | The following macros are obsolete, and are replaced by versions with |
4863 | a @samp{cl-} prefix that do not behave in exactly the same way. | |
4864 | Consequently, the @file{cl.el} versions are not simply aliases to the | |
4865 | @file{cl-lib.el} versions. | |
f94b04fc GM |
4866 | |
4867 | @defmac flet (bindings@dots{}) forms@dots{} | |
69c1c2e6 GM |
4868 | This macro is replaced by @code{cl-flet} (@pxref{Function Bindings}), |
4869 | which behaves the same way as Common Lisp's @code{flet}. | |
4870 | This @code{flet} takes the same arguments as @code{cl-flet}, but does | |
4871 | not behave in precisely the same way. | |
4872 | ||
4873 | While @code{flet} in Common Lisp establishes a lexical function | |
4874 | binding, this @code{flet} makes a dynamic binding (it dates from a | |
4875 | time before Emacs had lexical binding). The result is | |
4876 | that @code{flet} affects indirect calls to a function as well as calls | |
4877 | directly inside the @code{flet} form itself. | |
4878 | ||
4879 | @c Bug#411. | |
4880 | Note that many primitives (e.g. @code{+}) have special byte-compile | |
4881 | handling. Attempts to redefine such functions using @code{flet} will | |
4882 | fail if byte-compiled. | |
4883 | @c Or cl-flet. | |
4884 | @c In such cases, use @code{labels} instead. | |
f94b04fc GM |
4885 | @end defmac |
4886 | ||
4887 | @defmac labels (bindings@dots{}) forms@dots{} | |
69c1c2e6 GM |
4888 | This macro is replaced by @code{cl-labels} (@pxref{Function Bindings}), |
4889 | which behaves the same way as Common Lisp's @code{labels}. | |
4890 | This @code{labels} takes the same arguments as @code{cl-labels}, but | |
4891 | does not behave in precisely the same way. | |
4892 | ||
4893 | This version of @code{labels} uses the obsolete @code{lexical-let} | |
4894 | form (@pxref{Obsolete Lexical Binding}), rather than the true | |
4895 | lexical binding that @code{cl-labels} uses. | |
f94b04fc GM |
4896 | @end defmac |
4897 | ||
4898 | @defmac letf (bindings@dots{}) forms@dots{} | |
4ddedf94 GM |
4899 | This macro is almost exactly the same as @code{cl-letf}, which |
4900 | replaces it (@pxref{Modify Macros}). The only difference is in | |
4901 | details that relate to some deprecated usage of @code{symbol-function} | |
4902 | in place forms. | |
f94b04fc GM |
4903 | @end defmac |
4904 | ||
4905 | @node Obsolete Setf Customization | |
4906 | @appendixsec Obsolete Ways to Customize Setf | |
4907 | ||
d571e9c3 GM |
4908 | Common Lisp defines three macros, @code{define-modify-macro}, |
4909 | @code{defsetf}, and @code{define-setf-method}, that allow the | |
4910 | user to extend generalized variables in various ways. | |
4911 | In Emacs, these are obsolete, replaced by various features of | |
4912 | @file{gv.el} in Emacs 24.3. | |
4913 | @c FIXME details. | |
4914 | ||
4915 | @defmac define-modify-macro name arglist function [doc-string] | |
4916 | This macro defines a ``read-modify-write'' macro similar to | |
4917 | @code{cl-incf} and @code{cl-decf}. The macro @var{name} is defined | |
4918 | to take a @var{place} argument followed by additional arguments | |
4919 | described by @var{arglist}. The call | |
4920 | ||
4921 | @example | |
4922 | (@var{name} @var{place} @var{args}...) | |
4923 | @end example | |
4924 | ||
4925 | @noindent | |
4926 | will be expanded to | |
f94b04fc | 4927 | |
d571e9c3 GM |
4928 | @example |
4929 | (cl-callf @var{func} @var{place} @var{args}...) | |
4930 | @end example | |
4931 | ||
4932 | @noindent | |
4933 | which in turn is roughly equivalent to | |
4934 | ||
4935 | @example | |
4936 | (setf @var{place} (@var{func} @var{place} @var{args}...)) | |
4937 | @end example | |
4938 | ||
4939 | For example: | |
4940 | ||
4941 | @example | |
4942 | (define-modify-macro cl-incf (&optional (n 1)) +) | |
4943 | (define-modify-macro cl-concatf (&rest args) concat) | |
4944 | @end example | |
4945 | ||
4946 | Note that @code{&key} is not allowed in @var{arglist}, but | |
4947 | @code{&rest} is sufficient to pass keywords on to the function. | |
4948 | ||
4949 | Most of the modify macros defined by Common Lisp do not exactly | |
4950 | follow the pattern of @code{define-modify-macro}. For example, | |
4951 | @code{push} takes its arguments in the wrong order, and @code{pop} | |
4952 | is completely irregular. You can define these macros ``by hand'' | |
4953 | using @code{get-setf-method}, or consult the source | |
4954 | to see how to use the internal @code{setf} building blocks. | |
f94b04fc GM |
4955 | @end defmac |
4956 | ||
4957 | @defmac defsetf access-fn update-fn | |
d571e9c3 GM |
4958 | This is the simpler of two @code{defsetf} forms. Where |
4959 | @var{access-fn} is the name of a function which accesses a place, | |
4960 | this declares @var{update-fn} to be the corresponding store | |
4961 | function. From now on, | |
4962 | ||
4963 | @example | |
4964 | (setf (@var{access-fn} @var{arg1} @var{arg2} @var{arg3}) @var{value}) | |
4965 | @end example | |
4966 | ||
4967 | @noindent | |
4968 | will be expanded to | |
4969 | ||
4970 | @example | |
4971 | (@var{update-fn} @var{arg1} @var{arg2} @var{arg3} @var{value}) | |
4972 | @end example | |
4973 | ||
4974 | @noindent | |
4975 | The @var{update-fn} is required to be either a true function, or | |
4976 | a macro which evaluates its arguments in a function-like way. Also, | |
4977 | the @var{update-fn} is expected to return @var{value} as its result. | |
4978 | Otherwise, the above expansion would not obey the rules for the way | |
4979 | @code{setf} is supposed to behave. | |
4980 | ||
4981 | As a special (non-Common-Lisp) extension, a third argument of @code{t} | |
4982 | to @code{defsetf} says that the @code{update-fn}'s return value is | |
4983 | not suitable, so that the above @code{setf} should be expanded to | |
4984 | something more like | |
4985 | ||
4986 | @example | |
4987 | (let ((temp @var{value})) | |
4988 | (@var{update-fn} @var{arg1} @var{arg2} @var{arg3} temp) | |
4989 | temp) | |
4990 | @end example | |
4991 | ||
4992 | Some examples of the use of @code{defsetf}, drawn from the standard | |
4993 | suite of setf methods, are: | |
4994 | ||
4995 | @example | |
4996 | (defsetf car setcar) | |
4997 | (defsetf symbol-value set) | |
4998 | (defsetf buffer-name rename-buffer t) | |
4999 | @end example | |
f94b04fc GM |
5000 | @end defmac |
5001 | ||
d571e9c3 GM |
5002 | @defmac defsetf access-fn arglist (store-var) forms@dots{} |
5003 | This is the second, more complex, form of @code{defsetf}. It is | |
5004 | rather like @code{defmacro} except for the additional @var{store-var} | |
5005 | argument. The @var{forms} should return a Lisp form which stores | |
5006 | the value of @var{store-var} into the generalized variable formed | |
5007 | by a call to @var{access-fn} with arguments described by @var{arglist}. | |
5008 | The @var{forms} may begin with a string which documents the @code{setf} | |
5009 | method (analogous to the doc string that appears at the front of a | |
5010 | function). | |
5011 | ||
5012 | For example, the simple form of @code{defsetf} is shorthand for | |
5013 | ||
5014 | @example | |
5015 | (defsetf @var{access-fn} (&rest args) (store) | |
5016 | (append '(@var{update-fn}) args (list store))) | |
5017 | @end example | |
5018 | ||
5019 | The Lisp form that is returned can access the arguments from | |
5020 | @var{arglist} and @var{store-var} in an unrestricted fashion; | |
5021 | macros like @code{setf} and @code{cl-incf} which invoke this | |
5022 | setf-method will insert temporary variables as needed to make | |
5023 | sure the apparent order of evaluation is preserved. | |
5024 | ||
5025 | Another example drawn from the standard package: | |
5026 | ||
5027 | @example | |
5028 | (defsetf nth (n x) (store) | |
5029 | (list 'setcar (list 'nthcdr n x) store)) | |
5030 | @end example | |
f94b04fc GM |
5031 | @end defmac |
5032 | ||
d571e9c3 GM |
5033 | @defmac define-setf-method access-fn arglist forms@dots{} |
5034 | This is the most general way to create new place forms. When | |
5035 | a @code{setf} to @var{access-fn} with arguments described by | |
5036 | @var{arglist} is expanded, the @var{forms} are evaluated and | |
5037 | must return a list of five items: | |
5038 | ||
5039 | @enumerate | |
5040 | @item | |
5041 | A list of @dfn{temporary variables}. | |
5042 | ||
5043 | @item | |
5044 | A list of @dfn{value forms} corresponding to the temporary variables | |
5045 | above. The temporary variables will be bound to these value forms | |
5046 | as the first step of any operation on the generalized variable. | |
5047 | ||
5048 | @item | |
5049 | A list of exactly one @dfn{store variable} (generally obtained | |
5050 | from a call to @code{gensym}). | |
5051 | ||
5052 | @item | |
5053 | A Lisp form which stores the contents of the store variable into | |
5054 | the generalized variable, assuming the temporaries have been | |
5055 | bound as described above. | |
5056 | ||
5057 | @item | |
5058 | A Lisp form which accesses the contents of the generalized variable, | |
5059 | assuming the temporaries have been bound. | |
5060 | @end enumerate | |
5061 | ||
5062 | This is exactly like the Common Lisp macro of the same name, | |
5063 | except that the method returns a list of five values rather | |
5064 | than the five values themselves, since Emacs Lisp does not | |
5065 | support Common Lisp's notion of multiple return values. | |
5066 | ||
5067 | Once again, the @var{forms} may begin with a documentation string. | |
5068 | ||
5069 | A setf-method should be maximally conservative with regard to | |
5070 | temporary variables. In the setf-methods generated by | |
5071 | @code{defsetf}, the second return value is simply the list of | |
5072 | arguments in the place form, and the first return value is a | |
5073 | list of a corresponding number of temporary variables generated | |
5074 | by @code{cl-gensym}. Macros like @code{setf} and @code{cl-incf} which | |
5075 | use this setf-method will optimize away most temporaries that | |
5076 | turn out to be unnecessary, so there is little reason for the | |
5077 | setf-method itself to optimize. | |
5078 | @end defmac | |
5079 | ||
5080 | @defun get-setf-method place &optional env | |
5081 | This function returns the setf-method for @var{place}, by | |
5082 | invoking the definition previously recorded by @code{defsetf} | |
5083 | or @code{define-setf-method}. The result is a list of five | |
5084 | values as described above. You can use this function to build | |
5085 | your own @code{cl-incf}-like modify macros. (Actually, it is | |
5086 | @c FIXME? | |
5087 | better to use the internal functions @code{cl-setf-do-modify} | |
5088 | and @code{cl-setf-do-store}, which are a bit easier to use and | |
5089 | which also do a number of optimizations; consult the source | |
5090 | code for the @code{cl-incf} function for a simple example.) | |
5091 | ||
5092 | The argument @var{env} specifies the ``environment'' to be | |
5093 | passed on to @code{macroexpand} if @code{get-setf-method} should | |
5094 | need to expand a macro in @var{place}. It should come from | |
5095 | an @code{&environment} argument to the macro or setf-method | |
5096 | that called @code{get-setf-method}. | |
5097 | ||
6a07d52e GM |
5098 | See also the source code for the setf-method for |
5099 | @c Also @code{apply}, but that is commented out. | |
5100 | @code{substring}, which works by calling @code{get-setf-method} on a | |
5101 | simpler case, then massaging the result. | |
d571e9c3 GM |
5102 | @end defun |
5103 | ||
5104 | Modern Common Lisp defines a second, independent way to specify | |
5105 | the @code{setf} behavior of a function, namely ``@code{setf} | |
5106 | functions'' whose names are lists @code{(setf @var{name})} | |
5107 | rather than symbols. For example, @code{(defun (setf foo) @dots{})} | |
5108 | defines the function that is used when @code{setf} is applied to | |
5109 | @code{foo}. This package does not currently support @code{setf} | |
5110 | functions. In particular, it is a compile-time error to use | |
5111 | @code{setf} on a form which has not already been @code{defsetf}'d | |
5112 | or otherwise declared; in newer Common Lisps, this would not be | |
5113 | an error since the function @code{(setf @var{func})} might be | |
5114 | defined later. | |
5115 | ||
3c0c6155 | 5116 | |
1d5b82ef | 5117 | @node GNU Free Documentation License |
4009494e GM |
5118 | @appendix GNU Free Documentation License |
5119 | @include doclicense.texi | |
5120 | ||
1d5b82ef | 5121 | @node Function Index |
4009494e GM |
5122 | @unnumbered Function Index |
5123 | ||
5124 | @printindex fn | |
5125 | ||
1d5b82ef | 5126 | @node Variable Index |
4009494e GM |
5127 | @unnumbered Variable Index |
5128 | ||
5129 | @printindex vr | |
5130 | ||
4009494e GM |
5131 | @bye |
5132 |