;ELC ;;; compiled by cthomp@willow on Thu Aug 12 00:49:09 1993 ;;; from file /era/era-0.80/editor/lisp/utils/cl-seq.el ;;; emacs version 19.8 (beta8) Lucid. ;;; bytecomp version 2.15; 14-jul-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 "ﾀ >ｬﾂﾃ!案ﾅM鞍ﾇM以ﾉM位ﾈﾋﾌ#位ﾈﾍﾎ#委ﾐM尉ﾒM意ﾔM易ﾖM位ﾏﾍﾗ#位ﾓﾍﾗ#位ﾑﾍﾗ#位ﾕﾍﾗ#" [cl-19 features error "Tried to load `cl-seq' before `cl'!" cl-push (macro . #[(x place) "ﾀ ﾂ EE" [setq place cons x] 5]) cl-pop (macro . #[(place) "ﾀﾁ\nﾃ\nﾄ\nDEED" [car prog1 place setq cdr] 7]) cl-parsing-keywords (macro . #[(kwords other-keys &rest body) "ﾀﾁﾂ \"ﾄ ﾆ=?ｭ佗ﾈﾉﾊﾋﾌﾍﾎﾁﾏﾄ \"\"DEﾐﾑFﾒFEC\"BB" [let* mapcar #[(x) ":ｫ@ｪﾂﾃﾄﾅ DﾆEDD ﾈ=ｫ庫ﾊﾋEﾌF ﾍ=ｫ庫ﾊﾎEﾌFﾏﾐﾑﾒ !ﾓﾔO\"!:ｫ苛A@Eｪ*D" [x var car cdr memq quote cl-keys mem :test-not and setq cl-test t :if-not cl-if intern format "cl-%s" symbol-name 1 nil or] 6] kwords append other-keys t let ((cl-keys-temp cl-keys)) while cl-keys-temp or memq (car cl-keys-temp) quote #[(x) ":ｫ@" [x] 1] (car (cdr (memq ':allow-other-keys cl-keys))) (error "Bad keyword argument %s" (car cl-keys-temp)) (setq cl-keys-temp (cdr (cdr cl-keys-temp))) body] 16]) put lisp-indent-function 2 edebug-form-spec (sexp sexp &rest form) cl-check-key (macro . #[(x) "ﾀﾁﾂﾁ E F" [if cl-key funcall x] 5]) cl-check-test-nokey (macro . #[(item x) "ﾀﾁﾂﾃﾄﾁ FDﾇEDﾈﾂﾃﾄﾈEDﾉEDﾊﾋﾌ Dﾍ Eﾂ EFDF" [cond cl-test eq not funcall item x cl-test-not cl-if cl-if-not t if numberp equal] 10]) cl-check-test (macro . #[(item x) "ﾀ ﾂ DE" [cl-check-test-nokey item cl-check-key x] 4]) cl-check-match (macro . #[(x y) "ﾀ Dﾀ\nDﾃﾄﾅﾆﾇﾄ \nFDﾈEﾃﾉ Dﾊ \nEﾅ \nEFF" [cl-check-key x y if cl-test eq not funcall cl-test-not numberp equal] 9]) edebug-forms] 4) (fset 'reduce #[(cl-func cl-seq &rest cl-keys) "ﾀ >A@ﾃ >A@ｮﾄﾆ >A@ﾈ >A@ ﾊ >A@  ｫ @ﾍ>ｬ斜 >A@ｬﾏﾐ @\" AA ｬb)<ｬﾒﾓ\"ﾔ #\nｫﾈ >ｫ ｪｫ ｫ 陰@!ｪ陰@ｪ \nｫ､ｫﾄ ｫ 陰@!ｪ陰@\"ｪ\\ｫ ｫ 陰@!ｪ陰@\"ｪ\\." [:from-end cl-keys cl-from-end :start 0 cl-start :end cl-end :initial-value cl-initial-value :key cl-key cl-keys-temp (:from-end :start :end :initial-value :key) :allow-other-keys error "Bad keyword argument %s" cl-seq append nil subseq cl-func cl-accum] 6 "\ Reduce two-argument FUNCTION across SEQUENCE. Keywords supported: :start :end :from-end :initial-value :key"]) (fset 'fill #[(seq item &rest cl-keys) "ﾀ >A@ｮﾂﾄ >A@ ｫ@ﾇ>ｬ縞 >A@ｬﾉﾊ@\"AAｬb) <ｫｯ  ｫ Zｪ⇔ ｫ S ﾂYｫAｬh*ｪｮ ｬ G ﾂUｫ  GUｫ禍 \"穐 Wｫ I Tｪo *" [:start cl-keys 0 cl-start :end cl-end cl-keys-temp (:start :end) :allow-other-keys error "Bad keyword argument %s" seq 8000000 n p item fillarray] 4 "\ Fill the elements of SEQ with ITEM. Keywords supported: :start :end"]) (fset 'replace #[(cl-seq1 cl-seq2 &rest cl-keys) "ﾀ >A@ｮﾂﾄ >A@ﾆ >A@ｮﾂﾈ >A@ \nｫ\n@ﾋ>ｬ捨 >A@ｬﾍﾎ\n@\"\nAA\nｬb)=ｫ Xｫﾚ UэG ｮ Z ｮZ^SﾂYｫｭ \\\\<ｫｪI+ｪI*ｏ<:  ｫ Zｪﾖ<ｫﾀ ｫ Zｪﾖ^ｫ｡ｫSﾂYｫ@AAｪ[*ｪｯ ｮG\\^ ｫ WｫHATｪ`*ｪﾕ ｮG  ｮGZ\\^<ｫ｢ Wｫ @IA Tｪi)ｪ Wｫ HIT Tｪg," [:start1 cl-keys 0 cl-start1 :end1 cl-end1 :start2 cl-start2 :end2 cl-end2 cl-keys-temp (:start1 :end1 :start2 :end2) :allow-other-keys error "Bad keyword argument %s" cl-seq1 cl-seq2 cl-len cl-n val n seq 4000000 cl-n1 cl-p1 cl-p2] 6 "\ Replace the elements of SEQ1 with the elements of SEQ2. SEQ1 is destructively modified, then returned. Keywords supported: :start1 :end1 :start2 :end2"]) (fset 'remove* #[(cl-item cl-seq &rest cl-keys) "ﾀ >A@ﾃ >A@ｭ甘 >A@ｭﾄﾆ >A@ﾈ >A@ ﾊ >A@ｭ玉 >A@ ｭﾄ ﾌ >A@ ﾎ >A@ﾐ >A@ｮﾑﾓ >A@ ｫ@ﾖ>ｬ邪 >A@ｬﾘﾙ@\"AAｬb) ｮﾚ ﾑXｫＦ<ｫｫﾖ ﾜWｫﾐﾝ%ｫｹ珮綵"ｫﾓTDｪﾐD \"$$<ｫ$ｪ;ｫ$ｰｪ$!)ｪ)Ｆｮ∠ZﾑUユユﾑVｫ\nｫ禄nｫ@!ｪ@\"? =ｪﾇ ｫ ｫ@!ｪ@!? =ｪｫｧｫｫ@!ｪ@坎ｫ@!ｪ@=ｫSAｫ S ﾑV ﾑVツﾑVツﾑVｫ妛SA&&ｫﾑVｫ\nｫ禄nｫ&@!ｪ&@\"? =ｪﾇ ｫ ｫ&@!ｪ&@!? =ｪｫｧｫｫ&@!ｪ&@坎ｫ&@!ｪ&@=ｬ&A&Sｪ&ｫｵﾑVｫｯ&\" 鏘ｫ&Aｪ&Aｭ籾&A!ﾐﾑﾓSﾌ S &\n､ｪ)ｪ. " [:test cl-keys cl-test :test-not t cl-test-not :key cl-key :if cl-if :if-not cl-if-not :count cl-count :from-end cl-from-end :start 0 cl-start :end cl-end cl-keys-temp (:test :test-not :key :if :if-not :count :from-end :start :end) :allow-other-keys error "Bad keyword argument %s" 8000000 cl-seq 4000000 cl-position cl-item cl-i apply delete* append nil cl-res vconcat cl-p ldiff 1 copy-sequence] 13 "\ Remove all occurrences of ITEM in SEQ. This is a non-destructive function; it makes a copy of SEQ if necessary to avoid corrupting the original SEQ. Keywords supported: :test :test-not :key :count :start :end :from-end"]) (fset 'remove-if #[(cl-pred cl-list &rest cl-keys) "ﾀﾁﾂ ﾄ &" [apply remove* nil cl-list :if cl-pred cl-keys] 7 "\ Remove all items satisfying PREDICATE in SEQ. This is a non-destructive function; it makes a copy of SEQ if necessary to avoid corrupting the original SEQ. Keywords supported: :key :count :start :end :from-end"]) (fset 'remove-if-not #[(cl-pred cl-list &rest cl-keys) "ﾀﾁﾂ ﾄ &" [apply remove* nil cl-list :if-not cl-pred cl-keys] 7 "\ Remove all items not satisfying PREDICATE in SEQ. This is a non-destructive function; it makes a copy of SEQ if necessary to avoid corrupting the original SEQ. Keywords supported: :key :count :start :end :from-end"]) (fset 'delete* #[(cl-item cl-seq &rest cl-keys) "ﾀ >A@ﾃ >A@ｭ甘 >A@ｭﾄﾆ >A@ﾈ >A@ ﾊ >A@ｭ玉 >A@ ｭﾄ ﾌ >A@ ﾎ >A@ﾐ >A@ｮﾑﾓ >A@ ｫ@ﾖ>ｬ邪 >A@ｬﾘﾙ@\"AAｬb) ｮﾚ ﾑXｫGｫﾂﾃ !\" " [x y delq copy-list] 4]] 3) (fset 'remove-duplicates #[(cl-seq &rest cl-keys) "ﾀ \nﾃ#" [cl-delete-duplicates cl-seq cl-keys t] 4 "\ Return a copy of SEQ with all duplicate elements removed. Keywords supported: :test :test-not :key :start :end :from-end"]) (fset 'delete-duplicates #[(cl-seq &rest cl-keys) "ﾀ \nﾃ#" [cl-delete-duplicates cl-seq cl-keys nil] 4 "\ Remove all duplicate elements from SEQ (destructively). Keywords supported: :test :test-not :key :start :end :from-end"]) (fset 'cl-delete-duplicates #[(cl-seq cl-keys cl-copy) "<ヲﾁ\n>A@ﾄ\n>A@ｭ監\n>A@ｭﾅﾇ\n>A@ﾉ\n>A@ｮ¬ ﾌ\n>A@ ﾎ\n>A@ﾐ\n>A@\nｫ@ﾓ>ｬ車\n>A@ｬﾕﾖ@\"AAｬb)ｫ 嶼 ｮG Z  ﾚVｫﾘﾊﾛｫ@!ｪ@A S$ｫｦｫ在! ﾗ實陰A｡) S ｪ<A S  T ｪ\"*ｏ ｮG Z Aｫｭ ﾊUｫｧ ﾚVｫ｡ﾛｫ@!ｪ@Aﾊ S$ｫA S ｪO ﾊVｫ S妛 S ﾚ AAｫﾏ ﾚVｫﾉﾛｫA@!ｪA@AAﾊ S$ｫｫ爵! Sﾗ陰A｡穐A S  T ｪ+).ﾟﾗ\"\nﾗ#!;ｫ!ｰｪ!!)" [cl-seq :test cl-keys cl-test :test-not t cl-test-not :key cl-key :start 0 cl-start :end cl-end :from-end cl-from-end :if cl-if cl-keys-temp (:test :test-not :key :start :end :from-end :if) :allow-other-keys error "Bad keyword argument %s" nil cl-i cl-p 1 cl-position cl-copy copy-sequence cl-tail cl-delete-duplicates append cl-res vconcat] 6]) (fset 'substitute #[(cl-new cl-old cl-seq &rest cl-keys) "ﾀ >A@ﾃ >A@ｭ甘 >A@ｭﾄﾆ >A@ﾈ >A@ ﾊ >A@ｭ玉 >A@ ｭﾄ ﾌ >A@ ﾎ >A@ｮﾏﾑ >A@ﾓ >A@ ｫ@ﾖ>ｬ邪 >A@ｬﾘﾙ@\"AAｬb)=ｬ ｮﾜﾝ ﾏXｫｪﾜﾟ$ ｬｪﾈ!ｬｭ \"#$<ｫ#$\"ｪ$#\"I+ T  S 褂ﾌ ﾎ & ). " [:test cl-keys cl-test :test-not t cl-test-not :key cl-key :if cl-if :if-not cl-if-not :count cl-count :start 0 cl-start :end cl-end :from-end cl-from-end cl-keys-temp (:test :test-not :key :if :if-not :count :start :end :from-end) :allow-other-keys error "Bad keyword argument %s" cl-old cl-new nil 8000000 cl-seq cl-position cl-i copy-sequence val n seq apply nsubstitute] 11 "\ Substitute NEW for OLD in SEQ. This is a non-destructive function; it makes a copy of SEQ if necessary to avoid corrupting the original SEQ. Keywords supported: :test :test-not :key :count :start :end :from-end"]) (fset 'substitute-if #[(cl-new cl-pred cl-list &rest cl-keys) "ﾀﾁ\nﾃ ﾅ&" [apply substitute cl-new nil cl-list :if cl-pred cl-keys] 8 "\ Substitute NEW for all items satisfying PREDICATE in SEQ. This is a non-destructive function; it makes a copy of SEQ if necessary to avoid corrupting the original SEQ. Keywords supported: :key :count :start :end :from-end"]) (fset 'substitute-if-not #[(cl-new cl-pred cl-list &rest cl-keys) "ﾀﾁ\nﾃ ﾅ&" [apply substitute cl-new nil cl-list :if-not cl-pred cl-keys] 8 "\ Substitute NEW for all items not satisfying PREDICATE in SEQ. This is a non-destructive function; it makes a copy of SEQ if necessary to avoid corrupting the original SEQ. Keywords supported: :key :count :start :end :from-end"]) (fset 'nsubstitute #[(cl-new cl-old cl-seq &rest cl-keys) "ﾀ >A@ﾃ >A@ｭ甘 >A@ｭﾄﾆ >A@ﾈ >A@ ﾊ >A@ｭ玉 >A@ ｭﾄ ﾌ >A@ ﾎ >A@ｮﾏﾑ >A@ﾓ >A@ ｫ@ﾖ>ｬ邪 >A@ｬﾘﾙ@\"AAｬb)=┐ ｮﾜ ﾏX┐<エｫ ﾞVエｮ⌒ZイﾏVイ ﾏVｫ\nｫ禄nｫ@!ｪ@\"? =ｪﾇ ｫ ｫ@!ｪ@!? =ｪｫｧｫｫ@!ｪ@坎ｫ@!ｪ@=ｫ S ASし)いｬG WΔ ﾏVΔS\nｫ彌nｫ!ｪ彌"? =ｪﾓ ｫ ｫ!ｪ!? =ｪｳｧｫｫ!ｪ悁ｪｫ!ｪ=ザ !\"<ｫ!\" ｪ\"! I+ S ６WΔ ﾏVΔ\nｫ彌nｫH!ｪH\"? =ｪﾓ ｫ ｫH!ｪH!? =ｪｳｧｫｫH!ｪH坎ｫH!ｪH=ｫI S T . " [:test cl-keys cl-test :test-not t cl-test-not :key cl-key :if cl-if :if-not cl-if-not :count cl-count :start 0 cl-start :end cl-end :from-end cl-from-end cl-keys-temp (:test :test-not :key :if :if-not :count :start :end :from-end) :allow-other-keys error "Bad keyword argument %s" cl-old cl-new 8000000 cl-seq 4000000 cl-p val n seq] 6 "\ Substitute NEW for OLD in SEQ. This is a destructive function; it reuses the storage of SEQ whenever possible. Keywords supported: :test :test-not :key :count :start :end :from-end"]) (fset 'nsubstitute-if #[(cl-new cl-pred cl-list &rest cl-keys) "ﾀﾁ\nﾃ ﾅ&" [apply nsubstitute cl-new nil cl-list :if cl-pred cl-keys] 8 "\ Substitute NEW for all items satisfying PREDICATE in SEQ. This is a destructive function; it reuses the storage of SEQ whenever possible. Keywords supported: :key :count :start :end :from-end"]) (fset 'nsubstitute-if-not #[(cl-new cl-pred cl-list &rest cl-keys) "ﾀﾁ\nﾃ ﾅ&" [apply nsubstitute cl-new nil cl-list :if-not cl-pred cl-keys] 8 "\ Substitute NEW for all items not satisfying PREDICATE in SEQ. This is a destructive function; it reuses the storage of SEQ whenever possible. Keywords supported: :key :count :start :end :from-end"]) (fset 'find #[(cl-item cl-seq &rest cl-keys) "ﾀﾁ\n $ｭ )" [apply position cl-item cl-seq cl-keys cl-pos] 6 "\ Find the first occurrence of ITEM in LIST. Return the matching ITEM, or nil if not found. Keywords supported: :test :test-not :key :start :end :from-end"]) (fset 'find-if #[(cl-pred cl-list &rest cl-keys) "ﾀﾁﾂ ﾄ &" [apply find nil cl-list :if cl-pred cl-keys] 7 "\ Find the first item satisfying PREDICATE in LIST. Return the matching ITEM, or nil if not found. Keywords supported: :key :start :end :from-end"]) (fset 'find-if-not #[(cl-pred cl-list &rest cl-keys) "ﾀﾁﾂ ﾄ &" [apply find nil cl-list :if-not cl-pred cl-keys] 7 "\ Find the first item not satisfying PREDICATE in LIST. Return the matching ITEM, or nil if not found. Keywords supported: :key :start :end :from-end"]) (fset 'position #[(cl-item cl-seq &rest cl-keys) "ﾀ >A@ﾃ >A@ｭ甘 >A@ｭﾄﾆ >A@ﾈ >A@ ﾊ >A@ｭ玉 >A@ ｭﾄ ﾌ >A@ｮ∀ﾏ >A@ﾑ >A@ ｫ@ﾔ>ｬ遮 >A@ｬﾖﾗ@\"AAｬb)ﾘ%." [:test cl-keys cl-test :test-not t cl-test-not :key cl-key :if cl-if :if-not cl-if-not :start 0 cl-start :end cl-end :from-end cl-from-end cl-keys-temp (:test :test-not :key :if :if-not :start :end :from-end) :allow-other-keys error "Bad keyword argument %s" cl-position cl-item cl-seq] 7 "\ Find the first occurrence of ITEM in LIST. Return the index of the matching item, or nil if not found. Keywords supported: :test :test-not :key :start :end :from-end"]) (fset 'cl-position #[(cl-item cl-seq cl-start &optional cl-end cl-from-end) "<ワ  ｬてﾅ\nｫ Wｫｫｫｫ \nｫ\n\n@!ｪ\n@\"? =ｪﾁ ｫ \nｫ\n\n@!ｪ\n@!? =ｪｧ ｧｫ \nｫ\n\n@!ｪ\n@坎 \nｫ\n\n@!ｪ\n@=ｫ \nA Tｪ* ｬGｫ S Yｫｫ \nｫ\n H!ｪ H\"? =ｪﾇ ｫ \nｫ\n H!ｪ H!? =ｪｫ ｧｫ \nｫ\n H!ｪ H坎 \nｫ\n H!ｪ H=ｫ Yｭ Wｫｫ \nｫ\n H!ｪ H\"? =ｪﾇ ｫ \nｫ\n H!ｪ H!? =ｪｫ ｧｫ \nｫ\n H!ｪ H坎 \nｫ\n H!ｪ H=ｬ Tｪ Wｭ " [cl-seq cl-start cl-p cl-end 8000000 nil cl-res cl-from-end cl-test cl-item cl-key cl-test-not cl-if cl-if-not] 6]) (fset 'position-if #[(cl-pred cl-list &rest cl-keys) "ﾀﾁﾂ ﾄ &" [apply position nil cl-list :if cl-pred cl-keys] 7 "\ Find the first item satisfying PREDICATE in LIST. Return the index of the matching item, or nil if not found. Keywords supported: :key :start :end :from-end"]) (fset 'position-if-not #[(cl-pred cl-list &rest cl-keys) "ﾀﾁﾂ ﾄ &" [apply position nil cl-list :if-not cl-pred cl-keys] 7 "\ Find the first item not satisfying PREDICATE in LIST. Return the index of the matching item, or nil if not found. Keywords supported: :key :start :end :from-end"]) (fset 'count #[(cl-item cl-seq &rest cl-keys) "ﾀ >A@ﾃ >A@ｭ甘 >A@ｭﾄﾆ >A@ﾈ >A@ ﾊ >A@ｭ玉 >A@ ｭﾄ ﾌ >A@ｮ∀ﾏ >A@ ｫ@ﾒ>ｬ謝 >A@ｬﾔﾕ@\"AAｬb)ﾍﾖｬG:ｫWｫ:ｫ陰@ｪH\nｫ暴nｫ!ｪ\"? =ｪﾁ ｫ ｫ!ｪ!? =ｪｧｧｫｫ!ｪ坎ｫ!ｪ=ｫTTｍ. " [:test cl-keys cl-test :test-not t cl-test-not :key cl-key :if cl-if :if-not cl-if-not :start 0 cl-start :end cl-end cl-keys-temp (:test :test-not :key :if :if-not :start :end) :allow-other-keys error "Bad keyword argument %s" nil cl-x cl-count cl-seq cl-item] 5 "\ Count the number of occurrences of ITEM in LIST. Keywords supported: :test :test-not :key :start :end"]) (fset 'count-if #[(cl-pred cl-list &rest cl-keys) "ﾀﾁﾂ ﾄ &" [apply count nil cl-list :if cl-pred cl-keys] 7 "\ Count the number of items satisfying PREDICATE in LIST. Keywords supported: :key :start :end"]) (fset 'count-if-not #[(cl-pred cl-list &rest cl-keys) "ﾀﾁﾂ ﾄ &" [apply count nil cl-list :if-not cl-pred cl-keys] 7 "\ Count the number of items not satisfying PREDICATE in LIST. Keywords supported: :key :start :end"]) (fset 'mismatch #[(cl-seq1 cl-seq2 &rest cl-keys) "ﾀ >A@ﾃ >A@ｭ甘 >A@ｭﾄﾆ >A@ﾈ >A@ ﾊ >A@ｮ⇒ ﾍ >A@ﾏ >A@ｮ⇒ﾑ >A@ ｫ@ﾔ>ｬ遮 >A@ｬﾖﾗ@\"AAｬb)ｬGｬG ソ\ WエWエ\nｫｱ\nｫS!ｪSｫS!ｪS彌"? =ｪｫS!ｪS悸ｫｭｫS!ｪSｫS!ｪS悁ｪｫｫS!ｪSｫS!ｪS=ｫSSｄ WｬWﾃSづ<ｭ <ｭ WΥWΥ\nｫﾒ\nｫｫ@ｪ H!ｪｫ@ｪ Hｫｫ@ｪH!ｪｫ@ｪH\"? =ｙｫｫ@ｪ H!ｪｫ@ｪ Hｧｫﾍｫｫ@ｪ H!ｪｫ@ｪ Hｫｫ@ｪH!ｪｫ@ｪH坎ﾋｫｫ@ｪ H!ｪｫ@ｪ Hｫｫ@ｪH!ｪｫ@ｪH=ｫAA T TＵ WｬWｭ *." [:test cl-keys cl-test :test-not t cl-test-not :key cl-key :from-end cl-from-end :start1 0 cl-start1 :end1 cl-end1 :start2 cl-start2 :end2 cl-end2 cl-keys-temp (:test :test-not :key :from-end :start1 :end1 :start2 :end2) :allow-other-keys error "Bad keyword argument %s" cl-seq1 cl-seq2 cl-p2 cl-p1] 6 "\ Compare SEQ1 with SEQ2, return index of first mismatching element. Return nil if the sequences match. If one sequence is a prefix of the other, the return value indicates the end of the shorted sequence. Keywords supported: :test :test-not :key :start1 :end1 :start2 :end2 :from-end"]) (fset 'search #[(cl-seq1 cl-seq2 &rest cl-keys) "ﾀ >A@ﾃ >A@ｭ甘 >A@ｭﾄﾆ >A@ﾈ >A@ ﾊ >A@ｮ⇒ ﾍ >A@ﾏ >A@ｮ⇒ﾑ >A@ ｫ@ﾔ>ｬ遮 >A@ｬﾖﾗ@\"AAｬb)ｬGｬG Yｫ ｫｪ Zｫ !ｪ ﾜﾜSZWｫﾁﾟ %ｫｰ珮ﾊ TﾍﾏTﾑ\\ﾈﾜ &ｫ ｫｪ@Tｪ:Wｭ,." [:test cl-keys cl-test :test-not t cl-test-not :key cl-key :from-end cl-from-end :start1 0 cl-start1 :end1 cl-end1 :start2 cl-start2 :end2 cl-end2 cl-keys-temp (:test :test-not :key :from-end :start1 :end1 :start2 :end2) :allow-other-keys error "Bad keyword argument %s" cl-seq1 cl-seq2 cl-len cl-first nil cl-if cl-pos cl-position apply mismatch] 16 "\ Search for SEQ1 as a subsequence of SEQ2. Return the index of the leftmost element of the first match found; return nil if there are no matches. Keywords supported: :test :test-not :key :start1 :end1 :start2 :end2 :from-end"]) (fset 'sort* #[(cl-seq cl-pred &rest cl-keys) "<ｬ消ﾂﾃﾄﾅ\"$\"ﾈ>A@ \nｫ\n@ﾋ>ｬ称>A@ｬﾍﾎ\n@\"\nAA\nｬa) ﾏ>ｫﾐ\"ｪﾐﾑ\")" [cl-seq replace apply sort* append nil cl-pred cl-keys :key cl-key cl-keys-temp (:key) :allow-other-keys error "Bad keyword argument %s" (nil identity) sort #[(cl-x cl-y) " \n! !\"" [cl-pred cl-key cl-x cl-y] 4]] 8 "\ Sort the argument SEQUENCE according to PREDICATE. This is a destructive function; it reuses the storage of SEQUENCE if possible. Keywords supported: :key"]) (fset 'stable-sort #[(cl-seq cl-pred &rest cl-keys) "ﾀﾁ\n $" [apply sort* cl-seq cl-pred cl-keys] 5 "\ Sort the argument SEQUENCE stably according to PREDICATE. This is a destructive function; it reuses the storage of SEQUENCE if possible. Keywords supported: :key"]) (fset 'merge #[(cl-type cl-seq1 cl-seq2 cl-pred &rest cl-keys) "<ｬﾁﾂ\" <ｬﾁ ﾂ\"ﾄ >A@ ｫ@ﾈ>ｬ舎 >A@ｬﾊﾋ@\"AAｬb)ﾂ ｫｺ ｫｷ ｫ @!ｪ @ｫ@!ｪ@\"ｫ 陰@ B ｪO陰@ B ｪCﾎ ､ ､\"*" [cl-seq1 append nil cl-seq2 :key cl-keys cl-key cl-keys-temp (:key) :allow-other-keys error "Bad keyword argument %s" cl-res cl-pred coerce cl-type] 5 "\ Destructively merge the two sequences to produce a new sequence. TYPE is the sequence type to return, SEQ1 and SEQ2 are the two argument sequences, and PRED is a `less-than' predicate on the elements. Keywords supported: :key"]) (fset 'member* #[(cl-item cl-list &rest cl-keys) "ﾗﾁ>A@ﾃ>A@ｭ甘>A@ｭﾄﾆ>A@ﾈ>A@ ﾊ>A@ｭ玉>A@ ｭﾄ  ｫ @ﾍ>ｬ斜>A@ｬﾏﾐ @\" AA ｬb)ｫ\nｫ禄nｫ@!ｪ@\"? =ｪﾇ ｫ ｫ@!ｪ@!? =ｪｫｧｫｫ@!ｪ@坎ｫ@!ｪ@=ｬAｬ-ｧｫｨｬ插>" [cl-keys :test cl-test :test-not t cl-test-not :key cl-key :if cl-if :if-not cl-if-not cl-keys-temp (:test :test-not :key :if :if-not) :allow-other-keys error "Bad keyword argument %s" cl-list cl-item] 5 "\ Find the first occurrence of ITEM in LIST. Return the sublist of LIST whose car is ITEM. Keywords supported: :test :test-not :key"]) (fset 'member-if #[(cl-pred cl-list &rest cl-keys) "ﾀﾁﾂ ﾄ &" [apply member* nil cl-list :if cl-pred cl-keys] 7 "\ Find the first item satisfying PREDICATE in LIST. Return the sublist of LIST whose car matches. Keywords supported: :key"]) (fset 'member-if-not #[(cl-pred cl-list &rest cl-keys) "ﾀﾁﾂ ﾄ &" [apply member* nil cl-list :if-not cl-pred cl-keys] 7 "\ Find the first item not satisfying PREDICATE in LIST. Return the sublist of LIST whose car matches. Keywords supported: :key"]) (fset 'cl-adjoin #[(cl-item cl-list &rest cl-keys) "ﾀ >A@ﾃﾄ\nｫ\n !ｪ  $)ｫ B" [:key cl-keys cl-key apply member* cl-item cl-list] 5]) (fset 'assoc* #[(cl-item cl-alist &rest cl-keys) "ﾁ>A@ﾃ>A@ｭ甘>A@ｭﾄﾆ>A@ﾈ>A@ ﾊ>A@ｭ玉>A@ ｭﾄ  ｫ @ﾍ>ｬ斜>A@ｬﾏﾐ @\" AA ｬb)ｫ@:ｫ\nｫ喀nｫ@@!ｪ@@\"? =ｪﾍ ｫ ｫ@@!ｪ@@!? =ｪｯｧｫｫ@@!ｪ@@坎ｫ@@!ｪ@@=ｬAｬｭ@-ｧｫｨｬﾓ\"梏" [cl-keys :test cl-test :test-not t cl-test-not :key cl-key :if cl-if :if-not cl-if-not cl-keys-temp (:test :test-not :key :if :if-not) :allow-other-keys error "Bad keyword argument %s" cl-alist cl-item assoc] 5 "\ Find the first item whose car matches ITEM in LIST. Keywords supported: :test :test-not :key"]) (fset 'assoc-if #[(cl-pred cl-list &rest cl-keys) "ﾀﾁﾂ ﾄ &" [apply assoc* nil cl-list :if cl-pred cl-keys] 7 "\ Find the first item whose car satisfies PREDICATE in LIST. Keywords supported: :key"]) (fset 'assoc-if-not #[(cl-pred cl-list &rest cl-keys) "ﾀﾁﾂ ﾄ &" [apply assoc* nil cl-list :if-not cl-pred cl-keys] 7 "\ Find the first item whose car does not satisfy PREDICATE in LIST. Keywords supported: :key"]) (fset 'rassoc* #[(cl-item cl-alist &rest cl-keys) "ｬ ｧﾂ>A@ﾄ>A@ｭ監>A@ｭﾅﾇ>A@ﾉ>A@\nﾋ>A@ｭ桐>A@\nｭﾅ  ｫ @ﾎ>ｬ煮>A@ｬﾐﾑ @\" AA ｬb)ｫ@:ｫ ｫ ｫ@A!ｪ@A\"?=ｪﾊ\nｫ\nｫ@A!ｪ@A!? =ｪｬ ｧｫ ｫ@A!ｪ@A坎 ｫ@A!ｪ@A=ｬAｬ ｭ@-ﾓ \"" [cl-keys cl-item :test cl-test :test-not t cl-test-not :key cl-key :if cl-if :if-not cl-if-not cl-keys-temp (:test :test-not :key :if :if-not) :allow-other-keys error "Bad keyword argument %s" cl-alist rassq] 5 "\ Find the first item whose cdr matches ITEM in LIST. Keywords supported: :test :test-not :key"]) (fset 'rassoc #[(item alist) "ﾀ \nﾃﾄ$" [rassoc* item alist :test equal] 5]) (fset 'rassoc-if #[(cl-pred cl-list &rest cl-keys) "ﾀﾁﾂ ﾄ &" [apply rassoc* nil cl-list :if cl-pred cl-keys] 7 "\ Find the first item whose cdr satisfies PREDICATE in LIST. Keywords supported: :key"]) (fset 'rassoc-if-not #[(cl-pred cl-list &rest cl-keys) "ﾀﾁﾂ ﾄ &" [apply rassoc* nil cl-list :if-not cl-pred cl-keys] 7 "\ Find the first item whose cdr does not satisfy PREDICATE in LIST. Keywords supported: :key"]) (fset 'union #[(cl-list1 cl-list2 &rest cl-keys) "ｬ ｬ 圻G GYｬ  ｫ､\nｬ @ｧｫ甘ﾄ @\n$ｪ @>ｬ @B 陰穐Y" [cl-list1 cl-list2 cl-keys apply adjoin] 5 "\ Combine LIST1 and LIST2 using a set-union operation. The result list contains all items that appear in either LIST1 or LIST2. This is a non-destructive function; it makes a copy of the data if necessary to avoid corrupting the original LIST1 and LIST2. Keywords supported: :test :test-not :key"]) (fset 'nunion #[(cl-list1 cl-list2 &rest cl-keys) "ｬ ｬﾂﾃ $" [cl-list1 cl-list2 apply union cl-keys] 5 "\ Combine LIST1 and LIST2 using a set-union operation. The result list contains all items that appear in either LIST1 or LIST2. This is a destructive function; it reuses the storage of LIST1 and LIST2 whenever possible. Keywords supported: :test :test-not :key"]) (fset 'intersection #[(cl-list1 cl-list2 &rest cl-keys) "ｭ ｭ 圻ﾂ >A@ ｫ @ﾆ>ｬ塞 >A@ｬﾈﾉ @\" AAｬf)ﾊ G GYｬ  ｫｮ ｬ @ｧｫ栂ﾍ ｫ @!ｪ @ $ｪ @>ｫ @ B 陰穐O *" [cl-list1 cl-list2 :key cl-keys cl-key cl-keys-temp (:key :test :test-not) :allow-other-keys error "Bad keyword argument %s" nil cl-res apply member*] 6 "\ Combine LIST1 and LIST2 using a set-intersection operation. The result list contains all items that appear in both LIST1 and LIST2. This is a non-destructive function; it makes a copy of the data if necessary to avoid corrupting the original LIST1 and LIST2. Keywords supported: :test :test-not :key"]) (fset 'nintersection #[(cl-list1 cl-list2 &rest cl-keys) "ｭ ｭﾂﾃ $" [cl-list1 cl-list2 apply intersection cl-keys] 5 "\ Combine LIST1 and LIST2 using a set-intersection operation. The result list contains all items that appear in both LIST1 and LIST2. This is a destructive function; it reuses the storage of LIST1 and LIST2 whenever possible. Keywords supported: :test :test-not :key"]) (fset 'set-difference #[(cl-list1 cl-list2 &rest cl-keys) "ｫ ｬﾂ >A@ ｫ @ﾆ>ｬ塞 >A@ｬﾈﾉ @\" AAｬf)ﾊ ｫｮ ｬ@ｧｫ栂ﾍ ｫ @!ｪ@ $ｪ@ >ｬ@ B 陰穐O *" [cl-list1 cl-list2 :key cl-keys cl-key cl-keys-temp (:key :test :test-not) :allow-other-keys error "Bad keyword argument %s" nil cl-res apply member*] 6 "\ Combine LIST1 and LIST2 using a set-difference operation. The result list contains all items that appear in LIST1 but not LIST2. This is a non-destructive function; it makes a copy of the data if necessary to avoid corrupting the original LIST1 and LIST2. Keywords supported: :test :test-not :key"]) (fset 'nset-difference #[(cl-list1 cl-list2 &rest cl-keys) "ｫ ｬﾂﾃ $" [cl-list1 cl-list2 apply set-difference cl-keys] 5 "\ Combine LIST1 and LIST2 using a set-difference operation. The result list contains all items that appear in LIST1 but not LIST2. This is a destructive function; it reuses the storage of LIST1 and LIST2 whenever possible. Keywords supported: :test :test-not :key"]) (fset 'set-exclusive-or #[(cl-list1 cl-list2 &rest cl-keys) "ｬ ｬ 圻つﾃﾄﾅ $ﾄﾅ $\"" [cl-list1 cl-list2 nil append apply set-difference cl-keys] 7 "\ Combine LIST1 and LIST2 using a set-exclusive-or operation. The result list contains all items that appear in exactly one of LIST1, LIST2. This is a non-destructive function; it makes a copy of the data if necessary to avoid corrupting the original LIST1 and LIST2. Keywords supported: :test :test-not :key"]) (fset 'nset-exclusive-or #[(cl-list1 cl-list2 &rest cl-keys) "ｬ ｬ 圻つﾃﾄ $ﾃﾄ  $､" [cl-list1 cl-list2 nil apply nset-difference cl-keys] 6 "\ Combine LIST1 and LIST2 using a set-exclusive-or operation. The result list contains all items that appear in exactly one of LIST1, LIST2. This is a destructive function; it reuses the storage of LIST1 and LIST2 whenever possible. Keywords supported: :test :test-not :key"]) (fset 'subsetp #[(cl-list1 cl-list2 &rest cl-keys) "ｬっ\nｬづ\n圻っﾄ >A@ ｫ@ﾈ>ｬ舎 >A@ｬﾊﾋ@\"AAｬb)ｫ嵶ﾍｫ@!ｪ@\n $ｫ陰穐b)?" [cl-list1 t cl-list2 nil :key cl-keys cl-key cl-keys-temp (:key :test :test-not) :allow-other-keys error "Bad keyword argument %s" apply member*] 6 "\ True if LIST1 is a subset of LIST2. I.e., if every element of LIST1 also appears in LIST2. Keywords supported: :test :test-not :key"]) (fset 'subst-if #[(cl-new cl-pred cl-tree &rest cl-keys) "ﾀﾁﾂ BC ﾅ&" [apply sublis nil cl-new cl-tree :if cl-pred cl-keys] 7 "\ Substitute NEW for elements matching PREDICATE in TREE (non-destructively). Return a copy of TREE with all matching elements replaced by NEW. Keywords supported: :key"]) (fset 'subst-if-not #[(cl-new cl-pred cl-tree &rest cl-keys) "ﾀﾁﾂ BC ﾅ&" [apply sublis nil cl-new cl-tree :if-not cl-pred cl-keys] 7 "\ Substitute NEW for elts not matching PREDICATE in TREE (non-destructively). Return a copy of TREE with all non-matching elements replaced by NEW. Keywords supported: :key"]) (fset 'nsubst #[(cl-new cl-old cl-tree &rest cl-keys) "ﾀﾁ\n BC $" [apply nsublis cl-old cl-new cl-tree cl-keys] 5 "\ Substitute NEW for OLD everywhere in TREE (destructively). Any element of TREE which is `eql' to OLD is changed to NEW (via a call to `setcar'). Keywords supported: :test :test-not :key"]) (fset 'nsubst-if #[(cl-new cl-pred cl-tree &rest cl-keys) "ﾀﾁﾂ BC ﾅ&" [apply nsublis nil cl-new cl-tree :if cl-pred cl-keys] 7 "\ Substitute NEW for elements matching PREDICATE in TREE (destructively). Any element of TREE which matches is changed to NEW (via a call to `setcar'). Keywords supported: :key"]) (fset 'nsubst-if-not #[(cl-new cl-pred cl-tree &rest cl-keys) "ﾀﾁﾂ BC ﾅ&" [apply nsublis nil cl-new cl-tree :if-not cl-pred cl-keys] 7 "\ Substitute NEW for elements not matching PREDICATE in TREE (destructively). Any element of TREE which matches is changed to NEW (via a call to `setcar'). Keywords supported: :key"]) (fset 'sublis #[(cl-alist cl-tree &rest cl-keys) "ﾀ >A@ﾃ >A@ｭ甘 >A@ｭﾄﾆ >A@ﾈ >A@ ﾊ >A@ｭ玉 >A@ ｭﾄ  ｫ @ﾍ>ｬ斜 >A@ｬﾏﾐ @\" AA ｬb)ﾑ!-" [:test cl-keys cl-test :test-not t cl-test-not :key cl-key :if cl-if :if-not cl-if-not cl-keys-temp (:test :test-not :key :if :if-not) :allow-other-keys error "Bad keyword argument %s" cl-sublis-rec cl-tree] 4 "\ Perform substitutions indicated by ALIST in TREE (non-destructively). Return a copy of TREE with all matching elements replaced. Keywords supported: :test :test-not :key"]) (fset 'cl-sublis-rec #[(cl-tree) "ｫ !ｪ \n ｫｷ ｫ @@ \"?=ｪｫ !?=ｪ @@ｧｫ @@ 坎 @@ =ｬ AｬI ｫ @Aｪｩ :ｫ､ﾉ @!ﾉ A!\n @=ｫ\n A=ｫ ｪ \nB*ｪ *" [cl-key cl-tree cl-alist cl-p cl-temp cl-test cl-test-not cl-if cl-if-not cl-sublis-rec cl-d cl-a] 4]) (fset 'nsublis #[(cl-alist cl-tree &rest cl-keys) "ﾀ >A@ﾃ >A@ｭ甘 >A@ｭﾄﾆ >A@ﾈ >A@ ﾊ >A@ｭ玉 >A@ ｭﾄ  ｫ @ﾍ>ｬ斜 >A@ｬﾏﾐ @\" AA ｬb)Cﾓ!@." [:test cl-keys cl-test :test-not t cl-test-not :key cl-key :if cl-if :if-not cl-if-not cl-keys-temp (:test :test-not :key :if :if-not) :allow-other-keys error "Bad keyword argument %s" cl-tree cl-hold cl-nsublis-rec] 4 "\ Perform substitutions indicated by ALIST in TREE (destructively). Any matching element of TREE is changed via a call to `setcar'. Keywords supported: :test :test-not :key"]) (fset 'cl-nsublis-rec #[(cl-tree) ":ｾ ｫ @!ｪ@\n ｫｷ ｫ @@ \"?=ｪｫ !?=ｪ @@ｧｫ @@ 坎 @@ =ｬ AｬI ｫ @A穐@:ｫﾉ@! ｫ A!ｪA\nｫｷ ｫ @@ \"?=ｪｫ !?=ｪ @@ｧｫ @@ 坎 @@ =ｬ AｬI ｫ @A｡位ｪA*" [cl-tree cl-key cl-alist cl-p cl-temp cl-test cl-test-not cl-if cl-if-not cl-nsublis-rec nil] 4]) (fset 'tree-equal #[(cl-x cl-y &rest cl-keys) "ﾀ >A@ﾃ >A@ｭ甘 >A@ｭﾄﾆ >A@ ｫ@ﾉ>ｬ写 >A@ｬﾋﾌ@\"AAｬb)ﾍ\"+" [:test cl-keys cl-test :test-not t cl-test-not :key cl-key cl-keys-temp (:test :test-not :key) :allow-other-keys error "Bad keyword argument %s" cl-tree-equal-rec cl-x cl-y] 4 "\ T if trees X and Y have `eql' leaves. Atoms are compared by `eql'; cons cells are compared recursively. Keywords supported: :test :test-not :key"]) (byte-code "ﾀﾁM按ﾃ!" [cl-tree-equal-rec #[(cl-x cl-y) ":ｫ :ｫ青@ @\"ｫA Aｪh:?ｭﾓ :?ｭﾎ ｫ ｫ !ｪ ｫ !ｪ \"? = ｫ !ｪｧｫ ｫ !ｪ ｫ !ｪ 嚊 ｫ !ｪ ｫ !ｪ =" [cl-x cl-y cl-tree-equal-rec cl-test cl-key cl-test-not] 4] run-hooks cl-seq-load-hook] 2)