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