Commit | Line | Data |
---|---|---|
fcd73769 RS |
1 | ;; cl.el --- Common Lisp extensions for GNU Emacs Lisp |
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 | |
13 | ;; the Free Software Foundation; either version 1, or (at your option) | |
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 | |
22 | ;; along with GNU Emacs; see the file COPYING. If not, write to | |
23 | ;; the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. | |
24 | ||
25 | ;; Commentary: | |
26 | ||
27 | ;; These are extensions to Emacs Lisp that provide a degree of | |
28 | ;; Common Lisp compatibility, beyond what is already built-in | |
29 | ;; in Emacs Lisp. | |
30 | ;; | |
31 | ;; This package was written by Dave Gillespie; it is a complete | |
32 | ;; rewrite of Cesar Quiroz's original cl.el package of December 1986. | |
33 | ;; | |
34 | ;; This package works with Emacs 18, Emacs 19, and Lucid Emacs 19. | |
35 | ;; | |
36 | ;; Bug reports, comments, and suggestions are welcome! | |
37 | ||
38 | ;; This file contains the portions of the Common Lisp extensions | |
39 | ;; package which should always be present. | |
40 | ||
41 | ||
42 | ;; Future notes: | |
43 | ||
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. | |
47 | ||
48 | ||
49 | ;; Change Log: | |
50 | ||
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. | |
62 | ||
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. | |
90 | ||
91 | ;; Version 2.00: | |
92 | ;; * First public release of this package. | |
93 | ||
94 | ||
95 | ;; Code: | |
96 | ||
97 | (defvar cl-emacs-type (cond ((or (and (fboundp 'epoch::version) | |
98 | (symbol-value 'epoch::version)) | |
99 | (string-lessp emacs-version "19")) 18) | |
100 | ((string-match "Lucid" emacs-version) 'lucid) | |
101 | (t 19))) | |
102 | ||
103 | (or (fboundp 'defalias) (fset 'defalias 'fset)) | |
104 | ||
105 | (defvar cl-optimize-speed 1) | |
106 | (defvar cl-optimize-safety 1) | |
107 | ||
108 | ||
109 | ;;; Keywords used in this package. | |
110 | ||
111 | (defconst :test ':test) | |
112 | (defconst :test-not ':test-not) | |
113 | (defconst :key ':key) | |
114 | (defconst :start ':start) | |
115 | (defconst :start1 ':start1) | |
116 | (defconst :start2 ':start2) | |
117 | (defconst :end ':end) | |
118 | (defconst :end1 ':end1) | |
119 | (defconst :end2 ':end2) | |
120 | (defconst :count ':count) | |
121 | (defconst :initial-value ':initial-value) | |
122 | (defconst :size ':size) | |
123 | (defconst :from-end ':from-end) | |
124 | (defconst :rehash-size ':rehash-size) | |
125 | (defconst :rehash-threshold ':rehash-threshold) | |
126 | (defconst :allow-other-keys ':allow-other-keys) | |
127 | ||
128 | ||
129 | (defvar custom-print-functions nil | |
130 | "This is a list of functions that format user objects for printing. | |
131 | Each function is called in turn with three arguments: the object, the | |
132 | stream, and the print level (currently ignored). If it is able to | |
133 | print the object it returns true; otherwise it returns nil and the | |
134 | printer proceeds to the next function on the list. | |
135 | ||
136 | This variable is not used at present, but it is defined in hopes that | |
137 | a future Emacs interpreter will be able to use it.") | |
138 | ||
139 | ||
140 | ;;; Predicates. | |
141 | ||
142 | (defun eql (a b) ; See compiler macro in cl-macs.el | |
143 | "T if the two args are the same Lisp object. | |
144 | Floating-point numbers of equal value are `eql', but they may not be `eq'." | |
145 | (if (numberp a) | |
146 | (equal a b) | |
147 | (eq a b))) | |
148 | ||
149 | ||
150 | ;;; Generalized variables. These macros are defined here so that they | |
151 | ;;; can safely be used in .emacs files. | |
152 | ||
153 | (defmacro incf (place &optional x) | |
154 | "(incf PLACE [X]): increment PLACE by X (1 by default). | |
155 | PLACE may be a symbol, or any generalized variable allowed by `setf'. | |
156 | The return value is the incremented value of PLACE." | |
157 | (if (symbolp place) | |
158 | (list 'setq place (if x (list '+ place x) (list '1+ place))) | |
159 | (list 'callf '+ place (or x 1)))) | |
160 | ||
161 | (defmacro decf (place &optional x) | |
162 | "(decf PLACE [X]): decrement PLACE by X (1 by default). | |
163 | PLACE may be a symbol, or any generalized variable allowed by `setf'. | |
164 | The return value is the decremented value of PLACE." | |
165 | (if (symbolp place) | |
166 | (list 'setq place (if x (list '- place x) (list '1- place))) | |
167 | (list 'callf '- place (or x 1)))) | |
168 | ||
169 | (defmacro pop (place) | |
170 | "(pop PLACE): remove and return the head of the list stored in PLACE. | |
171 | Analogous to (prog1 (car PLACE) (setf PLACE (cdr PLACE))), though more | |
172 | careful about evaluating each argument only once and in the right order. | |
173 | PLACE may be a symbol, or any generalized variable allowed by `setf'." | |
174 | (if (symbolp place) | |
175 | (list 'car (list 'prog1 place (list 'setq place (list 'cdr place)))) | |
176 | (cl-do-pop place))) | |
177 | ||
178 | (defmacro push (x place) | |
179 | "(push X PLACE): insert X at the head of the list stored in PLACE. | |
180 | Analogous to (setf PLACE (cons X PLACE)), though more careful about | |
181 | evaluating each argument only once and in the right order. PLACE may | |
182 | be a symbol, or any generalized variable allowed by `setf'." | |
183 | (if (symbolp place) (list 'setq place (list 'cons x place)) | |
184 | (list 'callf2 'cons x place))) | |
185 | ||
186 | (defmacro pushnew (x place &rest keys) | |
187 | "(pushnew X PLACE): insert X at the head of the list if not already there. | |
188 | Like (push X PLACE), except that the list is unmodified if X is `eql' to | |
189 | an element already on the list. | |
190 | Keywords supported: :test :test-not :key" | |
191 | (if (symbolp place) (list 'setq place (list* 'adjoin x place keys)) | |
192 | (list* 'callf2 'adjoin x place keys))) | |
193 | ||
194 | (defun cl-set-elt (seq n val) | |
195 | (if (listp seq) (setcar (nthcdr n seq) val) (aset seq n val))) | |
196 | ||
197 | (defun cl-set-nthcdr (n list x) | |
198 | (if (<= n 0) x (setcdr (nthcdr (1- n) list) x) list)) | |
199 | ||
200 | (defun cl-set-buffer-substring (start end val) | |
201 | (save-excursion (delete-region start end) | |
202 | (goto-char start) | |
203 | (insert val) | |
204 | val)) | |
205 | ||
206 | (defun cl-set-substring (str start end val) | |
207 | (if end (if (< end 0) (incf end (length str))) | |
208 | (setq end (length str))) | |
209 | (if (< start 0) (incf start str)) | |
210 | (concat (and (> start 0) (substring str 0 start)) | |
211 | val | |
212 | (and (< end (length str)) (substring str end)))) | |
213 | ||
214 | ||
215 | ;;; Control structures. | |
216 | ||
217 | ;;; These macros are so simple and so often-used that it's better to have | |
218 | ;;; them all the time than to load them from cl-macs.el. | |
219 | ||
220 | (defmacro when (cond &rest body) | |
221 | "(when COND BODY...): if COND yields non-nil, do BODY, else return nil." | |
222 | (list 'if cond (cons 'progn body))) | |
223 | ||
224 | (defmacro unless (cond &rest body) | |
225 | "(unless COND BODY...): if COND yields nil, do BODY, else return nil." | |
226 | (cons 'if (cons cond (cons nil body)))) | |
227 | ||
228 | (defun cl-map-extents (&rest cl-args) | |
229 | (if (fboundp 'next-overlay-at) (apply 'cl-map-overlays cl-args) | |
230 | (if (fboundp 'map-extents) (apply 'map-extents cl-args)))) | |
231 | ||
232 | ||
233 | ;;; Blocks and exits. | |
234 | ||
235 | (defalias 'cl-block-wrapper 'identity) | |
236 | (defalias 'cl-block-throw 'throw) | |
237 | ||
238 | ||
239 | ;;; Multiple values. True multiple values are not supported, or even | |
240 | ;;; simulated. Instead, multiple-value-bind and friends simply expect | |
241 | ;;; the target form to return the values as a list. | |
242 | ||
243 | (defalias 'values 'list) | |
244 | (defalias 'values-list 'identity) | |
245 | (defalias 'multiple-value-list 'identity) | |
246 | (defalias 'multiple-value-call 'apply) ; only works for one arg | |
247 | (defalias 'nth-value 'nth) | |
248 | ||
249 | ||
250 | ;;; Macros. | |
251 | ||
252 | (defvar cl-macro-environment nil) | |
253 | (defvar cl-old-macroexpand (prog1 (symbol-function 'macroexpand) | |
254 | (defalias 'macroexpand 'cl-macroexpand))) | |
255 | ||
256 | (defun cl-macroexpand (cl-macro &optional cl-env) | |
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)))) | |
262 | cl-macro)) | |
263 | ||
264 | ||
265 | ;;; Declarations. | |
266 | ||
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*")))) | |
273 | ||
274 | (defvar cl-proclaims-deferred nil) | |
275 | ||
276 | (defun proclaim (spec) | |
277 | (if (fboundp 'cl-do-proclaim) (cl-do-proclaim spec t) | |
278 | (push spec cl-proclaims-deferred)) | |
279 | nil) | |
280 | ||
281 | (defmacro declaim (&rest specs) | |
282 | (let ((body (mapcar (function (lambda (x) (list 'proclaim (list 'quote x)))) | |
283 | specs))) | |
284 | (if (cl-compiling-file) (list* 'eval-when '(compile load eval) body) | |
285 | (cons 'progn body)))) ; avoid loading cl-macs.el for eval-when | |
286 | ||
287 | ||
288 | ;;; Symbols. | |
289 | ||
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)))) | |
293 | v)) | |
294 | ||
295 | (defvar *gensym-counter* (* (logand (cl-random-time) 1023) 100)) | |
296 | ||
297 | ||
298 | ;;; Numbers. | |
299 | ||
300 | (defun floatp-safe (x) | |
301 | "T if OBJECT is a floating point number. | |
302 | On Emacs versions that lack floating-point support, this function | |
303 | always returns nil." | |
304 | (and (numberp x) (not (integerp x)))) | |
305 | ||
306 | (defun plusp (x) | |
307 | "T if NUMBER is positive." | |
308 | (> x 0)) | |
309 | ||
310 | (defun minusp (x) | |
311 | "T if NUMBER is negative." | |
312 | (< x 0)) | |
313 | ||
314 | (defun oddp (x) | |
315 | "T if INTEGER is odd." | |
316 | (eq (logand x 1) 1)) | |
317 | ||
318 | (defun evenp (x) | |
319 | "T if INTEGER is even." | |
320 | (eq (logand x 1) 0)) | |
321 | ||
322 | (defun cl-abs (x) | |
323 | "Return the absolute value of ARG." | |
324 | (if (>= x 0) x (- x))) | |
325 | (or (fboundp 'abs) (defalias 'abs 'cl-abs)) ; This is built-in to Emacs 19 | |
326 | ||
327 | (defvar *random-state* (vector 'cl-random-state-tag -1 30 (cl-random-time))) | |
328 | ||
329 | ;;; We use `eval' in case VALBITS differs from compile-time to load-time. | |
330 | (defconst most-positive-fixnum (eval '(lsh -1 -1))) | |
331 | (defconst most-negative-fixnum (eval '(- -1 (lsh -1 -1)))) | |
332 | ||
333 | ;;; The following are actually set by cl-float-limits. | |
334 | (defconst most-positive-float nil) | |
335 | (defconst most-negative-float nil) | |
336 | (defconst least-positive-float nil) | |
337 | (defconst least-negative-float nil) | |
338 | (defconst least-positive-normalized-float nil) | |
339 | (defconst least-negative-normalized-float nil) | |
340 | (defconst float-epsilon nil) | |
341 | (defconst float-negative-epsilon nil) | |
342 | ||
343 | ||
344 | ;;; Sequence functions. | |
345 | ||
346 | (defalias 'copy-seq 'copy-sequence) | |
347 | ||
348 | (defun mapcar* (cl-func cl-x &rest cl-rest) | |
349 | "Apply FUNCTION to each element of SEQ, and make a list of the results. | |
350 | If there are several SEQs, FUNCTION is called with that many arguments, | |
351 | and mapping stops as soon as the shortest list runs out. With just one | |
352 | SEQ, this is like `mapcar'. With several, it is like the Common Lisp | |
353 | `mapcar' function extended to arbitrary sequence types." | |
354 | (if cl-rest | |
355 | (if (or (cdr cl-rest) (nlistp cl-x) (nlistp (car cl-rest))) | |
356 | (cl-mapcar-many cl-func (cons cl-x cl-rest)) | |
357 | (let ((cl-res nil) (cl-y (car cl-rest))) | |
358 | (while (and cl-x cl-y) | |
359 | (push (funcall cl-func (pop cl-x) (pop cl-y)) cl-res)) | |
360 | (nreverse cl-res))) | |
361 | (mapcar cl-func cl-x))) | |
362 | ||
363 | ||
364 | ;;; List functions. | |
365 | ||
366 | (defalias 'first 'car) | |
367 | (defalias 'rest 'cdr) | |
368 | (defalias 'endp 'null) | |
369 | ||
370 | (defun second (x) | |
371 | "Return the second element of the list LIST." | |
372 | (car (cdr x))) | |
373 | ||
374 | (defun third (x) | |
375 | "Return the third element of the list LIST." | |
376 | (car (cdr (cdr x)))) | |
377 | ||
378 | (defun fourth (x) | |
379 | "Return the fourth element of the list LIST." | |
380 | (nth 3 x)) | |
381 | ||
382 | (defun fifth (x) | |
383 | "Return the fifth element of the list LIST." | |
384 | (nth 4 x)) | |
385 | ||
386 | (defun sixth (x) | |
387 | "Return the sixth element of the list LIST." | |
388 | (nth 5 x)) | |
389 | ||
390 | (defun seventh (x) | |
391 | "Return the seventh element of the list LIST." | |
392 | (nth 6 x)) | |
393 | ||
394 | (defun eighth (x) | |
395 | "Return the eighth element of the list LIST." | |
396 | (nth 7 x)) | |
397 | ||
398 | (defun ninth (x) | |
399 | "Return the ninth element of the list LIST." | |
400 | (nth 8 x)) | |
401 | ||
402 | (defun tenth (x) | |
403 | "Return the tenth element of the list LIST." | |
404 | (nth 9 x)) | |
405 | ||
406 | (defun caar (x) | |
407 | "Return the `car' of the `car' of X." | |
408 | (car (car x))) | |
409 | ||
410 | (defun cadr (x) | |
411 | "Return the `car' of the `cdr' of X." | |
412 | (car (cdr x))) | |
413 | ||
414 | (defun cdar (x) | |
415 | "Return the `cdr' of the `car' of X." | |
416 | (cdr (car x))) | |
417 | ||
418 | (defun cddr (x) | |
419 | "Return the `cdr' of the `cdr' of X." | |
420 | (cdr (cdr x))) | |
421 | ||
422 | (defun caaar (x) | |
423 | "Return the `car' of the `car' of the `car' of X." | |
424 | (car (car (car x)))) | |
425 | ||
426 | (defun caadr (x) | |
427 | "Return the `car' of the `car' of the `cdr' of X." | |
428 | (car (car (cdr x)))) | |
429 | ||
430 | (defun cadar (x) | |
431 | "Return the `car' of the `cdr' of the `car' of X." | |
432 | (car (cdr (car x)))) | |
433 | ||
434 | (defun caddr (x) | |
435 | "Return the `car' of the `cdr' of the `cdr' of X." | |
436 | (car (cdr (cdr x)))) | |
437 | ||
438 | (defun cdaar (x) | |
439 | "Return the `cdr' of the `car' of the `car' of X." | |
440 | (cdr (car (car x)))) | |
441 | ||
442 | (defun cdadr (x) | |
443 | "Return the `cdr' of the `car' of the `cdr' of X." | |
444 | (cdr (car (cdr x)))) | |
445 | ||
446 | (defun cddar (x) | |
447 | "Return the `cdr' of the `cdr' of the `car' of X." | |
448 | (cdr (cdr (car x)))) | |
449 | ||
450 | (defun cdddr (x) | |
451 | "Return the `cdr' of the `cdr' of the `cdr' of X." | |
452 | (cdr (cdr (cdr x)))) | |
453 | ||
454 | (defun caaaar (x) | |
455 | "Return the `car' of the `car' of the `car' of the `car' of X." | |
456 | (car (car (car (car x))))) | |
457 | ||
458 | (defun caaadr (x) | |
459 | "Return the `car' of the `car' of the `car' of the `cdr' of X." | |
460 | (car (car (car (cdr x))))) | |
461 | ||
462 | (defun caadar (x) | |
463 | "Return the `car' of the `car' of the `cdr' of the `car' of X." | |
464 | (car (car (cdr (car x))))) | |
465 | ||
466 | (defun caaddr (x) | |
467 | "Return the `car' of the `car' of the `cdr' of the `cdr' of X." | |
468 | (car (car (cdr (cdr x))))) | |
469 | ||
470 | (defun cadaar (x) | |
471 | "Return the `car' of the `cdr' of the `car' of the `car' of X." | |
472 | (car (cdr (car (car x))))) | |
473 | ||
474 | (defun cadadr (x) | |
475 | "Return the `car' of the `cdr' of the `car' of the `cdr' of X." | |
476 | (car (cdr (car (cdr x))))) | |
477 | ||
478 | (defun caddar (x) | |
479 | "Return the `car' of the `cdr' of the `cdr' of the `car' of X." | |
480 | (car (cdr (cdr (car x))))) | |
481 | ||
482 | (defun cadddr (x) | |
483 | "Return the `car' of the `cdr' of the `cdr' of the `cdr' of X." | |
484 | (car (cdr (cdr (cdr x))))) | |
485 | ||
486 | (defun cdaaar (x) | |
487 | "Return the `cdr' of the `car' of the `car' of the `car' of X." | |
488 | (cdr (car (car (car x))))) | |
489 | ||
490 | (defun cdaadr (x) | |
491 | "Return the `cdr' of the `car' of the `car' of the `cdr' of X." | |
492 | (cdr (car (car (cdr x))))) | |
493 | ||
494 | (defun cdadar (x) | |
495 | "Return the `cdr' of the `car' of the `cdr' of the `car' of X." | |
496 | (cdr (car (cdr (car x))))) | |
497 | ||
498 | (defun cdaddr (x) | |
499 | "Return the `cdr' of the `car' of the `cdr' of the `cdr' of X." | |
500 | (cdr (car (cdr (cdr x))))) | |
501 | ||
502 | (defun cddaar (x) | |
503 | "Return the `cdr' of the `cdr' of the `car' of the `car' of X." | |
504 | (cdr (cdr (car (car x))))) | |
505 | ||
506 | (defun cddadr (x) | |
507 | "Return the `cdr' of the `cdr' of the `car' of the `cdr' of X." | |
508 | (cdr (cdr (car (cdr x))))) | |
509 | ||
510 | (defun cdddar (x) | |
511 | "Return the `cdr' of the `cdr' of the `cdr' of the `car' of X." | |
512 | (cdr (cdr (cdr (car x))))) | |
513 | ||
514 | (defun cddddr (x) | |
515 | "Return the `cdr' of the `cdr' of the `cdr' of the `cdr' of X." | |
516 | (cdr (cdr (cdr (cdr x))))) | |
517 | ||
518 | (defun last (x &optional n) | |
519 | "Returns the last link in the list LIST. | |
520 | With optional argument N, returns Nth-to-last link (default 1)." | |
521 | (if n | |
522 | (let ((m 0) (p x)) | |
523 | (while (consp p) (incf m) (pop p)) | |
524 | (if (<= n 0) p | |
525 | (if (< n m) (nthcdr (- m n) x) x))) | |
526 | (while (consp (cdr x)) (pop x)) | |
527 | x)) | |
528 | ||
529 | (defun butlast (x &optional n) | |
530 | "Returns a copy of LIST with the last N elements removed." | |
531 | (if (and n (<= n 0)) x | |
532 | (nbutlast (copy-sequence x) n))) | |
533 | ||
534 | (defun nbutlast (x &optional n) | |
535 | "Modifies LIST to remove the last N elements." | |
536 | (let ((m (length x))) | |
537 | (or n (setq n 1)) | |
538 | (and (< n m) | |
539 | (progn | |
540 | (if (> n 0) (setcdr (nthcdr (- (1- m) n) x) nil)) | |
541 | x)))) | |
542 | ||
543 | (defun list* (arg &rest rest) ; See compiler macro in cl-macs.el | |
544 | "Return a new list with specified args as elements, cons'd to last arg. | |
545 | Thus, `(list* A B C D)' is equivalent to `(nconc (list A B C) D)', or to | |
546 | `(cons A (cons B (cons C D)))'." | |
547 | (cond ((not rest) arg) | |
548 | ((not (cdr rest)) (cons arg (car rest))) | |
549 | (t (let* ((n (length rest)) | |
550 | (copy (copy-sequence rest)) | |
551 | (last (nthcdr (- n 2) copy))) | |
552 | (setcdr last (car (cdr last))) | |
553 | (cons arg copy))))) | |
554 | ||
555 | (defun ldiff (list sublist) | |
556 | "Return a copy of LIST with the tail SUBLIST removed." | |
557 | (let ((res nil)) | |
558 | (while (and (consp list) (not (eq list sublist))) | |
559 | (push (pop list) res)) | |
560 | (nreverse res))) | |
561 | ||
562 | (defun copy-list (list) | |
563 | "Return a copy of a list, which may be a dotted list. | |
564 | The elements of the list are not copied, just the list structure itself." | |
565 | (if (consp list) | |
566 | (let ((res nil)) | |
567 | (while (consp list) (push (pop list) res)) | |
568 | (prog1 (nreverse res) (setcdr res list))) | |
569 | (car list))) | |
570 | ||
571 | (defun cl-maclisp-member (item list) | |
572 | (while (and list (not (equal item (car list)))) (setq list (cdr list))) | |
573 | list) | |
574 | ||
575 | ;;; Define an Emacs 19-compatible `member' for the benefit of Emacs 18 users. | |
576 | (or (and (fboundp 'member) (subrp (symbol-function 'member))) | |
577 | (defalias 'member 'cl-maclisp-member)) | |
578 | ||
579 | (defalias 'cl-member 'memq) ; for compatibility with old CL package | |
580 | (defalias 'cl-floor 'floor*) | |
581 | (defalias 'cl-ceiling 'ceiling*) | |
582 | (defalias 'cl-truncate 'truncate*) | |
583 | (defalias 'cl-round 'round*) | |
584 | (defalias 'cl-mod 'mod*) | |
585 | ||
586 | (defun adjoin (cl-item cl-list &rest cl-keys) ; See compiler macro in cl-macs | |
587 | "Return ITEM consed onto the front of LIST only if it's not already there. | |
588 | Otherwise, return LIST unmodified. | |
589 | Keywords supported: :test :test-not :key" | |
590 | (cond ((or (equal cl-keys '(:test eq)) | |
591 | (and (null cl-keys) (not (numberp cl-item)))) | |
592 | (if (memq cl-item cl-list) cl-list (cons cl-item cl-list))) | |
593 | ((or (equal cl-keys '(:test equal)) (null cl-keys)) | |
594 | (if (member cl-item cl-list) cl-list (cons cl-item cl-list))) | |
595 | (t (apply 'cl-adjoin cl-item cl-list cl-keys)))) | |
596 | ||
597 | (defun subst (cl-new cl-old cl-tree &rest cl-keys) | |
598 | "Substitute NEW for OLD everywhere in TREE (non-destructively). | |
599 | Return a copy of TREE with all elements `eql' to OLD replaced by NEW. | |
600 | Keywords supported: :test :test-not :key" | |
601 | (if (or cl-keys (and (numberp cl-old) (not (integerp cl-old)))) | |
602 | (apply 'sublis (list (cons cl-old cl-new)) cl-tree cl-keys) | |
603 | (cl-do-subst cl-new cl-old cl-tree))) | |
604 | ||
605 | (defun cl-do-subst (cl-new cl-old cl-tree) | |
606 | (cond ((eq cl-tree cl-old) cl-new) | |
607 | ((consp cl-tree) | |
608 | (let ((a (cl-do-subst cl-new cl-old (car cl-tree))) | |
609 | (d (cl-do-subst cl-new cl-old (cdr cl-tree)))) | |
610 | (if (and (eq a (car cl-tree)) (eq d (cdr cl-tree))) | |
611 | cl-tree (cons a d)))) | |
612 | (t cl-tree))) | |
613 | ||
614 | (defun acons (a b c) (cons (cons a b) c)) | |
615 | (defun pairlis (a b &optional c) (nconc (mapcar* 'cons a b) c)) | |
616 | ||
617 | ||
618 | ;;; Miscellaneous. | |
619 | ||
620 | (put 'cl-assertion-failed 'error-conditions '(error)) | |
621 | (put 'cl-assertion-failed 'error-message "Assertion failed") | |
622 | ||
623 | ;;; This is defined in Emacs 19; define it here for Emacs 18 users. | |
624 | (defun cl-add-hook (hook func &optional append) | |
625 | "Add to hook variable HOOK the function FUNC. | |
626 | FUNC is not added if it already appears on the list stored in HOOK." | |
627 | (let ((old (and (boundp hook) (symbol-value hook)))) | |
628 | (and (listp old) (not (eq (car old) 'lambda)) | |
629 | (setq old (list old))) | |
630 | (and (not (member func old)) | |
631 | (set hook (if append (nconc old (list func)) (cons func old)))))) | |
632 | (or (fboundp 'add-hook) (defalias 'add-hook 'cl-add-hook)) | |
633 | ||
634 | ||
635 | ;;; Autoload the other portions of the package. | |
636 | (mapcar (function | |
637 | (lambda (set) | |
638 | (mapcar (function | |
639 | (lambda (func) | |
640 | (autoload func (car set) nil nil (nth 1 set)))) | |
641 | (cddr set)))) | |
642 | '(("cl-extra" nil | |
643 | coerce equalp cl-map-keymap maplist mapc mapl mapcan mapcon | |
644 | cl-map-keymap cl-map-keymap-recursively cl-map-intervals | |
645 | cl-map-overlays cl-set-frame-visible-p cl-float-limits | |
646 | gcd lcm isqrt expt floor* ceiling* truncate* round* | |
647 | mod* rem* signum random* make-random-state random-state-p | |
648 | subseq concatenate cl-mapcar-many map some every notany | |
649 | notevery revappend nreconc list-length tailp copy-tree get* getf | |
650 | cl-set-getf cl-do-remf remprop make-hash-table cl-hash-lookup | |
651 | gethash cl-puthash remhash clrhash maphash hash-table-p | |
652 | hash-table-count cl-progv-before cl-prettyexpand | |
653 | cl-macroexpand-all) | |
654 | ("cl-seq" nil | |
655 | reduce fill replace remq remove remove* remove-if remove-if-not | |
656 | delete delete* delete-if delete-if-not remove-duplicates | |
657 | delete-duplicates substitute substitute-if substitute-if-not | |
658 | nsubstitute nsubstitute-if nsubstitute-if-not find find-if | |
659 | find-if-not position position-if position-if-not count count-if | |
660 | count-if-not mismatch search sort* stable-sort merge member* | |
661 | member-if member-if-not cl-adjoin assoc* assoc-if assoc-if-not | |
662 | rassoc* rassoc rassoc-if rassoc-if-not union nunion intersection | |
663 | nintersection set-difference nset-difference set-exclusive-or | |
664 | nset-exclusive-or subsetp subst-if subst-if-not nsubst nsubst-if | |
665 | nsubst-if-not sublis nsublis tree-equal) | |
666 | ("cl-macs" nil | |
667 | gensym gentemp typep cl-do-pop get-setf-method | |
668 | cl-struct-setf-expander compiler-macroexpand cl-compile-time-init) | |
669 | ("cl-macs" t | |
670 | defun* defmacro* function* destructuring-bind eval-when | |
671 | eval-when-compile load-time-value case ecase typecase etypecase | |
672 | block return return-from loop do do* dolist dotimes do-symbols | |
673 | do-all-symbols psetq progv flet labels macrolet symbol-macrolet | |
674 | lexical-let lexical-let* multiple-value-bind multiple-value-setq | |
675 | locally the declare define-setf-method defsetf define-modify-macro | |
676 | setf psetf remf shiftf rotatef letf letf* callf callf2 defstruct | |
677 | check-type assert ignore-errors define-compiler-macro))) | |
678 | ||
679 | ;;; Define data for indentation and edebug. | |
680 | (mapcar (function | |
681 | (lambda (entry) | |
682 | (mapcar (function | |
683 | (lambda (func) | |
684 | (put func 'lisp-indent-function (nth 1 entry)) | |
685 | (put func 'lisp-indent-hook (nth 1 entry)) | |
686 | (or (get func 'edebug-form-spec) | |
687 | (put func 'edebug-form-spec (nth 2 entry))))) | |
688 | (car entry)))) | |
689 | '(((defun* defmacro*) 2) | |
690 | ((function*) nil | |
691 | (&or symbolp ([&optional 'macro] 'lambda (&rest sexp) &rest form))) | |
692 | ((eval-when) 1 (sexp &rest form)) | |
693 | ((when unless) 1 (&rest form)) | |
694 | ((declare) nil (&rest sexp)) | |
695 | ((the) 1 (sexp &rest form)) | |
696 | ((case ecase typecase etypecase) 1 (form &rest (sexp &rest form))) | |
697 | ((block return-from) 1 (sexp &rest form)) | |
698 | ((return) nil (&optional form)) | |
699 | ((do do*) 2 ((&rest &or symbolp (symbolp &optional form form)) | |
700 | (form &rest form) | |
701 | &rest form)) | |
702 | ((dolist dotimes) 1 ((symbolp form &rest form) &rest form)) | |
703 | ((do-symbols) 1 ((symbolp form &optional form form) &rest form)) | |
704 | ((do-all-symbols) 1 ((symbolp form &optional form) &rest form)) | |
705 | ((psetq setf psetf) nil edebug-setq-form) | |
706 | ((progv) 2 (&rest form)) | |
707 | ((flet labels macrolet) 1 | |
708 | ((&rest (sexp sexp &rest form)) &rest form)) | |
709 | ((symbol-macrolet lexical-let lexical-let*) 1 | |
710 | ((&rest &or symbolp (symbolp form)) &rest form)) | |
711 | ((multiple-value-bind) 2 ((&rest symbolp) &rest form)) | |
712 | ((multiple-value-setq) 1 ((&rest symbolp) &rest form)) | |
713 | ((incf decf remf pop push pushnew shiftf rotatef) nil (&rest form)) | |
714 | ((letf letf*) 1 ((&rest (&rest form)) &rest form)) | |
715 | ((callf destructuring-bind) 2 (sexp form &rest form)) | |
716 | ((callf2) 3 (sexp form form &rest form)) | |
717 | ((loop) nil (&rest &or symbolp form)) | |
718 | ((ignore-errors) 0 (&rest form)))) | |
719 | ||
720 | ||
721 | ;;; This goes here so that cl-macs can find it if it loads right now. | |
722 | (provide 'cl-19) ; usage: (require 'cl-19 "cl") | |
723 | ||
724 | ||
725 | ;;; Things to do after byte-compiler is loaded. | |
726 | ;;; As a side effect, we cause cl-macs to be loaded when compiling, so | |
727 | ;;; that the compiler-macros defined there will be present. | |
728 | ||
729 | (defvar cl-hacked-flag nil) | |
730 | (defun cl-hack-byte-compiler () | |
731 | (if (and (not cl-hacked-flag) (fboundp 'byte-compile-file-form)) | |
732 | (progn | |
733 | (cl-compile-time-init) ; in cl-macs.el | |
734 | (setq cl-hacked-flag t)))) | |
735 | ||
736 | ;;; Try it now in case the compiler has already been loaded. | |
737 | (cl-hack-byte-compiler) | |
738 | ||
739 | ;;; Also make a hook in case compiler is loaded after this file. | |
740 | ;;; The compiler doesn't call any hooks when it loads or runs, but | |
741 | ;;; we can take advantage of the fact that emacs-lisp-mode will be | |
742 | ;;; called when the compiler reads in the file to be compiled. | |
743 | ;;; BUG: If the first compilation is `byte-compile' rather than | |
744 | ;;; `byte-compile-file', we lose. Oh, well. | |
745 | (add-hook 'emacs-lisp-mode-hook 'cl-hack-byte-compiler) | |
746 | ||
747 | ||
748 | ;;; The following ensures that packages which expect the old-style cl.el | |
749 | ;;; will be happy with this one. | |
750 | ||
751 | (provide 'cl) | |
752 | ||
753 | (provide 'mini-cl) ; for Epoch | |
754 | ||
755 | (run-hooks 'cl-load-hook) | |
756 | ||
757 | ;;; cl.el ends here |