jej/~QddlmZddlmZmZddlmZGddZdZdZ dZ d Z d Z d Z d Zd ZdZddZdZGddZGddZy))_)errorutil) stringutilcHeZdZd dZdZdZdZd dZd dZdZ d Z d Z y) parserNc.||_||_d|_yN) _elements_methodscurrent)selfelementsmethodss 4usr/lib/python3.12/site-packages/mercurial/parser.py__init__zparser.__init__s!  cT|j}t|jd|_|S)zadvance the tokenizerN)r next_iter)rts r_advancezparser._advance"s" LLDJJ- rcRt|j|jdddS)z%True if next token may start new termr)anyr r )rs r _hasnewtermzparser._hasnewterm(s%4>>$,,q/21Q788rc|jd|k7r?D""1%8#9E#A3G GT^^DLLO4Q77 $  E5# NN51!"5ME6u)9)9);~a$(:(:(:E!"I(FG&&q)<'='EsKKT^^DLLO4Q77 rcx||_|j|j}|j\}}}||fS)z!generate a parse tree from tokens)rrr$r )r tokeniterresr)r*r+s rparsez parser.parseVs6  kkm LLucCxrct|ts|S|j|d|ddDcgc]}|j|c}Scc}w)z4recursively evaluate a parse tree using node methodsrrN) isinstancetupler eval)rtreers rr7z parser.eval^sK$&K%t}}T!W%d12h'Gh ! h'GHH'GsAcb|j|}|jr|j|S|S)z>> splitargspec(b'') ([], None, [], None) >>> splitargspec(b'foo bar') ([], None, ['foo', 'bar'], None) >>> splitargspec(b'foo *bar baz **qux') (['foo'], 'bar', ['baz'], 'qux') >>> splitargspec(b'*foo') ([], 'foo', [], None) >>> splitargspec(b'**foo') ([], None, [], 'foo') Ns**sno **optkey name providedrs!excessive **optkey names providedr*sno *varkey name provided) partitionsplitrProgrammingErrorlen)specoptkeypreseppostpostspress r splitargspecrLlsF^^E*NCd  (()EF F u:>(()MN Nq]]4(NCd 99;D JJLE (()DE EU1XuQRy&00 tT6 !!rc|\}}}}tfdt|Dt|} | t|kr-tjt d|t|dz|sS| t|t|zkDr9tjt d|t|t|zdzt j} t||d| D] \} } | | | < |r|t| | | |<n%t||t| | D] \} } | | | < |rt j| |<|| dD]} | r| dk7s | dd|k7r#tjt dd |iz| dd} | |vr| } n+|s$tjt d || d z| |} | | vr$tjt d || d z| d | | <| S)aBuild dict from list containing positional and keyword arguments Arguments are specified by a tuple of ``(poskeys, varkey, keys, optkey)`` where - ``poskeys``: list of names of positional arguments - ``varkey``: optional argument name that takes up remainder - ``keys``: list of names that can be either positional or keyword arguments - ``optkey``: optional argument name that takes up excess keyword arguments If ``varkey`` specified, all ``keys`` must be given as keyword arguments. Invalid keywords, too few positional arguments, or too many positional arguments are rejected, but missing keyword arguments are just omitted. c3@K|]\}}|s |dk(s|ywrNr>).0ix keyvaluenodes r z buildargsdict..s%F'tq!111E's s6%(func)s takes at least %(nargs)d positional arguments)funcsnargss5%(func)s takes at most %(nargs)d positional argumentsNrrs %(func)s got an invalid argumentrUs5%(func)s got an unexpected keyword argument '%(key)s')rUskeys;%(func)s got multiple values for keyword argument '%(key)s'r) r enumeraterDrr rrsortdictzip)treesfuncnameargspecrSkeynodeposkeysvarkeykeysrFkwstartargskrRds ` r buildargsdictrds2 %,!GVT6Fy'F E GW G H CL9 :   gG s4y 88 F G CL3t9,DE F   ==?DGU8G_-1Q. SY1V eCI89DAqDG:}}V 78_AaDL(AaDGw,>""56'89LL  aDG 9A""JK$a01  V A 6""*%a0 1 t!/0 Krc tj|S#t$r;}tjtj |j d}~wwxYwr )r unescapestr ValueErrorrr forcebytestrlower)ses rrfrfsRC%%a(( C z66q9??ABB Cs A6AAct|ts'|j|tj|fy|d|vrHt tj|dd}|j|d|ddj |fzfy|j|d|dzf|ddD]}t|||dz||dd|dddzfg|ddy)Nrrs(%s %s) s(%s))r5r6appendrpprintmapjoin _prettyformat)r8 leafnodeslevellinesrsrjs rrtrts dE " eZ..t456 aI  ""DH - eZ47DIIbM*BBCD eVd1g-./abA !Y 5 9Ry|U2Yq\D%89:bc rcVg}t||d|djd|D}|S)Nr c32K|]\}}d|z|zyw)s Nr>)rPlrjs rrTzprettyformat..s:EDAqQEs)rtrs)r8rurwoutputs r prettyformatr~s. E$ 1e, ZZ:E: :F Mrcdt|ts|S|d}|vr|ftfd|ddDzSg}|}|d|k(r.|dd\}}|jt||}|d|k(r.|jt||j|tt |S)a_Flatten chained infix operations to reduce usage of Python stack >>> from . import pycompat >>> def f(tree): ... s = prettyformat(simplifyinfixops(tree, (b'or',)), (b'symbol',)) ... print(pycompat.sysstr(s)) >>> f((b'or', ... (b'or', ... (b'symbol', b'1'), ... (b'symbol', b'2')), ... (b'symbol', b'3'))) (or (symbol '1') (symbol '2') (symbol '3')) >>> f((b'func', ... (b'symbol', b'p1'), ... (b'or', ... (b'or', ... (b'func', ... (b'symbol', b'sort'), ... (b'list', ... (b'or', ... (b'or', ... (b'symbol', b'1'), ... (b'symbol', b'2')), ... (b'symbol', b'3')), ... (b'negate', ... (b'symbol', b'rev')))), ... (b'and', ... (b'symbol', b'4'), ... (b'group', ... (b'or', ... (b'or', ... (b'symbol', b'5'), ... (b'symbol', b'6')), ... (b'symbol', b'7'))))), ... (b'symbol', b'8')))) (func (symbol 'p1') (or (func (symbol 'sort') (list (or (symbol '1') (symbol '2') (symbol '3')) (negate (symbol 'rev')))) (and (symbol '4') (group (or (symbol '5') (symbol '6') (symbol '7')))) (symbol '8'))) rc36K|]}t|ywr )simplifyinfixops)rPrR targetnodess rrTz#simplifyinfixops..4sPx!-a=xsrN)r5r6rprreversed)r8rop simplifiedrRr|rs ` rrrsx dE " aB uuPtABxPPPP J A A$"*u1*1k:;  A$"*&q+67b *% &&rc~|k(rjSt|ts|Stfd|DS)Nc38K|]}t|ywr ) _buildtree)rPrR placeholder replstacks rrTz_buildtree..IsI1A{I6s)popr5r6)templaterrs ``rrrDs7;}} h & II IIrct|tstjdt t |}t |||}|rtjd|S)aCreate new tree by substituting placeholders by replacements >>> _ = (b'symbol', b'_') >>> def f(template, *repls): ... return buildtree(template, _, *repls) >>> f((b'func', (b'symbol', b'only'), (b'list', _, _)), ... ('symbol', '1'), ('symbol', '2')) ('func', ('symbol', 'only'), ('list', ('symbol', '1'), ('symbol', '2'))) >>> f((b'and', _, (b'not', _)), (b'symbol', b'1'), (b'symbol', b'2')) ('and', ('symbol', '1'), ('not', ('symbol', '2'))) placeholder must be a node tuplestoo many replacements)r5r6rrClistrr)rrreplsrrs r buildtreerLsV k5 )$$%HIIXe_%I8[)4A$$%=>> Hrc||k(ryt|trt|tsy|k(r|dvrj|yt|t|k7ryt fdt ||DS)NTFrc3BK|]\}}t||ywr ) _matchtree)rPprRincompletenodesmatchesrs rrTz_matchtree..ks*&DAq 1aow?&)r5r6rprDallrXpatternr8rrrs ```rrrasy$ gu %Ze-D+$q'"@t 7|s4y  & rNcz|%t|tstjd|g}t |||||r|Sy)a If a tree matches the pattern, return a list of the tree and nodes matched with the placeholder; Otherwise None >>> def f(pattern, tree): ... m = matchtree(pattern, tree, _, {b'keyvalue', b'list'}) ... if m: ... return m[1:] >>> _ = (b'symbol', b'_') >>> f((b'func', (b'symbol', b'ancestors'), _), ... (b'func', (b'symbol', b'ancestors'), (b'symbol', b'1'))) [('symbol', '1')] >>> f((b'func', (b'symbol', b'ancestors'), _), ... (b'func', (b'symbol', b'ancestors'), None)) >>> f((b'range', (b'dagrange', _, _), _), ... (b'range', ... (b'dagrange', (b'symbol', b'1'), (b'symbol', b'2')), ... (b'symbol', b'3'))) [('symbol', '1'), ('symbol', '2'), ('symbol', '3')] The placeholder does not match the specified incomplete nodes because an incomplete node (e.g. argument list) cannot construct an expression. >>> f((b'func', (b'symbol', b'ancestors'), _), ... (b'func', (b'symbol', b'ancestors'), ... (b'list', (b'symbol', b'1'), (b'symbol', b'2')))) The placeholder may be omitted, but which shouldn't match a None node. >>> _ = None >>> f((b'func', (b'symbol', b'ancestors'), None), ... (b'func', (b'symbol', b'ancestors'), (b'symbol', b'0'))) Nr)r5r6rrCrrs r matchtreerqsHDz+u'E$$%HIIfG'4owGHrcz|j$td|j|jfzS|jS)z6Compose error message from specified ParseError objects at %d: %s)locationrmessage)insts rparseerrordetailrs2 }} $--!>>>||rceZdZdZdZy)aliaszParsed result of aliascJ||_||_||_||_d|_y)NF)namerar replacementwarned)rrraerrrs rrzalias.__init__s(   & rN)r;r<r=__doc__rr>rrrrs  rrceZdZdZdZdZdZedZedZ e dZ e dZ e d Z e d Ze d Ze d Ze d Ze dZe dZy)basealiasrulesawParsing and expansion rule set of aliases This is a helper for fileset/revset/template aliases. A concrete rule set should be made by sub-classing this and implementing class/static methods. It supports alias expansion of symbol and function-call styles:: # decl = defn h = heads(default) b($1) = ancestors($1) - ancestors(default) Nssymbolc2td|jz)Ns'%s' is not instantiatable) TypeErrorr;)clss r__new__zbasealiasrules.__new__s5 DEErct)z-Parse an alias name, arguments and definitionNotImplementedError)rEs rr$zbasealiasrules._parse "!rct)z9Return (name, args) if tree is a function; otherwise Noner)r8s r _trygetfunczbasealiasrules._trygetfuncrrcf j|}|djk(r,|d}|j dr|dt d|zfS|ddfSj|}|r|\}}|j dr|dt d|zfStfd|Dr|dt dfSt|tt|k7r|dt d fS||Dcgc]}|d c}dfS|dt d fS#tj$r}|dt|fcYd}~Sd}~wwxYwcc}w) a Parse an alias declaration into ``(name, args, errorstr)`` This function analyzes the parsed tree. The parsing rule is provided by ``_parse()``. - ``name``: of declared alias (may be ``decl`` itself at error) - ``args``: list of argument names (or None for symbol declaration) - ``errorstr``: detail about detected error (or None) >>> sym = lambda x: (b'symbol', x) >>> symlist = lambda *xs: (b'list',) + tuple(sym(x) for x in xs) >>> func = lambda n, a: (b'func', sym(n), a) >>> parsemap = { ... b'foo': sym(b'foo'), ... b'$foo': sym(b'$foo'), ... b'foo::bar': (b'dagrange', sym(b'foo'), sym(b'bar')), ... b'foo()': func(b'foo', None), ... b'$foo()': func(b'$foo', None), ... b'foo($1, $2)': func(b'foo', symlist(b'$1', b'$2')), ... b'foo(bar_bar, baz.baz)': ... func(b'foo', symlist(b'bar_bar', b'baz.baz')), ... b'foo(bar($1, $2))': ... func(b'foo', func(b'bar', symlist(b'$1', b'$2'))), ... b'foo($1, $2, nested($1, $2))': ... func(b'foo', (symlist(b'$1', b'$2') + ... (func(b'nested', symlist(b'$1', b'$2')),))), ... b'foo("bar")': func(b'foo', (b'string', b'bar')), ... b'foo($1, $2': error.ParseError(b'unexpected token: end', 10), ... b'foo("bar': error.ParseError(b'unterminated string', 5), ... b'foo($1, $2, $1)': func(b'foo', symlist(b'$1', b'$2', b'$1')), ... } >>> def parse(expr): ... x = parsemap[expr] ... if isinstance(x, Exception): ... raise x ... return x >>> def trygetfunc(tree): ... if not tree or tree[0] != b'func' or tree[1][0] != b'symbol': ... return None ... if not tree[2]: ... return tree[1][1], [] ... if tree[2][0] == b'list': ... return tree[1][1], list(tree[2][1:]) ... return tree[1][1], [tree[2]] >>> class aliasrules(basealiasrules): ... _parse = staticmethod(parse) ... _trygetfunc = staticmethod(trygetfunc) >>> builddecl = aliasrules._builddecl >>> builddecl(b'foo') ('foo', None, None) >>> builddecl(b'$foo') ('$foo', None, "invalid symbol '$foo'") >>> builddecl(b'foo::bar') ('foo::bar', None, 'invalid format') >>> builddecl(b'foo()') ('foo', [], None) >>> builddecl(b'$foo()') ('$foo()', None, "invalid function '$foo'") >>> builddecl(b'foo($1, $2)') ('foo', ['$1', '$2'], None) >>> builddecl(b'foo(bar_bar, baz.baz)') ('foo', ['bar_bar', 'baz.baz'], None) >>> builddecl(b'foo($1, $2, nested($1, $2))') ('foo($1, $2, nested($1, $2))', None, 'invalid argument list') >>> builddecl(b'foo(bar($1, $2))') ('foo(bar($1, $2))', None, 'invalid argument list') >>> builddecl(b'foo("bar")') ('foo("bar")', None, 'invalid argument list') >>> builddecl(b'foo($1, $2') ('foo($1, $2', None, 'at 10: unexpected token: end') >>> builddecl(b'foo("bar') ('foo("bar', None, 'at 5: unterminated string') >>> builddecl(b'foo($1, $2, $1)') ('foo', None, 'argument names collide with each other') Nrr$invalid symbol '%s'sinvalid function '%s'c3BK|]}|djk7ywrO) _symbolnode)rPrrs rrTz,basealiasrules._builddecl...s9Dq1Q43??*Drsinvalid argument lists&argument names collide with each othersinvalid format) r$rr rr startswithrrrrDset)rdeclr8rrfuncrars` r _builddeclzbasealiasrules._builddeclsSZ 8::d#D 7coo %7Dt$dA&<$=$DEE$% %t$ JD$t$dA&>$?$$FGG9D99dA&>$?@@4yCD N*?@ .A1Q4.5 5dA/0115 8$ 0 67 7 80/s#D! D.D+ D& D+&D+c4t|ts|S|d}|jk7r|ftfd|ddDzSt|dk(sJ|d}|vrd}||fS|j dr!t j td|z||fS) z%Mark alias arguments as ``_aliasarg``rc3BK|]}j|ywr ) _relabelargs)rPrRrars rrTz.basealiasrules._relabelargs..As MHq!1!1!T!:HrrNr _aliasargrr)r5r6rrDrrr r)rr8rarsyms` ` rrzbasealiasrules._relabelargs:s$&K !W  55 MDH MMM M4yA~~1g $;BCy^^D !""1%;#>> from . import pycompat >>> parsemap = { ... b'$1 or foo': (b'or', (b'symbol', b'$1'), (b'symbol', b'foo')), ... b'$1 or $bar': ... (b'or', (b'symbol', b'$1'), (b'symbol', b'$bar')), ... b'$10 or baz': ... (b'or', (b'symbol', b'$10'), (b'symbol', b'baz')), ... b'"$1" or "foo"': ... (b'or', (b'string', b'$1'), (b'string', b'foo')), ... } >>> class aliasrules(basealiasrules): ... _parse = staticmethod(parsemap.__getitem__) ... _trygetfunc = staticmethod(lambda x: None) >>> builddefn = aliasrules._builddefn >>> def pprint(tree): ... s = prettyformat(tree, (b'_aliasarg', b'string', b'symbol')) ... print(pycompat.sysstr(s)) >>> args = [b'$1', b'$2', b'foo'] >>> pprint(builddefn(b'$1 or foo', args)) (or (_aliasarg '$1') (_aliasarg 'foo')) >>> try: ... builddefn(b'$1 or $bar', args) ... except error.ParseError as inst: ... print(pycompat.sysstr(parseerrordetail(inst))) invalid symbol '$bar' >>> args = [b'$1', b'$10', b'foo'] >>> pprint(builddefn(b'$10 or baz', args)) (or (_aliasarg '$10') (symbol 'baz')) >>> pprint(builddefn(b'"$1" or "foo"', args)) (or (string '$1') (string 'foo')) )r$rr)rdefnrar8s r _builddefnzbasealiasrules._builddefnKs9^zz$ t9D5Dd++rc(dx}}|j|\}}}|r td}n |j||}|r||j ||dz}t||||S#tj$r }t |}td}Yd}~Qd}~wwxYw)z>Parse an alias declaration and definition into an alias objectNs4bad declaration of %(section)s "%(name)s": %(error)ss3bad definition of %(section)s "%(name)s": %(error)s)sectionnameserror)rrrrr r_sectionr) rrrreplefmtrrarrs rbuildzbasealiasrules.buildst...dC LMD Q~~dD1 LLC T4d++## Q&t,OP QsAB1B  Bc`i}|D]&\}}|j||}|||j<(|S)zTParse a list of alias (name, replacement) pairs into a dict of alias objects)rr)ritemsaliasesrras rbuildmapzbasealiasrules.buildmaps;JD$ $%AGAFFO rct|tsy|d|jk(r(|d}|j|}|r|j|dfS|j |}|r(|\}}|j|}|r|j||fSy)zrIf tree looks like an unexpanded alias, return (alias, pattern-args) pair. Return None otherwise. Nrr)r5r6rgetrar)rrr8rrrras r _getaliaszbasealiasrules._getaliass $& 7coo %7D D!AQVV^$wt$ JD$ D!AQVV'$wrcxt|ts|S|ddk(r |d}|Stfd|DS)zoReplace _aliasarg instances with the substitution value of the same name in args, recursively. rrrc3BK|]}j|ywr ) _expandargs)rPrrars rrTz-basealiasrules._expandargs..s.s$CGa GQ 594s!s5infinite expansion of %(section)s "%(name)s" detected)rrsinvalid number of arguments: %d)r5r6rrAbortr rrrrprrrrarDrdictrX) rrr8rrrrr|resultrs `` `` rrzbasealiasrules._expands$&K MM'4 ( 9CG 1 77++agg& & >""JK"||aff=>   66 KK 5E!&&Mqvv  66>M q6S[ ""45A> :; ;AS[[!R / ;vtCN';<< rrrrs HKF""""h2h2T 3,3,j,,(& = = = =D22rr)Nr>)i18nrrrutilsrrrLrdrfrtr~rrrrrrrrr>rrrsv(MM`"DCLC ;M'`J *  &R  y2y2r