|
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)
|
|
3343
|
135 "Increment PLACE by X (1 by default).
|
|
428
|
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)
|
|
3343
|
145 "Decrement PLACE by X (1 by default).
|
|
428
|
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)
|
|
3343
|
153 "Remove and return the head of the list stored in PLACE.
|
|
428
|
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
|
|
3343
|
161 (defmacro push (newelt listname)
|
|
|
162 "Add NEWELT to the list stored in LISTNAME.
|
|
|
163 Analogous to (setf LISTNAME (cons NEWELT LISTNAME)), though more careful about
|
|
|
164 evaluating each argument only once and in the right order. LISTNAME may
|
|
428
|
165 be a symbol, or any generalized variable allowed by `setf'."
|
|
3343
|
166 (if (symbolp listname) `(setq ,listname (cons ,newelt ,listname))
|
|
|
167 (list 'callf2 'cons newelt listname)))
|
|
428
|
168
|
|
3343
|
169 (defmacro pushnew (newelt listname &rest keys)
|
|
|
170 "Add NEWELT to the list stored in LISTNAME, unless it's already there.
|
|
|
171 Like (push NEWELT LISTNAME), except that the list is unmodified if NEWELT is
|
|
|
172 `eql' to an element already on the list.
|
|
428
|
173 Keywords supported: :test :test-not :key"
|
|
3343
|
174 (if (symbolp listname) (list 'setq listname
|
|
|
175 (list* 'adjoin newelt listname keys))
|
|
|
176 (list* 'callf2 'adjoin newelt listname keys)))
|
|
428
|
177
|
|
|
178 (defun cl-set-elt (seq n val)
|
|
|
179 (if (listp seq) (setcar (nthcdr n seq) val) (aset seq n val)))
|
|
|
180
|
|
|
181 (defun cl-set-nthcdr (n list x)
|
|
|
182 (if (<= n 0) x (setcdr (nthcdr (1- n) list) x) list))
|
|
|
183
|
|
|
184 (defun cl-set-buffer-substring (start end val)
|
|
|
185 (save-excursion (delete-region start end)
|
|
|
186 (goto-char start)
|
|
|
187 (insert val)
|
|
|
188 val))
|
|
|
189
|
|
|
190 (defun cl-set-substring (str start end val)
|
|
|
191 (if end (if (< end 0) (incf end (length str)))
|
|
|
192 (setq end (length str)))
|
|
2136
|
193 (if (< start 0) (incf start (length str)))
|
|
428
|
194 (concat (and (> start 0) (substring str 0 start))
|
|
|
195 val
|
|
|
196 (and (< end (length str)) (substring str end))))
|
|
|
197
|
|
|
198
|
|
|
199 ;;; Control structures.
|
|
|
200
|
|
|
201 ;; The macros `when' and `unless' are so useful that we want them to
|
|
|
202 ;; ALWAYS be available. So they've been moved from cl.el to eval.c.
|
|
|
203 ;; Note: FSF Emacs moved them to subr.el in FSF 20.
|
|
|
204
|
|
2153
|
205 (defalias 'cl-map-extents 'map-extents)
|
|
428
|
206
|
|
|
207
|
|
|
208 ;;; Blocks and exits.
|
|
|
209
|
|
|
210 (defalias 'cl-block-wrapper 'identity)
|
|
|
211 (defalias 'cl-block-throw 'throw)
|
|
|
212
|
|
|
213
|
|
|
214 ;;; Multiple values. True multiple values are not supported, or even
|
|
|
215 ;;; simulated. Instead, multiple-value-bind and friends simply expect
|
|
|
216 ;;; the target form to return the values as a list.
|
|
|
217
|
|
2153
|
218 (defsubst values (&rest values)
|
|
|
219 "Return multiple values, Common Lisp style.
|
|
|
220 The arguments of `values' are the values
|
|
|
221 that the containing function should return."
|
|
|
222 values)
|
|
|
223
|
|
|
224 (defsubst values-list (list)
|
|
|
225 "Return multiple values, Common Lisp style, taken from a list.
|
|
|
226 LIST specifies the list of values
|
|
|
227 that the containing function should return."
|
|
|
228 list)
|
|
|
229
|
|
|
230 (defsubst multiple-value-list (expression)
|
|
|
231 "Return a list of the multiple values produced by EXPRESSION.
|
|
|
232 This handles multiple values in Common Lisp style, but it does not
|
|
|
233 work right when EXPRESSION calls an ordinary Emacs Lisp function
|
|
|
234 that returns just one value."
|
|
|
235 expression)
|
|
|
236
|
|
|
237 (defsubst multiple-value-apply (function expression)
|
|
|
238 "Evaluate EXPRESSION to get multiple values and apply FUNCTION to them.
|
|
|
239 This handles multiple values in Common Lisp style, but it does not work
|
|
|
240 right when EXPRESSION calls an ordinary Emacs Lisp function that returns just
|
|
|
241 one value."
|
|
|
242 (apply function expression))
|
|
|
243
|
|
428
|
244 (defalias 'multiple-value-call 'apply) ; only works for one arg
|
|
|
245
|
|
2153
|
246 (defsubst nth-value (n expression)
|
|
|
247 "Evaluate EXPRESSION to get multiple values and return the Nth one.
|
|
|
248 This handles multiple values in Common Lisp style, but it does not work
|
|
|
249 right when EXPRESSION calls an ordinary Emacs Lisp function that returns just
|
|
|
250 one value."
|
|
|
251 (nth n expression))
|
|
428
|
252
|
|
|
253 ;;; Macros.
|
|
|
254
|
|
|
255 (defvar cl-macro-environment nil)
|
|
|
256 ;; XEmacs: we renamed the internal function to macroexpand-internal
|
|
|
257 ;; to avoid doc-file problems.
|
|
|
258 (defvar cl-old-macroexpand (prog1 (symbol-function 'macroexpand-internal)
|
|
|
259 (defalias 'macroexpand 'cl-macroexpand)))
|
|
|
260
|
|
|
261 (defun cl-macroexpand (cl-macro &optional cl-env)
|
|
|
262 "Return result of expanding macros at top level of FORM.
|
|
|
263 If FORM is not a macro call, it is returned unchanged.
|
|
|
264 Otherwise, the macro is expanded and the expansion is considered
|
|
|
265 in place of FORM. When a non-macro-call results, it is returned.
|
|
|
266
|
|
442
|
267 The second optional arg ENVIRONMENT specifies an environment of macro
|
|
428
|
268 definitions to shadow the loaded ones for use in file byte-compilation."
|
|
|
269 (let ((cl-macro-environment cl-env))
|
|
|
270 (while (progn (setq cl-macro (funcall cl-old-macroexpand cl-macro cl-env))
|
|
|
271 (and (symbolp cl-macro)
|
|
|
272 (cdr (assq (symbol-name cl-macro) cl-env))))
|
|
|
273 (setq cl-macro (cadr (assq (symbol-name cl-macro) cl-env))))
|
|
|
274 cl-macro))
|
|
|
275
|
|
|
276
|
|
|
277 ;;; Declarations.
|
|
|
278
|
|
|
279 (defvar cl-compiling-file nil)
|
|
|
280 (defun cl-compiling-file ()
|
|
|
281 (or cl-compiling-file
|
|
|
282 ;; XEmacs change
|
|
|
283 ; (and (boundp 'outbuffer) (bufferp (symbol-value 'outbuffer))
|
|
|
284 ; (equal (buffer-name (symbol-value 'outbuffer))
|
|
|
285 ; " *Compiler Output*"))
|
|
|
286 (and (boundp 'byte-compile-outbuffer)
|
|
|
287 (bufferp (symbol-value 'byte-compile-outbuffer))
|
|
|
288 (equal (buffer-name (symbol-value 'byte-compile-outbuffer))
|
|
|
289 " *Compiler Output*"))
|
|
|
290 ))
|
|
|
291
|
|
|
292 (defvar cl-proclaims-deferred nil)
|
|
|
293
|
|
|
294 (defun proclaim (spec)
|
|
|
295 (if (fboundp 'cl-do-proclaim) (cl-do-proclaim spec t)
|
|
|
296 (push spec cl-proclaims-deferred))
|
|
|
297 nil)
|
|
|
298
|
|
|
299 (defmacro declaim (&rest specs)
|
|
|
300 (let ((body (mapcar (function (lambda (x) (list 'proclaim (list 'quote x))))
|
|
|
301 specs)))
|
|
|
302 (if (cl-compiling-file) (list* 'eval-when '(compile load eval) body)
|
|
|
303 (cons 'progn body)))) ; avoid loading cl-macs.el for eval-when
|
|
|
304
|
|
|
305
|
|
|
306 ;;; Symbols.
|
|
|
307
|
|
|
308 (defun cl-random-time ()
|
|
|
309 (let* ((time (copy-sequence (current-time-string))) (i (length time)) (v 0))
|
|
|
310 (while (>= (decf i) 0) (setq v (+ (* v 3) (aref time i))))
|
|
2509
|
311 (if-fboundp 'coerce-number
|
|
|
312 (coerce-number v 'fixnum)
|
|
1983
|
313 v)))
|
|
428
|
314
|
|
|
315 (defvar *gensym-counter* (* (logand (cl-random-time) 1023) 100))
|
|
|
316
|
|
2153
|
317 ;; XEmacs change: gensym and gentemp moved here from cl-macs.el
|
|
442
|
318 (defun gensym (&optional arg)
|
|
|
319 "Generate a new uninterned symbol.
|
|
2071
|
320 The name is made by appending a number to a prefix. If ARG is a string, it
|
|
|
321 is the prefix, otherwise the prefix defaults to \"G\". If ARG is an integer,
|
|
|
322 the internal counter is reset to that number before creating the name.
|
|
|
323 There is no way to specify both using this function."
|
|
442
|
324 (let ((prefix (if (stringp arg) arg "G"))
|
|
|
325 (num (if (integerp arg) arg
|
|
|
326 (prog1 *gensym-counter*
|
|
|
327 (setq *gensym-counter* (1+ *gensym-counter*))))))
|
|
|
328 (make-symbol (format "%s%d" prefix num))))
|
|
|
329
|
|
|
330 (defun gentemp (&optional arg)
|
|
|
331 "Generate a new interned symbol with a unique name.
|
|
2071
|
332 The name is made by appending a number to ARG, default \"G\".
|
|
|
333 If ARG is not a string, it is ignored."
|
|
442
|
334 (let ((prefix (if (stringp arg) arg "G"))
|
|
|
335 name)
|
|
|
336 (while (intern-soft (setq name (format "%s%d" prefix *gensym-counter*)))
|
|
|
337 (setq *gensym-counter* (1+ *gensym-counter*)))
|
|
|
338 (intern name)))
|
|
428
|
339
|
|
|
340 ;;; Numbers.
|
|
|
341
|
|
2153
|
342 ;; XEmacs change: use floatp, which is right even in the presence of ratios
|
|
|
343 ;; and bigfloats
|
|
446
|
344 (defun floatp-safe (object)
|
|
|
345 "Return t if OBJECT is a floating point number."
|
|
|
346 (floatp object))
|
|
428
|
347
|
|
446
|
348 (defun plusp (number)
|
|
428
|
349 "Return t if NUMBER is positive."
|
|
446
|
350 (> number 0))
|
|
|
351
|
|
|
352 (defun minusp (number)
|
|
|
353 "Return t if NUMBER is negative."
|
|
|
354 (< number 0))
|
|
428
|
355
|
|
446
|
356 (defun oddp (integer)
|
|
428
|
357 "Return t if INTEGER is odd."
|
|
446
|
358 (eq (logand integer 1) 1))
|
|
428
|
359
|
|
446
|
360 (defun evenp (integer)
|
|
428
|
361 "Return t if INTEGER is even."
|
|
446
|
362 (eq (logand integer 1) 0))
|
|
428
|
363
|
|
2153
|
364 ;; XEmacs addition
|
|
|
365 (defalias 'cl-abs 'abs)
|
|
428
|
366
|
|
|
367 (defvar *random-state* (vector 'cl-random-state-tag -1 30 (cl-random-time)))
|
|
|
368
|
|
2153
|
369 ;; XEmacs: These constants are defined in C when 'number-types is provided.
|
|
|
370 ;; They are always defined in C on Emacs. Maybe we should, too.
|
|
1983
|
371 (unless (featurep 'number-types)
|
|
428
|
372 ;;; We use `eval' in case VALBITS differs from compile-time to load-time.
|
|
1983
|
373 (defconst most-positive-fixnum (eval '(lsh -1 -1))
|
|
|
374 "The integer closest in value to positive infinity.")
|
|
|
375 (defconst most-negative-fixnum (eval '(- -1 (lsh -1 -1)))
|
|
|
376 "The integer closest in value to negative infinity."))
|
|
428
|
377
|
|
|
378 ;;; The following are set by code in cl-extra.el
|
|
|
379 (defconst most-positive-float nil
|
|
|
380 "The float closest in value to positive infinity.")
|
|
|
381 (defconst most-negative-float nil
|
|
|
382 "The float closest in value to negative infinity.")
|
|
|
383 (defconst least-positive-float nil
|
|
|
384 "The positive float closest in value to 0.")
|
|
|
385 (defconst least-negative-float nil
|
|
|
386 "The negative float closest in value to 0.")
|
|
|
387 (defconst least-positive-normalized-float nil)
|
|
|
388 (defconst least-negative-normalized-float nil)
|
|
|
389 (defconst float-epsilon nil)
|
|
|
390 (defconst float-negative-epsilon nil)
|
|
|
391
|
|
|
392
|
|
|
393 ;;; Sequence functions.
|
|
|
394
|
|
|
395 (defalias 'copy-seq 'copy-sequence)
|
|
|
396
|
|
|
397 (defun mapcar* (cl-func cl-x &rest cl-rest)
|
|
|
398 "Apply FUNCTION to each element of SEQ, and make a list of the results.
|
|
|
399 If there are several SEQs, FUNCTION is called with that many arguments,
|
|
|
400 and mapping stops as soon as the shortest list runs out. With just one
|
|
|
401 SEQ, this is like `mapcar'. With several, it is like the Common Lisp
|
|
|
402 `mapcar' function extended to arbitrary sequence types."
|
|
|
403 (if cl-rest
|
|
|
404 (if (or (cdr cl-rest) (nlistp cl-x) (nlistp (car cl-rest)))
|
|
|
405 (cl-mapcar-many cl-func (cons cl-x cl-rest))
|
|
|
406 (let ((cl-res nil) (cl-y (car cl-rest)))
|
|
|
407 (while (and cl-x cl-y)
|
|
|
408 (push (funcall cl-func (pop cl-x) (pop cl-y)) cl-res))
|
|
|
409 (nreverse cl-res)))
|
|
|
410 (mapcar cl-func cl-x)))
|
|
|
411
|
|
2153
|
412 (defalias 'svref 'aref)
|
|
428
|
413
|
|
|
414 ;;; List functions.
|
|
|
415
|
|
|
416 ;; These functions are made known to the byte-compiler by cl-macs.el
|
|
|
417 ;; and turned into efficient car and cdr bytecodes.
|
|
|
418
|
|
|
419 (defalias 'first 'car)
|
|
|
420 (defalias 'rest 'cdr)
|
|
|
421 (defalias 'endp 'null)
|
|
|
422
|
|
2153
|
423 ;; XEmacs change: make it a real function
|
|
428
|
424 (defun second (x)
|
|
|
425 "Return the second element of the list LIST."
|
|
|
426 (car (cdr x)))
|
|
|
427
|
|
|
428 (defun third (x)
|
|
2153
|
429 "Return the third element of the list X."
|
|
428
|
430 (car (cdr (cdr x))))
|
|
|
431
|
|
|
432 (defun fourth (x)
|
|
2153
|
433 "Return the fourth element of the list X."
|
|
428
|
434 (nth 3 x))
|
|
|
435
|
|
|
436 (defun fifth (x)
|
|
2153
|
437 "Return the fifth element of the list X."
|
|
428
|
438 (nth 4 x))
|
|
|
439
|
|
|
440 (defun sixth (x)
|
|
2153
|
441 "Return the sixth element of the list X."
|
|
428
|
442 (nth 5 x))
|
|
|
443
|
|
|
444 (defun seventh (x)
|
|
2153
|
445 "Return the seventh element of the list X."
|
|
428
|
446 (nth 6 x))
|
|
|
447
|
|
|
448 (defun eighth (x)
|
|
2153
|
449 "Return the eighth element of the list X."
|
|
428
|
450 (nth 7 x))
|
|
|
451
|
|
|
452 (defun ninth (x)
|
|
2153
|
453 "Return the ninth element of the list X."
|
|
428
|
454 (nth 8 x))
|
|
|
455
|
|
|
456 (defun tenth (x)
|
|
2153
|
457 "Return the tenth element of the list X."
|
|
428
|
458 (nth 9 x))
|
|
|
459
|
|
2153
|
460 ;; XEmacs change: Emacs defines caar, cadr, cdar, and cddr in subr.el.
|
|
428
|
461 (defun caar (x)
|
|
|
462 "Return the `car' of the `car' of X."
|
|
|
463 (car (car x)))
|
|
|
464
|
|
|
465 (defun cadr (x)
|
|
|
466 "Return the `car' of the `cdr' of X."
|
|
|
467 (car (cdr x)))
|
|
|
468
|
|
|
469 (defun cdar (x)
|
|
|
470 "Return the `cdr' of the `car' of X."
|
|
|
471 (cdr (car x)))
|
|
|
472
|
|
|
473 (defun cddr (x)
|
|
|
474 "Return the `cdr' of the `cdr' of X."
|
|
|
475 (cdr (cdr x)))
|
|
|
476
|
|
|
477 (defun caaar (x)
|
|
|
478 "Return the `car' of the `car' of the `car' of X."
|
|
|
479 (car (car (car x))))
|
|
|
480
|
|
|
481 (defun caadr (x)
|
|
|
482 "Return the `car' of the `car' of the `cdr' of X."
|
|
|
483 (car (car (cdr x))))
|
|
|
484
|
|
|
485 (defun cadar (x)
|
|
|
486 "Return the `car' of the `cdr' of the `car' of X."
|
|
|
487 (car (cdr (car x))))
|
|
|
488
|
|
|
489 (defun caddr (x)
|
|
|
490 "Return the `car' of the `cdr' of the `cdr' of X."
|
|
|
491 (car (cdr (cdr x))))
|
|
|
492
|
|
|
493 (defun cdaar (x)
|
|
|
494 "Return the `cdr' of the `car' of the `car' of X."
|
|
|
495 (cdr (car (car x))))
|
|
|
496
|
|
|
497 (defun cdadr (x)
|
|
|
498 "Return the `cdr' of the `car' of the `cdr' of X."
|
|
|
499 (cdr (car (cdr x))))
|
|
|
500
|
|
|
501 (defun cddar (x)
|
|
|
502 "Return the `cdr' of the `cdr' of the `car' of X."
|
|
|
503 (cdr (cdr (car x))))
|
|
|
504
|
|
|
505 (defun cdddr (x)
|
|
|
506 "Return the `cdr' of the `cdr' of the `cdr' of X."
|
|
|
507 (cdr (cdr (cdr x))))
|
|
|
508
|
|
|
509 (defun caaaar (x)
|
|
|
510 "Return the `car' of the `car' of the `car' of the `car' of X."
|
|
|
511 (car (car (car (car x)))))
|
|
|
512
|
|
|
513 (defun caaadr (x)
|
|
|
514 "Return the `car' of the `car' of the `car' of the `cdr' of X."
|
|
|
515 (car (car (car (cdr x)))))
|
|
|
516
|
|
|
517 (defun caadar (x)
|
|
|
518 "Return the `car' of the `car' of the `cdr' of the `car' of X."
|
|
|
519 (car (car (cdr (car x)))))
|
|
|
520
|
|
|
521 (defun caaddr (x)
|
|
|
522 "Return the `car' of the `car' of the `cdr' of the `cdr' of X."
|
|
|
523 (car (car (cdr (cdr x)))))
|
|
|
524
|
|
|
525 (defun cadaar (x)
|
|
|
526 "Return the `car' of the `cdr' of the `car' of the `car' of X."
|
|
|
527 (car (cdr (car (car x)))))
|
|
|
528
|
|
|
529 (defun cadadr (x)
|
|
|
530 "Return the `car' of the `cdr' of the `car' of the `cdr' of X."
|
|
|
531 (car (cdr (car (cdr x)))))
|
|
|
532
|
|
|
533 (defun caddar (x)
|
|
|
534 "Return the `car' of the `cdr' of the `cdr' of the `car' of X."
|
|
|
535 (car (cdr (cdr (car x)))))
|
|
|
536
|
|
|
537 (defun cadddr (x)
|
|
|
538 "Return the `car' of the `cdr' of the `cdr' of the `cdr' of X."
|
|
|
539 (car (cdr (cdr (cdr x)))))
|
|
|
540
|
|
|
541 (defun cdaaar (x)
|
|
|
542 "Return the `cdr' of the `car' of the `car' of the `car' of X."
|
|
|
543 (cdr (car (car (car x)))))
|
|
|
544
|
|
|
545 (defun cdaadr (x)
|
|
|
546 "Return the `cdr' of the `car' of the `car' of the `cdr' of X."
|
|
|
547 (cdr (car (car (cdr x)))))
|
|
|
548
|
|
|
549 (defun cdadar (x)
|
|
|
550 "Return the `cdr' of the `car' of the `cdr' of the `car' of X."
|
|
|
551 (cdr (car (cdr (car x)))))
|
|
|
552
|
|
|
553 (defun cdaddr (x)
|
|
|
554 "Return the `cdr' of the `car' of the `cdr' of the `cdr' of X."
|
|
|
555 (cdr (car (cdr (cdr x)))))
|
|
|
556
|
|
|
557 (defun cddaar (x)
|
|
|
558 "Return the `cdr' of the `cdr' of the `car' of the `car' of X."
|
|
|
559 (cdr (cdr (car (car x)))))
|
|
|
560
|
|
|
561 (defun cddadr (x)
|
|
|
562 "Return the `cdr' of the `cdr' of the `car' of the `cdr' of X."
|
|
|
563 (cdr (cdr (car (cdr x)))))
|
|
|
564
|
|
|
565 (defun cdddar (x)
|
|
|
566 "Return the `cdr' of the `cdr' of the `cdr' of the `car' of X."
|
|
|
567 (cdr (cdr (cdr (car x)))))
|
|
|
568
|
|
|
569 (defun cddddr (x)
|
|
|
570 "Return the `cdr' of the `cdr' of the `cdr' of the `cdr' of X."
|
|
|
571 (cdr (cdr (cdr (cdr x)))))
|
|
|
572
|
|
|
573 ;;; `last' is implemented as a C primitive, as of 1998-11
|
|
2153
|
574 ;;(defun last* (x &optional n)
|
|
|
575 ;; "Returns the last link in the list LIST.
|
|
|
576 ;;With optional argument N, returns Nth-to-last link (default 1)."
|
|
|
577 ;; (if n
|
|
|
578 ;; (let ((m 0) (p x))
|
|
|
579 ;; (while (consp p) (incf m) (pop p))
|
|
|
580 ;; (if (<= n 0) p
|
|
|
581 ;; (if (< n m) (nthcdr (- m n) x) x)))
|
|
|
582 ;; (while (consp (cdr x)) (pop x))
|
|
|
583 ;; x))
|
|
428
|
584
|
|
|
585 (defun list* (arg &rest rest) ; See compiler macro in cl-macs.el
|
|
|
586 "Return a new list with specified args as elements, cons'd to last arg.
|
|
|
587 Thus, `(list* A B C D)' is equivalent to `(nconc (list A B C) D)', or to
|
|
|
588 `(cons A (cons B (cons C D)))'."
|
|
|
589 (cond ((not rest) arg)
|
|
|
590 ((not (cdr rest)) (cons arg (car rest)))
|
|
|
591 (t (let* ((n (length rest))
|
|
|
592 (copy (copy-sequence rest))
|
|
|
593 (last (nthcdr (- n 2) copy)))
|
|
|
594 (setcdr last (car (cdr last)))
|
|
|
595 (cons arg copy)))))
|
|
|
596
|
|
|
597 (defun ldiff (list sublist)
|
|
|
598 "Return a copy of LIST with the tail SUBLIST removed."
|
|
|
599 (let ((res nil))
|
|
|
600 (while (and (consp list) (not (eq list sublist)))
|
|
|
601 (push (pop list) res))
|
|
|
602 (nreverse res)))
|
|
|
603
|
|
|
604 ;;; `copy-list' is implemented as a C primitive, as of 1998-11
|
|
|
605
|
|
|
606 ;(defun copy-list (list)
|
|
|
607 ; "Return a copy of a list, which may be a dotted list.
|
|
|
608 ;The elements of the list are not copied, just the list structure itself."
|
|
|
609 ; (if (consp list)
|
|
|
610 ; (let ((res nil))
|
|
|
611 ; (while (consp list) (push (pop list) res))
|
|
|
612 ; (prog1 (nreverse res) (setcdr res list)))
|
|
|
613 ; (car list)))
|
|
|
614
|
|
|
615 (defun cl-maclisp-member (item list)
|
|
|
616 (while (and list (not (equal item (car list)))) (setq list (cdr list)))
|
|
|
617 list)
|
|
|
618
|
|
|
619 (defalias 'cl-member 'memq) ; for compatibility with old CL package
|
|
|
620 (defalias 'cl-floor 'floor*)
|
|
|
621 (defalias 'cl-ceiling 'ceiling*)
|
|
|
622 (defalias 'cl-truncate 'truncate*)
|
|
|
623 (defalias 'cl-round 'round*)
|
|
|
624 (defalias 'cl-mod 'mod*)
|
|
|
625
|
|
|
626 (defun adjoin (cl-item cl-list &rest cl-keys) ; See compiler macro in cl-macs
|
|
|
627 "Return ITEM consed onto the front of LIST only if it's not already there.
|
|
|
628 Otherwise, return LIST unmodified.
|
|
|
629 Keywords supported: :test :test-not :key"
|
|
|
630 (cond ((or (equal cl-keys '(:test eq))
|
|
|
631 (and (null cl-keys) (not (numberp cl-item))))
|
|
|
632 (if (memq cl-item cl-list) cl-list (cons cl-item cl-list)))
|
|
|
633 ((or (equal cl-keys '(:test equal)) (null cl-keys))
|
|
|
634 (if (member cl-item cl-list) cl-list (cons cl-item cl-list)))
|
|
|
635 (t (apply 'cl-adjoin cl-item cl-list cl-keys))))
|
|
|
636
|
|
|
637 (defun subst (cl-new cl-old cl-tree &rest cl-keys)
|
|
|
638 "Substitute NEW for OLD everywhere in TREE (non-destructively).
|
|
|
639 Return a copy of TREE with all elements `eql' to OLD replaced by NEW.
|
|
|
640 Keywords supported: :test :test-not :key"
|
|
|
641 (if (or cl-keys (and (numberp cl-old) (not (integerp cl-old))))
|
|
|
642 (apply 'sublis (list (cons cl-old cl-new)) cl-tree cl-keys)
|
|
|
643 (cl-do-subst cl-new cl-old cl-tree)))
|
|
|
644
|
|
|
645 (defun cl-do-subst (cl-new cl-old cl-tree)
|
|
|
646 (cond ((eq cl-tree cl-old) cl-new)
|
|
|
647 ((consp cl-tree)
|
|
|
648 (let ((a (cl-do-subst cl-new cl-old (car cl-tree)))
|
|
|
649 (d (cl-do-subst cl-new cl-old (cdr cl-tree))))
|
|
|
650 (if (and (eq a (car cl-tree)) (eq d (cdr cl-tree)))
|
|
|
651 cl-tree (cons a d))))
|
|
|
652 (t cl-tree)))
|
|
|
653
|
|
|
654 (defun acons (a b c)
|
|
|
655 "Return a new alist created by adding (KEY . VALUE) to ALIST."
|
|
|
656 (cons (cons a b) c))
|
|
|
657
|
|
|
658 (defun pairlis (a b &optional c) (nconc (mapcar* 'cons a b) c))
|
|
|
659
|
|
|
660
|
|
|
661 ;;; Miscellaneous.
|
|
|
662
|
|
|
663 ;; XEmacs change
|
|
|
664 (define-error 'cl-assertion-failed "Assertion failed")
|
|
|
665
|
|
2153
|
666 ;; XEmacs change: omit the autoload rules; we handle those a different way
|
|
428
|
667
|
|
|
668 ;;; Define data for indentation and edebug.
|
|
|
669 (mapcar
|
|
|
670 #'(lambda (entry)
|
|
|
671 (mapcar
|
|
|
672 #'(lambda (func)
|
|
|
673 (put func 'lisp-indent-function (nth 1 entry))
|
|
|
674 (put func 'lisp-indent-hook (nth 1 entry))
|
|
|
675 (or (get func 'edebug-form-spec)
|
|
|
676 (put func 'edebug-form-spec (nth 2 entry))))
|
|
|
677 (car entry)))
|
|
|
678 '(((defun* defmacro*) defun)
|
|
|
679 ((function*) nil
|
|
|
680 (&or symbolp ([&optional 'macro] 'lambda (&rest sexp) &rest form)))
|
|
|
681 ((eval-when) 1 (sexp &rest form))
|
|
|
682 ((when unless) 1 (&rest form))
|
|
|
683 ((declare) nil (&rest sexp))
|
|
|
684 ((the) 1 (sexp &rest form))
|
|
|
685 ((case ecase typecase etypecase) 1 (form &rest (sexp &rest form)))
|
|
|
686 ((block return-from) 1 (sexp &rest form))
|
|
|
687 ((return) nil (&optional form))
|
|
|
688 ((do do*) 2 ((&rest &or symbolp (symbolp &optional form form))
|
|
|
689 (form &rest form)
|
|
|
690 &rest form))
|
|
|
691 ((dolist dotimes) 1 ((symbolp form &rest form) &rest form))
|
|
|
692 ((do-symbols) 1 ((symbolp form &optional form form) &rest form))
|
|
|
693 ((do-all-symbols) 1 ((symbolp form &optional form) &rest form))
|
|
|
694 ((psetq setf psetf) nil edebug-setq-form)
|
|
|
695 ((progv) 2 (&rest form))
|
|
|
696 ((flet labels macrolet) 1
|
|
|
697 ((&rest (sexp sexp &rest form)) &rest form))
|
|
|
698 ((symbol-macrolet lexical-let lexical-let*) 1
|
|
|
699 ((&rest &or symbolp (symbolp form)) &rest form))
|
|
|
700 ((multiple-value-bind) 2 ((&rest symbolp) &rest form))
|
|
|
701 ((multiple-value-setq) 1 ((&rest symbolp) &rest form))
|
|
|
702 ((incf decf remf pop push pushnew shiftf rotatef) nil (&rest form))
|
|
|
703 ((letf letf*) 1 ((&rest (&rest form)) &rest form))
|
|
|
704 ((callf destructuring-bind) 2 (sexp form &rest form))
|
|
|
705 ((callf2) 3 (sexp form form &rest form))
|
|
|
706 ((loop) defun (&rest &or symbolp form))
|
|
|
707 ((ignore-errors) 0 (&rest form))))
|
|
|
708
|
|
|
709
|
|
|
710 ;;; This goes here so that cl-macs can find it if it loads right now.
|
|
|
711 (provide 'cl-19) ; usage: (require 'cl-19 "cl")
|
|
|
712
|
|
|
713
|
|
|
714 ;;; Things to do after byte-compiler is loaded.
|
|
|
715 ;;; As a side effect, we cause cl-macs to be loaded when compiling, so
|
|
|
716 ;;; that the compiler-macros defined there will be present.
|
|
|
717
|
|
|
718 (defvar cl-hacked-flag nil)
|
|
|
719 (defun cl-hack-byte-compiler ()
|
|
|
720 (if (and (not cl-hacked-flag) (fboundp 'byte-compile-file-form))
|
|
|
721 (progn
|
|
2153
|
722 (setq cl-hacked-flag t) ; Do it first, to prevent recursion.
|
|
442
|
723 (when (not (fboundp 'cl-compile-time-init))
|
|
|
724 (load "cl-macs" nil t))
|
|
2153
|
725 (cl-compile-time-init)))) ; In cl-macs.el.
|
|
428
|
726
|
|
|
727 ;;; Try it now in case the compiler has already been loaded.
|
|
|
728 (cl-hack-byte-compiler)
|
|
|
729
|
|
|
730 ;;; Also make a hook in case compiler is loaded after this file.
|
|
|
731 ;;; The compiler doesn't call any hooks when it loads or runs, but
|
|
|
732 ;;; we can take advantage of the fact that emacs-lisp-mode will be
|
|
|
733 ;;; called when the compiler reads in the file to be compiled.
|
|
|
734 ;;; BUG: If the first compilation is `byte-compile' rather than
|
|
2153
|
735 ;;; `byte-compile-file', we lose. Emacs has fixed this by hanging it
|
|
|
736 ;;; on `bytecomp-load-hook' instead, which we do not have.
|
|
428
|
737 (add-hook 'emacs-lisp-mode-hook 'cl-hack-byte-compiler)
|
|
|
738
|
|
|
739
|
|
|
740 ;;; The following ensures that packages which expect the old-style cl.el
|
|
|
741 ;;; will be happy with this one.
|
|
|
742
|
|
|
743 (provide 'cl)
|
|
|
744
|
|
|
745 (run-hooks 'cl-load-hook)
|
|
|
746
|
|
2153
|
747 ;;; arch-tag: 5f07fa74-f153-4524-9303-21f5be125851
|
|
428
|
748 ;;; cl.el ends here
|
