1 ;;; cl.el --- Common Lisp extensions for Emacs -*-byte-compile-dynamic: t;-*-
3 ;; Copyright (C) 1993, 2002, 2003, 2004, 2005,
4 ;; 2006 Free Software Foundation, Inc.
6 ;; Author: Dave Gillespie <daveg@synaptics.com>
8 ;; Keywords: extensions
10 ;; This file is part of GNU Emacs.
12 ;; GNU Emacs is free software; you can redistribute it and/or modify
13 ;; it under the terms of the GNU General Public License as published by
14 ;; the Free Software Foundation; either version 2, or (at your option)
17 ;; GNU Emacs is distributed in the hope that it will be useful,
18 ;; but WITHOUT ANY WARRANTY; without even the implied warranty of
19 ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 ;; GNU General Public License for more details.
22 ;; You should have received a copy of the GNU General Public License
23 ;; along with GNU Emacs; see the file COPYING. If not, write to the
24 ;; Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
25 ;; Boston, MA 02110-1301, USA.
29 ;; These are extensions to Emacs Lisp that provide a degree of
30 ;; Common Lisp compatibility, beyond what is already built-in
33 ;; This package was written by Dave Gillespie; it is a complete
34 ;; rewrite of Cesar Quiroz's original cl.el package of December 1986.
36 ;; Bug reports, comments, and suggestions are welcome!
38 ;; This file contains the portions of the Common Lisp extensions
39 ;; package which should always be present.
44 ;; Once Emacs 19 becomes standard, many things in this package which are
45 ;; messy for reasons of compatibility can be greatly simplified. For now,
46 ;; I prefer to maintain one unified version.
51 ;; Version 2.02 (30 Jul 93):
52 ;; * Added "cl-compat.el" file, extra compatibility with old package.
53 ;; * Added `lexical-let' and `lexical-let*'.
54 ;; * Added `define-modify-macro', `callf', and `callf2'.
55 ;; * Added `ignore-errors'.
56 ;; * Changed `(setf (nthcdr N PLACE) X)' to work when N is zero.
57 ;; * Merged `*gentemp-counter*' into `*gensym-counter*'.
58 ;; * Extended `subseq' to allow negative START and END like `substring'.
59 ;; * Added `in-ref', `across-ref', `elements of-ref' loop clauses.
60 ;; * Added `concat', `vconcat' loop clauses.
61 ;; * Cleaned up a number of compiler warnings.
63 ;; Version 2.01 (7 Jul 93):
64 ;; * Added support for FSF version of Emacs 19.
65 ;; * Added `add-hook' for Emacs 18 users.
66 ;; * Added `defsubst*' and `symbol-macrolet'.
67 ;; * Added `maplist', `mapc', `mapl', `mapcan', `mapcon'.
68 ;; * Added `map', `concatenate', `reduce', `merge'.
69 ;; * Added `revappend', `nreconc', `tailp', `tree-equal'.
70 ;; * Added `assert', `check-type', `typecase', `typep', and `deftype'.
71 ;; * Added destructuring and `&environment' support to `defmacro*'.
72 ;; * Added destructuring to `loop', and added the following clauses:
73 ;; `elements', `frames', `overlays', `intervals', `buffers', `key-seqs'.
74 ;; * Renamed `delete' to `delete*' and `remove' to `remove*'.
75 ;; * Completed support for all keywords in `remove*', `substitute', etc.
76 ;; * Added `most-positive-float' and company.
77 ;; * Fixed hash tables to work with latest Lucid Emacs.
78 ;; * `proclaim' forms are no longer compile-time-evaluating; use `declaim'.
79 ;; * Syntax for `warn' declarations has changed.
80 ;; * Improved implementation of `random*'.
81 ;; * Moved most sequence functions to a new file, cl-seq.el.
82 ;; * Moved `eval-when' into cl-macs.el.
83 ;; * Moved `pushnew' and `adjoin' to cl.el for most common cases.
84 ;; * Moved `provide' forms down to ends of files.
85 ;; * Changed expansion of `pop' to something that compiles to better code.
86 ;; * Changed so that no patch is required for Emacs 19 byte compiler.
87 ;; * Made more things dependent on `optimize' declarations.
88 ;; * Added a partial implementation of struct print functions.
89 ;; * Miscellaneous minor changes.
92 ;; * First public release of this package.
97 (defvar cl-optimize-speed
1)
98 (defvar cl-optimize-safety
1)
102 (defvar custom-print-functions nil
103 "This is a list of functions that format user objects for printing.
104 Each function is called in turn with three arguments: the object, the
105 stream, and the print level (currently ignored). If it is able to
106 print the object it returns true; otherwise it returns nil and the
107 printer proceeds to the next function on the list.
109 This variable is not used at present, but it is defined in hopes that
110 a future Emacs interpreter will be able to use it.")
112 (add-hook 'cl-unload-hook
'cl-cannot-unload
)
113 (defun cl-cannot-unload ()
114 (error "Cannot unload the feature `cl'"))
116 ;;; Generalized variables. These macros are defined here so that they
117 ;;; can safely be used in .emacs files.
119 (defmacro incf
(place &optional x
)
120 "Increment PLACE by X (1 by default).
121 PLACE may be a symbol, or any generalized variable allowed by `setf'.
122 The return value is the incremented value of PLACE."
124 (list 'setq place
(if x
(list '+ place x
) (list '1+ place
)))
125 (list 'callf
'+ place
(or x
1))))
127 (defmacro decf
(place &optional x
)
128 "Decrement PLACE by X (1 by default).
129 PLACE may be a symbol, or any generalized variable allowed by `setf'.
130 The return value is the decremented value of PLACE."
132 (list 'setq place
(if x
(list '- place x
) (list '1- place
)))
133 (list 'callf
'- place
(or x
1))))
135 (defmacro pop
(place)
136 "Remove and return the head of the list stored in PLACE.
137 Analogous to (prog1 (car PLACE) (setf PLACE (cdr PLACE))), though more
138 careful about evaluating each argument only once and in the right order.
139 PLACE may be a symbol, or any generalized variable allowed by `setf'."
141 (list 'car
(list 'prog1 place
(list 'setq place
(list 'cdr place
))))
144 (defmacro push
(x place
)
145 "Insert X at the head of the list stored in PLACE.
146 Analogous to (setf PLACE (cons X PLACE)), though more careful about
147 evaluating each argument only once and in the right order. PLACE may
148 be a symbol, or any generalized variable allowed by `setf'."
149 (if (symbolp place
) (list 'setq place
(list 'cons x place
))
150 (list 'callf2
'cons x place
)))
152 (defmacro pushnew
(x place
&rest keys
)
153 "(pushnew X PLACE): insert X at the head of the list if not already there.
154 Like (push X PLACE), except that the list is unmodified if X is `eql' to
155 an element already on the list.
156 \nKeywords supported: :test :test-not :key
157 \n(fn X PLACE [KEYWORD VALUE]...)"
161 (if (memql x
,place
) ,place
(setq ,place
(cons x
,place
))))
162 (list 'setq place
(list* 'adjoin x place keys
)))
163 (list* 'callf2
'adjoin x place keys
)))
165 (defun cl-set-elt (seq n val
)
166 (if (listp seq
) (setcar (nthcdr n seq
) val
) (aset seq n val
)))
168 (defun cl-set-nthcdr (n list x
)
169 (if (<= n
0) x
(setcdr (nthcdr (1- n
) list
) x
) list
))
171 (defun cl-set-buffer-substring (start end val
)
172 (save-excursion (delete-region start end
)
177 (defun cl-set-substring (str start end val
)
178 (if end
(if (< end
0) (incf end
(length str
)))
179 (setq end
(length str
)))
180 (if (< start
0) (incf start
(length str
)))
181 (concat (and (> start
0) (substring str
0 start
))
183 (and (< end
(length str
)) (substring str end
))))
186 ;;; Control structures.
188 ;;; These macros are so simple and so often-used that it's better to have
189 ;;; them all the time than to load them from cl-macs.el.
191 (defun cl-map-extents (&rest cl-args
)
192 (apply 'cl-map-overlays cl-args
))
195 ;;; Blocks and exits.
197 (defalias 'cl-block-wrapper
'identity
)
198 (defalias 'cl-block-throw
'throw
)
201 ;;; Multiple values. True multiple values are not supported, or even
202 ;;; simulated. Instead, multiple-value-bind and friends simply expect
203 ;;; the target form to return the values as a list.
205 (defsubst values
(&rest values
)
206 "Return multiple values, Common Lisp style.
207 The arguments of `values' are the values
208 that the containing function should return."
211 (defsubst values-list
(list)
212 "Return multiple values, Common Lisp style, taken from a list.
213 LIST specifies the list of values
214 that the containing function should return."
217 (defsubst multiple-value-list
(expression)
218 "Return a list of the multiple values produced by EXPRESSION.
219 This handles multiple values in Common Lisp style, but it does not
220 work right when EXPRESSION calls an ordinary Emacs Lisp function
221 that returns just one value."
224 (defsubst multiple-value-apply
(function expression
)
225 "Evaluate EXPRESSION to get multiple values and apply FUNCTION to them.
226 This handles multiple values in Common Lisp style, but it does not work
227 right when EXPRESSION calls an ordinary Emacs Lisp function that returns just
229 (apply function expression
))
231 (defalias 'multiple-value-call
'apply
232 "Apply FUNCTION to ARGUMENTS, taking multiple values into account.
233 This implementation only handles the case where there is only one argument.")
235 (defsubst nth-value
(n expression
)
236 "Evaluate EXPRESSION to get multiple values and return the Nth one.
237 This handles multiple values in Common Lisp style, but it does not work
238 right when EXPRESSION calls an ordinary Emacs Lisp function that returns just
244 (defvar cl-macro-environment nil
)
245 (defvar cl-old-macroexpand
(prog1 (symbol-function 'macroexpand
)
246 (defalias 'macroexpand
'cl-macroexpand
)))
248 (defun cl-macroexpand (cl-macro &optional cl-env
)
249 "Return result of expanding macros at top level of FORM.
250 If FORM is not a macro call, it is returned unchanged.
251 Otherwise, the macro is expanded and the expansion is considered
252 in place of FORM. When a non-macro-call results, it is returned.
254 The second optional arg ENVIRONMENT specifies an environment of macro
255 definitions to shadow the loaded ones for use in file byte-compilation.
256 \n(fn FORM &optional ENVIRONMENT)"
257 (let ((cl-macro-environment cl-env
))
258 (while (progn (setq cl-macro
(funcall cl-old-macroexpand cl-macro cl-env
))
259 (and (symbolp cl-macro
)
260 (cdr (assq (symbol-name cl-macro
) cl-env
))))
261 (setq cl-macro
(cadr (assq (symbol-name cl-macro
) cl-env
))))
267 (defvar cl-compiling-file nil
)
268 (defun cl-compiling-file ()
269 (or cl-compiling-file
270 (and (boundp 'outbuffer
) (bufferp (symbol-value 'outbuffer
))
271 (equal (buffer-name (symbol-value 'outbuffer
))
272 " *Compiler Output*"))))
274 (defvar cl-proclaims-deferred nil
)
276 (defun proclaim (spec)
277 (if (fboundp 'cl-do-proclaim
) (cl-do-proclaim spec t
)
278 (push spec cl-proclaims-deferred
))
281 (defmacro declaim
(&rest specs
)
282 (let ((body (mapcar (function (lambda (x) (list 'proclaim
(list 'quote x
))))
284 (if (cl-compiling-file) (list* 'eval-when
'(compile load eval
) body
)
285 (cons 'progn body
)))) ; avoid loading cl-macs.el for eval-when
290 (defun cl-random-time ()
291 (let* ((time (copy-sequence (current-time-string))) (i (length time
)) (v 0))
292 (while (>= (decf i
) 0) (setq v
(+ (* v
3) (aref time i
))))
295 (defvar *gensym-counter
* (* (logand (cl-random-time) 1023) 100))
300 (defun floatp-safe (object)
301 "Return t if OBJECT is a floating point number.
302 On Emacs versions that lack floating-point support, this function
304 (and (numberp object
) (not (integerp object
))))
306 (defun plusp (number)
307 "Return t if NUMBER is positive."
310 (defun minusp (number)
311 "Return t if NUMBER is negative."
314 (defun oddp (integer)
315 "Return t if INTEGER is odd."
316 (eq (logand integer
1) 1))
318 (defun evenp (integer)
319 "Return t if INTEGER is even."
320 (eq (logand integer
1) 0))
322 (defvar *random-state
* (vector 'cl-random-state-tag -
1 30 (cl-random-time)))
324 ;;; The following are actually set by cl-float-limits.
325 (defconst most-positive-float nil
)
326 (defconst most-negative-float nil
)
327 (defconst least-positive-float nil
)
328 (defconst least-negative-float nil
)
329 (defconst least-positive-normalized-float nil
)
330 (defconst least-negative-normalized-float nil
)
331 (defconst float-epsilon nil
)
332 (defconst float-negative-epsilon nil
)
335 ;;; Sequence functions.
337 (defalias 'copy-seq
'copy-sequence
)
339 (defun mapcar* (cl-func cl-x
&rest cl-rest
)
340 "Apply FUNCTION to each element of SEQ, and make a list of the results.
341 If there are several SEQs, FUNCTION is called with that many arguments,
342 and mapping stops as soon as the shortest list runs out. With just one
343 SEQ, this is like `mapcar'. With several, it is like the Common Lisp
344 `mapcar' function extended to arbitrary sequence types.
345 \n(fn FUNCTION SEQ...)"
347 (if (or (cdr cl-rest
) (nlistp cl-x
) (nlistp (car cl-rest
)))
348 (cl-mapcar-many cl-func
(cons cl-x cl-rest
))
349 (let ((cl-res nil
) (cl-y (car cl-rest
)))
350 (while (and cl-x cl-y
)
351 (push (funcall cl-func
(pop cl-x
) (pop cl-y
)) cl-res
))
353 (mapcar cl-func cl-x
)))
355 (defalias 'svref
'aref
)
359 (defalias 'first
'car
)
360 (defalias 'second
'cadr
)
361 (defalias 'rest
'cdr
)
362 (defalias 'endp
'null
)
365 "Return the third element of the list X."
369 "Return the fourth element of the list X."
373 "Return the fifth element of the list X."
377 "Return the sixth element of the list X."
381 "Return the seventh element of the list X."
385 "Return the eighth element of the list X."
389 "Return the ninth element of the list X."
393 "Return the tenth element of the list X."
397 "Return the `car' of the `car' of the `car' of X."
401 "Return the `car' of the `car' of the `cdr' of X."
405 "Return the `car' of the `cdr' of the `car' of X."
409 "Return the `car' of the `cdr' of the `cdr' of X."
413 "Return the `cdr' of the `car' of the `car' of X."
417 "Return the `cdr' of the `car' of the `cdr' of X."
421 "Return the `cdr' of the `cdr' of the `car' of X."
425 "Return the `cdr' of the `cdr' of the `cdr' of X."
429 "Return the `car' of the `car' of the `car' of the `car' of X."
430 (car (car (car (car x
)))))
433 "Return the `car' of the `car' of the `car' of the `cdr' of X."
434 (car (car (car (cdr x
)))))
437 "Return the `car' of the `car' of the `cdr' of the `car' of X."
438 (car (car (cdr (car x
)))))
441 "Return the `car' of the `car' of the `cdr' of the `cdr' of X."
442 (car (car (cdr (cdr x
)))))
445 "Return the `car' of the `cdr' of the `car' of the `car' of X."
446 (car (cdr (car (car x
)))))
449 "Return the `car' of the `cdr' of the `car' of the `cdr' of X."
450 (car (cdr (car (cdr x
)))))
453 "Return the `car' of the `cdr' of the `cdr' of the `car' of X."
454 (car (cdr (cdr (car x
)))))
457 "Return the `car' of the `cdr' of the `cdr' of the `cdr' of X."
458 (car (cdr (cdr (cdr x
)))))
461 "Return the `cdr' of the `car' of the `car' of the `car' of X."
462 (cdr (car (car (car x
)))))
465 "Return the `cdr' of the `car' of the `car' of the `cdr' of X."
466 (cdr (car (car (cdr x
)))))
469 "Return the `cdr' of the `car' of the `cdr' of the `car' of X."
470 (cdr (car (cdr (car x
)))))
473 "Return the `cdr' of the `car' of the `cdr' of the `cdr' of X."
474 (cdr (car (cdr (cdr x
)))))
477 "Return the `cdr' of the `cdr' of the `car' of the `car' of X."
478 (cdr (cdr (car (car x
)))))
481 "Return the `cdr' of the `cdr' of the `car' of the `cdr' of X."
482 (cdr (cdr (car (cdr x
)))))
485 "Return the `cdr' of the `cdr' of the `cdr' of the `car' of X."
486 (cdr (cdr (cdr (car x
)))))
489 "Return the `cdr' of the `cdr' of the `cdr' of the `cdr' of X."
490 (cdr (cdr (cdr (cdr x
)))))
492 ;;(defun last* (x &optional n)
493 ;; "Returns the last link in the list LIST.
494 ;;With optional argument N, returns Nth-to-last link (default 1)."
496 ;; (let ((m 0) (p x))
497 ;; (while (consp p) (incf m) (pop p))
499 ;; (if (< n m) (nthcdr (- m n) x) x)))
500 ;; (while (consp (cdr x)) (pop x))
503 (defun list* (arg &rest rest
) ; See compiler macro in cl-macs.el
504 "Return a new list with specified ARGs as elements, consed to last ARG.
505 Thus, `(list* A B C D)' is equivalent to `(nconc (list A B C) D)', or to
506 `(cons A (cons B (cons C D)))'.
508 (cond ((not rest
) arg
)
509 ((not (cdr rest
)) (cons arg
(car rest
)))
510 (t (let* ((n (length rest
))
511 (copy (copy-sequence rest
))
512 (last (nthcdr (- n
2) copy
)))
513 (setcdr last
(car (cdr last
)))
516 (defun ldiff (list sublist
)
517 "Return a copy of LIST with the tail SUBLIST removed."
519 (while (and (consp list
) (not (eq list sublist
)))
520 (push (pop list
) res
))
523 (defun copy-list (list)
524 "Return a copy of LIST, which may be a dotted list.
525 The elements of LIST are not copied, just the list structure itself."
528 (while (consp list
) (push (pop list
) res
))
529 (prog1 (nreverse res
) (setcdr res list
)))
532 (defun cl-maclisp-member (item list
)
533 (while (and list
(not (equal item
(car list
)))) (setq list
(cdr list
)))
536 (defalias 'cl-member
'memq
) ; for compatibility with old CL package
537 (defalias 'cl-floor
'floor
*)
538 (defalias 'cl-ceiling
'ceiling
*)
539 (defalias 'cl-truncate
'truncate
*)
540 (defalias 'cl-round
'round
*)
541 (defalias 'cl-mod
'mod
*)
543 (defun adjoin (cl-item cl-list
&rest cl-keys
) ; See compiler macro in cl-macs
544 "Return ITEM consed onto the front of LIST only if it's not already there.
545 Otherwise, return LIST unmodified.
546 \nKeywords supported: :test :test-not :key
547 \n(fn ITEM LIST [KEYWORD VALUE]...)"
548 (cond ((or (equal cl-keys
'(:test eq
))
549 (and (null cl-keys
) (not (numberp cl-item
))))
550 (if (memq cl-item cl-list
) cl-list
(cons cl-item cl-list
)))
551 ((or (equal cl-keys
'(:test equal
)) (null cl-keys
))
552 (if (member cl-item cl-list
) cl-list
(cons cl-item cl-list
)))
553 (t (apply 'cl-adjoin cl-item cl-list cl-keys
))))
555 (defun subst (cl-new cl-old cl-tree
&rest cl-keys
)
556 "Substitute NEW for OLD everywhere in TREE (non-destructively).
557 Return a copy of TREE with all elements `eql' to OLD replaced by NEW.
558 \nKeywords supported: :test :test-not :key
559 \n(fn NEW OLD TREE [KEYWORD VALUE]...)"
560 (if (or cl-keys
(and (numberp cl-old
) (not (integerp cl-old
))))
561 (apply 'sublis
(list (cons cl-old cl-new
)) cl-tree cl-keys
)
562 (cl-do-subst cl-new cl-old cl-tree
)))
564 (defun cl-do-subst (cl-new cl-old cl-tree
)
565 (cond ((eq cl-tree cl-old
) cl-new
)
567 (let ((a (cl-do-subst cl-new cl-old
(car cl-tree
)))
568 (d (cl-do-subst cl-new cl-old
(cdr cl-tree
))))
569 (if (and (eq a
(car cl-tree
)) (eq d
(cdr cl-tree
)))
570 cl-tree
(cons a d
))))
573 (defun acons (key value alist
)
574 "Add KEY and VALUE to ALIST.
575 Return a new list with (cons KEY VALUE) as car and ALIST as cdr."
576 (cons (cons key value
) alist
))
578 (defun pairlis (keys values
&optional alist
)
579 "Make an alist from KEYS and VALUES.
580 Return a new alist composed by associating KEYS to corresponding VALUES;
581 the process stops as soon as KEYS or VALUES run out.
582 If ALIST is non-nil, the new pairs are prepended to it."
583 (nconc (mapcar* 'cons keys values
) alist
))
588 (defvar cl-fake-autoloads nil
589 "Non-nil means don't make CL functions autoload.")
591 ;;; Autoload the other portions of the package.
592 ;; We want to replace the basic versions of dolist, dotimes, declare below.
593 (fmakunbound 'dolist
)
594 (fmakunbound 'dotimes
)
595 (fmakunbound 'declare
)
598 (let ((file (if cl-fake-autoloads
"<none>" (car set
))))
601 (autoload func
(car set
) nil nil
(nth 1 set
))))
604 coerce equalp cl-map-keymap maplist mapc mapl mapcan mapcon
605 cl-map-keymap cl-map-keymap-recursively cl-map-intervals
606 cl-map-overlays cl-set-frame-visible-p cl-float-limits
607 gcd lcm isqrt floor
* ceiling
* truncate
* round
*
608 mod
* rem
* signum random
* make-random-state random-state-p
609 subseq concatenate cl-mapcar-many map some every notany
610 notevery revappend nreconc list-length tailp copy-tree get
* getf
611 cl-set-getf cl-do-remf remprop cl-make-hash-table cl-hash-lookup
612 cl-gethash cl-puthash cl-remhash cl-clrhash cl-maphash cl-hash-table-p
613 cl-hash-table-count cl-progv-before cl-prettyexpand
616 reduce fill replace remove
* remove-if remove-if-not
617 delete
* delete-if delete-if-not remove-duplicates
618 delete-duplicates substitute substitute-if substitute-if-not
619 nsubstitute nsubstitute-if nsubstitute-if-not find find-if
620 find-if-not position position-if position-if-not count count-if
621 count-if-not mismatch search sort
* stable-sort merge member
*
622 member-if member-if-not cl-adjoin assoc
* assoc-if assoc-if-not
623 rassoc
* rassoc-if rassoc-if-not union nunion intersection
624 nintersection set-difference nset-difference set-exclusive-or
625 nset-exclusive-or subsetp subst-if subst-if-not nsubst nsubst-if
626 nsubst-if-not sublis nsublis tree-equal
)
628 gensym gentemp typep cl-do-pop get-setf-method
629 cl-struct-setf-expander compiler-macroexpand cl-compile-time-init
)
631 defun
* defmacro
* function
* destructuring-bind eval-when
632 load-time-value case ecase typecase etypecase
633 block return return-from loop do do
* dolist dotimes do-symbols
634 do-all-symbols psetq progv flet labels macrolet symbol-macrolet
635 lexical-let lexical-let
* multiple-value-bind multiple-value-setq
636 locally the declare define-setf-method defsetf define-modify-macro
637 setf psetf remf shiftf rotatef letf letf
* callf callf2 defstruct
638 check-type assert ignore-errors define-compiler-macro
)))
640 ;;; Define data for indentation and edebug.
645 (put func
'lisp-indent-function
(nth 1 entry
))
646 (put func
'lisp-indent-hook
(nth 1 entry
))
647 (or (get func
'edebug-form-spec
)
648 (put func
'edebug-form-spec
(nth 2 entry
)))))
650 '(((defun* defmacro
*) 2)
652 (&or symbolp
([&optional
'macro
] 'lambda
(&rest sexp
) &rest form
)))
653 ((eval-when) 1 (sexp &rest form
))
654 ((declare) nil
(&rest sexp
))
655 ((the) 1 (sexp &rest form
))
656 ((case ecase typecase etypecase
) 1 (form &rest
(sexp &rest form
)))
657 ((block return-from
) 1 (sexp &rest form
))
658 ((return) nil
(&optional form
))
659 ((do do
*) 2 ((&rest
&or symbolp
(symbolp &optional form form
))
662 ((do-symbols) 1 ((symbolp form
&optional form form
) &rest form
))
663 ((do-all-symbols) 1 ((symbolp form
&optional form
) &rest form
))
664 ((psetq setf psetf
) nil edebug-setq-form
)
665 ((progv) 2 (&rest form
))
666 ((flet labels macrolet
) 1
667 ((&rest
(sexp sexp
&rest form
)) &rest form
))
668 ((symbol-macrolet lexical-let lexical-let
*) 1
669 ((&rest
&or symbolp
(symbolp form
)) &rest form
))
670 ((multiple-value-bind) 2 ((&rest symbolp
) &rest form
))
671 ((multiple-value-setq) 1 ((&rest symbolp
) &rest form
))
672 ((incf decf remf pushnew shiftf rotatef
) nil
(&rest form
))
673 ((letf letf
*) 1 ((&rest
(&rest form
)) &rest form
))
674 ((callf destructuring-bind
) 2 (sexp form
&rest form
))
675 ((callf2) 3 (sexp form form
&rest form
))
676 ((loop) nil
(&rest
&or symbolp form
))
677 ((ignore-errors) 0 (&rest form
))))
680 ;;; This goes here so that cl-macs can find it if it loads right now.
681 (provide 'cl-19
) ; usage: (require 'cl-19 "cl")
684 ;;; Things to do after byte-compiler is loaded.
685 ;;; As a side effect, we cause cl-macs to be loaded when compiling, so
686 ;;; that the compiler-macros defined there will be present.
688 (defvar cl-hacked-flag nil
)
689 (defun cl-hack-byte-compiler ()
690 (if (and (not cl-hacked-flag
) (fboundp 'byte-compile-file-form
))
692 (setq cl-hacked-flag t
) ; Do it first, to prevent recursion.
693 (cl-compile-time-init)))) ; In cl-macs.el.
695 ;;; Try it now in case the compiler has already been loaded.
696 (cl-hack-byte-compiler)
698 ;;; Also make a hook in case compiler is loaded after this file.
699 (add-hook 'bytecomp-load-hook
'cl-hack-byte-compiler
)
702 ;;; The following ensures that packages which expect the old-style cl.el
703 ;;; will be happy with this one.
707 (run-hooks 'cl-load-hook
)
709 ;; arch-tag: 5f07fa74-f153-4524-9303-21f5be125851