Commit | Line | Data |
---|---|---|
73217411 | 1 | ;;; cl.el --- Common Lisp extensions for Emacs -*-byte-compile-dynamic: t;-*- |
fcd73769 RS |
2 | |
3 | ;; Copyright (C) 1993 Free Software Foundation, Inc. | |
4 | ||
5 | ;; Author: Dave Gillespie <daveg@synaptics.com> | |
6 | ;; Version: 2.02 | |
7 | ;; Keywords: extensions | |
8 | ||
9 | ;; This file is part of GNU Emacs. | |
10 | ||
11 | ;; GNU Emacs is free software; you can redistribute it and/or modify | |
12 | ;; it under the terms of the GNU General Public License as published by | |
7c938215 | 13 | ;; the Free Software Foundation; either version 2, or (at your option) |
fcd73769 RS |
14 | ;; any later version. |
15 | ||
16 | ;; GNU Emacs is distributed in the hope that it will be useful, | |
17 | ;; but WITHOUT ANY WARRANTY; without even the implied warranty of | |
18 | ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
19 | ;; GNU General Public License for more details. | |
20 | ||
21 | ;; You should have received a copy of the GNU General Public License | |
b578f267 EN |
22 | ;; along with GNU Emacs; see the file COPYING. If not, write to the |
23 | ;; Free Software Foundation, Inc., 59 Temple Place - Suite 330, | |
24 | ;; Boston, MA 02111-1307, USA. | |
fcd73769 | 25 | |
07b3798c | 26 | ;;; Commentary: |
fcd73769 RS |
27 | |
28 | ;; These are extensions to Emacs Lisp that provide a degree of | |
29 | ;; Common Lisp compatibility, beyond what is already built-in | |
30 | ;; in Emacs Lisp. | |
31 | ;; | |
32 | ;; This package was written by Dave Gillespie; it is a complete | |
33 | ;; rewrite of Cesar Quiroz's original cl.el package of December 1986. | |
34 | ;; | |
fcd73769 RS |
35 | ;; Bug reports, comments, and suggestions are welcome! |
36 | ||
37 | ;; This file contains the portions of the Common Lisp extensions | |
38 | ;; package which should always be present. | |
39 | ||
40 | ||
07b3798c | 41 | ;;; Future notes: |
fcd73769 RS |
42 | |
43 | ;; Once Emacs 19 becomes standard, many things in this package which are | |
44 | ;; messy for reasons of compatibility can be greatly simplified. For now, | |
45 | ;; I prefer to maintain one unified version. | |
46 | ||
47 | ||
07b3798c | 48 | ;;; Change Log: |
fcd73769 RS |
49 | |
50 | ;; Version 2.02 (30 Jul 93): | |
51 | ;; * Added "cl-compat.el" file, extra compatibility with old package. | |
52 | ;; * Added `lexical-let' and `lexical-let*'. | |
53 | ;; * Added `define-modify-macro', `callf', and `callf2'. | |
54 | ;; * Added `ignore-errors'. | |
55 | ;; * Changed `(setf (nthcdr N PLACE) X)' to work when N is zero. | |
56 | ;; * Merged `*gentemp-counter*' into `*gensym-counter*'. | |
57 | ;; * Extended `subseq' to allow negative START and END like `substring'. | |
58 | ;; * Added `in-ref', `across-ref', `elements of-ref' loop clauses. | |
59 | ;; * Added `concat', `vconcat' loop clauses. | |
60 | ;; * Cleaned up a number of compiler warnings. | |
61 | ||
62 | ;; Version 2.01 (7 Jul 93): | |
63 | ;; * Added support for FSF version of Emacs 19. | |
64 | ;; * Added `add-hook' for Emacs 18 users. | |
65 | ;; * Added `defsubst*' and `symbol-macrolet'. | |
66 | ;; * Added `maplist', `mapc', `mapl', `mapcan', `mapcon'. | |
67 | ;; * Added `map', `concatenate', `reduce', `merge'. | |
68 | ;; * Added `revappend', `nreconc', `tailp', `tree-equal'. | |
69 | ;; * Added `assert', `check-type', `typecase', `typep', and `deftype'. | |
70 | ;; * Added destructuring and `&environment' support to `defmacro*'. | |
71 | ;; * Added destructuring to `loop', and added the following clauses: | |
72 | ;; `elements', `frames', `overlays', `intervals', `buffers', `key-seqs'. | |
73 | ;; * Renamed `delete' to `delete*' and `remove' to `remove*'. | |
74 | ;; * Completed support for all keywords in `remove*', `substitute', etc. | |
75 | ;; * Added `most-positive-float' and company. | |
76 | ;; * Fixed hash tables to work with latest Lucid Emacs. | |
77 | ;; * `proclaim' forms are no longer compile-time-evaluating; use `declaim'. | |
78 | ;; * Syntax for `warn' declarations has changed. | |
79 | ;; * Improved implementation of `random*'. | |
80 | ;; * Moved most sequence functions to a new file, cl-seq.el. | |
81 | ;; * Moved `eval-when' into cl-macs.el. | |
82 | ;; * Moved `pushnew' and `adjoin' to cl.el for most common cases. | |
83 | ;; * Moved `provide' forms down to ends of files. | |
84 | ;; * Changed expansion of `pop' to something that compiles to better code. | |
85 | ;; * Changed so that no patch is required for Emacs 19 byte compiler. | |
86 | ;; * Made more things dependent on `optimize' declarations. | |
87 | ;; * Added a partial implementation of struct print functions. | |
88 | ;; * Miscellaneous minor changes. | |
89 | ||
90 | ;; Version 2.00: | |
91 | ;; * First public release of this package. | |
92 | ||
93 | ||
07b3798c | 94 | ;;; Code: |
fcd73769 | 95 | |
fcd73769 RS |
96 | (defvar cl-optimize-speed 1) |
97 | (defvar cl-optimize-safety 1) | |
98 | ||
99 | ||
7dcf6269 | 100 | ;;;###autoload |
fcd73769 RS |
101 | (defvar custom-print-functions nil |
102 | "This is a list of functions that format user objects for printing. | |
103 | Each function is called in turn with three arguments: the object, the | |
104 | stream, and the print level (currently ignored). If it is able to | |
105 | print the object it returns true; otherwise it returns nil and the | |
106 | printer proceeds to the next function on the list. | |
107 | ||
108 | This variable is not used at present, but it is defined in hopes that | |
109 | a future Emacs interpreter will be able to use it.") | |
110 | ||
111 | ||
112 | ;;; Predicates. | |
113 | ||
114 | (defun eql (a b) ; See compiler macro in cl-macs.el | |
115 | "T if the two args are the same Lisp object. | |
116 | Floating-point numbers of equal value are `eql', but they may not be `eq'." | |
117 | (if (numberp a) | |
118 | (equal a b) | |
119 | (eq a b))) | |
120 | ||
121 | ||
122 | ;;; Generalized variables. These macros are defined here so that they | |
123 | ;;; can safely be used in .emacs files. | |
124 | ||
125 | (defmacro incf (place &optional x) | |
64a4c526 | 126 | "Increment PLACE by X (1 by default). |
fcd73769 RS |
127 | PLACE may be a symbol, or any generalized variable allowed by `setf'. |
128 | The return value is the incremented value of PLACE." | |
129 | (if (symbolp place) | |
130 | (list 'setq place (if x (list '+ place x) (list '1+ place))) | |
131 | (list 'callf '+ place (or x 1)))) | |
132 | ||
133 | (defmacro decf (place &optional x) | |
64a4c526 | 134 | "Decrement PLACE by X (1 by default). |
fcd73769 RS |
135 | PLACE may be a symbol, or any generalized variable allowed by `setf'. |
136 | The return value is the decremented value of PLACE." | |
137 | (if (symbolp place) | |
138 | (list 'setq place (if x (list '- place x) (list '1- place))) | |
139 | (list 'callf '- place (or x 1)))) | |
140 | ||
141 | (defmacro pop (place) | |
64a4c526 | 142 | "Remove and return the head of the list stored in PLACE. |
fcd73769 RS |
143 | Analogous to (prog1 (car PLACE) (setf PLACE (cdr PLACE))), though more |
144 | careful about evaluating each argument only once and in the right order. | |
145 | PLACE may be a symbol, or any generalized variable allowed by `setf'." | |
146 | (if (symbolp place) | |
147 | (list 'car (list 'prog1 place (list 'setq place (list 'cdr place)))) | |
148 | (cl-do-pop place))) | |
149 | ||
150 | (defmacro push (x place) | |
64a4c526 | 151 | "Insert X at the head of the list stored in PLACE. |
fcd73769 RS |
152 | Analogous to (setf PLACE (cons X PLACE)), though more careful about |
153 | evaluating each argument only once and in the right order. PLACE may | |
154 | be a symbol, or any generalized variable allowed by `setf'." | |
155 | (if (symbolp place) (list 'setq place (list 'cons x place)) | |
156 | (list 'callf2 'cons x place))) | |
157 | ||
158 | (defmacro pushnew (x place &rest keys) | |
159 | "(pushnew X PLACE): insert X at the head of the list if not already there. | |
160 | Like (push X PLACE), except that the list is unmodified if X is `eql' to | |
161 | an element already on the list. | |
162 | Keywords supported: :test :test-not :key" | |
163 | (if (symbolp place) (list 'setq place (list* 'adjoin x place keys)) | |
164 | (list* 'callf2 'adjoin x place keys))) | |
165 | ||
166 | (defun cl-set-elt (seq n val) | |
167 | (if (listp seq) (setcar (nthcdr n seq) val) (aset seq n val))) | |
168 | ||
169 | (defun cl-set-nthcdr (n list x) | |
170 | (if (<= n 0) x (setcdr (nthcdr (1- n) list) x) list)) | |
171 | ||
172 | (defun cl-set-buffer-substring (start end val) | |
173 | (save-excursion (delete-region start end) | |
174 | (goto-char start) | |
175 | (insert val) | |
176 | val)) | |
177 | ||
178 | (defun cl-set-substring (str start end val) | |
179 | (if end (if (< end 0) (incf end (length str))) | |
180 | (setq end (length str))) | |
181 | (if (< start 0) (incf start str)) | |
182 | (concat (and (> start 0) (substring str 0 start)) | |
183 | val | |
184 | (and (< end (length str)) (substring str end)))) | |
185 | ||
186 | ||
187 | ;;; Control structures. | |
188 | ||
189 | ;;; These macros are so simple and so often-used that it's better to have | |
190 | ;;; them all the time than to load them from cl-macs.el. | |
191 | ||
fcd73769 | 192 | (defun cl-map-extents (&rest cl-args) |
f67171e6 | 193 | (apply 'cl-map-overlays cl-args)) |
fcd73769 RS |
194 | |
195 | ||
196 | ;;; Blocks and exits. | |
197 | ||
198 | (defalias 'cl-block-wrapper 'identity) | |
199 | (defalias 'cl-block-throw 'throw) | |
200 | ||
201 | ||
202 | ;;; Multiple values. True multiple values are not supported, or even | |
203 | ;;; simulated. Instead, multiple-value-bind and friends simply expect | |
204 | ;;; the target form to return the values as a list. | |
205 | ||
413da451 RS |
206 | (defsubst values (&rest values) |
207 | "Return multiple values, Common Lisp style. | |
208 | The arguments of `values' are the values | |
209 | that the containing function should return." | |
210 | (apply 'list values)) | |
211 | ||
212 | (defsubst values-list (list) | |
213 | "Return multiple values, Common Lisp style, taken from a list. | |
214 | LIST specifies the list of values | |
215 | that the containing function should return." | |
216 | list) | |
217 | ||
218 | (defsubst multiple-value-list (expression) | |
219 | "Return a list of the multiple values produced by EXPRESSION. | |
220 | This handles multiple values in Common Lisp style, but it does not | |
221 | work right when EXPRESSION calls an ordinary Emacs Lisp function | |
222 | that returns just one value." | |
223 | expression) | |
224 | ||
225 | (defsubst multiple-value-apply (function expression) | |
226 | "Evaluate EXPRESSION to get multiple values and apply FUNCTION to them. | |
227 | This handles multiple values in Common Lisp style, but it does not work | |
228 | right when EXPRESSION calls an ordinary Emacs Lisp function that returns just | |
229 | one value." | |
230 | (apply function expression)) | |
231 | ||
232 | (defsubst nth-value (n expression) | |
233 | "Evaluate EXPRESSION to get multiple values and return the Nth one. | |
234 | This handles multiple values in Common Lisp style, but it does not work | |
235 | right when EXPRESSION calls an ordinary Emacs Lisp function that returns just | |
236 | one value." | |
237 | (nth n expression)) | |
fcd73769 RS |
238 | |
239 | ;;; Macros. | |
240 | ||
241 | (defvar cl-macro-environment nil) | |
242 | (defvar cl-old-macroexpand (prog1 (symbol-function 'macroexpand) | |
243 | (defalias 'macroexpand 'cl-macroexpand))) | |
244 | ||
245 | (defun cl-macroexpand (cl-macro &optional cl-env) | |
2a8160e6 RS |
246 | "Return result of expanding macros at top level of FORM. |
247 | If FORM is not a macro call, it is returned unchanged. | |
248 | Otherwise, the macro is expanded and the expansion is considered | |
249 | in place of FORM. When a non-macro-call results, it is returned. | |
250 | ||
f15e298c | 251 | The second optional arg ENVIRONMENT specifies an environment of macro |
2a8160e6 | 252 | definitions to shadow the loaded ones for use in file byte-compilation." |
fcd73769 RS |
253 | (let ((cl-macro-environment cl-env)) |
254 | (while (progn (setq cl-macro (funcall cl-old-macroexpand cl-macro cl-env)) | |
255 | (and (symbolp cl-macro) | |
256 | (cdr (assq (symbol-name cl-macro) cl-env)))) | |
257 | (setq cl-macro (cadr (assq (symbol-name cl-macro) cl-env)))) | |
258 | cl-macro)) | |
259 | ||
260 | ||
261 | ;;; Declarations. | |
262 | ||
263 | (defvar cl-compiling-file nil) | |
264 | (defun cl-compiling-file () | |
265 | (or cl-compiling-file | |
266 | (and (boundp 'outbuffer) (bufferp (symbol-value 'outbuffer)) | |
267 | (equal (buffer-name (symbol-value 'outbuffer)) | |
268 | " *Compiler Output*")))) | |
269 | ||
270 | (defvar cl-proclaims-deferred nil) | |
271 | ||
272 | (defun proclaim (spec) | |
273 | (if (fboundp 'cl-do-proclaim) (cl-do-proclaim spec t) | |
274 | (push spec cl-proclaims-deferred)) | |
275 | nil) | |
276 | ||
277 | (defmacro declaim (&rest specs) | |
278 | (let ((body (mapcar (function (lambda (x) (list 'proclaim (list 'quote x)))) | |
279 | specs))) | |
280 | (if (cl-compiling-file) (list* 'eval-when '(compile load eval) body) | |
281 | (cons 'progn body)))) ; avoid loading cl-macs.el for eval-when | |
282 | ||
283 | ||
284 | ;;; Symbols. | |
285 | ||
286 | (defun cl-random-time () | |
287 | (let* ((time (copy-sequence (current-time-string))) (i (length time)) (v 0)) | |
288 | (while (>= (decf i) 0) (setq v (+ (* v 3) (aref time i)))) | |
289 | v)) | |
290 | ||
291 | (defvar *gensym-counter* (* (logand (cl-random-time) 1023) 100)) | |
292 | ||
293 | ||
294 | ;;; Numbers. | |
295 | ||
296 | (defun floatp-safe (x) | |
297 | "T if OBJECT is a floating point number. | |
298 | On Emacs versions that lack floating-point support, this function | |
299 | always returns nil." | |
300 | (and (numberp x) (not (integerp x)))) | |
301 | ||
302 | (defun plusp (x) | |
303 | "T if NUMBER is positive." | |
304 | (> x 0)) | |
305 | ||
306 | (defun minusp (x) | |
307 | "T if NUMBER is negative." | |
308 | (< x 0)) | |
309 | ||
310 | (defun oddp (x) | |
311 | "T if INTEGER is odd." | |
312 | (eq (logand x 1) 1)) | |
313 | ||
314 | (defun evenp (x) | |
315 | "T if INTEGER is even." | |
316 | (eq (logand x 1) 0)) | |
317 | ||
fcd73769 RS |
318 | (defvar *random-state* (vector 'cl-random-state-tag -1 30 (cl-random-time))) |
319 | ||
fcd73769 RS |
320 | ;;; The following are actually set by cl-float-limits. |
321 | (defconst most-positive-float nil) | |
322 | (defconst most-negative-float nil) | |
323 | (defconst least-positive-float nil) | |
324 | (defconst least-negative-float nil) | |
325 | (defconst least-positive-normalized-float nil) | |
326 | (defconst least-negative-normalized-float nil) | |
327 | (defconst float-epsilon nil) | |
328 | (defconst float-negative-epsilon nil) | |
329 | ||
330 | ||
331 | ;;; Sequence functions. | |
332 | ||
333 | (defalias 'copy-seq 'copy-sequence) | |
334 | ||
335 | (defun mapcar* (cl-func cl-x &rest cl-rest) | |
336 | "Apply FUNCTION to each element of SEQ, and make a list of the results. | |
337 | If there are several SEQs, FUNCTION is called with that many arguments, | |
338 | and mapping stops as soon as the shortest list runs out. With just one | |
339 | SEQ, this is like `mapcar'. With several, it is like the Common Lisp | |
340 | `mapcar' function extended to arbitrary sequence types." | |
341 | (if cl-rest | |
342 | (if (or (cdr cl-rest) (nlistp cl-x) (nlistp (car cl-rest))) | |
343 | (cl-mapcar-many cl-func (cons cl-x cl-rest)) | |
344 | (let ((cl-res nil) (cl-y (car cl-rest))) | |
345 | (while (and cl-x cl-y) | |
346 | (push (funcall cl-func (pop cl-x) (pop cl-y)) cl-res)) | |
347 | (nreverse cl-res))) | |
348 | (mapcar cl-func cl-x))) | |
349 | ||
350 | ||
351 | ;;; List functions. | |
352 | ||
353 | (defalias 'first 'car) | |
dc79c3ea | 354 | (defalias 'second 'cadr) |
fcd73769 RS |
355 | (defalias 'rest 'cdr) |
356 | (defalias 'endp 'null) | |
357 | ||
dc79c3ea | 358 | (defun third (x) |
b7a90344 SM |
359 | "Return the third element of the list X." |
360 | (car (cdr (cdr x)))) | |
fcd73769 | 361 | |
dc79c3ea | 362 | (defun fourth (x) |
b7a90344 SM |
363 | "Return the fourth element of the list X." |
364 | (nth 3 x)) | |
fcd73769 | 365 | |
dc79c3ea | 366 | (defun fifth (x) |
b7a90344 SM |
367 | "Return the fifth element of the list X." |
368 | (nth 4 x)) | |
fcd73769 | 369 | |
dc79c3ea | 370 | (defun sixth (x) |
b7a90344 SM |
371 | "Return the sixth element of the list X." |
372 | (nth 5 x)) | |
fcd73769 | 373 | |
dc79c3ea | 374 | (defun seventh (x) |
b7a90344 SM |
375 | "Return the seventh element of the list X." |
376 | (nth 6 x)) | |
fcd73769 | 377 | |
dc79c3ea | 378 | (defun eighth (x) |
b7a90344 SM |
379 | "Return the eighth element of the list X." |
380 | (nth 7 x)) | |
fcd73769 | 381 | |
dc79c3ea | 382 | (defun ninth (x) |
b7a90344 SM |
383 | "Return the ninth element of the list X." |
384 | (nth 8 x)) | |
fcd73769 | 385 | |
dc79c3ea | 386 | (defun tenth (x) |
b7a90344 SM |
387 | "Return the tenth element of the list X." |
388 | (nth 9 x)) | |
fcd73769 | 389 | |
fcd73769 RS |
390 | (defun caaar (x) |
391 | "Return the `car' of the `car' of the `car' of X." | |
392 | (car (car (car x)))) | |
393 | ||
394 | (defun caadr (x) | |
395 | "Return the `car' of the `car' of the `cdr' of X." | |
396 | (car (car (cdr x)))) | |
397 | ||
398 | (defun cadar (x) | |
399 | "Return the `car' of the `cdr' of the `car' of X." | |
400 | (car (cdr (car x)))) | |
401 | ||
402 | (defun caddr (x) | |
403 | "Return the `car' of the `cdr' of the `cdr' of X." | |
404 | (car (cdr (cdr x)))) | |
405 | ||
406 | (defun cdaar (x) | |
407 | "Return the `cdr' of the `car' of the `car' of X." | |
408 | (cdr (car (car x)))) | |
409 | ||
410 | (defun cdadr (x) | |
411 | "Return the `cdr' of the `car' of the `cdr' of X." | |
412 | (cdr (car (cdr x)))) | |
413 | ||
414 | (defun cddar (x) | |
415 | "Return the `cdr' of the `cdr' of the `car' of X." | |
416 | (cdr (cdr (car x)))) | |
417 | ||
418 | (defun cdddr (x) | |
419 | "Return the `cdr' of the `cdr' of the `cdr' of X." | |
420 | (cdr (cdr (cdr x)))) | |
421 | ||
422 | (defun caaaar (x) | |
423 | "Return the `car' of the `car' of the `car' of the `car' of X." | |
424 | (car (car (car (car x))))) | |
425 | ||
426 | (defun caaadr (x) | |
427 | "Return the `car' of the `car' of the `car' of the `cdr' of X." | |
428 | (car (car (car (cdr x))))) | |
429 | ||
430 | (defun caadar (x) | |
431 | "Return the `car' of the `car' of the `cdr' of the `car' of X." | |
432 | (car (car (cdr (car x))))) | |
433 | ||
434 | (defun caaddr (x) | |
435 | "Return the `car' of the `car' of the `cdr' of the `cdr' of X." | |
436 | (car (car (cdr (cdr x))))) | |
437 | ||
438 | (defun cadaar (x) | |
439 | "Return the `car' of the `cdr' of the `car' of the `car' of X." | |
440 | (car (cdr (car (car x))))) | |
441 | ||
442 | (defun cadadr (x) | |
443 | "Return the `car' of the `cdr' of the `car' of the `cdr' of X." | |
444 | (car (cdr (car (cdr x))))) | |
445 | ||
446 | (defun caddar (x) | |
447 | "Return the `car' of the `cdr' of the `cdr' of the `car' of X." | |
448 | (car (cdr (cdr (car x))))) | |
449 | ||
450 | (defun cadddr (x) | |
451 | "Return the `car' of the `cdr' of the `cdr' of the `cdr' of X." | |
452 | (car (cdr (cdr (cdr x))))) | |
453 | ||
454 | (defun cdaaar (x) | |
455 | "Return the `cdr' of the `car' of the `car' of the `car' of X." | |
456 | (cdr (car (car (car x))))) | |
457 | ||
458 | (defun cdaadr (x) | |
459 | "Return the `cdr' of the `car' of the `car' of the `cdr' of X." | |
460 | (cdr (car (car (cdr x))))) | |
461 | ||
462 | (defun cdadar (x) | |
463 | "Return the `cdr' of the `car' of the `cdr' of the `car' of X." | |
464 | (cdr (car (cdr (car x))))) | |
465 | ||
466 | (defun cdaddr (x) | |
467 | "Return the `cdr' of the `car' of the `cdr' of the `cdr' of X." | |
468 | (cdr (car (cdr (cdr x))))) | |
469 | ||
470 | (defun cddaar (x) | |
471 | "Return the `cdr' of the `cdr' of the `car' of the `car' of X." | |
472 | (cdr (cdr (car (car x))))) | |
473 | ||
474 | (defun cddadr (x) | |
475 | "Return the `cdr' of the `cdr' of the `car' of the `cdr' of X." | |
476 | (cdr (cdr (car (cdr x))))) | |
477 | ||
478 | (defun cdddar (x) | |
479 | "Return the `cdr' of the `cdr' of the `cdr' of the `car' of X." | |
480 | (cdr (cdr (cdr (car x))))) | |
481 | ||
482 | (defun cddddr (x) | |
483 | "Return the `cdr' of the `cdr' of the `cdr' of the `cdr' of X." | |
484 | (cdr (cdr (cdr (cdr x))))) | |
485 | ||
f9efebca RS |
486 | ;;(defun last* (x &optional n) |
487 | ;; "Returns the last link in the list LIST. | |
488 | ;;With optional argument N, returns Nth-to-last link (default 1)." | |
489 | ;; (if n | |
490 | ;; (let ((m 0) (p x)) | |
491 | ;; (while (consp p) (incf m) (pop p)) | |
492 | ;; (if (<= n 0) p | |
493 | ;; (if (< n m) (nthcdr (- m n) x) x))) | |
494 | ;; (while (consp (cdr x)) (pop x)) | |
495 | ;; x)) | |
fcd73769 | 496 | |
fcd73769 RS |
497 | (defun list* (arg &rest rest) ; See compiler macro in cl-macs.el |
498 | "Return a new list with specified args as elements, cons'd to last arg. | |
499 | Thus, `(list* A B C D)' is equivalent to `(nconc (list A B C) D)', or to | |
500 | `(cons A (cons B (cons C D)))'." | |
501 | (cond ((not rest) arg) | |
502 | ((not (cdr rest)) (cons arg (car rest))) | |
503 | (t (let* ((n (length rest)) | |
504 | (copy (copy-sequence rest)) | |
505 | (last (nthcdr (- n 2) copy))) | |
506 | (setcdr last (car (cdr last))) | |
507 | (cons arg copy))))) | |
508 | ||
509 | (defun ldiff (list sublist) | |
510 | "Return a copy of LIST with the tail SUBLIST removed." | |
511 | (let ((res nil)) | |
512 | (while (and (consp list) (not (eq list sublist))) | |
513 | (push (pop list) res)) | |
514 | (nreverse res))) | |
515 | ||
516 | (defun copy-list (list) | |
517 | "Return a copy of a list, which may be a dotted list. | |
518 | The elements of the list are not copied, just the list structure itself." | |
519 | (if (consp list) | |
520 | (let ((res nil)) | |
521 | (while (consp list) (push (pop list) res)) | |
522 | (prog1 (nreverse res) (setcdr res list))) | |
523 | (car list))) | |
524 | ||
525 | (defun cl-maclisp-member (item list) | |
526 | (while (and list (not (equal item (car list)))) (setq list (cdr list))) | |
527 | list) | |
528 | ||
fcd73769 RS |
529 | (defalias 'cl-member 'memq) ; for compatibility with old CL package |
530 | (defalias 'cl-floor 'floor*) | |
531 | (defalias 'cl-ceiling 'ceiling*) | |
532 | (defalias 'cl-truncate 'truncate*) | |
533 | (defalias 'cl-round 'round*) | |
534 | (defalias 'cl-mod 'mod*) | |
535 | ||
536 | (defun adjoin (cl-item cl-list &rest cl-keys) ; See compiler macro in cl-macs | |
537 | "Return ITEM consed onto the front of LIST only if it's not already there. | |
538 | Otherwise, return LIST unmodified. | |
539 | Keywords supported: :test :test-not :key" | |
540 | (cond ((or (equal cl-keys '(:test eq)) | |
541 | (and (null cl-keys) (not (numberp cl-item)))) | |
542 | (if (memq cl-item cl-list) cl-list (cons cl-item cl-list))) | |
543 | ((or (equal cl-keys '(:test equal)) (null cl-keys)) | |
544 | (if (member cl-item cl-list) cl-list (cons cl-item cl-list))) | |
545 | (t (apply 'cl-adjoin cl-item cl-list cl-keys)))) | |
546 | ||
547 | (defun subst (cl-new cl-old cl-tree &rest cl-keys) | |
548 | "Substitute NEW for OLD everywhere in TREE (non-destructively). | |
549 | Return a copy of TREE with all elements `eql' to OLD replaced by NEW. | |
550 | Keywords supported: :test :test-not :key" | |
551 | (if (or cl-keys (and (numberp cl-old) (not (integerp cl-old)))) | |
552 | (apply 'sublis (list (cons cl-old cl-new)) cl-tree cl-keys) | |
553 | (cl-do-subst cl-new cl-old cl-tree))) | |
554 | ||
555 | (defun cl-do-subst (cl-new cl-old cl-tree) | |
556 | (cond ((eq cl-tree cl-old) cl-new) | |
557 | ((consp cl-tree) | |
558 | (let ((a (cl-do-subst cl-new cl-old (car cl-tree))) | |
559 | (d (cl-do-subst cl-new cl-old (cdr cl-tree)))) | |
560 | (if (and (eq a (car cl-tree)) (eq d (cdr cl-tree))) | |
561 | cl-tree (cons a d)))) | |
562 | (t cl-tree))) | |
563 | ||
564 | (defun acons (a b c) (cons (cons a b) c)) | |
565 | (defun pairlis (a b &optional c) (nconc (mapcar* 'cons a b) c)) | |
566 | ||
567 | ||
568 | ;;; Miscellaneous. | |
569 | ||
570 | (put 'cl-assertion-failed 'error-conditions '(error)) | |
571 | (put 'cl-assertion-failed 'error-message "Assertion failed") | |
572 | ||
ed590ca8 GM |
573 | (defvar cl-fake-autoloads nil |
574 | "Non-nil means don't make CL functions autoload.") | |
575 | ||
fcd73769 | 576 | ;;; Autoload the other portions of the package. |
335db3c1 DL |
577 | ;; We want to replace the basic versions of dolist, dotimes below. |
578 | (fmakunbound 'dolist) | |
579 | (fmakunbound 'dotimes) | |
fcd73769 RS |
580 | (mapcar (function |
581 | (lambda (set) | |
ed590ca8 GM |
582 | (let ((file (if cl-fake-autoloads "<none>" (car set)))) |
583 | (mapcar (function | |
584 | (lambda (func) | |
585 | (autoload func (car set) nil nil (nth 1 set)))) | |
586 | (cddr set))))) | |
fcd73769 RS |
587 | '(("cl-extra" nil |
588 | coerce equalp cl-map-keymap maplist mapc mapl mapcan mapcon | |
589 | cl-map-keymap cl-map-keymap-recursively cl-map-intervals | |
590 | cl-map-overlays cl-set-frame-visible-p cl-float-limits | |
a599ac7c | 591 | gcd lcm isqrt floor* ceiling* truncate* round* |
fcd73769 RS |
592 | mod* rem* signum random* make-random-state random-state-p |
593 | subseq concatenate cl-mapcar-many map some every notany | |
594 | notevery revappend nreconc list-length tailp copy-tree get* getf | |
f67171e6 DL |
595 | cl-set-getf cl-do-remf remprop cl-make-hash-table cl-hash-lookup |
596 | cl-gethash cl-puthash cl-remhash cl-clrhash cl-maphash cl-hash-table-p | |
597 | cl-hash-table-count cl-progv-before cl-prettyexpand | |
fcd73769 RS |
598 | cl-macroexpand-all) |
599 | ("cl-seq" nil | |
ed590ca8 | 600 | reduce fill replace remove* remove-if remove-if-not |
a599ac7c | 601 | delete* delete-if delete-if-not remove-duplicates |
fcd73769 RS |
602 | delete-duplicates substitute substitute-if substitute-if-not |
603 | nsubstitute nsubstitute-if nsubstitute-if-not find find-if | |
604 | find-if-not position position-if position-if-not count count-if | |
605 | count-if-not mismatch search sort* stable-sort merge member* | |
606 | member-if member-if-not cl-adjoin assoc* assoc-if assoc-if-not | |
a599ac7c | 607 | rassoc* rassoc-if rassoc-if-not union nunion intersection |
fcd73769 RS |
608 | nintersection set-difference nset-difference set-exclusive-or |
609 | nset-exclusive-or subsetp subst-if subst-if-not nsubst nsubst-if | |
610 | nsubst-if-not sublis nsublis tree-equal) | |
611 | ("cl-macs" nil | |
612 | gensym gentemp typep cl-do-pop get-setf-method | |
613 | cl-struct-setf-expander compiler-macroexpand cl-compile-time-init) | |
614 | ("cl-macs" t | |
615 | defun* defmacro* function* destructuring-bind eval-when | |
f67171e6 | 616 | load-time-value case ecase typecase etypecase |
cc4dfff0 | 617 | block return return-from loop do do* dolist dotimes do-symbols |
fcd73769 RS |
618 | do-all-symbols psetq progv flet labels macrolet symbol-macrolet |
619 | lexical-let lexical-let* multiple-value-bind multiple-value-setq | |
620 | locally the declare define-setf-method defsetf define-modify-macro | |
621 | setf psetf remf shiftf rotatef letf letf* callf callf2 defstruct | |
622 | check-type assert ignore-errors define-compiler-macro))) | |
623 | ||
624 | ;;; Define data for indentation and edebug. | |
625 | (mapcar (function | |
626 | (lambda (entry) | |
627 | (mapcar (function | |
628 | (lambda (func) | |
629 | (put func 'lisp-indent-function (nth 1 entry)) | |
630 | (put func 'lisp-indent-hook (nth 1 entry)) | |
631 | (or (get func 'edebug-form-spec) | |
632 | (put func 'edebug-form-spec (nth 2 entry))))) | |
633 | (car entry)))) | |
634 | '(((defun* defmacro*) 2) | |
635 | ((function*) nil | |
636 | (&or symbolp ([&optional 'macro] 'lambda (&rest sexp) &rest form))) | |
637 | ((eval-when) 1 (sexp &rest form)) | |
fcd73769 RS |
638 | ((declare) nil (&rest sexp)) |
639 | ((the) 1 (sexp &rest form)) | |
640 | ((case ecase typecase etypecase) 1 (form &rest (sexp &rest form))) | |
641 | ((block return-from) 1 (sexp &rest form)) | |
642 | ((return) nil (&optional form)) | |
643 | ((do do*) 2 ((&rest &or symbolp (symbolp &optional form form)) | |
644 | (form &rest form) | |
645 | &rest form)) | |
fcd73769 RS |
646 | ((do-symbols) 1 ((symbolp form &optional form form) &rest form)) |
647 | ((do-all-symbols) 1 ((symbolp form &optional form) &rest form)) | |
648 | ((psetq setf psetf) nil edebug-setq-form) | |
649 | ((progv) 2 (&rest form)) | |
650 | ((flet labels macrolet) 1 | |
651 | ((&rest (sexp sexp &rest form)) &rest form)) | |
652 | ((symbol-macrolet lexical-let lexical-let*) 1 | |
653 | ((&rest &or symbolp (symbolp form)) &rest form)) | |
654 | ((multiple-value-bind) 2 ((&rest symbolp) &rest form)) | |
655 | ((multiple-value-setq) 1 ((&rest symbolp) &rest form)) | |
7df85084 | 656 | ((incf decf remf pushnew shiftf rotatef) nil (&rest form)) |
fcd73769 RS |
657 | ((letf letf*) 1 ((&rest (&rest form)) &rest form)) |
658 | ((callf destructuring-bind) 2 (sexp form &rest form)) | |
659 | ((callf2) 3 (sexp form form &rest form)) | |
660 | ((loop) nil (&rest &or symbolp form)) | |
661 | ((ignore-errors) 0 (&rest form)))) | |
662 | ||
663 | ||
664 | ;;; This goes here so that cl-macs can find it if it loads right now. | |
665 | (provide 'cl-19) ; usage: (require 'cl-19 "cl") | |
666 | ||
667 | ||
668 | ;;; Things to do after byte-compiler is loaded. | |
669 | ;;; As a side effect, we cause cl-macs to be loaded when compiling, so | |
670 | ;;; that the compiler-macros defined there will be present. | |
671 | ||
672 | (defvar cl-hacked-flag nil) | |
673 | (defun cl-hack-byte-compiler () | |
674 | (if (and (not cl-hacked-flag) (fboundp 'byte-compile-file-form)) | |
675 | (progn | |
676 | (cl-compile-time-init) ; in cl-macs.el | |
677 | (setq cl-hacked-flag t)))) | |
678 | ||
679 | ;;; Try it now in case the compiler has already been loaded. | |
680 | (cl-hack-byte-compiler) | |
681 | ||
682 | ;;; Also make a hook in case compiler is loaded after this file. | |
0d752cda | 683 | (add-hook 'bytecomp-load-hook 'cl-hack-byte-compiler) |
fcd73769 RS |
684 | |
685 | ||
686 | ;;; The following ensures that packages which expect the old-style cl.el | |
687 | ;;; will be happy with this one. | |
688 | ||
689 | (provide 'cl) | |
690 | ||
fcd73769 RS |
691 | (run-hooks 'cl-load-hook) |
692 | ||
693 | ;;; cl.el ends here |