;ELC   
;;; Compiled by pot@pot.cnuce.cnr.it on Tue Mar 18 15:39:04 2003
;;; from file /home/pot/gnu/emacs-pretest.new/lisp/emacs-lisp/cl.el
;;; in Emacs version 21.3
;;; with bytecomp version 2.85.4.1
;;; with all optimizations.
;;; Function definitions are lazy-loaded.

;;; This file uses dynamic docstrings, first added in Emacs 19.29.
(if (and (boundp 'emacs-version)
	 (< (aref emacs-version (1- (length emacs-version))) ?A)
	 (or (and (boundp 'epoch::version) epoch::version)
	     (string-lessp emacs-version "19.29")))
    (error "`cl.el' was compiled for Emacs 19.29 or later"))

;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;


(byte-code "\301B\303\301!\204\f \304\302B\303\302!\204 \304\301\207" [current-load-list cl-optimize-speed cl-optimize-safety boundp 1] 2)
#@445 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.
(defvar custom-print-functions nil (#$ . 806))
#@120 T if the two args are the same Lisp object.
Floating-point numbers of equal value are `eql', but they may not be `eq'.
(defalias 'eql #[(a b) #@43 ("\247\203	0	\232\207	=\207" . [a b])(#$ . 1452) nil 2 (#$ . 1304)])
#@160 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.
(defalias 'incf '(macro . #[(place &optional x) #@110 ("9\2030\302	\2030\303	E\2020\304DE\207\305\303	\206_0\306F\207" . [place x setq + 1+ callf 1])(#$ . 1746) nil 5 (#$ . 1532)]))
#@160 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.
(defalias 'decf '(macro . #[(place &optional x) #@110 ("9\2030\302	\2030\303	E\2020\304DE\207\305\303	\206_0\306F\207" . [place x setq - 1- callf 1])(#$ . 2108) nil 5 (#$ . 1894)]))
#@271 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'.
(defalias 'pop '(macro . #[(place) #@91 ("9\2030\301\302\303\304DEED\207\305!\207" . [place car prog1 setq cdr cl-do-pop])(#$ . 2567) nil 7 (#$ . 2256)]))
#@249 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'.
(defalias 'push '(macro . #[(x place) #@76 ("9\2030\302\303	EE\207\304\303	F\207" . [place x setq cons callf2])(#$ . 2988) nil 5 (#$ . 2696)]))
#@222 (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
(defalias 'pushnew '(macro . #[(x place &rest keys) #@92 ("9\2030\303\304	\nBBBE\207\305\304	\nBBBB\207" . [place x keys setq adjoin callf2])(#$ . 3381) nil 6 (#$ . 3102)]))
(defalias 'cl-set-elt #[(seq n val) #@54 ("<\2030	\233\n\240\207	\nI\207" . [seq n val])(#$ . 3546) nil 3])
(defalias 'cl-set-nthcdr #[(n list x) #@62 ("\303X\2030	\207S\n\233	\241\210\n\207" . [n x list 0])(#$ . 3662) nil 2])
(defalias 'cl-set-buffer-substring #[(start end val) #@55 ("\212	|\210b\210\nc\210\n)\207" . [start end val])(#$ . 3801) nil 2])
(defalias 'cl-set-substring #[(str start end val) #@138 ("\2030\304W\2030	G\\\2020	G\n\304W\203_0\n	\\\n\304V\205)0	\304\nO	GW\20550	\305OQ\207" . [end str start val 0 nil])(#$ . 3931) nil 5])
(defalias 'cl-map-extents #[(&rest cl-args) #@55 ("\301\302\"\207" . [cl-args apply cl-map-overlays])(#$ . 4137) nil 3])
(byte-code "\303\304\305\"\210\303\306\307\"\210\303\310\311\"\210\303\312\305\"\210\303\313\305\"\210\303\314\315\"\210\303\316\317\"\210\301B\320\301!\204/ \321\302B\320\302!\204A \322K\303\322\323\"\210\321\207" [current-load-list cl-macro-environment cl-old-macroexpand defalias cl-block-wrapper identity cl-block-throw throw values list values-list multiple-value-list multiple-value-call apply nth-value nth boundp nil macroexpand cl-macroexpand] 4)
#@386 Return result of expanding macros at top level of FORM.
If FORM is not a macro call, it is returned unchanged.
Otherwise, the macro is expanded and the expansion is considered
in place of FORM.  When a non-macro-call results, it is returned.

The second optional arg ENVIRONMENT specifies an environment of macro
definitions to shadow the loaded ones for use in file byte-compilation.
(defalias 'cl-macroexpand #[(cl-macro &optional cl-env) #@153 ("\n\"\2119\203#0\305!\236A\203#0\305!\236\211A@)\2020)\207" . [cl-env cl-macro-environment cl-old-macroexpand cl-macro x symbol-name])(#$ . 5127) nil 4 (#$ . 4679)])
(byte-code "\301B\302\301!\204\f \303\303\207" [current-load-list cl-compiling-file boundp nil] 2)
(defalias 'cl-compiling-file #[nil #@149 ("\2060\301\302!\2050\303\302J!\2050\304\302J!\305\232\207" . [cl-compiling-file boundp outbuffer bufferp buffer-name " *Compiler Output*"])(#$ . 5454) nil 2])
(byte-code "\301B\302\301!\204\f \303\303\207" [current-load-list cl-proclaims-deferred boundp nil] 2)
(defalias 'proclaim #[(spec) #@116 ("\302\303!\2030\303\304\"\210\2020	B\305\207" . [spec cl-proclaims-deferred fboundp cl-do-proclaim t nil])(#$ . 5763) nil 3])
(defalias 'declaim '(macro . #[(&rest specs) #@181 ("\302\303\"\304 \2030\305\306	BB\2020\307	B)\207" . [specs body mapcar #[(x) "\301\302DD\207" [x proclaim quote] 3] cl-compiling-file eval-when (compile load eval) progn])(#$ . 5949) nil 3]))
(defalias 'cl-random-time #[nil #@126 ("\303\304 !\211G\305	S\211\305Y\2030\n\306_	H\\\202\n0\n+\207" . [time i v copy-sequence current-time-string 0 3])(#$ . 6188) nil 4])
(byte-code "\301B\302\301!\204 \303\304 \305\"\306_\301\207" [current-load-list *gensym-counter* boundp logand cl-random-time 1023 100] 3)
#@127 T if OBJECT is a floating point number.
On Emacs versions that lack floating-point support, this function
always returns nil.
(defalias 'floatp-safe #[(x) #@34 ("\247\2050\250?\207" . [x])(#$ . 6643) nil 1 (#$ . 6482)])
#@26 T if NUMBER is positive.
(defalias 'plusp #[(x) #@24 ("\301V\207" . [x 0])(#$ . 6767) nil 2 (#$ . 6713)])
#@26 T if NUMBER is negative.
(defalias 'minusp #[(x) #@24 ("\301W\207" . [x 0])(#$ . 6882) nil 2 (#$ . 6827)])
#@22 T if INTEGER is odd.
(defalias 'oddp #[(x) #@41 ("\301\302\"\302=\207" . [x logand 1])(#$ . 6991) nil 3 (#$ . 6942)])
#@23 T if INTEGER is even.
(defalias 'evenp #[(x) #@43 ("\301\302\"\303=\207" . [x logand 1 0])(#$ . 7119) nil 3 (#$ . 7068)])
(byte-code "\301B\306\301!\204 \307\310\311\312\313 $\302B\314\315!\303B\314\316!\304B\317\305B\317\320B\317\321B\317\322B\317\323B\317\324B\317\325B\317\326\327\330\"\207" [current-load-list *random-state* most-positive-fixnum most-negative-fixnum most-positive-float most-negative-float boundp vector cl-random-state-tag -1 30 cl-random-time eval (lsh -1 -1) (- -1 (lsh -1 -1)) nil least-positive-float least-negative-float least-positive-normalized-float least-negative-normalized-float float-epsilon float-negative-epsilon defalias copy-seq copy-sequence] 5)
#@342 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.
(defalias 'mapcar* #[(cl-func cl-x &rest cl-rest) #@199 ("\203>0A\2040	<\2030@<\2040\305\n	B\"\207\306@	\203:0\203:0\n	\211A@\211A@\"\fB\202 0\f\237*\207\307\n	\"\207" . [cl-rest cl-x cl-func cl-y cl-res cl-mapcar-many nil mapcar])(#$ . 8200) nil 4 (#$ . 7802)])
(byte-code "\300\301\302\"\210\300\303\304\"\210\300\305\306\"\210\300\307\310\"\207" [defalias first car second cadr rest cdr endp null] 3)
#@41 Return the third element of the list X.
(defalias 'third #[(x) #@20 ("AA@\207" . [x])(#$ . 8645) nil 1 (#$ . 8576)])
#@42 Return the fourth element of the list X.
(defalias 'fourth #[(x) #@24 ("\3018\207" . [x 3])(#$ . 8772) nil 2 (#$ . 8701)])
#@41 Return the fifth element of the list X.
(defalias 'fifth #[(x) #@24 ("\3018\207" . [x 4])(#$ . 8901) nil 2 (#$ . 8832)])
#@41 Return the sixth element of the list X.
(defalias 'sixth #[(x) #@24 ("\3018\207" . [x 5])(#$ . 9030) nil 2 (#$ . 8961)])
#@43 Return the seventh element of the list X.
(defalias 'seventh #[(x) #@24 ("\3018\207" . [x 6])(#$ . 9163) nil 2 (#$ . 9090)])
#@42 Return the eighth element of the list X.
(defalias 'eighth #[(x) #@24 ("\3018\207" . [x 7])(#$ . 9294) nil 2 (#$ . 9223)])
#@41 Return the ninth element of the list X.
(defalias 'ninth #[(x) #@24 ("\3018\207" . [x 8])(#$ . 9423) nil 2 (#$ . 9354)])
#@41 Return the tenth element of the list X.
(defalias 'tenth #[(x) #@24 ("\3018\207" . [x 9])(#$ . 9552) nil 2 (#$ . 9483)])
#@50 Return the `car' of the `car' of the `car' of X.
(defalias 'caaar #[(x) #@20 ("@@@\207" . [x])(#$ . 9690) nil 1 (#$ . 9612)])
#@50 Return the `car' of the `car' of the `cdr' of X.
(defalias 'caadr #[(x) #@20 ("A@@\207" . [x])(#$ . 9824) nil 1 (#$ . 9746)])
#@50 Return the `car' of the `cdr' of the `car' of X.
(defalias 'cadar #[(x) #@20 ("@A@\207" . [x])(#$ . 9958) nil 1 (#$ . 9880)])
#@50 Return the `car' of the `cdr' of the `cdr' of X.
(defalias 'caddr #[(x) #@20 ("AA@\207" . [x])(#$ . 10092) nil 1 (#$ . 10014)])
#@50 Return the `cdr' of the `car' of the `car' of X.
(defalias 'cdaar #[(x) #@20 ("@@A\207" . [x])(#$ . 10228) nil 1 (#$ . 10150)])
#@50 Return the `cdr' of the `car' of the `cdr' of X.
(defalias 'cdadr #[(x) #@20 ("A@A\207" . [x])(#$ . 10364) nil 1 (#$ . 10286)])
#@50 Return the `cdr' of the `cdr' of the `car' of X.
(defalias 'cddar #[(x) #@20 ("@AA\207" . [x])(#$ . 10500) nil 1 (#$ . 10422)])
#@50 Return the `cdr' of the `cdr' of the `cdr' of X.
(defalias 'cdddr #[(x) #@20 ("AAA\207" . [x])(#$ . 10636) nil 1 (#$ . 10558)])
#@63 Return the `car' of the `car' of the `car' of the `car' of X.
(defalias 'caaaar #[(x) #@21 ("@@@@\207" . [x])(#$ . 10786) nil 1 (#$ . 10694)])
#@63 Return the `car' of the `car' of the `car' of the `cdr' of X.
(defalias 'caaadr #[(x) #@21 ("A@@@\207" . [x])(#$ . 10937) nil 1 (#$ . 10845)])
#@63 Return the `car' of the `car' of the `cdr' of the `car' of X.
(defalias 'caadar #[(x) #@21 ("@A@@\207" . [x])(#$ . 11088) nil 1 (#$ . 10996)])
#@63 Return the `car' of the `car' of the `cdr' of the `cdr' of X.
(defalias 'caaddr #[(x) #@21 ("AA@@\207" . [x])(#$ . 11239) nil 1 (#$ . 11147)])
#@63 Return the `car' of the `cdr' of the `car' of the `car' of X.
(defalias 'cadaar #[(x) #@21 ("@@A@\207" . [x])(#$ . 11390) nil 1 (#$ . 11298)])
#@63 Return the `car' of the `cdr' of the `car' of the `cdr' of X.
(defalias 'cadadr #[(x) #@21 ("A@A@\207" . [x])(#$ . 11541) nil 1 (#$ . 11449)])
#@63 Return the `car' of the `cdr' of the `cdr' of the `car' of X.
(defalias 'caddar #[(x) #@21 ("@AA@\207" . [x])(#$ . 11692) nil 1 (#$ . 11600)])
#@63 Return the `car' of the `cdr' of the `cdr' of the `cdr' of X.
(defalias 'cadddr #[(x) #@21 ("AAA@\207" . [x])(#$ . 11843) nil 1 (#$ . 11751)])
#@63 Return the `cdr' of the `car' of the `car' of the `car' of X.
(defalias 'cdaaar #[(x) #@21 ("@@@A\207" . [x])(#$ . 11994) nil 1 (#$ . 11902)])
#@63 Return the `cdr' of the `car' of the `car' of the `cdr' of X.
(defalias 'cdaadr #[(x) #@21 ("A@@A\207" . [x])(#$ . 12145) nil 1 (#$ . 12053)])
#@63 Return the `cdr' of the `car' of the `cdr' of the `car' of X.
(defalias 'cdadar #[(x) #@21 ("@A@A\207" . [x])(#$ . 12296) nil 1 (#$ . 12204)])
#@63 Return the `cdr' of the `car' of the `cdr' of the `cdr' of X.
(defalias 'cdaddr #[(x) #@21 ("AA@A\207" . [x])(#$ . 12447) nil 1 (#$ . 12355)])
#@63 Return the `cdr' of the `cdr' of the `car' of the `car' of X.
(defalias 'cddaar #[(x) #@21 ("@@AA\207" . [x])(#$ . 12598) nil 1 (#$ . 12506)])
#@63 Return the `cdr' of the `cdr' of the `car' of the `cdr' of X.
(defalias 'cddadr #[(x) #@21 ("A@AA\207" . [x])(#$ . 12749) nil 1 (#$ . 12657)])
#@63 Return the `cdr' of the `cdr' of the `cdr' of the `car' of X.
(defalias 'cdddar #[(x) #@21 ("@AAA\207" . [x])(#$ . 12900) nil 1 (#$ . 12808)])
#@63 Return the `cdr' of the `cdr' of the `cdr' of the `cdr' of X.
(defalias 'cddddr #[(x) #@21 ("AAAA\207" . [x])(#$ . 13051) nil 1 (#$ . 12959)])
#@177 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)))'.
(defalias 'list* #[(arg &rest rest) #@126 ("\2040	\207A\2040	@B\207G\305!\n\306Z\233\211\211A@\241\210	+B\207" . [rest arg n copy last copy-sequence 2])(#$ . 13330) nil 3 (#$ . 13111)])
#@54 Return a copy of LIST with the tail SUBLIST removed.
(defalias 'ldiff #[(list sublist) #@84 ("\303	:\2030	\n=\2040	\211A@B\2020\237)\207" . [res list sublist nil])(#$ . 13587) nil 2 (#$ . 13494)])
#@127 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.
(defalias 'copy-list #[(list) #@91 (":\203_0\302:\2030\211A@	B\2020	\237	\241\210)\207@\207" . [list res nil])(#$ . 13872) nil 3 (#$ . 13710)])
(defalias 'cl-maclisp-member #[(item list) #@61 ("\2030	@\232\2040A\211\2040\207" . [list item])(#$ . 14044) nil 3])
(byte-code "\300\301\302\"\210\300\303\304\"\210\300\305\306\"\210\300\307\310\"\210\300\311\312\"\210\300\313\314\"\207" [defalias cl-member memq cl-floor floor* cl-ceiling ceiling* cl-truncate truncate* cl-round round* cl-mod mod*] 3)
#@152 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
(defalias 'adjoin #[(cl-item cl-list &rest cl-keys) #@205 ("\303\232\2040\2040	\247\2040	\n>\2030\n\207	\nB\207\304\232\204%0\20410	\n\235\203-0\n\207	\nB\207\305\306	\n$\207" . [cl-keys cl-item cl-list (:test eq) (:test equal) apply cl-adjoin])(#$ . 14578) nil 5 (#$ . 14368)])
#@176 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
(defalias 'subst #[(cl-new cl-old cl-tree &rest cl-keys) #@130 ("\2040	\247\2030	\250\2040\304\305	\nBC$\207\306\n	#\207" . [cl-keys cl-old cl-new cl-tree apply sublis cl-do-subst])(#$ . 15061) nil 5 (#$ . 14822)])
(defalias 'cl-do-subst #[(cl-new cl-old cl-tree) #@142 ("	=\2030\n\207:\20320\305\n	@#\305\n	A#\211@=\203-0A=\203-0\20200\fB*\207\207" . [cl-tree cl-old cl-new d a cl-do-subst])(#$ . 15279) nil 6])
(defalias 'acons #[(a b c) #@26 ("	B\nB\207" . [a b c])(#$ . 15473) nil 2])
(defalias 'pairlis #[(a b &optional c) #@50 ("\303\304	#\n\244\207" . [a b c mapcar* cons])(#$ . 15563) nil 4])
(byte-code "\300\301\302\303#\210\300\301\304\305#\207" [put cl-assertion-failed error-conditions (error) error-message "Assertion failed"] 4)
#@49 Non-nil means don't make CL functions autoload.
(defvar cl-fake-autoloads nil (#$ . 15781))
(byte-code "\302\303!\210\302\304!\210\305\306\307\"\210\305\310\311\"\210\312\313!\210\301B\314\301!\204\" \315\315\207" [current-load-list cl-hacked-flag fmakunbound dolist dotimes mapcar #[(set) "\203 \304\202\n 	@\305\306	\211AA)\")\207" [cl-fake-autoloads set file x "<none>" mapcar #[(func) "\302	@\303\211	A@%\207" [func set autoload nil] 6]] 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 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 cl-make-hash-table cl-hash-lookup cl-gethash cl-puthash cl-remhash cl-clrhash cl-maphash cl-hash-table-p cl-hash-table-count cl-progv-before cl-prettyexpand cl-macroexpand-all) ("cl-seq" nil reduce fill replace remove* remove-if remove-if-not 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-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 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) "\301\302@\"\207" [entry mapcar #[(func) "\302\303	A@#\210\302\304	A@#\210\305N\206 \302\305\306	8#\207" [func entry put lisp-indent-function lisp-indent-hook edebug-form-spec 2] 5]] 3] (((defun* defmacro*) 2) ((function*) nil (&or symbolp ([&optional 'macro] 'lambda (&rest sexp) &rest form))) ((eval-when) 1 (sexp &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)) ((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 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 nil] 3)
(defalias 'cl-hack-byte-compiler #[nil #@126 ("?\2050\301\302!\2050\303 \210\304\211\207" . [cl-hacked-flag fboundp byte-compile-file-form cl-compile-time-init t])(#$ . 19592) nil 2])
(byte-code "\300 \210\301\302\300\"\210\303\304!\210\305\306!\207" [cl-hack-byte-compiler add-hook bytecomp-load-hook provide cl run-hooks cl-load-hook] 3)
