9iԅ ~%SSKJr SSKrSSKrSSKrSSKrSSKrSSKrSSKJr SSK J r SSK J r J r SSKJr SSKJr SSKJrJrJrJrJrJr \(aSSKrSS KJr \"S 5rO\"S 5r\"S 5r\R<"S 5r\ \ \ /\!4r"\ \#\ \ 4/\!4r$"S S5r%"SS\%5r&"SS\%5r'"SS\%5r("SS\%5r)"SS\%5r*"SS\%5r+"SS\%5r,"SS\\\45r-"SS \%5r.S\%0r/S!\0S"'S$S%S#jjr1\%\&\*\'\)\(\+\,\.4 H r2\1"\25 M g)&) annotationsN) OrderedDict)Callable)FutureThreadPoolExecutor)groupby) itemgetter) TYPE_CHECKINGAnyClassVarGeneric NamedTupleTypeVar) ParamSpecPTfsspeccZ\rSrSr%SrSrS\S'S SjrSSjrSSjr SS jr SS jr S r g ) BaseCache"a;Pass-though cache: doesn't keep anything, calls every time Acts as base class for other cachers Parameters ---------- blocksize: int How far to read ahead in numbers of bytes fetcher: func Function of the form f(start, end) which gets bytes from remote as specified size: int How big this file is none ClassVar[str]namec`XlSUlX lX0lSUlSUlSUlgNr) blocksizenblocksfetchersize hit_count miss_counttotal_requested_bytes)selfrrrs N/var/www/html/land-doc-ocr/venv/lib/python3.13/site-packages/fsspec/caching.py__init__BaseCache.__init__4s."   %&"cvUcSnUc URnXR:dX:agURX5$)Nrr')rrr#startstops r$_fetchBaseCache._fetch>s: =E <99D II ||E((r'c.SUlSUlSUlg)zAReset hit and miss counts for a more ganular report e.g. by file.rN)r r!r"r#s r$ _reset_statsBaseCache._reset_statsGs%&"r'c URS:XaURS:XagSURSURSURSURS3 $)z2Return a formatted string of the cache statistics.rz , z: z hits, z misses, z total requested bytes)r r!rr"r/s r$ _log_statsBaseCache._log_statsMs^ >>Q 4??a#7TYYKr$..!18ISWSmSmRnoEF Fr'cSURRSURSURSURSUR SUR SURS3$) Nz ) __class____name__rrrr r!r"r/s r$__repr__BaseCache.__repr__Ts .. ! ! "#!^^,-!\\N+!YYK(!^^,-!__-.$$($>$>#?@   r')rrr r!rrr"NrintrFetcherrr<returnNoner* int | Noner+rAr>bytesr>r?)r>str) r8 __module__ __qualname____firstlineno____doc__r__annotations__r%r,r0r4r9__static_attributes__r'r$rr"s- !D- ')' F  r'rc^\rSrSrSrSrS S U4SjjjrS SjrS SjrSSjr SSjr S r U=r $) MMapCacheaamemory-mapped sparse file cache Opens temporary file, which is filled blocks-wise when data is requested. Ensure there is enough disc space in the temporary location. This cache method might only work on posix Parameters ---------- blocksize: int How far to read ahead in numbers of bytes fetcher: Fetcher Function of the form f(start, end) which gets bytes from remote as specified size: int How big this file is location: str Where to create the temporary file. If None, a temporary file is created using tempfile.TemporaryFile(). blocks: set[int] Set of block numbers that have already been fetched. If None, an empty set is created. multi_fetcher: MultiFetcher Function of the form f([(start, end)]) which gets bytes from remote as specified. This function is used to fetch multiple blocks at once. If not specified, the fetcher function is used instead. mmapc>[TU]XU5 Uc [5OUUlX@lX`lUR 5UlgN)superr%setblockslocation multi_fetcher _makefilecache)r#rrrrUrTrVr7s r$r%MMapCache.__init__s< T2%~ce6  *^^% r'cDSSKnSSKnURS:Xa [5$URb.[ R RUR5(dURc UR5n[5Ul O[URS5nURURS- 5 URS5 UR5 O[URS5nUR"UR5UR5$)Nrzwb+1zr+b)rOtempfiler bytearrayrUospathexists TemporaryFilerSrTopenseekwriteflushfileno)r#rOr]fds r$rWMMapCache._makefiles 99>;  == t}}(E(E}}$++-!e $--/ GGDIIM " HHTN HHJdmmU+Byydii00r'c *^[RSUSU35 UcSnUc TRnUTR:dX:agUTR-nUTR-n[ X4S-5nU4SjU5nT=R [ U4SjU55- sl/n[[U5SS 9Hup[[[S5U 55n U STR-n [U S TR-TR-TR5n T=RX- - sl [RS U SSU S S U SU S 3 5 URX45 TRR!U 5 T=R"[%U 5- slM U(dTR&X$TR((ak[RS U35 [TR)U55H4upX|up[RSU SU 35 U TR&X&M6 OCUH=up[RSU SU 35 TR+X5TR&X&M? TR&X$)NzMMap cache fetching -rr'r[c3J># UHoTR;dMUv M g7frQrT.0ir#s r$ #MMapCache._fetch..s?;a4;;*>;# #c3J># UHoTR;dMSv M g7f)r[Nrmrns r$rqrrsIAT[[8HaarscUSUS- $)Nrr[rK)xs r$"MMapCache._fetch..s1!r')keyzMMap get blocks z ()zMMap copy block (zMMap get block ()loggerdebugrrranger sumr enumeratetuplemapr minr"appendrTupdater!lenrXrVr)r#r*end start_block end_block block_rangeneedranges__blockssstartsendidxrs` r$r,MMapCache._fetchsN +E7!C59: =E ;))C DII t~~- 4>>) KQ7 ?;? #IIII")D/7LMJAC 1 w78GQZ$..0Fwr{T^^3dnnDdiiPD  & &$- 7 & LL"71:,a }BvhavQO  MM6. ) KK  w ' OOs7| +O%N(::e( (    LL+F84 5#D$6$6v$>?!' 0$@A*+ 6'@ !'  /xq?@*.,,v*D 6'!'zz%$$r'c@URR5nUS U$)NrX)__dict__copyr#states r$ __getstate__MMapCache.__getstate__s  ""$ 'N r'cdURRU5 UR5UlgrQ)rrrWrXrs r$ __setstate__MMapCache.__setstate__s" U#^^% r')rTrXrUrV)NNN)rr<rr=rr<rUz str | NonerTzset[int] | NonerVzMultiFetcher | Noner>r?)r>zmmap.mmap | bytearrayr*rArrAr>rBr>dict[str, Any]rrr>r?) r8rErFrGrHrr%rWr,rrrJ __classcell__r7s@r$rMrMas8 D $"&-1 & & & &  &  &+ &  & &1,<%| &&r'rMc>^\rSrSrSrSrSU4SjjrSSjrSrU=r $) ReadAheadCacheaCache which reads only when we get beyond a block of data This is a much simpler version of BytesCache, and does not attempt to fill holes in the cache or keep fragments alive. It is best suited to many small reads in a sequential order (e.g., reading lines from a file). readaheadcP>[TU]XU5 SUlSUlSUlg)Nr'r)rRr%rXr*rr#rrrr7s r$r%ReadAheadCache.__init__s' T2  r'cTUcSnUbX R:a URnXR:dX:agX!- nXR:aKX R::a<U=RS- slURXR- X R- $URUs=::aUR:aNO OKU=R S- slURXR- SnU[ U5-nURnOU=R S- slSn[URX R-5nU=RX!- - sl URX5UlXlUR[ UR5-UlX@RSU-$Nrr'r[) rr*rr rXr!rrrr"r)r#r*rlparts r$r,ReadAheadCache._fetchsI =E ;# /))C II  K JJ 3((? NNa N::ejj033CD D ZZ5 +488 + OOq O::ejj023D TNAHHE OOq OD$))S>>12 ""ck1"\\%-  ::DJJ/jj!n$$r')rXrr*r;r r8rErFrGrHrr%r,rJrrs@r$rrs D %%r'rc>^\rSrSrSrSrSU4SjjrSSjrSrU=r $) FirstChunkCacheizCaches the first block of a file only This may be useful for file types where the metadata is stored in the header, but is randomly accessed. firstcB>X:aUn[TU]XU5 SUlgrQ)rRr%rXrs r$r%FirstChunkCache.__init__&s$  I T2#' r'clU=(d SnXR:a[RS5 g[X R5nXR:Ga#UR cU=R S- slX R:a?U=RU- slURSU5nUSURUlX1S$URSUR5UlU=RUR- slUR XnX R:a?U=RX R- - slX@RURU5- nU=RS- sl U$U=R S- slU=RX!- - slURX5$)Nrz,FirstChunkCache: requested start > file sizer'r[) rr|r}rrrXr!r"rr )r#r*rdatars r$r,FirstChunkCache._fetch-sR  99  LLG H#yy! >> !zz!1$'..#5.<<3/D!%&6!7DJ<'!\\!T^^< **dnn<*::e(D^^#**cNN.BB* T^^S99 NNa NK OOq O  & &#+ 5 &<<+ +r')rXr;rrrs@r$rrs D(,,r'rc^\rSrSrSrSrS S U4SjjjrSrSSjrSSjr SSjr SU4S jjr SS jr S r U=r$) BlockCacheiKa Cache holding memory as a set of blocks. Requests are only ever made ``blocksize`` at a time, and are stored in an LRU cache. The least recently accessed block is discarded when more than ``maxblocks`` are stored. Parameters ---------- blocksize : int The number of bytes to store in each block. Requests are only ever made for ``blocksize``, so this should balance the overhead of making a request against the granularity of the blocks. fetcher : Callable size : int The total size of the file being cached. maxblocks : int The maximum number of blocks to cache for. The maximum memory use for this cache is then ``blocksize * maxblocks``. blockcachec>[TU]XU5 [R"X1- 5UlX@l[ R"U5"UR5Ul grQ) rRr%mathceilr maxblocks functools lru_cache _fetch_block_fetch_block_cachedr#rrrrr7s r$r%BlockCache.__init__dsJ T2yy!12 "#,#6#6y#A$BSBS#T r'c6URR5$zz The statistics on the block cache. Returns ------- NamedTuple Returned directly from the LRU Cache used internally. r cache_infor/s r$rBlockCache.cache_infol''2244r'c$URnUS U$)Nrrrs r$rBlockCache.__getstate__ws  ' ( r'cURRU5 [R"US5"UR5Ulg)Nr)rrrrrrrs r$rBlockCache.__setstate__|s: U##,#6#6u[7I#J   $  r'cUcSnUc URnXR:dX:agXR-nX R-n[X4S-5HnURU5 M UR UUUUS9$)Nrr'r[start_block_numberend_block_number)rrr~r _read_cache)r#r*rrr block_numbers r$r,BlockCache._fetchs =E ;))C II #nn4..0""46JKL  $ $\ 2L  1-    r'c8>XR:a[SUSURS35eXR-nX R-nU=RX2- - slU=RS- sl[ R SU5 [TU]!X#5nU$)- Fetch the block of data for `block_number`. 'block_number=(' is greater than the number of blocks (r{r[zBlockCache fetching block %d) r ValueErrorrr"r!r|inforRr,)r#rr*rblock_contentsr7s r$rBlockCache._fetch_blocks ,, & /))-a9  ~~-nn$ ""ck1" 1 2LA3r'c XR-nX R-nU=RS- slX4:XaURU5nXuU$URU5US/nUR[ UR[ US-U555 UR URU5SU5 SRU5$z Read from our block cache. Parameters ---------- start, end : int The start and end byte positions. start_block_number, end_block_number : int The start and end block numbers. r[Nr'rr rextendrr~rjoin r#r*rrr start_posend_posblockouts r$rBlockCache._read_cachesNN* & !  1334FGE7+ +++,>? KLC JJ,,,q02BC  JJt//0@A(7K L88C= r')rrr rr<rr=rr<rr<r>r?rrr)rr<r>rB r*r<rr<rr<rr<r>rB)r8rErFrGrHrr%rrrr,rrrJrrs@r$rrKs, DMOUU'.U69UFIU UU 5   .$&!&!"&!8;&!OR&! &!&!r'rcl^\rSrSr%SrSrS\S'S S U4SjjjrS SjrS Sjr S r U=r $) BytesCacheia+Cache which holds data in a in-memory bytes object Implements read-ahead by the block size, for semi-random reads progressing through the file. Parameters ---------- trim: bool As we read more data, whether to discard the start of the buffer when we are more than a blocksize ahead of it. rBrrc\>[TU]XU5 SUlSUlSUlX@lg)Nr')rRr%rXr*rtrim)r#rrrrr7s r$r%BytesCache.__init__s. T2 !% # r'cUcSnUc URnXR:dX:agURbbXR:aSURbFX R:a7XR- nU=RS- slURX3U-U- $UR (a#[ URX R -5nOUnXA:XdXR:agURbXR:afURbX R:aJU=RXA- - slU=RS- slURX5UlXlGOURceURceU=RS- slXR:aURbURU- UR :a5U=RXA- - slURX5UlXlGO/U=RURU- - slURXR5nXlXPR-UlOURbX@R:aURUR:aOX R- UR :a4U=RXA- - slURX5UlXlOQU=RX@R- - slURURU5nURU-UlUR[UR5-UlXR- nURX3U-U- nUR(arURUR- UR S--nUS:aCU=RUR U-- slURUR U-SUlU$r) rr*rr rXrrr"r!rrr)r#r*roffsetbendnewrnums r$r,BytesCache._fetchs =E ;))C II  JJ "#$hhZZ'F NNa N::f|e';< < >>tyy#"67DD =EII- JJ %**"4 HH hh  & &$, 6 & OOq Oe2DJJ::) ))88' '' OOq Ozz!88#txx#~'F..$,>.!%e!:DJ!&J..$**u2DD.,,ujj9C!&J!$zz!1DJ%$/88dii'88^dnn4..$,>.!%e!:DJ!&J..$/A.,,txx6C!%c!1DJ::DJJ/#jj3,"67 9988djj(dnnq.@ACQw dnns22 !ZZ(<(>?  r'c,[UR5$rQ)rrXr/s r$__len__BytesCache.__len__5s4::r')rXrr*r)T) rr<rr=rr<rboolr>r?r)r>r<) r8rErFrGrHrrIr%r,rrJrrs@r$rrs^ "D-!IM'.69AE GRr'rch^\rSrSr%SrSrS\S'S S U4SjjjrS SjrSr U=r $) AllBytesi9z!Cache entire contents of the fileallrrc>[TU]XU5 UcPU=RS- slU=RUR- slUR SUR5nX@lg)Nr[r)rRr%r!r"rrr)r#rrrrr7s r$r%AllBytes.__init__>sU T2 < OOq O  & &$)) 3 &<<499-D r'cHU=RS- slURX$)Nr[)r rr)s r$r,AllBytes._fetchLs !yy$$r')r)NNNN) rrArzFetcher | NonerrArz bytes | Noner>r?r@) r8rErFrGrHrrIr%r,rJrrs@r$rr9sb+D-!%"&!          %%r'rc^\rSrSr%SrSrS\S'S SU4Sjjjr\S5r \ RS5r \S 5r \ RS 5r SS jr S r U=r$)KnownPartsOfAFileiQaq Cache holding known file parts. Parameters ---------- blocksize: int How far to read ahead in numbers of bytes fetcher: func Function of the form f(start, end) which gets bytes from remote as specified size: int How big this file is data: dict A dictionary mapping explicit `(start, stop)` file-offset tuples with known bytes. strict: bool, default True Whether to fetch reads that go beyond a known byte-range boundary. If `False`, any read that ends outside a known part will be zero padded. Note that zero padding will not be used for reads that begin outside a known byte-range. partsrrc >[TU]XU5 XPlU(a[UR 55nUS/nUR US5/n USSHiupUSupX:Xa%X4US'U S==UR X45- ss'M6UR X45 U R UR X455 Mk [[X55Ul g0Ul g)Nrr[rz) rRr%strictsortedkeyspoprdictzipr)r#rrrrr r old_offsetsoffsetsrTr*r+start0stop0r7s r$r%KnownPartsOfAFile.__init__js T2   -K"1~&Ghh{1~./F*12  ' >#).GBK2J$((E="99JNNE=1MM$((E="9: /S12DIDIr'c:[SUR55$)Nc36# UHoSUS- v M g7f)r[rNrK)rors r$rq)KnownPartsOfAFile.size..s2 1Q4!A$; s)rrr/s r$rKnownPartsOfAFile.sizes2 222r'cgrQrKr#values r$rr r'c,[UR5$rQ)rrr/s r$rKnownPartsOfAFile.nblockss499~r'cgrQrKrs r$rrrr'cUcSnUc URnU=RX!- - slSnSnSn[UR5GHTupgXas=::aU:aEO OBXbs=::aU::a6O O3X- nU=RS- slURXg4XU-U- s $X&::a OU(a;Xe:a6U=R S- slUR (a[eUSXe- -- nXas=::aU:a7O O4U=RS- slX- nURXg4XU-U- nSnOoX:a-X':a(U=RS- slX0RXg4- nO=Xbs=::aU::a1O O.U=RS- slX0RXg4SX&- -s $UnGMW U=R S- slU(aUR (d USX%- --$[e)Nrr'Fr[T)rr"r rr r!r r) r#r*r+rstartedloc_oldloc0loc1offs r$r,KnownPartsOfAFile._fetchs =E <99D ""dl2" +JD$$4+?4+?l!#yy$.s4Z%5GHH|4>1$;;$$w$.11#t#!#lii -c$J4FG$+!#yy$..%%!#YY|4]t{CCCG9,: 1 4;;DN33 3r')rr )NF) rr<rr=rr<rz#dict[tuple[int, int], bytes] | Noner rrr r@)r8rErFrGrHrrIr%propertyrsetterrr,rJrrs@r$rrQs,"D-!59   2   <33 [[   ^^  **r'rcd\rSrSrSr"SS\5rS S SjjrSSjrSSjr SSjr SS jr S r g ) UpdatableLRUiz[ Custom implementation of LRU cache that allows updating keys Used by BackgroudBlockCache c>\rSrSr%S\S'S\S'S\S'S\S'Srg) UpdatableLRU.CacheInfoir<hitsmissesmaxsizecurrsizerKN)r8rErFrGrIrJrKr'r$ CacheInfor,s    r'r1c[R"5UlXlX lSUlSUl[R"5Ul gr) collectionsr_cache_func _max_size_hits_misses threadingLock_lock)r#funcmax_sizes r$r%UpdatableLRU.__init__s8+6+B+B+D  !  ^^% r'cxU(a[SUR535eUR XR;aHURR U5 U=R S- slURUsSSS5 $SSS5 UR "U0UD6nUR X0RU'U=RS- sl[UR5UR:aURRSS9 SSS5 U$!,(df  N=f!,(df  U$=f)Nz Got unexpected keyword argument r[Flast) TypeErrorr r;r4 move_to_endr7r5r8rr6popitem)r#argskwargsresults r$__call__UpdatableLRU.__call__s >v{{}oNO O ZZ{{" ''- a {{4( Z" T,V, ZZ &KK  LLA L4;;$..0 ###/   ZZ  sAD/A D* D'* D9clUR XR;sSSS5 $!,(df  g=frQ)r;r4)r#rEs r$ is_key_cachedUpdatableLRU.is_key_cacheds ZZ;;&ZZs% 3cUR XRU'[UR5UR:aURR SS9 SSS5 g!,(df  g=f)NFr@)r;r4rr6rD)r#rGrEs r$add_keyUpdatableLRU.add_keysI ZZ &KK 4;;$..0 ###/ZZs A A!! A/cUR URUR[UR5UR UR S9sSSS5 $!,(df  g=f)N)r/r0r-r.)r;r1r6rr4r7r8r/s r$rUpdatableLRU.cache_infosE ZZ>>T[[)ZZ|| "ZZs AA A()r4r5r7r;r6r8N))r<zCallable[P, T]r=r<r>r?)rEzP.argsrFzP.kwargsr>r)rEr r>r)rGrrEr r>r?r>r,) r8rErFrGrHrr1r%rHrKrNrrJrKr'r$r*r*s, J &&'0 r'r*c^\rSrSr%SrSrS\S'SSU4SjjjrSSjrSSjr SS jr SS jr SSU4S jjjr SS jr S rU=r$)BackgroundBlockCacheia/ Cache holding memory as a set of blocks with pre-loading of the next block in the background. Requests are only ever made ``blocksize`` at a time, and are stored in an LRU cache. The least recently accessed block is discarded when more than ``maxblocks`` are stored. If the next block is not in cache, it is loaded in a separate thread in non-blocking way. Parameters ---------- blocksize : int The number of bytes to store in each block. Requests are only ever made for ``blocksize``, so this should balance the overhead of making a request against the granularity of the blocks. fetcher : Callable size : int The total size of the file being cached. maxblocks : int The maximum number of blocks to cache for. The maximum memory use for this cache is then ``blocksize * maxblocks``. backgroundrrc>[TU]XU5 [R"X1- 5UlX@l[ URU5Ul[SS9Ul SUl SUl [R"5Ulg)Nr[ max_workers)rRr%rrrrr*rrr_thread_executor_fetch_future_block_number _fetch_futurer9r:_fetch_future_lockrs r$r%BackgroundBlockCache.__init__sm T2yy!12 "#/0A0A9#M 2q A6:'37"+.."2r'c6URR5$rrr/s r$rBackgroundBlockCache.cache_info*rr'c<URnUS US US US US U$)NrrZr[r\r]rrs r$r!BackgroundBlockCache.__getstate__5s<  ' ( $ % . / / " & ' r'cURRU5 [URUS5Ul[ SS9UlSUlSUl[R"5Ul g)Nrr[rX) rrr*rrrrZr[r\r9r:r]rs r$r!BackgroundBlockCache.__setstate__>sZ U##/0A0A5CU#V 2q A*.'!"+.."2r'cUcSnUc URnXR:dX:agXR-nX R-nSnSnUR URbURceURR 5(ab[ RS5 URRURR5UR5 SUlSUlOU[UURs=:*=(a U:*Os 5nU(a&URnURnSUlSUlSSS5 Ub?[ RS5 URRUR5U5 [X4S-5HnURU5 M US-n UR URcaXR::aRURRU 5(d2XlURR!UR"U S5UlSSS5 UR%UUUUS9$!,(df  GN=f!,(df  N2=f)Nrr'z3BlockCache joined background fetch without waiting.z(BlockCache waiting for background fetch.r[asyncr)rrr]r\r[doner|rrrNrGrr~rrKrZsubmitrr) r#r*rrrfetch_future_block_number fetch_future must_joinrend_block_plus_1s r$r,BackgroundBlockCache._fetchFsH =E ;))C II #nn4..0$(!  $ $!!-66BBB%%**,,KK UV,,44**113T5T5T7;D3)-D&!%*::,,+,!I !594S4S1'+'9'9 ;?7-1*7%<  # KKB C  $ $ , ,##%'@  ""46JKL  $ $\ 2L ,a/  $ $""*$ 400>>?OPP2B/%)%:%:%A%A%%'7&"%  1-    o% $X% $sC3I A/I% I"% I3c8>XR:a[SUSURS35eXR-nX0R-n[R SX!5 U=R XC- - slU=R S- sl[TU]!X45nU$)rrrr{z!BlockCache fetching block (%s) %dr[) rrrr|rr"r!rRr,)r#rlog_infor*rrr7s r$r!BackgroundBlockCache._fetch_blocks ,, & /))-a9  ~~-nn$ 7P ""ck1" 13r'c XR-nX R-nU=RS- slX4:XaURU5nXuU$URU5US/nUR[ UR[ US-U555 UR URU5SU5 SRU5$rrrs r$r BackgroundBlockCache._read_cachesNN* & !  1,,-?@E7+ +++,>? KLC JJ,,,q02BC  JJt//0@A(7K L88C= r')rr\r[r]rZrrrrrSrrCr)sync)rr<rorDr>rBr)r8rErFrGrHrrIr%rrrr,rrrJrrs@r$rUrUs2'D-&MO 3 3'. 369 3FI 3  3 3 53J X$(!(!"(!8;(!OR(! (!(!r'rUz!dict[str | None, type[BaseCache]]cachescURnU(d#U[;a[SU<S[U35eU[U'g)z'Register' cache implementation. Parameters ---------- clobber: bool, optional If set to True (default is False) - allow to overwrite existing entry. Raises ------ ValueError zCache with name z is already known: N)rrtr)clsclobberrs r$register_cacherxs= 88D tv~+D83Fvd|nUVVF4Lr')F)rvztype[BaseCache]rwrr>r?)3 __future__rr3rloggingrr_r9rcollections.abcrconcurrent.futuresrr itertoolsroperatorr typingr r r r rrrOtyping_extensionsrrr getLoggerr|r<rBr=list MultiFetcherrrMrrrrrrr*rUrtrIrxcrKr'r$rsq" #$9MM+#A A CL   8 $ C:u$ %c3h(%/0 < < ~K& K&\+%Y+%\+,i+,\F!F!RbbJ%y%0q qh971a4=9xK!9K!` )-) (   A1 r'