ELF@0 @8@##0 0 ###pppD???4p<?=@<@=@<]A DdA?bA4`0p@=@B`<WA5P>XA=@B`<UA5P>VA= @B`<SA5P>TA= @B`<QA5P>RA=@B`<OA5P>PA=@B`<MA5P>NA=@B`<KA5P>LA=@B`<IA5P>JA=@B`<GA5P>HA=@B`<EA5P=@B`<CA5P>DA=@B`<AA5P>BA= @B`<?A5P>@A="@B`<=A5P>>A=$@B`<;A5P=(@B`<9A5P=,@B`<7A5P=0@B`<5A5P>6A=2@B`<3A5P>4A=4@B`<1A5P>2A=6@B`</A5P=:@B`<-A5P=>@B`<+A5P>,A=@@Bp<)A5`9 PD0A?.A4p0`0PP"Q 0P `##CA@@?4SpCA@/?4@Rp0@0`` 0P 0` `#?9#1RpDA>A4@0P0`` "SpQ!Sp#RpD@>@4@0P0`` "SpQ#!Sp#C@B@@4p0p00`0` `9#1RpD@>@4@0P0`` "SpQ!Sp#RpD@p>@4@0P0`` "SpQ#!Sp#C@@@4p0p00`P#C@?>4RP0p0`` SP0`  #S #C}@?>4R 00@0R 0   # :D r@>p@4 Dx@>v@4# (RCz@?x@4`00  00p0P  " S 4`00p !0 p 9  # R0P " S !0 9   # ;9 D @=@4 D&@=$@4# (RC*@~?&@4`00 00p0P " S 4`00!9  0 # R0P" S !9  9   9C?D?=400P0@0"90`  9C?2?=400P0@0"90` @9##R@0PP"9S@!S@#R@0PP"WS@#!S@#0` @#R@0PP" C?>=4`S@R@ 9 @#R@0PP" Cw?>=4`S@0@ 9 P9#*RP0`P"SPRPQ!SP0P#R@0``" S@R@Q# 0P!S@#0P!0@C>?>?4`0`0p0PP9#*RP0`P"SPRPQ!SP0P#R@0``" S@R@Q# 0P!S@#0P!0@C ?y>>4`0`0p0P00@#R@0P@" S@0P@UP S@9 00@#R@0P@" S@0P@UP S@9 @D>7<>4`0PPX9<>D>!<>4P0@0P0` 0`000#R@S@;V90@0Q 9   #R "C>=<40S 0 0009 9  #R "Cm>=<40S 0 0009 9 P#9Cb>=`>4@RPSP@" CU>=<4`SP0` 9 @9#%R@0PP"R@QS@!S@#R@0PP"R@QS@#!S@#0` @9##R@0PP"QS@!S@#R@0PP"QS@#!S@#0` `9#+R`Di=?;g=4@0P0pP"QS`#R`DT=*;R=4@0P0pP"QS`#C=1=[=4`0`0p0P?:Q<:O>:?:Q<:O>:=:>:?::?:H<:O>:?:F<:O>:=:>:=:>:?::?:;<:O>:=:P>:?:6?;=<:O>;=:P>:?;6<:O>;?;4<:O>;?;2<:O>;?;2<;O>;?;2<;O>;? ;2<;O> ;? ;0<;O> ;?;.< ;O>;?;,< ;O>;?;*< ;O>;?;*<;O>;?;*<;O>;?;(<;O>;?;(<;O>;?;(<;O>;?;(<;O>;? ;(<;O> ;?";(<;O>";?$;&<;O>$;?&;$<!;O>&;?(;"<#;O>(;?*;"<%;O>*;?,; <';O>,;?.; <);O>.;=,;>,;=;>,;?,;&;= ;>);?);#;=:>&;?&; ;=:>#;?#;;=:> ;? ;;=:>;?;;=:>;?;;=:>;?;;=:>;?;;=:>;?; ;=t:>;?;;=c:> ;? ;;=R:>;?;;=A:>;?;:=0:>;?;:=:>:?::=:>:?::=9>:?::=9>:?::=9>:?::=9>:?::=9>:?::=9>:?::?:y<:O>:?:H?:[?:z?:?:?: ?;?;l?;? ;? ;?; ?;"?;:?;n?;?;?;?;+? ;C?#;[?$;z?%;?(;?);3<$;O>);?1;1<,;O>1;?5;/<0;O>5;??;/<:;O>?;?C;-<>;O>C;?G;+<B;O>G;?Y;)<T;O>Y;?];'?b;0<];O>b;?j;.<e;O>j;9 'define-module*'guile'ice-9' common-list'filename'ice-9/common-list.scm'exports'adjoin'union' intersection'set-difference' reduce-init'reduce'some'every'notany'notevery'count-if'find-if' member-if' remove-if' remove-if-not' delete-if!'delete-if-not!'butlast'and?'or?'has-duplicates?'pick' pick-mappings'uniq'set-current-module'memq'memv'reverse!'car'cdr'map'length'negative argument to butlast'error'member889:;<=|>|?ACEFH JX L M( Nl O P Qt R S, T U V W X@YhZ[\]D^_`,abc(*"*(* (**((**  ( ******`7A`7`7`70 0`7 "        EEEEEEEEEEEEEEEEEEEEEEEEpxx0  * " "d<##pEX$M!UX%kp@ z%  p(/X``:/0 @\U\]<r <HH@@H c@{@  ( H C H ^ T  T   x .x    D D ,  ,'  B ghhH                          !$ ,4<DXlp-/ 168D:= (,0 DHLh:= 1 :@:@ 1 :@@  04P\dhhhppx := 1 :@:@ 1 :@@  (,HT\```hhp GI/   $( DH G/ 6, 0 4LN/S /S 1 6/ 6   (,@DDD Thl$$ N/SX /S 1 6/ 66   ,0DHHH Xlp( (  N_X 16  $ (, HTN_X 16  $ (, HTN/  b/b/  b/b, 8@DDDLLTl x|N/  66(DHLXdN/  6(DHLdN/  /@/@  /@@ , 8 <DHL LT T\t N/  /@/@  /@@ , 8 <DHL LT T\t N//   6(4P`pN//   6(4P`pdb 1/hk 148< H\ptdbk o66(,8 <@ \`lu 166 48<@Xdu 166 48<@XddX  6$(,0D`dhG/  z/z/  z/z, 8 <DHHHPPXp | G/  z/z/  z/z, 8@DDDLLTl x|/ 1 |/ 1 |/| ( ,H TX``h|  \I<H;@q@b  H Z T ! [ x -U, V h 3\ DX$ '06(\B`IDN( HTp `[ `d0 m lu< l  `xxx,|llP0H %.. .Guile 2.2.7adjoinunionintersectionset-differencereduce-initreducesomeeverynotanynoteverycount-iffind-ifmember-ifremove-ifremove-if-notdelete-if!delete-ifdelete-if-not!delete-if-notbutlastbland?or?has-duplicates?pickpick-mappingsuniq6) ice-9/common-list.scm 4w{ Qqq JrT~,j !-'ww "-- )-2#, -, )-2#<. h - . ,%  - ,.  =%  - h]'w[ #- Xk B&<.ww -(,{h<h*, ?&<.ww -(,98<h*,XBjj /- g!-), - ,g!-) < . ? - g+k - g  - g.%,!  - ,g.% .!+ - +w]  -g.%,' ! -,g.% .'+ !- +w] i- g#/ w&9:A i-g'/ w09!:A#i,{Y-i-7J),w<^ =-! =-  X    -f%.0,!  -,f%.0<!. ?   -f1.B+,!  -,f1.B+<!. ? .. {.,. {. i\\X< H*@\6`=DB@HH `O `XH a liT ls } x  x xD|l,l hHH adjoinunionintersectionset-differencereduce-initreducesomeeverynotanynoteverycount-iffind-ifmember-ifremove-ifremove-if-notdelete-if!delete-ifdelete-if-not!delete-if-notbutlastbland?or?has-duplicates?pickpick-mappingsuniqclosureboxargtmpmodulenameunspecifiedelprocvall1l2resultpinitpredrestbound?lsnlstblu64falseargssaccReturn list L, possibly with element E added if it is not already in L.Return a new list that is the union of L1 and L2. Elements that occur in both lists occur only once in the result list.Return a new list that is the intersection of L1 and L2. Only elements that occur in both lists occur in the result list.Return elements from list L1 that are not in list L2.Same as `reduce' except it implicitly inserts INIT at the start of L.Combine all the elements of sequence L using a binary operation P. The combination is left-associative. For example, using +, one can add up all the elements. `reduce' allows you to apply a function which accepts only two arguments to more than 2 objects. Functional programmers usually refer to this as foldl.PRED is a boolean function of as many arguments as there are list arguments to `some', i.e., L plus any optional arguments. PRED is applied to successive elements of the list arguments in order. As soon as one of these applications returns a true value, return that value. If no application returns a true value, return #f. All the lists should have the same length.Return #t iff every application of PRED to L, etc., returns #t. Analogous to `some' except it returns #t if every application of PRED is #t and #f otherwise.Return #t iff every application of PRED to L, etc., returns #f. Analogous to some but returns #t if no application of PRED returns a true value or #f as soon as any one does.Return #t iff there is an application of PRED to L, etc., that returns #f. Analogous to some but returns #t as soon as an application of PRED returns #f, or #f otherwise.Return the number of elements in L for which (PRED element) returns true.Search for the first element in L for which (PRED element) returns true. If found, return that element, otherwise return #f.Return the first sublist of L for whose car PRED is true.Remove all elements from L where (PRED element) is true. Return everything that's left.Remove all elements from L where (PRED element) is #f. Return everything that's left.Destructive version of `remove-if'.Destructive version of `remove-if-not'.Return all but the last N elements of LST.Return #t iff all of ARGS are true.Return #t iff any of ARGS is true.Return #t iff 2 members of LST are equal?, else #f.Apply P to each element of L, returning a list of elts for which P returns a non-#f value.Apply P to each element of L, returning a list of the non-#f return values of P.Return a list containing elements of L, with duplicates removed..guile.procprops.rodata.data.rtl-text.guile.frame-maps.dynamic.strtab.symtab.guile.arities.strtab.guile.arities.guile.docstrs.strtab.guile.docstrs.debug_info.debug_abbrev.debug_str.debug_loc.debug_line.shstrtab