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