;ELC ;;; compiled by jwz@thalidomide on Tue Oct 19 23:14:53 1993 ;;; from file /th/jwz/emacs19/lisp/utils/cl.el ;;; emacs version 19.9 Lucid. ;;; bytecomp version 2.20; 18-oct-93. ;;; optimization is on. ;;; this file uses opcodes which do not exist in Emacs 18. (if (and (boundp 'emacs-version) (or (and (boundp 'epoch::version) epoch::version) (string-lessp emacs-version "19"))) (error "This file was compiled for Emacs 19.")) (byte-code "!!J řƪ \"ɪ!M! !" [boundp cl-emacs-type fboundp epoch::version emacs-version "19" 18 string-match "Lucid" lucid 19 defalias fset cl-optimize-speed 1 cl-optimize-safety :test :test-not :key :start :start1 :start2 :end :end1 :end2 :count :initial-value :size :from-end :rehash-size :rehash-threshold :allow-other-keys] 3) (defvar custom-print-functions nil "\ This is a list of functions that format user objects for printing. Each function is called in turn with three arguments: the object, the stream, and the print level (currently ignored). If it is able to print the object it returns true; otherwise it returns nil and the printer proceeds to the next function on the list. This variable is not used at present, but it is defined in hopes that a future Emacs interpreter will be able to use it.") (fset 'eql #[(a b) "  =" [a b] 2 "\ T if the two args are the same Lisp object. Floating-point numbers of equal value are `eql', but they may not be `eq'."]) (fset 'incf '(macro . #[(place &optional x) "9\n\nEDE\nF" [place setq x + 1+ callf 1] 5 "\ (incf PLACE [X]): increment PLACE by X (1 by default). PLACE may be a symbol, or any generalized variable allowed by `setf'. The return value is the incremented value of PLACE."])) (fset 'decf '(macro . #[(place &optional x) "9\n\nEDE\nF" [place setq x - 1- callf 1] 5 "\ (decf PLACE [X]): decrement PLACE by X (1 by default). PLACE may be a symbol, or any generalized variable allowed by `setf'. The return value is the decremented value of PLACE."])) (fset 'pop '(macro . #[(place) "9DEED!" [place car prog1 setq cdr cl-do-pop] 7 "\ (pop PLACE): remove and return the head of the list stored in PLACE. Analogous to (prog1 (car PLACE) (setf PLACE (cdr PLACE))), though more careful about evaluating each argument only once and in the right order. PLACE may be a symbol, or any generalized variable allowed by `setf'."])) (fset 'push '(macro . #[(x place) "9 EE F" [place setq cons x callf2] 5 "\ (push X PLACE): insert X at the head of the list stored in PLACE. Analogous to (setf PLACE (cons X PLACE)), though more careful about evaluating each argument only once and in the right order. PLACE may be a symbol, or any generalized variable allowed by `setf'."])) (fset 'pushnew '(macro . #[(x place &rest keys) "9  $E  %" [place setq list* adjoin x keys callf2] 7 "\ (pushnew X PLACE): insert X at the head of the list if not already there. Like (push X PLACE), except that the list is unmodified if X is `eql' to an element already on the list. Keywords supported: :test :test-not :key"])) (byte-code "MMMM" [cl-set-elt #[(seq n val) "< \n \nI" [seq n val] 3] cl-set-nthcdr #[(n list x) "X\nS \n " [n 0 x list] 2] cl-set-buffer-substring #[(start end val) " |b\nc\n)" [start end val] 2] cl-set-substring #[(str start end val) "W\nG\\\nG W \n\\ V\n O \nGW\nOQ" [end 0 str start val nil] 5]] 2) (fset 'when '(macro . #[(cond &rest body) " BE" [if cond progn body] 4 "\ (when COND BODY...): if COND yields non-nil, do BODY, else return nil."])) (fset 'unless '(macro . #[(cond &rest body) " BBB" [if cond nil body] 4 "\ (unless COND BODY...): if COND yields nil, do BODY, else return nil."])) (byte-code "M\"\"\"\"\"\"\"!!K\"M!M!MMM! \"_ч" [cl-map-extents #[(&rest cl-args) "! \"! \"" [fboundp next-overlay-at apply cl-map-overlays cl-args map-extents] 3] defalias cl-block-wrapper identity cl-block-throw throw values list values-list multiple-value-list multiple-value-call apply nth-value nth boundp cl-macro-environment nil cl-old-macroexpand macroexpand cl-macroexpand #[(cl-macro &optional cl-env) "\n \"9 !A !!e )" [cl-env cl-macro-environment cl-old-macroexpand cl-macro symbol-name cadr] 4] cl-compiling-file #[nil "!!J!J!Ś" [cl-compiling-file boundp byte-compile-output-buffer bufferp buffer-name " *Compiler Output*"] 2] cl-proclaims-deferred proclaim #[(spec) "!\n\"\n BŇ" [fboundp cl-do-proclaim spec t cl-proclaims-deferred nil] 3] declaim (macro . #[(&rest specs) "\n\" # B)" [mapcar #[(x) "\nDD" [proclaim quote x] 3] specs body cl-compiling-file list* eval-when (compile load eval) progn] 4]) cl-random-time #[nil " !G SY _\n H\\n +" [copy-sequence current-time-string time i 0 v 3] 4] *gensym-counter* logand 1023 100] 4) (fset 'floatp-safe #[(x) "?" [x] 1 "\ T if OBJECT is a floating point number. On Emacs versions that lack floating-point support, this function always returns nil."]) (fset 'plusp #[(x) "V" [x 0] 2 "\ T if NUMBER is positive."]) (fset 'minusp #[(x) "W" [x 0] 2 "\ T if NUMBER is negative."]) (fset 'oddp #[(x) " \"=" [logand x 1] 3 "\ T if INTEGER is odd."]) (fset 'evenp #[(x) " \"=" [logand x 1 0] 3 "\ T if INTEGER is even."]) (fset 'cl-abs #[(x) "Y[" [x 0] 2 "\ Return the absolute value of ARG."]) (byte-code "!\"! $! !\"" [fboundp abs defalias cl-abs boundp *random-state* vector cl-random-state-tag -1 30 cl-random-time eval (lsh -1 -1) most-positive-fixnum (- -1 (lsh -1 -1)) most-negative-fixnum nil most-positive-float most-negative-float least-positive-float least-negative-float least-positive-normalized-float least-negative-normalized-float float-epsilon float-negative-epsilon copy-seq copy-sequence] 5) (fset 'mapcar* #[(cl-func cl-x &rest cl-rest) "A <@< B\"@ A@ A@\"Bg* \"" [cl-rest cl-x cl-mapcar-many cl-func nil cl-y cl-res mapcar] 4 "\ Apply FUNCTION to each element of SEQ, and make a list of the results. If there are several SEQs, FUNCTION is called with that many arguments, and mapping stops as soon as the shortest list runs out. With just one SEQ, this is like `mapcar'. With several, it is like the Common Lisp `mapcar' function extended to arbitrary sequence types."]) (byte-code "\"\"\"" [defalias first car rest cdr endp null] 3) (fset 'second #[(x) "A@" [x] 1 "\ Return the second element of the list LIST."]) (fset 'third #[(x) "AA@" [x] 1 "\ Return the third element of the list LIST."]) (fset 'fourth #[(x) " 8" [3 x] 2 "\ Return the fourth element of the list LIST."]) (fset 'fifth #[(x) " 8" [4 x] 2 "\ Return the fifth element of the list LIST."]) (fset 'sixth #[(x) " 8" [5 x] 2 "\ Return the sixth element of the list LIST."]) (fset 'seventh #[(x) " 8" [6 x] 2 "\ Return the seventh element of the list LIST."]) (fset 'eighth #[(x) " 8" [7 x] 2 "\ Return the eighth element of the list LIST."]) (fset 'ninth #[(x) " 8" [8 x] 2 "\ Return the ninth element of the list LIST."]) (fset 'tenth #[(x) " 8" [9 x] 2 "\ Return the tenth element of the list LIST."]) (fset 'caar #[(x) "@@" [x] 1 "\ Return the `car' of the `car' of X."]) (fset 'cadr #[(x) "A@" [x] 1 "\ Return the `car' of the `cdr' of X."]) (fset 'cdar #[(x) "@A" [x] 1 "\ Return the `cdr' of the `car' of X."]) (fset 'cddr #[(x) "AA" [x] 1 "\ Return the `cdr' of the `cdr' of X."]) (fset 'caaar #[(x) "@@@" [x] 1 "\ Return the `car' of the `car' of the `car' of X."]) (fset 'caadr #[(x) "A@@" [x] 1 "\ Return the `car' of the `car' of the `cdr' of X."]) (fset 'cadar #[(x) "@A@" [x] 1 "\ Return the `car' of the `cdr' of the `car' of X."]) (fset 'caddr #[(x) "AA@" [x] 1 "\ Return the `car' of the `cdr' of the `cdr' of X."]) (fset 'cdaar #[(x) "@@A" [x] 1 "\ Return the `cdr' of the `car' of the `car' of X."]) (fset 'cdadr #[(x) "A@A" [x] 1 "\ Return the `cdr' of the `car' of the `cdr' of X."]) (fset 'cddar #[(x) "@AA" [x] 1 "\ Return the `cdr' of the `cdr' of the `car' of X."]) (fset 'cdddr #[(x) "AAA" [x] 1 "\ Return the `cdr' of the `cdr' of the `cdr' of X."]) (fset 'caaaar #[(x) "@@@@" [x] 1 "\ Return the `car' of the `car' of the `car' of the `car' of X."]) (fset 'caaadr #[(x) "A@@@" [x] 1 "\ Return the `car' of the `car' of the `car' of the `cdr' of X."]) (fset 'caadar #[(x) "@A@@" [x] 1 "\ Return the `car' of the `car' of the `cdr' of the `car' of X."]) (fset 'caaddr #[(x) "AA@@" [x] 1 "\ Return the `car' of the `car' of the `cdr' of the `cdr' of X."]) (fset 'cadaar #[(x) "@@A@" [x] 1 "\ Return the `car' of the `cdr' of the `car' of the `car' of X."]) (fset 'cadadr #[(x) "A@A@" [x] 1 "\ Return the `car' of the `cdr' of the `car' of the `cdr' of X."]) (fset 'caddar #[(x) "@AA@" [x] 1 "\ Return the `car' of the `cdr' of the `cdr' of the `car' of X."]) (fset 'cadddr #[(x) "AAA@" [x] 1 "\ Return the `car' of the `cdr' of the `cdr' of the `cdr' of X."]) (fset 'cdaaar #[(x) "@@@A" [x] 1 "\ Return the `cdr' of the `car' of the `car' of the `car' of X."]) (fset 'cdaadr #[(x) "A@@A" [x] 1 "\ Return the `cdr' of the `car' of the `car' of the `cdr' of X."]) (fset 'cdadar #[(x) "@A@A" [x] 1 "\ Return the `cdr' of the `car' of the `cdr' of the `car' of X."]) (fset 'cdaddr #[(x) "AA@A" [x] 1 "\ Return the `cdr' of the `car' of the `cdr' of the `cdr' of X."]) (fset 'cddaar #[(x) "@@AA" [x] 1 "\ Return the `cdr' of the `cdr' of the `car' of the `car' of X."]) (fset 'cddadr #[(x) "A@AA" [x] 1 "\ Return the `cdr' of the `cdr' of the `car' of the `cdr' of X."]) (fset 'cdddar #[(x) "@AAA" [x] 1 "\ Return the `cdr' of the `cdr' of the `cdr' of the `car' of X."]) (fset 'cddddr #[(x) "AAAA" [x] 1 "\ Return the `cdr' of the `cdr' of the `cdr' of the `cdr' of X."]) (fset 'last #[(x &optional n) "\n : T ArX  W Z\n\n*\nA:\nAt\n" [n 0 x p m] 2 "\ Returns the last link in the list LIST. With optional argument N, returns Nth-to-last link (default 1)."]) (fset 'butlast #[(x &optional n) "X\n\n!\"" [n 0 x nbutlast copy-sequence] 3 "\ Returns a copy of LIST with the last N elements removed."]) (fset 'nbutlast #[(x &optional n) "G\n\n W\nV S\nZš)" [x m n 1 0 nil] 2 "\ Modifies LIST to remove the last N elements."]) (fset 'list* #[(arg &rest rest) " A @BG!\nZ A@ +B" [rest arg n copy-sequence copy 2 last] 3 "\ Return a new list with specified args as elements, cons'd to last arg. Thus, `(list* A B C D)' is equivalent to `(nconc (list A B C) D)', or to `(cons A (cons B (cons C D)))'."]) (fset 'ldiff #[(list sublist) "\n:\n =\nA@ Bm )" [nil res list sublist] 2 "\ Return a copy of LIST with the tail SUBLIST removed."]) (fset 'copy-list #[(list) "::A@\nBr\n\n)@" [list nil res] 3 "\ Return a copy of a list, which may be a dotted list. The elements of the list are not copied, just the list structure itself."]) (byte-code "M!K!\"\"\"\"\"\"\"" [cl-maclisp-member #[(item list) " @At" [list item] 3] fboundp member subrp defalias cl-member memq cl-floor floor* cl-ceiling ceiling* cl-truncate truncate* cl-round round* cl-mod mod*] 3) (fset 'adjoin #[(cl-item cl-list &rest cl-keys) "\n\n > \n BĚ\n \n B\n $" [cl-keys (:test eq) cl-item cl-list (:test equal) apply cl-adjoin] 5 "\ Return ITEM consed onto the front of LIST only if it's not already there. Otherwise, return LIST unmodified. Keywords supported: :test :test-not :key"]) (fset 'subst #[(cl-new cl-old cl-tree &rest cl-keys) " BC $ #" [cl-keys cl-old apply sublis cl-new cl-tree cl-do-subst] 5 "\ Substitute NEW for OLD everywhere in TREE (non-destructively). Return a copy of TREE with all elements `eql' to OLD replaced by NEW. Keywords supported: :test :test-not :key"]) (byte-code "MMM##" [cl-do-subst #[(cl-new cl-old cl-tree) " =\n:\n @#\n A#@= A= B*" [cl-tree cl-old cl-new cl-do-subst d a] 6] acons #[(a b c) " B\nB" [a b c] 2] pairlis #[(a b &optional c) "\n # " [mapcar* cons a b c] 4] put cl-assertion-failed error-conditions (error) error-message "Assertion failed"] 4) (fset 'cl-add-hook #[(hook func &optional append) " ! J<\n@=\nC \n? \n C \nBL)" [boundp hook old lambda func append] 4 "\ Add to hook variable HOOK the function FUNC. FUNC is not added if it already appears on the list stored in HOOK."]) (byte-code "!\"\"\"!! M \"!!!" [fboundp add-hook defalias cl-add-hook mapcar #[(set) " !\"" [mapcar #[(func) " \n@É\nA@%" [autoload func set nil] 6] cddr set] 4] (("cl-extra" nil coerce equalp cl-map-keymap maplist mapc mapl mapcan mapcon cl-map-keymap cl-map-keymap-recursively cl-map-intervals cl-map-overlays cl-set-frame-visible-p cl-float-limits gcd lcm isqrt expt floor* ceiling* truncate* round* mod* rem* signum random* make-random-state random-state-p subseq concatenate cl-mapcar-many map some every notany notevery revappend nreconc list-length tailp copy-tree get* getf cl-set-getf cl-do-remf remprop make-hash-table cl-hash-lookup gethash cl-puthash remhash clrhash maphash hash-table-p hash-table-count cl-progv-before cl-prettyexpand cl-macroexpand-all) ("cl-seq" nil reduce fill replace remq remove remove* remove-if remove-if-not delete delete* delete-if delete-if-not remove-duplicates delete-duplicates substitute substitute-if substitute-if-not nsubstitute nsubstitute-if nsubstitute-if-not find find-if find-if-not position position-if position-if-not count count-if count-if-not mismatch search sort* stable-sort merge member* member-if member-if-not cl-adjoin assoc* assoc-if assoc-if-not rassoc* rassoc rassoc-if rassoc-if-not union nunion intersection nintersection set-difference nset-difference set-exclusive-or nset-exclusive-or subsetp subst-if subst-if-not nsubst nsubst-if nsubst-if-not sublis nsublis tree-equal) ("cl-macs" nil gensym gentemp typep cl-do-pop get-setf-method cl-struct-setf-expander compiler-macroexpand cl-compile-time-init) ("cl-macs" t defun* defmacro* function* destructuring-bind eval-when eval-when-compile load-time-value case ecase typecase etypecase block return return-from loop do do* dolist dotimes do-symbols do-all-symbols psetq progv flet labels macrolet symbol-macrolet lexical-let lexical-let* multiple-value-bind multiple-value-setq locally the declare define-setf-method defsetf define-modify-macro setf psetf remf shiftf rotatef letf letf* callf callf2 defstruct check-type assert ignore-errors define-compiler-macro)) #[(entry) "\n@\"" [mapcar #[(func) " A@# A@# N 8#" [put func lisp-indent-function entry lisp-indent-hook edebug-form-spec 2] 5] entry] 3] (((defun* defmacro*) 2) ((function*) nil (&or symbolp ([&optional 'macro] 'lambda (&rest sexp) &rest form))) ((eval-when) 1 (sexp &rest form)) ((when unless) 1 (&rest form)) ((declare) nil (&rest sexp)) ((the) 1 (sexp &rest form)) ((case ecase typecase etypecase) 1 (form &rest (sexp &rest form))) ((block return-from) 1 (sexp &rest form)) ((return) nil (&optional form)) ((do do*) 2 ((&rest &or symbolp (symbolp &optional form form)) (form &rest form) &rest form)) ((dolist dotimes) 1 ((symbolp form &rest form) &rest form)) ((do-symbols) 1 ((symbolp form &optional form form) &rest form)) ((do-all-symbols) 1 ((symbolp form &optional form) &rest form)) ((psetq setf psetf) nil edebug-setq-form) ((progv) 2 (&rest form)) ((flet labels macrolet) 1 ((&rest (sexp sexp &rest form)) &rest form)) ((symbol-macrolet lexical-let lexical-let*) 1 ((&rest &or symbolp (symbolp form)) &rest form)) ((multiple-value-bind) 2 ((&rest symbolp) &rest form)) ((multiple-value-setq) 1 ((&rest symbolp) &rest form)) ((incf decf remf pop push pushnew shiftf rotatef) nil (&rest form)) ((letf letf*) 1 ((&rest (&rest form)) &rest form)) ((callf destructuring-bind) 2 (sexp form &rest form)) ((callf2) 3 (sexp form form &rest form)) ((loop) nil (&rest &or symbolp form)) ((ignore-errors) 0 (&rest form))) provide cl-19 boundp cl-hacked-flag nil cl-hack-byte-compiler #[nil "?! ĉ" [cl-hacked-flag fboundp byte-compile-file-form cl-compile-time-init t] 2] emacs-lisp-mode-hook cl mini-cl run-hooks cl-load-hook] 3)