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