HEX

File: //usr/lib/python3/dist-packages/mercurial/__pycache__/parser.cpython-310.pyc
o

�]Lb�f�@s�ddlmZmZddlmZddlmZmZddlm	Z	Gdd�de
�Zdd	�Zd
d�Z
dd
�Zdd�Zdd�Zdd�Zdd�Zdd�Zdd�Zd$dd�Zdd�ZGd d!�d!e
�ZGd"d#�d#e
�ZdS)%�)�absolute_import�print_function�)�_)�error�util)�
stringutilc@sZeZdZddd�Zdd�Zdd�Zdd	�Zdd
d�Zdd
d�Zdd�Z	dd�Z
dd�ZdS)�parserNcCs||_||_d|_dS�N)�	_elements�_methods�current)�self�elements�methods�r�2/usr/lib/python3/dist-packages/mercurial/parser.py�__init__s
zparser.__init__cCs|j}t|jd�|_|S)zadvance the tokenizerN)r
�next�_iter)r�trrr�_advance#szparser._advancecCst|j|jddd��S)z%True if next token may start new termrr�)�anyrr
�rrrr�_hasnewterm)szparser._hasnewtermcCs:|jd|krt�td�|jd|jd��|��dS)z0make sure the tokenizer matches an end conditionrsunexpected token: %s�N)r
r�
ParseErrorrr)r�mrrr�_match-s
�z
parser._matchcCs4|r|jd|krd}n|�|�}|r|�|�|S)zLgather right-hand-side operand until an end condition or binding
        metrN)r
�_parser)r�bindr�exprrrr�
_parseoperand5s

zparser._parseoperandrc
Cs|��\}}}|j|dd�\}}|r|r|��s||f}n|r/|d|j|dd��f}n
t�td�||��||j|jddkr�|��\}}}|j|dd�\}}	|	rd|r_|��sd|	|f}n|ru|d||j|dd��f}n
t�td�||��||j|jddksE|S)Nrrrsnot a prefix: %ssnot an infix: %s)rrrr#rrrr
)
rr!�token�value�pos�primary�prefixr"�infix�suffixrrrr @s"

�
z
parser._parsecCs*||_|��|��}|j\}}}||fS)z!generate a parse tree from tokens)rrr r
)r�	tokeniter�resr$r%r&rrr�parseWs
zparser.parsecs6t|t�s|S�j|d�fdd�|dd�D��S)z4recursively evaluate a parse tree using node methodsrcsg|]}��|��qSr)�eval��.0rrrr�
<listcomp>cszparser.eval.<locals>.<listcomp>rN)�
isinstance�tupler)r�treerrrr._s
(zparser.evalcCs|�|�}|jr
|�|�S|S)z<parse tokens into a parse tree and evaluate if methods given)r-rr.)rr+rrrr�__call__es

zparser.__call__r
)r)�__name__�
__module__�__qualname__rrrrr#r r-r.r5rrrrr	s


r	cCs�d}|�d�\}}}|r&|��}|st�d��t|�dkr"t�d��|d}|�d�\}}}|��}|��}|rK|s?t�d��||d|dd�|fSgd||fS)	a�Parse spec of function arguments into (poskeys, varkey, keys, optkey)

    >>> 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)�	partition�splitr�ProgrammingError�len)�spec�optkey�pre�sep�post�posts�presrrr�splitargspecms"


rEcs�|\}}}}t�fdd�t|�D�t|��}	|	t|�kr*t�td�|t|�d���|sH|	t|�t|�krHt�td�|t|�t|�d���t��}
t||d|	��D]\}}||
|<qU|rk|t|
�|	�|
|<nt||t|
�|	��D]\}}||
|<qv|r�t��|
|<||	d�D]R}|r�|d�ks�|dd|kr�t�td	�d
|i��|dd}||vr�|
}
n|s�t�td�||d���|
|}
||
vr�t�td
�||d���|d|
|<q�|
S)a�Build 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.
    c3s(�|]\}}|r|d�kr|VqdS�rNr)r0�i�x��keyvaluenoderr�	<genexpr>�s�&z buildargsdict.<locals>.<genexpr>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 argumentrLs5%(func)s got an unexpected keyword argument '%(key)s')rLskeys;%(func)s got multiple values for keyword argument '%(key)s'r)	r�	enumerater=rrrr�sortdict�zip)�trees�funcname�argspecrJ�keynode�poskeys�varkey�keysr?�kwstart�args�krH�drrIr�
buildargsdict�sf�����

 ������r[c
Cs:zt�|�WSty}z
t�t�|�����d}~wwr
)r�unescapestr�
ValueErrorrr�forcebytestr�lower)�s�errrr\�s��r\cCs�t|t�s|�|t�|�f�dS|d|vr3ttj|dd��}|�|d|dd�|�ff�dS|�|d|df�|dd�D]}t|||d|�qD|dd|dddfg|dd�<dS)Nrrs(%s %s)� s(%s����))r2r3�appendr�pprint�map�join�
_prettyformat)r4�	leafnodes�level�lines�rsr`rrrri�s
$*ricCs*g}t||d|�d�dd�|D��}|S)Nr�
css �|]\}}d||VqdS)s  Nr)r0�lr`rrrrK�s�zprettyformat.<locals>.<genexpr>)rirh)r4rjrl�outputrrr�prettyformat�srqcs�t|t�s|S|d}|�vr!|ft�fdd�|dd�D��Sg}|}|d|krC|dd�\}}|�t|���|}|d|ks+|�t|���|�|�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')))
    rc3s�|]}t|��VqdSr
)�simplifyinfixops�r0rH��targetnodesrrrK5s�z#simplifyinfixops.<locals>.<genexpr>rN)r2r3rerr�reversed)r4ru�op�
simplifiedrHro�rrrtrrr�s
<$�
rrcs6|�kr���St|t�s|St��fdd�|D��S)Nc3s�|]	}t|���VqdSr
)�
_buildtreers��placeholder�	replstackrrrKJ��z_buildtree.<locals>.<genexpr>)�popr2r3)�templater|r}rr{rrzEs

rzcGs>t|t�s
t�d��tt|��}t|||�}|rt�d��|S)a�Create 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)r2r3rr<�listrvrz)r�r|�replsr}ryrrr�	buildtreeMs


r�csz||krdSt|t�rt|t�sdS|�kr#|d�vr#��|�dSt|�t|�kr-dSt���fdd�t||�D��S)NTFrc3s$�|]
\}}t||����VqdSr
)�
_matchtree)r0�prH��incompletenodes�matchesr|rrrKls
��
�z_matchtree.<locals>.<genexpr>)r2r3rer=�allrO��patternr4r|r�r�rr�rr�bs
�r�NrcCs:|durt|t�st�d��|g}t|||||�r|SdS)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�)r2r3rr<r�r�rrr�	matchtreers"
�r�cCs$|jdurtd�|j|jfS|jS)z6Compose error message from specified ParseError objectNs	at %d: %s)�locationr�message)�instrrr�parseerrordetail�s
r�c@seZdZdZdd�ZdS)�aliaszParsed result of aliascCs"||_||_||_||_d|_dS)NF)�namerXr�replacement�warned)rr�rX�errr�rrrr�s

zalias.__init__N)r6r7r8�__doc__rrrrrr��sr�c@s�eZdZdZdZdZdd�Zedd��Zedd	��Z	e
d
d��Ze
dd
��Ze
dd��Z
e
dd��Ze
dd��Ze
dd��Ze
dd��Ze
dd��Ze
dd��ZdS)�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)
    NssymbolcCstd|j��)Ns'%s' is not instantiatable)�	TypeErrorr6��clsrrr�__new__�szbasealiasrules.__new__cC�t�)z-Parse an alias name, arguments and definition��NotImplementedError)r>rrrr ��zbasealiasrules._parsecCr�)z9Return (name, args) if tree is a function; otherwise Noner�)r4rrr�_trygetfunc�r�zbasealiasrules._trygetfuncc
sz��|�}Wntjy!}z
|dt|�fWYd}~Sd}~ww|d�jkr@|d}|�d�r;|dtd�|fS|ddfS��|�}|r�|\}}|�d�rY|dtd�|fSt�fdd�|D��rk|dtd	�fSt	|�t	t
|��kr||dtd
�fS|dd�|D�dfS|dtd
�fS)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'c3s�|]
}|d�jkVqdSrF)�_symbolnoder/r�rrrK/s�z,basealiasrules._builddecl.<locals>.<genexpr>sinvalid argument lists&argument names collide with each othercSsg|]}|d�qS)rrr/rrrr17sz-basealiasrules._builddecl.<locals>.<listcomp>sinvalid format)r rrr�r��
startswithrr�rr=�set)r��declr4r�r��funcrXrr�r�
_builddecl�s2M��



�zbasealiasrules._builddeclcs�t|t�s|S|d}|�jkr#|ft��fdd�|dd�D��St|�dks+J�|d}|�vr9d}||fS|�d�rGt�td	�|��||fS)
z%Mark alias arguments as ``_aliasarg``rc3��|]	}��|��VqdSr
)�_relabelargsrs�rXr�rrrKBr~z.basealiasrules._relabelargs.<locals>.<genexpr>rNr�	_aliasargr�r�)r2r3r�r=r�rrr)r�r4rXrw�symrr�rr�;s

&
�zbasealiasrules._relabelargscCs*|�|�}|rt|�}nt�}|�||�S)a�Parse an alias definition into a tree and marks substitutions

        This function marks alias argument references as ``_aliasarg``. The
        parsing rule is provided by ``_parse()``.

        ``args`` is a list of alias argument names, or None if the alias
        is declared as a symbol.

        >>> 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 r�r�)r��defnrXr4rrr�
_builddefnLs

/
zbasealiasrules._builddefnc	
Cs�d}}|�|�\}}}|rtd�}n$z|�||�}Wntjy6}zt|�}td�}WYd}~nd}~ww|rB||j||d�}t||||�S)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)�section�nameserror)r�rr�rrr��_sectionr�)	r�r�r��repl�efmtr�rXr�r�rrr�build�s$
���zbasealiasrules.buildcCs,i}|D]\}}|�||�}|||j<q|S)zTParse a list of alias (name, replacement) pairs into a dict of
        alias objects)r�r�)r��items�aliasesr�r��arrr�buildmap�s
zbasealiasrules.buildmapcCs~t|t�sdS|d|jkr"|d}|�|�}|r"|jdur"|dfS|�|�}|r=|\}}|�|�}|r=|jdur=||fSdS)zrIf tree looks like an unexpanded alias, return (alias, pattern-args)
        pair. Return None otherwise.
        Nrr)r2r3r��getrXr�)r�r�r4r�r�r�rXrrr�	_getalias�s



zbasealiasrules._getaliascsBt|t�s|S|ddkr|d}�|St��fdd�|D��S)zoReplace _aliasarg instances with the substitution value of the
        same name in args, recursively.
        rr�rc3r�r
)�_expandargsr/r�rrrK�r~z-basealiasrules._expandargs.<locals>.<genexpr>)r2r3)r�r4rXr�rr�rr��s
zbasealiasrules._expandargsc	st|t�s|S���|�}|durt����fdd�|D��S|\}}|jr,t�|j��|�vr>t�td��j|jd�����	|�|j�vrT��
�|j����|j<�|j}���|j
durd|St|�t|j
�krxt�td�t|������fdd�|D�}��|tt|j
|���S)Nc3s �|]}���|���VqdSr
��_expandr/�r��cacher��	expandingrrrK�s�
�z)basealiasrules._expand.<locals>.<genexpr>s5infinite expansion of %(section)s "%(name)s" detected)r�r�sinvalid number of arguments: %dcsg|]
}���|g���qSrr�r/)r�r�r�rrr1�sz*basealiasrules._expand.<locals>.<listcomp>)r2r3r�r�Abortrrr�r�rer�r�rrXr=r��dictrO)	r�r�r4r�r�ryr�ro�resultrr�rr��s>
���



�

�zbasealiasrules._expandcCs|�||gi�S)zExpand aliases in tree, recursively.

        'aliases' is a dictionary mapping user defined aliases to alias objects.
        r�)r�r�r4rrr�expand�szbasealiasrules.expand)r6r7r8r�r�r�r��staticmethodr r��classmethodr�r�r�r�r�r�r�r�r�rrrrr��s6



j

5

	


"r�)Nr)�
__future__rr�i18nr�rr�utilsr�objectr	rEr[r\rirqrrrzr�r�r�r�r�r�rrrr�<module>s$P"F
P
)