Ë xm­Õâp%•ãó¤—ddlZddlmZddlmZmZddlmZmZm Z m Z m Z m Z m Z mZmZmZdd„ZGd„d«Z dd „Zd „Zdd „Zd „Zd „Zd„Zd„Zy)éNé)Ú_)ÚhexÚshort) Ú bookmarksÚ branchmapÚerrorÚobsoleteÚphasesÚpycompatÚscmutilÚ setdiscoveryÚ treediscoveryÚutilcó¢‡ ‡ —|jd«stj||||«S|r/|jjŠ t ˆ fd„|D««r|d|fSt j|j||| |¬«}|\}}}|r,|s*|jjŠ tˆ fd„|D««}t|«||xs t|«fS)aúReturn a tuple (common, anyincoming, heads) used to identify the common subset of nodes between repo and remote. "common" is a list of (at least) the heads of the common subset. "anyincoming" is testable as a boolean indicating if any nodes are missing locally. If remote does not support getbundle, this actually is a list of roots of the nodes that would be incoming, to be supplied to changegroupsubset. No code except for pull should be relying on this fact any longer. "heads" is either the supplied heads, or else the remote's heads. "ancestorsof" if not None, restrict the discovery to a subset defined by these nodes. Changeset outside of this set won't be considered (but may still appear in "common"). If you pass heads and they are all known locally, the response lists just these heads in "common" and in "heads". Please use findcommonoutgoing to compute the set of outgoing nodes to give extensions a good hook into outgoing. s getbundlec3ó.•K—|] }‰|«–—Œy­w©N©©Ú.0ÚhÚ knownnodes €ú7usr/lib/python3.12/site-packages/mercurial/discovery.pyÚ z%findcommonincoming..:søèø€Ð+¡U ‰y˜�|¡UùóƒF)ÚabortwhenunrelatedÚ ancestorsofc3ó0•K—|] }‰|« –—Œy­wrr)rÚnÚhas_nodes €rrz%findcommonincoming..Hsøèø€Ð4©e¨™ !›”_©eùóƒ) ÚcapablerÚfindcommonincomingÚ changelogÚhasnodeÚallrÚfindcommonheadsÚuiÚanyÚlist) ÚrepoÚremoteÚheadsÚforcerÚresÚcommonÚanyincÚsrvheadsr rs @@rr#r#sÆù€ð, �>‰>˜,Ô 'Ü×/Ñ/°°f¸eÀUÓKÐKá Ø—N‘N×*Ñ*ˆ Ü Ó+¡UÓ+Ô +ؘ5 %Ð(Ð (ä × &Ñ &Ø �‰Ø ØØ$˜9Øô  €Cð #Ñ€FˆF�HÙ ‘Và—>‘>×)Ñ)ˆÜÓ4©eÓ4Ó4ˆÜ �‹L˜& %Ò"9¬4°«>Ð :Ð:ócóh—eZdZdZ dd„Zd„Zejd„«Zejd„«Z y)Úoutgoinga¢Represents the result of a findcommonoutgoing() call. Members: ancestorsof is a list of the nodes whose ancestors are included in the outgoing operation. missing is a list of those ancestors of ancestorsof that are present in local but not in remote. common is a set containing revs common between the local and the remote repository (at least all of those that are ancestors of ancestorsof). commonheads is the list of heads of common. excluded is the list of missing changeset that shouldn't be sent remotely. Some members are computed on demand from the heads, unless provided upfront by discovery.NcóØ—d||fvsJ‚|j}|€|j«}|r|j||«\}}}t|«} g} |D]@} | j |j | «D� cgc]} | |j k7sŒ| ‘Œc} «ŒB|}| D� cgc] } | | vsŒ| ‘Œ }} n|s |j g}||_||_||_ d|_ d|_ g|_ ycc} wcc} wr) r$r-Ú nodesbetweenÚsetÚextendÚparentsÚnullidÚ commonheadsrÚ_revlogÚ_commonÚ_missingÚexcluded) Úselfr+r<rÚ missingrootsÚclÚcsetsÚrootsr-ÚincludedÚ discbasesrÚps rÚ__init__zoutgoing.__init__bsø€ð˜  \Ð2Ñ2Ð2Ð2Ø �^‰^ˆØ Ð ØŸ(™(›*ˆKÙ ð#%§/¡/°,À Ó"LÑ ˆE�5˜%ܘ5“zˆH؈IÛ�Ø× Ñ ¨R¯Z©Z¸¬]Ó!O©]¨¸aÀ4Ç;Á;Ó>N¢!¨]Ñ!OÕPðàˆKÙ&/ÓE¡i °1¸HÒ3Dš1 iˆKÑEÙØŸ;™;˜-ˆKØ&ˆÔØ&ˆÔ؈Œ ؈Œ ؈Œ ؈� ùò"PùâEsÁ/C" ÂC"  C'Â!C'có‚—|jj|j|j«}|\|_|_yr)r=Úfindcommonmissingr<rr>r?)rAÚsetss rÚ_computecommonmissingzoutgoing._computecommonmissing~s7€Ø�|‰|×-Ñ-Ø × Ñ ˜d×.Ñ.ó ˆð'+Ñ#ˆŒ �d•mr3cóR—|j€|j«|jSr)r>rM©rAs rr0zoutgoing.common„s"€à �<‰<Ð Ø × &Ñ &Ô (Ø�|‰|Ðr3cóR—|j€|j«|jSr)r?rMrOs rÚmissingzoutgoing.missingŠs"€à �=‰=Ð Ø × &Ñ &Ô (Ø�}‰}Ðr3)NNN) Ú__name__Ú __module__Ú __qualname__Ú__doc__rIrMrÚ propertycacher0rQrr3rr5r5LsL„ñð,FJóò8+ð  ×Ññóðð  ×Ññóñr3r5có—t|dd«}|€t||||¬«}|\|_}}|jjt j xs |j} | s|xs|j«|_ �n3|€W|jd«j«|_ |jd«D� cgc]} | j«‘Œc} |_ nÚ|jj|j|«} | \|_} gx|_} gx|_ }| D][}||} | j%«t j k\s| j'«r|j)|«ŒK| j)|«Œ]t+| «t+| «k(r|}nt j,|||«}||_ |rŸ|j/«|j}|j"D�chc]}|j1|«’Œ}}t|j3|««|z |_t|j«}|jD�cgc] }||vsŒ|‘Œ c}|_ |Scc} wcc}wcc}w)aNReturn an outgoing instance to identify the nodes present in repo but not in other. If onlyheads is given, only nodes ancestral to nodes in onlyheads (inclusive) are included. If you already know the local repo's heads, passing them in onlyheads is faster than letting them be recomputed here. If commoninc is given, it must be the result of a prior call to findcommonincoming(repo, other, force) to avoid recomputing it here. If portable is given, compute more conservative common and ancestorsof, to make bundles created from the instance more portable.N)r.rsservedssecret() or extinct())r5r#r<Ú _phasecacheÚ phaserootsr ÚsecretÚobsstorer-rÚfilteredr8Únoder@r$rKr>r?ÚphaseÚextinctÚappendÚlenÚnewheadsrMÚrevÚ ancestors)r+ÚotherÚ onlyheadsr.Ú commonincÚportableÚogÚ_anyÚ_hdsÚ mayexcludeÚctxrLÚ allmissingrQr@r]rrCrÚ missingrevsr<rs rÚfindcommonoutgoingrp‘s €ô �$˜˜dÓ #€BðÐÜ&Ø �%˜u°)ô ˆ ð"+Ñ€B„N�D˜$ð×!Ñ!×,Ñ,¬V¯]©]Ñ;ÒL¸t¿}¹}€JÙ Ø"Ò2 d§j¡j£lˆŽØ Ð àŸ™ yÓ1×7Ñ7Ó9ˆŒØ-1¯X©XÐ6NÔ-OÓPÑ-O c�s—x‘x•zÐ-OÑPˆ� ð�~‰~×/Ñ/°·±À ÓJˆØ!%шŒ �JØ "Ð"ˆŒ �gØ!#Ð#ˆŒ �hÛˆDØ�t‘*ˆCØ�y‰y‹{œfŸm™mÒ+¨s¯{©{¬}Ø—‘ Õ%à—‘˜tÕ$ð ô ˆw‹<œ3˜z›?Ò *Ø#‰Kä Ÿ/™/¨$° ¸8ÓDˆKØ$ˆŒÙð × Ñ Ô"Ø �^‰^ˆØ*,¯+ª+Ó6©+ Q�r—v‘v˜a•y¨+ˆ Ð6ܘŸ™ kÓ2Ó3°kÑAˆŒ ܘ"Ÿ.™.Ó)ˆ Ø%'§^¢^ÓL¡^ °qÀ Ò7Kš! ^ÑLˆŒà €Iùò;Qùò07ùòMsÂ5IÇIÈ: IÉIcóÞ—|jj«}|j}|j}|j}i}t «}t «}|j D]7}||} |j| «|j| j««Œ9|j«5} | jdi«j«} ddd«|j}  j«D]Q\} }| |vrŒ g}g}|D]-}| |«r|j|«Œ|j|«Œ/|t|«|f|| <ŒS|D]} | |vsŒdggf|| <Œt!j"|d„|j«D««}|j%|d„|D««|j«D]\} }||| dddŒ|j«D](\} }|D]}|€Œ|j'«Œ|gfz|| <Œ*|j(rÐ|jj*}|j,D�chc] }||«’Œ }}||j.D�chc] }||«’Œ c}z}|jj1|d¬«}t3t5j6|««D]:\} }|\}}}}t9|||«}|t3|d«|t3|d«f|| <Œ<|S#1swY�ŒxYwcc}wcc}w) acompute a summary of branch and heads status before and after push return {'branch': ([remoteheads], [newheads], [unsyncedheads], [discardedheads])} mapping - branch: the branch name, - remoteheads: the list of remote heads known locally None if the branch is new, - newheads: the new remote heads (known locally) with outgoing pushed, - unsyncedheads: the list of remote heads unknown locally, - discardedheads: the list of heads made obsolete by the push. ó branchmapNc3ó:K—|]\}}|d� ||df–—Œy­w)rNrr)rÚbranchr-s rrz _headssummary..s/èø€ð á!1‘ �˜Ø�Q‰xÐ#ð�U˜1‘XÔ Ù!1ùs‚c3ó<K—|]}|j«–—Œy­wr)rc)rrms rrz _headssummary.. sèø€Ð9©j s˜Ÿ™Ÿ©jùó‚rT)Ú inclusiver)r+Ú unfilteredr,r5r$r8rQÚaddrtÚcommandexecutorÚ callcommandÚresultr%Úitemsr`r*rÚremotebranchcacheÚupdateÚsortr[rcrr<rdÚsortedr Ú iteritemsÚ_postprocessobsolete)Úpushopr+r,r5rCÚheadssumÚ missingctxÚbranchesrrmÚeÚ remotemaprrtr-ÚknownÚunsyncedrÚnewmaprbr}ÚlÚtorevÚ futureheadsÚallfuturecommonÚ remoteheadsÚ unsyncedheadsÚ placeholderr|s rÚ _headssummaryr”ÑsÜ€ð �;‰;× !Ñ !Ó #€DØ �]‰]€FØ�‰€HØ �‰€BØ€HÜ“€Jä‹u€HØ × Ô ˆØ�1‰gˆØ�‰�sÔØ� ‰ �S—Z‘Z“\Õ"ðð × Ñ Ô ! QØ—M‘M ,°Ó3×:Ñ:Ó<ˆ ÷ "ð— ‘ €Ià"Ÿ™Ö*‰ ˆ�à ˜Ñ !Ø ØˆØˆÛˆAÙ˜Œ|Ø— ‘ ˜Q•à—‘ Õ"ð ð "¤4¨£;°Ð9ˆ�Òð+óˆØ ˜Ò !Ø $ b¨"˜~ˆH�VÒ ðô × (Ñ (Ø ñ à!)§¡Ô!1ó ó€Fð ‡M�M�$Ñ9©jÓ9Ô:Ø"ŸL™LžNш�Ø!)ˆ�јљAÑð+à!Ÿ™Ö)‰ ˆ�ÛˆA؉}Ø—‘•ðð! B 5™=ˆ�Òð *ð ‡}‚}Ø—‘×"Ñ"ˆØ)1×)=Ò)=Ó>Ñ)= A‘u˜Q•xÐ)=ˆ Ð>ب(×*>Ò*>Ó?Ñ*> Q™˜a�Ð*>Ñ?Ñ?ˆ ØŸ.™.×2Ñ2°;È$Ð2ÓOˆÜ#¤H×$6Ñ$6°xÓ$@ÖA‰MˆF�EØ@EÑ =ˆK˜ =°+Ü)¨&°/À8ÓLˆFàÜ�v˜a‘yÓ!ØÜ�v˜a‘yÓ!ð  ˆH�VÒ ðBð €O÷s "Ñ !üòZ?ùÚ?sÂ+!KÈ*K%É K*ËK"cóÖ‡—|jjŠtˆfd„|D««}|jd||j«}td„|D««}|rdg}ng}d|||gfiS)z;Compute branchmapsummary for repo without branchmap supportc3ó4•K—|]}‰|«sŒ |–—Œy­wrrrs €rrz#_oldheadssummary...søèø€Ð=¡˜A± ¸!µ ”a¡ùsƒ ‘sheads(%ln + %ln)c3ó<K—|]}|j«–—Œy­wr)r])rÚcs rrz#_oldheadssummary..5sèø€Ð*© 1�a—f‘f—h©ùrvN)r$r%r�r8rQ) r+r‘r5ÚincÚoldheadsÚrrbr‹rs @rÚ_oldheadssummaryrœ'srø€ð —‘×&Ñ&€IÜÓ=¡Ó=Ó=€Hð �‰Ð$ h°×0@Ñ0@ÓA€AÜÑ*©Ó*Ó*€Há Ø�6‰àˆØ �8˜X x°Ð4Ð 5Ð5r3cóˆ—|jj«}|j}|j}|j «5}|j dddi«j «}ddd«t«}|jjdd«D�cgc]}|j|«‘Œ}}|D]|} j| «} | rI| |vrE||| || } } tj|| | «sŒ?|j| j««Œ_| |vsŒd| |vsŒi|j|| «Œ~|S#1swYŒÎxYwcc}w)Nslistkeyss namespaces bookmarksspushing)r+rxr,Ú _bookmarksrzr{r|r8r(Ú configlistÚ expandnameÚgetrÚ validdestryr]) r„r+r,ÚlocalbookmarksrˆÚremotebookmarksÚbookmarkedheadsÚbÚ newbookmarksÚbmÚrnodeÚlctxÚrctxs rÚ _nowarnheadsr¬>s@€à �;‰;× !Ñ !Ó #€DØ �]‰]€FØ—_‘_€Nà × Ñ Ô ! QØŸ-™-Ø à˜lð ó ÷ ‰&‹(ð ÷ "ô“e€Oð —‘×%Ñ% l°JÔ?óá?ˆAð ×!Ñ! !Õ$Ø?ððó ˆØ×#Ñ# BÓ'ˆÙ �U˜d‘]ؘn¨RÑ0Ñ1°4¸±;�$ˆDÜ×"Ñ" 4¨¨tÕ4Ø×#Ñ# D§I¡I£KÕ0à�\Ò! b°Ò&?Ø×#Ñ# N°2Ñ$6Õ7ðð Ð÷5 "Ð !üòsÁ#D3ÂD?Ä3D<cóˆ—|jj«}|j}|j}|j}|j }t |j«}||jgk(ry|jd«r t|«}nt||||«}||_ |j«D�� cgc] \}} | d�Œ |‘Œ} }} | r¼|sºdjt| ««} t!«} |j#«j%«D]\} } }}|sŒ | j'| «Œ| t!| «z} | rt)d«| t+| «fz}nt)d«| z}t)d«}t-j.||¬«‚t1|«}d}tt3j4|««D�]l\}} | \}}}}|€ t!«}n t!|«}|j7|«d}t!|«}|j7|«|r—d|vrd} nt9j:||«} | €%|j<j?t)d ««nS|€(|j<j?t)d «| z«n)|j<j?t)d «|| fz«|€5t+|«d kDrOtA|«}|€Bt)d «|z}t)d«}n(t+|«t+|«kDrt||z |z «}|s�ŒQ|€ž|dvrt)d«tC|d«|fz}nd||djE«r4t)d«tC|d«||djE«dfz}nt)d«tC|d«z}|r t)d«}n t)d«}|€%|j<jGt)d««n'|j<jGt)d«|z«|D])}|j<jGdtC|«z«Œ+�Œo|rt-j.|¬«‚ycc} }w)zpCheck that a push won't add any outgoing head raise StateError error and display ui message as needed. Nrrrs, s0push creates new remote branches: %s (%d closed)s$push creates new remote branches: %ss8use 'hg push --new-branch' to create new remote branches)Úhints,remote has heads that are not known locally s0remote has heads that are not known locally: %s s?remote has heads on branch '%s' that are not known locally: %s rs0push creates new branch '%s' with multiple headss?merge or see 'hg help push' for details about pushing new heads)sdefaultNs.push creates new remote head %s on branch '%s's2push creates new remote head %s with bookmark '%s'spush creates new remote head %ssHpull and merge or see 'hg help push' for details about pushing new headssnew remote heads: s!new remote heads on branch '%s': s %s )$r+rxr,r5r‘Ú newbranchÚboolÚincomingr;r"r”rœÚ pushbranchmapr}Újoinr�r8rÚ iterbranchesryrrar Ú StateErrorr¬r r‚rr Ú nodesummariesr(Ústatusr*rrÚnote)r„r+r,r5r‘r¯r™r…rtr-Ú newbranchesÚ branchnamesÚclosedbranchesÚtagÚtipÚisclosedÚerrmsgr®Ú nowarnheadsÚerrormsgrbr’ÚdiscardedheadsÚoldhsÚdhsÚnewhsrs rÚ checkheadsrÆasK€ð �;‰;× !Ñ !Ó #€DØ �]‰]€FØ�‰€HØ×$Ñ$€KØ× Ñ €IÜ ˆv�‰Ó €Cð�t—{‘{�mÒ#àà ‡~�~�lÔ#Ü  Ó(‰ä# D¨+°xÀÓEˆØ#€FÔà$,§N¡NÔ$4ôÙ$4‘=�6˜5¸¸a¹Ñ8HŠÐ$4ðññ™9Ø—j‘j¤¨ Ó!4Ó5ˆ 䛈Ø)-¯©Ó)9×)FÑ)FÖ)HÑ %ˆC�˜˜XÚØ×"Ñ" 3Õ'ð*Ið(¬#¨kÓ*:Ñ:ˆÙ ÜÐJÓKØÜ�NÓ#ðOñ‰Fô Ð>Ó?À+ÑMˆFÜÐLÓMˆÜ×јv¨DÔ1Ð1ô˜vÓ&€Kð €HÜ¤× 2Ñ 2°8Ó <×=‰ ˆ�Ø?DÑ<ˆ �X˜}¨nà Ð Ü“E‰Eä˜ Ó$ˆEØ � ‰ �]Ô#؈Ü�H“ ˆØ � ‰ �]Ô#Ù Ø�}Ñ$à‘ä×-Ñ-¨d°MÓB�؈}Ø—‘—‘ÜÐFÓGõð�Ø—‘—‘ÜÐJÓKØñõð —‘—‘Üð3óð˜u�oñ &ôð Ð Ü�5‹z˜AŠ~ܘ5“k�ØÐ#äÐMÓNØ ñ!ðôð.ó‘Dô �‹Zœ#˜e›*Ò $䘠Ñ,¨uÑ4Ó5ˆCÛ ØÐØÐ!3Ñ3Ü ØIó ô˜c !™f› Øðñ ‘Hð ˜#˜a™&‘\×+Ñ+Ô-Ü ð.ó ô˜s 1™v›¨¨S°©V© ×(>Ñ(>Ó(@ÀÑ(CÐDñ E‘Hô !Ð!CÓDÄuؘA™óHñ �Hñ!Üð.ó‘Dô ð.ó�Dð ˆ~Ø—‘— ‘ œQÐ5Ó6Õ7à—‘— ‘ œQÐDÓEÈÑNÔOÛ�Ø—‘— ‘ ˜X¬¨a«Ñ0Õ1òði>ñlÜ×јx¨dÔ3Ð3ðùógs Â6 P>ÃP>có6‡‡‡‡‡‡‡‡—|j}|j«Š‰jjjŠt j ЉjjŠˆˆˆfd„Šˆˆfd„}tjt‰j|«Š‰jj}t«}t«}t«}t«} |D]c} | ‰vr|j| «Œ|j!| «�)d} |j"j%| t'| «z«| j| «Œet)|«dk(r| t|«zt«fSt+j,‰d«} t/‰«| z Š|�r|j1«} ‰| «}‰| j3«}‰|«s|| vr|j| «ŒL‰j5d| ||«}g}|D]:}‰|}|j3«|k(sŒ|j7|j9««Œ<t;ˆfd„|D««s)t;ˆˆfd„|D««st;ˆfd „|D««r|j| «n|j| «|r�Œ|| z}||fS) zçpost process the list of new heads with obsolescence information Exists as a sub-function to contain the complexity and allow extensions to experiment with smarter logic. Returns (newheads, discarded_heads) tuple có•—‰‰|«‰k(Srr)r›ÚgetphaseÚpublicÚunfis €€€rÚz&_postprocessobsolete.. sø€™ $¨Ó*¨fÒ4r3có•—‰|«‰vSrr)rÚ futurecommonrŽs €€rrÌz&_postprocessobsolete.. sø€™˜q› \Ñ1r3s=checkheads: remote head unknown locally has local marker: %s rsobsoletesonly(%n, (%ln+%ln))c3ó.•K—|] }‰|«–—Œy­wrr)rr›Úispublics €rrz'_postprocessobsolete..@søèø€Ð0¡Z ‘˜— ¡Zùrc3ó2•K—|]}‰|«‰v–—Œy­wrr)rrÚfuturenonobsoleterŽs €€rrz'_postprocessobsolete..Asøèø€ÐF¹+°Q‘5˜“8Ð0Ô0¹+ùsƒc3ó0•K—|] }‰|« –—Œy­wrr)rrÚ hasoutmarkers €rrz'_postprocessobsolete..Bsøèø€Ð<± ¨1‘| A“Ô&± ùr!)r+rxr$ÚindexÚget_revr rÊrXr^Ú functoolsÚpartialÚpushingmarkerforr[Ú successorsr8ryr¡r(Údebugrrar ÚgetrevsÚ frozensetÚpoprtÚrevsr`r]r))r„rÎÚcandidate_newhsr+ÚispushedÚsuccessorsmarkersrÅÚ discardedÚlocalcandidateÚ unknownheadsrÚmsgÚobsrevsÚnhr›Úcurrent_branchÚ branchrevsÚ branchnodesr˜rÒrÉrÔrÐrÊrŽrËs ` @@@@@@@rrƒrƒôsBÿ€ð �;‰;€DØ �?‰?Ó €DØ �N‰N× Ñ × (Ñ (€EÜ �]‰]€FØ×Ñ×%Ñ%€HÝ4€HÜ1€HÜ×$Ñ$Ô%5°t·}±}ÀhÓO€LØŸ ™ ×0Ñ0ÐÜ ‹E€EÜ“€Iä“U€NÜ“5€LÛ ˆØ �‰9Ø × Ñ ˜qÕ !à ×$Ñ$ QÓ'Ð3ð+ðð—‘— ‘ ˜c¤C¨£F™lÔ+Ø × Ñ ˜QÕ ðô ˆ>Ó˜aÒØœc /Ó2Ñ2´C³EÐ9Ð9ä×јt [Ó1€GÜ! ,Ó/°'Ñ9Ðò Ø × Ñ Ó !ˆÙ �"‹IˆØ˜b™Ÿ™Ó*ˆá �AŒ;˜! 7Ñ*Ø �I‰I�bŒMØ ð—Y‘YØ " B¨¸ó ˆ ðˆ ÛˆAØ�Q‘ˆAØ�x‰x‹z˜^Ó+Ø×"Ñ" 1§6¡6£8Õ,ðô Ó0¡ZÓ0Ô 0ÜÔF¹+ÓFÔFÜÓ<± Ó<Ô<à �I‰I�b�Mð �M‰M˜"Ô óI ðJ ˆ\Ñ€EØ �)Ð Ðr3có"—|j}|g}t|«}|rs|j«}||«ry|j|d«}|D]@}|d} | s |dxsd} | D])} | |vsŒ|j | «|j | «Œ+ŒB|rŒsy)a�true if some markers are to be pushed for node We cannot just look in to the pushed obsmarkers from the pushop because discovery might have filtered relevant markers. In addition listing all markers relevant to all changesets in the pushed set would be too expensive (O(len(repo))) (note: There are cache opportunity in this function. but it would requires a two dimensional stack.) TrréF)rÚr8rÞr¡ryr`) r[rár]râÚstackÚseenÚcurrentÚmarkersÚmÚnextsrs rrÙrÙOsŸ€ð!×+Ñ+ÐØ ˆF€EÜ ˆu‹:€DÙ Ø—)‘)“+ˆÙ �GÔ ØØ#×'Ñ'¨°Ó4ˆãˆAØ�a‘DˆEÙØ˜!™š  �Û�ؘD’=Ø—H‘H˜Q”KØ—L‘L •Oñð ò ð r3)NFN)NFNF)F)r×Úi18nrr]rrÚrrr r r r r rrrr#r5rpr”rœr¬rÆrƒrÙrr3rÚrösfðóå÷÷ ÷ ÷ ó*;÷ZBñBðLHMó=ò@Sól6ò. òFP4òfXóvr3