Ë µ©äî9ö69ãóÚ—ddlmZddlmZddlmZmZmZdZdZdZ dZ dd d d d d d d d d ddddddœZ hd£Z iZ dZd„Zd„Zd„Zd„Zd„Zd„Zd„Zd„Zd„Zd„Zd„Zd „Zd!„Zd"„Zd#„Zd$„Zd%„Zy&)'é)Ú_)Úgetattr)ÚerrorÚparserÚpycompatgà?éé é2)éN)ógroupró))ófuncrr N)éNN)ókindpatrN)éN)ónegateé)óminusrN)r N)ónotr NN)rNN)óandrN)éNN)óorrN)éNN)ólistrN)éNNNN)rósymbolNNN)róstringNNN)ó(ó:ó-ró!ró&ró|ó+ó,r rróend>rrrs .*{}[]?/\_c#óBK—dt|«}}tj|«}||k�rl||}|j«r�nI|dvr |d|f–—�n<|dvs|dk(r‰|||dzdvr|dk(r|dz }||}d„}ntj }|dz }|}||kr1||}|d k(r|dz }Œ||k(rd ||||«|f–—nÔ|dz }||krŒ1t jtd «|«‚|j«s|tvst|«d kDre|}|dz }||kr7||}|j«s|tvst|«d kDsn |dz }||krŒ7|||}|tvr|d|f–—nd ||f–—|dz}nt jtd«|«‚|dz }||kr�Œldd|f–—y­w)Nrs (),-:|&+!s"'órr)sr'sr"rcó—|S©N©©Úxs ú9usr/lib/python3.12/site-packages/mercurial/filesetlang.pyÚztokenize..Cs€¡1óó\rsunterminated stringérs syntax errorr&) ÚlenrÚbytestrÚisspacerÚ unescapestrrÚ ParseErrorrÚisalnumÚ globcharsÚordÚkeywords)ÚprogramÚposÚlÚcÚdecodeÚsÚdÚsyms r.ÚtokenizerD2sóèø€Ø ”�G“ ˆ€CÜ×јwÓ'€GØ �‹'Ø �C‰LˆØ �9‰9Œ;Ù Ø �,Ñ Ø�d˜C�.Ô à �‰KØ�DŠyؘ˜c A™gÐ&¨.Ñ8à�DŠyØ�q‘�ؘC‘L�Ù$‘ä×+Ñ+�Ø �1‰HˆC؈Aؘ’'ؘC‘L�ؘ’:ؘ1‘H�CØØ˜’6Ø$¡f¨W°Q°s¨^Ó&<¸aÐ@Ò@ØØ�q‘�ð˜“'ô×&Ñ&¤qÐ)?Ó'@À!ÓDÐDØ �Y‰YŒ[˜A¤™N¬c°!«f°sªlàˆAØ �1‰HˆCؘ’'ؘC‘L�ØŸ ™ œ  q¬I¡~¼¸Q»À#ºØØ�q‘�𠘓'ð ˜!˜C�.ˆCØ”h‰Ø˜D !�nÓ$à  # qÐ)Ò)Ø �1‰H‰Cä×"Ñ"¤1 _Ó#5°sÓ;Ð ;Ø ˆq‰ˆð_ �Œ'ð` �4˜Ð Óùs‚B?FÃBFÅ A FÆFcóø—tjt«}|jt|««\}}|t |«k7rt j td«|«‚tj|ddh«S)Ns invalid tokenrr) rÚelementsÚparserDr3rr7rÚsimplifyinfixops)ÚexprÚpÚtreer=s r.rGrGhsc€Ü� ‰ ”hÓ€AØ—‘œ ›Ó'�I€Dˆ#Ø Œc�$‹iÒÜ×ÑœqÐ!1Ó2°CÓ8Ð8Ü × "Ñ " 4¨'°5Ð)9Ó :Ð:r0có\—|r |ddk(r|dStjtd««‚)Nrrrs not a symbol)rr7rr,s r.Ú getsymbolrMps/€ÙˆQˆq‰T�YÒ Ø�‰tˆ Ü × Ñ œ1˜_Ó-Ó .Ð.r0cóZ—|r|ddk(s|ddk(r|dStj|«‚)Nrrrr)rr7)r-Úerrs r.Ú getstringrPvs5€Ùˆa�‰d�iÒ 1 Q¡4¨9Ò#4Ø�‰tˆ Ü × Ñ ˜3Ó Ðr0cóˆ—t|«}t||«}||vr!tjt d«|z«‚d||fzS)Nsinvalid pattern kind: %ss%s:%s)rMrPrr7r)r-ÚyÚallkindsrOÚkindÚpats r.Ú getkindpatrV|sJ€Ü �Q‹<€DÜ �A�sÓ €CØ �8ÑÜ×ÑœqÐ!<Ó=ÀÑDÓEÐEØ �t˜S�kÑ !Ð!r0cóV—|r|ddk(rt|d|d||«St||«S)Nrrrr)rVrP)r-rSrOs r.Ú getpatternrX„s6€ÙˆQˆq‰T�ZÒ Ü˜!˜A™$  !¡ h°Ó4Ð4Ü �Q˜Ó Ðr0có<—|sgS|ddk(rt|dd«S|gS)Nrrr)Úlistr,s r.Úgetlistr[Šs,€Ù ؈ ؈�tˆw‚Ü�A�a�b�E‹{ÐØ ˆ3€Jr0có~—t|«}t|«|kst|«|kDrtj|«‚|Sr*)r[r3rr7)r-ÚminÚmaxrOr>s r.Úgetargsr_’s6€Ü�‹ €AÜ ˆ1ƒv�‚|”s˜1“v ’|Ü×јsÓ#Ð#Ø €Hr0cóN—|€|S|d}|dvr|S|dk(r$t|d«t|d«}||d|fS|dk(rt|d«S|dk(rtjt d««‚|d k(rt|d«}||fS|d k(r!t|d«}t|d«}|||fS|d k(rtd |dd |dff«S|d vrt d „|ddD««}|f|zS|dk(r$t|d«t|d«}||d|fStj d|z«‚)Nr¾rrrrrr rs)can't use negate operator in this contextrrr¾rrc3ó2K—|]}t|«–—Œy­wr*)Ú_analyze©Ú.0rRs r.Ú z_analyze..²sèø€Ð.© 1”8˜A—;©ùó‚róinvalid operator %r)rMrdrr7rÚtupleÚProgrammingError)r-ÚopÚtÚtaÚtbÚtss r.rdrd™sf€Ø€yØˆà ˆ1‰€BØ Ð #Ñ#ØˆØ ˆZÒÜ�!�A‘$ŒÜ �Q�q‘T‹NˆØ�A�a‘D˜!ˆ}ÐØ ˆX‚~ܘ˜!™‹~ÐØ ˆY‚Ü×ÑœqÐ!MÓNÓOÐOØ ˆV‚|Ü �Q�q‘T‹NˆØ�AˆwˆØ ˆV‚|Ü �a˜‘d‹^ˆÜ �a˜‘d‹^ˆØ�B˜ˆ|ÐØ ˆX‚~ܘ  1¡¨°°!± ~Ð6Ó7Ð7Ø Ð ÑÜ Ñ.¨¨!¨"©Ó.Ó .ˆØˆu�r‰zÐØ ˆW‚}Ü�!�A‘$ŒÜ �a˜‘d‹^ˆØ�A�a‘D˜"ˆ~ÐÜ × Ñ Ð!7¸"Ñ!<Ó =Ð=r0có—|€d|fS|d}|dvrd|fS|dk(rt|d«\}}|||ffS|dk(rMt|d«\}}t|d«\}}||z}|r|r|d |||fd d j|«fffS||||ffS|d k(rZtd „|ddD«Ž\} } t| d«}td„| D««dkDr|d |f| zd d j|«fffS||f| zfS|dk(r'td„|ddD«Ž\} } t| d«|f| zfS|dk(rYt |d«} t|d«\}}t t j| «dd«r| fd ||d|fd | fffSd||d|ffStjd|z«‚)amInsert hint nodes where status should be calculated (first path) This works in bottom-up way, summing up status names and inserting hint nodes at 'and' and 'or' as needed. Thus redundant hint nodes may be left. Returns (status-names, new-tree) at the given subtree, where status-names is a sum of status names referenced in the given subtree. Nr+r¾rrrrrrró withstatusró rc3ó2K—|]}t|«–—Œy­wr*©Ú_insertstatushintsres r.rgz%_insertstatushints..Õóèø€Ð<±e°Ô)¨!×,±eùrhc3ó2K—|]}t|«–—Œy­wr*)Úbool)rfÚhs r.rgz%_insertstatushints..×sèø€Ð#¡˜1Œt�A�w¡ùrhrc3ó2K—|]}t|«–—Œy­wr*rvres r.rgz%_insertstatushints..ÛrxrhrÚ _callstatusFri) rwÚjoinÚzipÚsumrMrÚsymbolsÚgetrrk) r-rlr{rmÚharnÚhbroÚhrÚhsrpÚfs r.rwrw»s÷€ð €yØ�1ˆuˆ à ˆ1‰€BØ Ð /Ñ/Ø�1ˆuˆ Ø ˆV‚|Ü! ! A¡$Ó'‰ˆˆ1Ø�2�q�'ˆzÐØ ˆV‚|Ü# A a¡DÓ)‰ˆˆBÜ# A a¡DÓ)‰ˆˆBØ �"‰WˆÙ ‘"ؘ ¨¨B° |°iÀÇÁÈ2ÃÐ5OÐPÐPÐ PØ�B˜˜B�<ÐÐØ ˆU‚{ÜÑ<°a¸¸±eÓ<Ð=‰ˆˆBÜ ��R‹[ˆÜ Ñ#¡Ó#Ó # aÒ 'ؘ ¨ u¨r¡z°I¸t¿y¹yÈ»}Ð3MÐNÐNÐ NØ�B�5˜2‘:ˆ~ÐØ ˆW‚}ÜÑ<°a¸¸±eÓ<Ð=‰ˆˆBÜ�2�r‹{˜R˜E B™JÐ&Ð&Ø ˆW‚}Ü �a˜‘d‹Oˆä# A a¡DÓ)‰ˆˆBÜ ”7—;‘;˜q“> =°%Ô 8Ø�4˜-¨"¨a°©d°B¨¸)ÀQ¸ÐHÐHÐ HØ�B˜˜!™˜b�>Ð!Ð!Ü × Ñ Ð!7¸"Ñ!<Ó =Ð=r0c󪇗|€|S|d}|dk(r)‰rt|d‰«St|dd¬«}|||dfS|dvr|S|d k(rt|d‰«}||fS|d k(r#t|d‰«}t|d‰«}|||fS|d vrtˆfd „|ddD««}|f|zS|d k(rt|dd¬«}||d|fStjd|z«‚)zsRemove redundant status hint nodes (second path) This is the top-down path to eliminate inner hint nodes. NrrsrT©Úinstatusrrrrrrbc3ó6•K—|]}t|‰«–—Œy­wr*)Ú_mergestatushints)rfrRrŠs €r.rgz$_mergestatushints..søèø€ÐA¹5°aÔ$ Q¨×1¹5ùsƒrFri)rŒrjrrk)r-rŠrlrmrnrorps ` r.rŒrŒçsø€ð  €yØˆà ˆ1‰€BØ ˆ]ÒÙ ä$ Q q¡T¨8Ó4Ð 4Ü ˜a ™d¨TÔ 2ˆØ�A�q˜‘tˆ}ÐØ Ð /Ñ/ØˆØ ˆV‚|Ü ˜a ™d HÓ -ˆØ�AˆwˆØ ˆV‚|Ü ˜q ™t XÓ .ˆÜ ˜q ™t XÓ .ˆØ�B˜ˆ|ÐØ Ð ÑÜ ÓA¸1¸Q¸R¹5ÓAÓ AˆØˆu�r‰zÐØ ˆW‚}ä ˜q ™t¨eÔ 4ˆØ�A�a‘D˜"ˆ~ÐÜ × Ñ Ð!7¸"Ñ!<Ó =Ð=r0cóN—t|«}t|«\}}t|d¬«S)zåTransform raw parsed tree to evaluatable tree which can be fed to optimize() or getmatch() All pseudo operations should be mapped to real operations or functions defined in methods or symbols table respectively. Fr‰)rdrwrŒ)r-rmÚ_hs r.Úanalyzer� s(€ô �‹ €AÜ ˜qÓ !�E€BˆÜ ˜Q¨Ô /Ð/r0có0—|�|ddk(rd||dfS|||fS)Nrrrrr+)rlrnros r.Ú_optimizeandopsr‘s.€Ø €~˜"˜Q™% 6š/ؘ"˜b ™eÐ$Ð$Ø ��Bˆ<Ðr0có"—ggg}}}|D]M}t|«\}}|�|ddvr|j|«Œ,|j|«|j|«ŒO|r2|jt«|jdt|«z«||fS)Nrrr)spatterns)Ú _optimizeÚappendÚWEIGHT_CHECK_FILENAMErj)ÚxsÚwsrpÚssr-Úwrms r.Ú_optimizeunionršs‹€à�R˜ˆBˆ€BÛ ˆÜ˜‹|‰ˆˆ1Ø ˆ=˜Q˜q™TÐ%GÑGØ �I‰I�aŒLØ Ø � ‰ �!Œ Ø � ‰ �!� ð ñ Ø � ‰ Ô'Ô(Ø � ‰ �.¤5¨£9Ñ,Ô-Ø ˆrˆ6€Mr0cóv‡ —|€d|fS|d}|dk(rt|d«\}}||||dffS|dvrt|fS|dk(rt|d«\}}|||d|ffS|dk(rt|d«\}}|||ffS|dk(rEt|d«\}}t|d«\}}||kr|t|||«fS|t|||«fS|d k(rct|dd«\Š }t |«dk(r ‰ d|dfSt d „t t|«ˆ fd „¬ «D««}t‰ «|f|zfS|d k(r&td„|ddD«Ž\Š }t‰ «|f|zfS|dk(rLt|d«} ttj| «dd«}t|d«\}}||z||d|ffStj d|z«‚)Nrrsrrrarrrrc3ó&K—|] }|d–—Œ y­w)rNr+)rfÚits r.rgz_optimize..Fsèø€ð ÙK�bˆBˆq�EÑKùs‚có•—‰|dS)Nrr+)r�r—s €r.r/z_optimize..Gs ø€ÀÀBÀqÁEÂr0)Úkeyrc3ó2K—|]}t|«–—Œy­wr*©r“res r.rgz_optimize..Ksèø€Ð3©U¨”y —|©UùrhrÚ_weightri)r“r•r‘ršr3rjÚsortedÚ enumerater^rr€rMrr�r‚rrk) r-rlr™rmÚwarnÚwbrorpr‡r—s @r.r“r“+sø€Ø€yØ�!ˆtˆ à ˆ1‰€BØ ˆ]Òܘ˜1™‹‰ˆˆ1Ø�2�q˜!˜A™$�-ÐÐØ Ð #Ñ#Ü$ aÐ'Ð'Ø ˆZÒܘ˜1™‹‰ˆˆ1Ø�2�q˜‘t˜Q�-ÐÐØ ˆV‚|ܘ˜1™‹‰ˆˆ1Ø�2�q�'ˆzÐØ ˆV‚|ܘ1˜Q™4“‰ˆˆBܘ1˜Q™4“‰ˆˆBØ �Š8Ø” r¨2¨rÓ2Ð2Ð 2à” r¨2¨rÓ2Ð2Ð 2Ø ˆU‚{Ü  ! " Ó&‰ˆˆBÜ ˆr‹7�aŠ<Ø�a‘5˜"˜Q™%�<Ð Ü ñ Ü"¤9¨R£=Ó6JÕKó ó ˆô�2‹w˜˜ ™ Ð"Ð"Ø ˆW‚}ÜÑ3¨Q¨q¨r©UÓ3Ð4‰ˆˆBÜ�2‹w˜˜ ™ Ð"Ð"Ø ˆW‚}Ü �a˜‘d‹OˆÜ ”G—K‘K “N I¨qÓ 1ˆÜ˜1˜Q™4“‰ˆˆBØ�2‰v˜˜A˜a™D "�~Ð%Ð%Ü × Ñ Ð!7¸"Ñ!<Ó =Ð=r0có"—t|«\}}|S)zsReorder/rewrite evaluatable tree for optimization All pseudo operations should be transformed beforehand. r¡)r-Ú_wrms r.Úoptimizer©Us€ô �a‹L�E€BˆØ €Hr0có.—tj|d«S)N)rr)rÚ prettyformat)rKs r.r«r«^s€Ü × Ñ ˜tÐ%;Ó <Ðr±sÒðõÝ÷ñðÐØÐØ€ ØÐð DØ 2Ø 9Ø 0Ø .Ø .Ø ,Ø ,Ø +Ø +Ø -Ø %Ø/Ø/Ø 'ñ! €ò& #€à €à € ò3òl;ò/ò  ò "òò ò ò>òD)>òX>òD 0òò ò '>òT ó=r0