ACC SHELL

Path : /usr/lib/python/lib2to3/
File Upload :
Current File : //usr/lib/python/lib2to3/pytree.pyo

Ñò
sÄMc@sdZdZddkZddkZddklZdZhad„Zdefd„ƒYZ	d	e	fd
„ƒYZ
de	fd„ƒYZd
„Zdefd„ƒYZ
de
fd„ƒYZde
fd„ƒYZde
fd„ƒYZde
fd„ƒYZd„ZdS(sÌ
Python parse tree definitions.

This is a very concrete parse tree; we need to keep every token and
even the comments and whitespace between tokens.

There's also a pattern matching implementation here.
s#Guido van Rossum <guido@python.org>iÿÿÿÿN(tStringIOiÿÿÿcCsltpUddkl}xB|iiƒD]-\}}t|ƒtjo|t|<q'q'Wnti||ƒS(Ni(tpython_symbols(t_type_reprstpygramRt__dict__titemsttypetintt
setdefault(ttype_numRtnametval((s$/usr/lib/python2.6/lib2to3/pytree.pyt	type_reprstBasecBsåeZdZdZdZdZeZd„Z	d„Z
dZd„Zd„Z
d„Zd„Zd„Zd„Zd	„Zd
„Zd„Zd„Zd
„Zed„ƒZed„ƒZd„Zeidjo
d„ZnRS(sÂ
    Abstract base class for Node and Leaf.

    This provides some default functionality and boilerplate using the
    template pattern.

    A node may be a subnode of at most one parent.
    cOs
ti|ƒS(s7Constructor that prevents Base from being instantiated.(tobjectt__new__(tclstargstkwds((s$/usr/lib/python2.6/lib2to3/pytree.pyR3scCs%|i|ij	otS|i|ƒS(sW
        Compare two nodes for equality.

        This calls the method _eq().
        (t	__class__tNotImplementedt_eq(tselftother((s$/usr/lib/python2.6/lib2to3/pytree.pyt__eq__8scCs&|i|ij	otS|i|ƒS(sY
        Compare two nodes for inequality.

        This calls the method _eq().
        (RRR(RR((s$/usr/lib/python2.6/lib2to3/pytree.pyt__ne__DscCs
t‚dS(s_
        Compare two nodes for equality.

        This is called by __eq__ and __ne__.  It is only called if the two nodes
        have the same type.  This must be implemented by the concrete subclass.
        Nodes should be considered equal if they have the same structure,
        ignoring the prefix string and other context information.
        N(tNotImplementedError(RR((s$/usr/lib/python2.6/lib2to3/pytree.pyRNs	cCs
t‚dS(sr
        Return a cloned (deep) copy of self.

        This must be implemented by the concrete subclass.
        N(R(R((s$/usr/lib/python2.6/lib2to3/pytree.pytcloneYscCs
t‚dS(sx
        Return a post-order iterator for the tree.

        This must be implemented by the concrete subclass.
        N(R(R((s$/usr/lib/python2.6/lib2to3/pytree.pyt
post_orderascCs
t‚dS(sw
        Return a pre-order iterator for the tree.

        This must be implemented by the concrete subclass.
        N(R(R((s$/usr/lib/python2.6/lib2to3/pytree.pyt	pre_orderiscCs#tidtddƒ||_dS(sv
        Set the prefix for the node (see Leaf class).

        DEPRECATED; use the prefix property directly.
        s3set_prefix() is deprecated; use the prefix propertyt
stackleveliN(twarningstwarntDeprecationWarningtprefix(RR"((s$/usr/lib/python2.6/lib2to3/pytree.pyt
set_prefixqs	
cCstidtddƒ|iS(sy
        Return the prefix for the node (see Leaf class).

        DEPRECATED; use the prefix property directly.
        s3get_prefix() is deprecated; use the prefix propertyRi(RR R!R"(R((s$/usr/lib/python2.6/lib2to3/pytree.pyt
get_prefix{s	
cCsÅt|tƒp
|g}ng}t}xV|iiD]H}||jo(|dj	o|i|ƒnt}q6|i|ƒq6W|ii	ƒ||i_x|D]}|i|_q¢Wd|_dS(s/Replace this node with a new one in the parent.N(
t
isinstancetlisttFalsetparenttchildrentNonetextendtTruetappendtchanged(Rtnewt
l_childrentfoundtchtx((s$/usr/lib/python2.6/lib2to3/pytree.pytreplace…s"





cCsA|}x1t|tƒp |ipdS|id}q	W|iS(s9Return the line number which generated the invocant node.Ni(R%tLeafR)tlineno(Rtnode((s$/usr/lib/python2.6/lib2to3/pytree.pyt
get_linenoœs
cCs(|io|iiƒnt|_dS(N(R(R.R,twas_changed(R((s$/usr/lib/python2.6/lib2to3/pytree.pyR.¥s
cCsj|io\xYt|iiƒD]A\}}||jo(|iiƒ|ii|=d|_|SqWndS(s‰
        Remove the node from the tree. Returns the position of the node in its
        parent's children before it was removed.
        N(R(t	enumerateR)R.R*(RtiR7((s$/usr/lib/python2.6/lib2to3/pytree.pytremoveªs



	cCsz|idjodSx^t|iiƒD]J\}}||jo1y|ii|dSWqrtj
odSXq(q(WdS(sŸ
        The node immediately following the invocant in their parent's children
        list. If the invocant does not have a next sibling, it is None
        iN(R(R*R:R)t
IndexError(RR;tchild((s$/usr/lib/python2.6/lib2to3/pytree.pytnext_sibling·s
cCsn|idjodSxRt|iiƒD]>\}}||jo%|djodS|ii|dSq(WdS(s¤
        The node immediately preceding the invocant in their parent's children
        list. If the invocant does not have a previous sibling, it is None.
        iiN(R(R*R:R)(RR;R>((s$/usr/lib/python2.6/lib2to3/pytree.pytprev_siblingÈs

cCs"|i}|djodS|iS(s
        Return the string immediately following the invocant node. This is
        effectively equivalent to node.next_sibling.prefix
        uN(R?R*R"(Rtnext_sib((s$/usr/lib/python2.6/lib2to3/pytree.pyt
get_suffixØs	
iicCst|ƒidƒS(Ntascii(tunicodetencode(R((s$/usr/lib/python2.6/lib2to3/pytree.pyt__str__ãsN((ii(t__name__t
__module__t__doc__R*RR(R)R'R9RRt__hash__RRRRRR#R$R4R8R.R<tpropertyR?R@RBtsystversion_infoRF(((s$/usr/lib/python2.6/lib2to3/pytree.pyR
"s0			
	
					
	
					
	
tNodecBs©eZdZddd„Zd„Zd„Zeidjo
eZ	nd„Z
d„Zd„Zd	„Z
ed
„ƒZeid„ƒZd„Zd
„Zd„ZRS(s+Concrete implementation for interior nodes.cCsS||_t|ƒ|_x|iD]}||_q"W|dj	o
||_ndS(sð
        Initializer.

        Takes a type constant (a symbol number >= 256), a sequence of
        child nodes, and an optional context keyword argument.

        As a side effect, the parent pointers of the children are updated.
        N(RR&R)R(R*R"(RRR)tcontextR"R2((s$/usr/lib/python2.6/lib2to3/pytree.pyt__init__ës
	


cCs#d|iit|iƒ|ifS(s)Return a canonical string representation.s
%s(%s, %r)(RRGRRR)(R((s$/usr/lib/python2.6/lib2to3/pytree.pyt__repr__ýscCsditt|iƒƒS(sk
        Return a pretty string representation.

        This reproduces the input source exactly.
        u(tjointmapRDR)(R((s$/usr/lib/python2.6/lib2to3/pytree.pyt__unicode__siicCs"|i|if|i|ifjS(sCompare two nodes for equality.(RR)(RR((s$/usr/lib/python2.6/lib2to3/pytree.pyRscCs4t|ig}|iD]}||iƒq~ƒS(s$Return a cloned (deep) copy of self.(RNRR)R(Rt_[1]R2((s$/usr/lib/python2.6/lib2to3/pytree.pyRsccs9x-|iD]"}x|iƒD]}|VqWq
W|VdS(s*Return a post-order iterator for the tree.N(R)R(RR>R7((s$/usr/lib/python2.6/lib2to3/pytree.pyRs


ccs9|Vx-|iD]"}x|iƒD]}|Vq"WqWdS(s)Return a pre-order iterator for the tree.N(R)R(RR>R7((s$/usr/lib/python2.6/lib2to3/pytree.pyRs

cCs|ipdS|idiS(sO
        The whitespace and comments preceding this node in the input.
        ti(R)R"(R((s$/usr/lib/python2.6/lib2to3/pytree.pyR"$s
cCs"|io||id_ndS(Ni(R)R"(RR"((s$/usr/lib/python2.6/lib2to3/pytree.pyR"-s
cCs4||_d|i|_||i|<|iƒdS(s…
        Equivalent to 'node.children[i] = child'. This method also sets the
        child's parent attribute appropriately.
        N(R(R*R)R.(RR;R>((s$/usr/lib/python2.6/lib2to3/pytree.pyt	set_child2s	
cCs*||_|ii||ƒ|iƒdS(s‹
        Equivalent to 'node.children.insert(i, child)'. This method also sets
        the child's parent attribute appropriately.
        N(R(R)tinsertR.(RR;R>((s$/usr/lib/python2.6/lib2to3/pytree.pytinsert_child<s	cCs'||_|ii|ƒ|iƒdS(sˆ
        Equivalent to 'node.children.append(child)'. This method also sets the
        child's parent attribute appropriately.
        N(R(R)R-R.(RR>((s$/usr/lib/python2.6/lib2to3/pytree.pytappend_childEs	N(ii(RGRHRIR*RPRQRTRLRMRFRRRRRKR"tsetterRWRYRZ(((s$/usr/lib/python2.6/lib2to3/pytree.pyRNçs		
						
		R5cBs eZdZdZdZdZd
d
d„Zd„Zd„Z	e
idjo
e	Znd„Z
d„Zd	„Zd
„Zed„ƒZeid„ƒZRS(s'Concrete implementation for leaf nodes.RVicCs\|dj	o|\|_\|_|_n||_||_|dj	o
||_ndS(s—
        Initializer.

        Takes a type constant (a token number < 256), a string value, and an
        optional context keyword argument.
        N(R*t_prefixR6tcolumnRtvalue(RRR^ROR"((s$/usr/lib/python2.6/lib2to3/pytree.pyRPXs
		
cCsd|ii|i|ifS(s)Return a canonical string representation.s
%s(%r, %r)(RRGRR^(R((s$/usr/lib/python2.6/lib2to3/pytree.pyRQgscCs|it|iƒS(sk
        Return a pretty string representation.

        This reproduces the input source exactly.
        (R"RDR^(R((s$/usr/lib/python2.6/lib2to3/pytree.pyRTmsicCs"|i|if|i|ifjS(sCompare two nodes for equality.(RR^(RR((s$/usr/lib/python2.6/lib2to3/pytree.pyRxscCs+t|i|i|i|i|iffƒS(s$Return a cloned (deep) copy of self.(R5RR^R"R6R](R((s$/usr/lib/python2.6/lib2to3/pytree.pyR|sccs	|VdS(s*Return a post-order iterator for the tree.N((R((s$/usr/lib/python2.6/lib2to3/pytree.pyRsccs	|VdS(s)Return a pre-order iterator for the tree.N((R((s$/usr/lib/python2.6/lib2to3/pytree.pyR…scCs|iS(sP
        The whitespace and comments preceding this token in the input.
        (R\(R((s$/usr/lib/python2.6/lib2to3/pytree.pyR"‰scCs|iƒ||_dS(N(R.R\(RR"((s$/usr/lib/python2.6/lib2to3/pytree.pyR"s
N(ii(RGRHRIR\R6R]R*RPRQRTRLRMRFRRRRRKR"R[(((s$/usr/lib/python2.6/lib2to3/pytree.pyR5Os		
				cCsp|\}}}}|p||ijo0t|ƒdjo	|dSt||d|ƒSt||d|ƒSdS(sõ
    Convert raw node information to a Node or Leaf instance.

    This is passed to the parser driver which calls it whenever a reduction of a
    grammar rule produces a new complete node, so that the tree is build
    strictly bottom-up.
    iiRON(t
number2symboltlenRNR5(tgrtraw_nodeRR^ROR)((s$/usr/lib/python2.6/lib2to3/pytree.pytconvert–s	tBasePatterncBs\eZdZdZdZdZd„Zd„Zd„Z	dd„Z
dd„Zd„ZRS(s”
    A pattern is a tree matching pattern.

    It looks for a specific node type (token or symbol), and
    optionally for a specific content.

    This is an abstract base class.  There are three concrete
    subclasses:

    - LeafPattern matches a single leaf node;
    - NodePattern matches a single node (usually non-leaf);
    - WildcardPattern matches a sequence of nodes of variable length.
    cOs
ti|ƒS(s>Constructor that prevents BasePattern from being instantiated.(RR(RRR((s$/usr/lib/python2.6/lib2to3/pytree.pyR¾scCskt|iƒ|i|ig}x$|o|ddjo|d=q!Wd|iiditt	|ƒƒfS(Niÿÿÿÿs%s(%s)s, (
RRtcontentR
R*RRGRRRStrepr(RR((s$/usr/lib/python2.6/lib2to3/pytree.pyRQÃs
cCs|S(sŒ
        A subclass can define this as a hook for optimizations.

        Returns either self or another node with the same effect.
        ((R((s$/usr/lib/python2.6/lib2to3/pytree.pytoptimizeÉscCsµ|idj	o|i|ijotS|idj	oQd}|dj	o
h}n|i||ƒptS|o|i|ƒq‰n|dj	o|io|||i<ntS(s#
        Does this pattern exactly match a node?

        Returns True if it matches, False if not.

        If results is not None, it must be a dict which will be
        updated with the nodes matching named subpatterns.

        Default implementation for non-wildcard patterns.
        N(RR*R'Ret	_submatchtupdateR
R,(RR7tresultstr((s$/usr/lib/python2.6/lib2to3/pytree.pytmatchÑs#

cCs,t|ƒdjotS|i|d|ƒS(s
        Does this pattern exactly match a sequence of nodes?

        Default implementation for non-wildcard patterns.
        ii(R`R'Rl(RtnodesRj((s$/usr/lib/python2.6/lib2to3/pytree.pyt	match_seqêsccs7h}|o&|i|d|ƒod|fVndS(s}
        Generator yielding all matches for this pattern.

        Default implementation for non-wildcard patterns.
        iiN(Rl(RRmRk((s$/usr/lib/python2.6/lib2to3/pytree.pytgenerate_matchesôsN(
RGRHRIR*RReR
RRQRgRlRnRo(((s$/usr/lib/python2.6/lib2to3/pytree.pyRd©s			
tLeafPatterncBs2eZdddd„Zdd„Zdd„ZRS(cCsA|dj	on|dj	on||_||_||_dS(sp
        Initializer.  Takes optional type, content, and name.

        The type, if given must be a token type (< 256).  If not given,
        this matches any *leaf* node; the content may still be required.

        The content, if given, must be a string.

        If a name is given, the matching node is stored in the results
        dict under that key.
        N(R*RReR
(RRReR
((s$/usr/lib/python2.6/lib2to3/pytree.pyRPs

		cCs(t|tƒptSti|||ƒS(s*Override match() to insist on a leaf node.(R%R5R'RdRl(RR7Rj((s$/usr/lib/python2.6/lib2to3/pytree.pyRlscCs|i|ijS(s„
        Match the pattern's content to the node's children.

        This assumes the node type matches and self.content is not None.

        Returns True if it matches, False if not.

        If results is not None, it must be a dict which will be
        updated with the nodes matching named subpatterns.

        When returning False, the results dict may still be updated.
        (ReR^(RR7Rj((s$/usr/lib/python2.6/lib2to3/pytree.pyRhs
N(RGRHR*RPRlRh(((s$/usr/lib/python2.6/lib2to3/pytree.pyRpÿstNodePatterncBs,eZeZdddd„Zdd„ZRS(cCs‡|dj	on|dj	oJt|ƒ}x;t|ƒD])\}}t|tƒo
t|_q7q7Wn||_||_||_	dS(sd
        Initializer.  Takes optional type, content, and name.

        The type, if given, must be a symbol type (>= 256).  If the
        type is None this matches *any* single node (leaf or not),
        except if content is not None, in which it only matches
        non-leaf nodes that also match the content pattern.

        The content, if not None, must be a sequence of Patterns that
        must match the node's children exactly.  If the content is
        given, the type must not be None.

        If a name is given, the matching node is stored in the results
        dict under that key.
        N(
R*R&R:R%tWildcardPatternR,t	wildcardsRReR
(RRReR
R;titem((s$/usr/lib/python2.6/lib2to3/pytree.pyRP/s


		cCsÔ|iodx\t|i|iƒD]E\}}|t|iƒjo#|dj	o|i|ƒntSq WtSt|iƒt|iƒjotSx;t	|i|iƒD]$\}}|i
||ƒptSq¨WtS(s„
        Match the pattern's content to the node's children.

        This assumes the node type matches and self.content is not None.

        Returns True if it matches, False if not.

        If results is not None, it must be a dict which will be
        updated with the nodes matching named subpatterns.

        When returning False, the results dict may still be updated.
        N(RsRoReR)R`R*RiR,R'tzipRl(RR7RjtcRkt
subpatternR>((s$/usr/lib/python2.6/lib2to3/pytree.pyRhLs

		N(RGRHR'RsR*RPRh(((s$/usr/lib/python2.6/lib2to3/pytree.pyRq+sRrcBsheZdZd
ded
d„Zd„Zd
d„Zd
d„Zd„Z	d„Z
d„Zd	„ZRS(s
    A wildcard pattern can match zero or more nodes.

    This has all the flexibility needed to implement patterns like:

    .*      .+      .?      .{m,n}
    (a b c | d e | f)
    (...)*  (...)+  (...)?  (...){m,n}

    except it always uses non-greedy matching.
    icCs_|dj	o*ttt|ƒƒ}x|D]}q)Wn||_||_||_||_dS(sÏ
        Initializer.

        Args:
            content: optional sequence of subsequences of patterns;
                     if absent, matches one node;
                     if present, each subsequence is an alternative [*]
            min: optinal minumum number of times to match, default 0
            max: optional maximum number of times tro match, default HUGE
            name: optional name assigned to this match

        [*] Thus, if content is [[a, b, c], [d, e], [f, g, h]] this is
            equivalent to (a b c | d e | f g h); if content is None,
            this is equivalent to '.' in regular expression terms.
            The min and max parameters work as follows:
                min=0, max=maxint: .*
                min=1, max=maxint: .+
                min=0, max=1: .?
                min=1, max=1: .
            If content is not None, replace the dot with the parenthesized
            list of alternatives, e.g. (a b c | d e | f g h)*
        N(R*ttupleRSRetmintmaxR
(RReRyRzR
talt((s$/usr/lib/python2.6/lib2to3/pytree.pyRPvs
			cCs@d}|idj	oEt|iƒdjo/t|idƒdjo|idd}n|idjo`|idjoP|idjotd|iƒS|dj	o|i|ijo|iƒSn|idjoat|t	ƒoQ|idjoA|i|ijo.t	|i|i|i|i|i|iƒS|S(s+Optimize certain stacked wildcard patterns.iiR
N(
R*ReR`RyRzRqR
RgR%Rr(RRw((s$/usr/lib/python2.6/lib2to3/pytree.pyRg™s 0   #	

cCs|i|g|ƒS(s'Does this pattern exactly match a node?(Rn(RR7Rj((s$/usr/lib/python2.6/lib2to3/pytree.pyRl¬scCs{xt|i|ƒD]c\}}|t|ƒjoD|dj	o2|i|ƒ|iot|ƒ||i<qnntSqWtS(s4Does this pattern exactly match a sequence of nodes?N(RoR`R*RiR
R&R,R'(RRmRjRvRk((s$/usr/lib/python2.6/lib2to3/pytree.pyRn°s


	ccst|idjogx]t|idtt|ƒ|iƒƒD]6}h}|io|| ||i<n||fVq9Wnú|idjo|i|ƒVnØti	}t
ƒt_	zµyQxJ|i|dƒD]6\}}|io|| ||i<n||fVqÇWWn]tj
oQxL|i
|ƒD]6\}}|io|| ||i<n||fVq#WnXWd|t_	XdS(s"
        Generator yielding matches for a sequence of nodes.

        Args:
            nodes: sequence of nodes

        Yields:
            (count, results) tuples where:
            count: the match comprises nodes[:count];
            results: dict containing named submatches.
        it	bare_nameiN(ReR*txrangeRyR`RzR
t_bare_name_matchesRLtstderrRt_recursive_matchestRuntimeErrort_iterative_matches(RRmtcountRktsave_stderr((s$/usr/lib/python2.6/lib2to3/pytree.pyRo»s2)
	

c	csit|ƒ}d|ijodhfVng}xO|iD]D}x;t||ƒD]*\}}||fV|i||fƒqQWq;Wxß|o×g}xÄ|D]¼\}}	||jo£||ijo“x|iD]}xxt|||ƒD]c\}
}|
djoJh}|i|	ƒ|i|ƒ||
|fV|i||
|fƒqçqçWqÍWqšqšW|}q†WdS(s(Helper to iteratively yield the matches.iN(R`RyReRoR-RzRi(RRmtnodelenRjR{RvRktnew_resultstc0tr0tc1tr1((s$/usr/lib/python2.6/lib2to3/pytree.pyR‚ås6




+cCs d}h}t}t|ƒ}xd|o[||joNt}xA|iD]6}|di|||ƒo|d7}t}PqFqFWq!W|| ||i<||fS(s(Special optimized matcher for bare_name.ii(R'R`R,ReRlR
(RRmRƒRktdoneRztleaf((s$/usr/lib/python2.6/lib2to3/pytree.pyR~s

c	csÅ||ijodhfVn||ijo’x|iD]€}xwt||ƒD]f\}}xW|i|||dƒD];\}}h}|i|ƒ|i|ƒ|||fVqvWqOWq9WndS(s(Helper to recursively yield the matches.iiN(RyRzReRoR€Ri(	RRmRƒR{R‡RˆR‰RŠRk((s$/usr/lib/python2.6/lib2to3/pytree.pyR€s


N(
RGRHRIR*tHUGERPRgRlRnRoR‚R~R€(((s$/usr/lib/python2.6/lib2to3/pytree.pyRrhs#		*		tNegatedPatterncBs/eZdd„Zd„Zd„Zd„ZRS(cCs|dj	on||_dS(s
        Initializer.

        The argument is either a pattern or None.  If it is None, this
        only matches an empty sequence (effectively '$' in regex
        lingo).  If it is not None, this matches whenever the argument
        pattern doesn't have any matches.
        N(R*Re(RRe((s$/usr/lib/python2.6/lib2to3/pytree.pyRP#s	
cCstS(N(R'(RR7((s$/usr/lib/python2.6/lib2to3/pytree.pyRl0scCst|ƒdjS(Ni(R`(RRm((s$/usr/lib/python2.6/lib2to3/pytree.pyRn4sccsi|idjo&t|ƒdjodhfVqen0x!|ii|ƒD]
\}}dSWdhfVdS(Ni(ReR*R`Ro(RRmRvRk((s$/usr/lib/python2.6/lib2to3/pytree.pyRo8sN(RGRHR*RPRlRnRo(((s$/usr/lib/python2.6/lib2to3/pytree.pyRŽ!s
		c	cs¸|pdhfVnŸ|d|d}}x†|i|ƒD]u\}}|p||fVq;xPt|||ƒD];\}}h}|i|ƒ|i|ƒ|||fVqqWq;WdS(sR
    Generator yielding matches for a sequence of patterns and nodes.

    Args:
        patterns: a sequence of patterns
        nodes: a sequence of nodes

    Yields:
        (count, results) tuples where:
        count: the entire sequence of patterns matches nodes[:count];
        results: dict containing named submatches.
        iiN(RoRi(	tpatternsRmtptrestR‡RˆR‰RŠRk((s$/usr/lib/python2.6/lib2to3/pytree.pyRoDs


(RIt
__author__RLRRRRRRR
RNR5RcRdRpRqRrRŽRo(((s$/usr/lib/python2.6/lib2to3/pytree.pyt<module>s"	ÅhG	V,=¹#

ACC SHELL 2018