q&f)ddlmZddlmZmZmZdZdZdZdZ ddd d d d d d d d d dddddZ hdZ iZ dZ dZdZdZdZdZdZdZdZdZdZdZdZd Zd!Zd"Zd#Zd$Zy%)&)_)errorparserpycompatg? 2)N)groupr))funcrr N)NN)kindpatrN)N)negate)minusrN)rN)notrNN)rNN)andrN)NN)orrN)NN)listrN)NNNN)rsymbolNNN)rstringNNN)(:-r!r&r|+,r rrend>rrrs .*{}[]?/\_c#BKdt|}}tj|}||krl||}|jrnI|dvr |d|fn<|dvs|dk(r|||dzdvr|dk(r|dz }||}d}ntj }|dz }|}||kr1||}|d k(r|dz }||k(rd |||||fn|dz }||kr1t jtd ||js|tvst|d kDre|}|dz }||kr7||}|js|tvst|d kDsn |dz }||kr7|||}|tvr|d|fnd ||f|dz}nt jtd||dz }||krldd|fyw)Nrs (),-:|&+!s"'rr)sr'sr"rc|SNxs 7/usr/lib/python3/dist-packages/mercurial/filesetlang.pyztokenize..Bs1\rsunterminated stringrs syntax errorr%) lenrbytestrisspacer unescapestrr ParseErrorrisalnum globcharsordkeywords)programposlcdecodesdsyms r-tokenizerC1s G Cw'G ' CL 99;  , dC. KDycAg&.8DyqCL$++ 1HCA'CL:1HC6$fWQs^&z_analyze..s.18A;.r invalid operator %r)rLrcrr6rtupleProgrammingError)r,opttatbtss r-rcrcsfy 1B ## Z!A$ QqTNAaD!} X~!~ Yq!MNOO V| QqTNAw V| ad^ ad^B| X~1!~677  .!". .urz W}!A$ ad^AaD"~  !7"!< ==r/c|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| DdkDr|d |f| zd d j|fffS||f| zfS|dk(r'td|ddD\} } t| d|f| zfS|dk(rYt |d} t|d\}}t t j| ddr| 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*rrrrrrrr withstatusr rc32K|]}t|ywr)_insertstatushintsrds r-rfz%_insertstatushints..<)!,.s#1tAw#rgrc32K|]}t|ywr)rurds r-rfz%_insertstatushints..rwrgr _callstatusFrh) rvjoinzipsumrLgetattrsymbolsgetrrj) r,rkrzrlharmhbrnhrhsrofs r-rvrvs y1u 1B //1u  V|!!A$'12q'z V|#AaD)B#AaD)B "W " B|i25OPP PBB< U{=% 84-"adB)QHH HB!b>!!  !7"!< ==r/c||S|d}|dk(r)rt|dSt|dd}|||dfS|dvr|S|d k(rt|d}||fS|d k(r#t|d}t|d}|||fS|d vrtfd |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. NrrrrTinstatusrrqrrrac36K|]}t|ywr))_mergestatushints)rerQrs r-rfz$_mergestatushints..sAa$Q1Asr Frh)rrirrj)r,rrkrlrmrnros ` r-rrs  y 1B ] $QqT84 4 adT 2Aqt} // V| adH -Aw V| qtX . qtX .B|  A1QR5A Aurz W} qte 4AaD"~  !7"!< ==r/cNt|}t|\}}t|dS)zTransform 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)rcrvr)r,rl_hs r-analyzers(  A q !EB Q //r/c0||ddk(rd||dfS|||fS)Nrrrrr*)rkrmrns r-_optimizeandopsrs. ~"Q%6/"be$$ B<r/c"ggg}}}|D]M}t|\}}||ddvr|j|,|j||j|O|r2|jt|jdt|z||fS)Nrrq)spatterns) _optimizeappendWEIGHT_CHECK_FILENAMEri)xswsrossr,wrls r-_optimizeunionrsRBB |1 =QqT%GG IIaL  !  !   '( .59,- r6Mr/cv |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)Nrrrrrr`rrrrc3&K|] }|d yw)rNr*)reits r-rfz_optimize..Es BqE sc|dS)Nrr*)rrs r-r.z_optimize..FsBqEr/)keyrc32K|]}t|ywr)rrds r-rfz_optimize..Js3y|3rgr _weightrh)rrrrr2risorted enumerater]r~rrLrrrrrj) r,rkrrlwarmwbrnrorrs @r-rr*sy!t 1B ]112q!A$- ##$a'' Z112qtQ- V|112q'z V|1Q4B1Q4B 8r2r22 2r2r22 2 U{!"&B r7a<a5"Q%<   "9R=6JK  2w "" W}3QqrU34B2w "" W} adO GKKNIq 11Q4B2vAaD"~%%  !7"!< ==r/c"t|\}}|S)zsReorder/rewrite evaluatable tree for optimization All pseudo operations should be transformed beforehand. r)r,_wrls r-optimizerTs aLEB Hr/c.tj|dS)N)rr)r prettyformat)rJs r-rr]s   t%; <rs  D 2 9 0 . . , , + + - %// '! & #   3l;/  "  >D)>X>D 0  '>T =r/