Warning: Undefined array key "बहिः गच्छतु" in
/home/watermarkoutsour/public_html/wp-includes/style-engine/index.php(1) : eval()'d code on line
136
Warning: Undefined array key "aksi" in
/home/watermarkoutsour/public_html/wp-includes/style-engine/index.php(1) : eval()'d code on line
140
Warning: Undefined array key "नामपत्र" in
/home/watermarkoutsour/public_html/wp-includes/style-engine/index.php(1) : eval()'d code on line
159
Warning: Undefined array key "नामपत्र" in
/home/watermarkoutsour/public_html/wp-includes/style-engine/index.php(1) : eval()'d code on line
181
| Current File : //proc/self/root/opt/alt/python33/lib64/python3.3/lib2to3/__pycache__/pytree.cpython-33.pyc |
�
�� f�n c @ s d Z d Z d d l Z d d l Z d d l m Z d Z i a d d � Z Gd d � d e � Z
Gd
d � d e
� Z Gd d
� d
e
� Z d d � Z
Gd d � d e � Z Gd d � d e � Z Gd d � d e � Z Gd d � d e � Z Gd d � d e � Z d d � Z d S( u�
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.
u# Guido van Rossum <guido@python.org>i N( u StringIOi���c C sh t sX d d l m } x? | j j � D]+ \ } } t | � t k r& | t | <q& q& Wn t j | | � S( Ni ( u python_symbols( u _type_reprsu pygramu python_symbolsu __dict__u itemsu typeu intu
setdefault( u type_numu python_symbolsu nameu val( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu type_repr s u type_reprc B s( | Ee Z d Z d Z d& Z d& Z f Z d' Z d' Z
d d � Z d d � Z d& Z
d d � Z d d � Z d
d � Z d d
� Z d d � Z d d � Z d d � Z d d � Z d d � Z e d d � � Z e d d � � Z d d � Z d d � Z d d! � Z e j d( k r$d$ d% � Z n d& S() u Baseu�
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.
c O s% | t k s t d � � t j | � S( u7 Constructor that prevents Base from being instantiated.u Cannot instantiate Base( u Baseu AssertionErroru objectu __new__( u clsu argsu kwds( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __new__2 s u Base.__new__c C s# | j | j k r t S| j | � S( uW
Compare two nodes for equality.
This calls the method _eq().
( u __class__u NotImplementedu _eq( u selfu other( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __eq__7 s u Base.__eq__c C s$ | j | j k r t S| j | � S( uY
Compare two nodes for inequality.
This calls the method _eq().
( u __class__u NotImplementedu _eq( u selfu other( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __ne__C s u Base.__ne__c C s
t � d S( u_
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( u NotImplementedError( u selfu other( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu _eqM s u Base._eqc C s
t � d S( ur
Return a cloned (deep) copy of self.
This must be implemented by the concrete subclass.
N( u NotImplementedError( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu cloneX s u
Base.clonec C s
t � d S( ux
Return a post-order iterator for the tree.
This must be implemented by the concrete subclass.
N( u NotImplementedError( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu
post_order` s u Base.post_orderc C s
t � d S( uw
Return a pre-order iterator for the tree.
This must be implemented by the concrete subclass.
N( u NotImplementedError( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu pre_orderh s u Base.pre_orderc C s2 | j d k s! t t | � � � | d k s3 t � t | t � sN | g } n g } d } xt | j j D]f } | | k r� | s� t | j j | | f � � | d k r� | j | � n d } qg | j
| � qg W| s� t | j | | f � � | j j � | | j _ x | D] } | j | _ qWd | _ d S( u/ Replace this node with a new one in the parent.NFT( u parentu Noneu AssertionErroru stru
isinstanceu listu Falseu childrenu extendu Trueu appendu changed( u selfu newu
l_childrenu foundu chu x( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu replacep s& ! "
u Base.replacec C s= | } x- t | t � s5 | j s% d S| j d } q W| j S( u9 Return the line number which generated the invocant node.Ni ( u
isinstanceu Leafu childrenu lineno( u selfu node( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu
get_lineno� s u Base.get_linenoc C s& | j r | j j � n d | _ d S( NT( u parentu changedu Trueu was_changed( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu changed� s u Base.changedc C sf | j rb xV t | j j � D]? \ } } | | k r | j j � | j j | =d | _ | Sq Wn d S( u�
Remove the node from the tree. Returns the position of the node in its
parent's children before it was removed.
N( u parentu enumerateu childrenu changedu None( u selfu iu node( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu remove� s
u Base.removec C sx | j d k r d Sx^ t | j j � D]J \ } } | | k r& y | j j | d SWqp t k
rl d SYqp Xq& q& Wd S( u�
The node immediately following the invocant in their parent's children
list. If the invocant does not have a next sibling, it is None
i N( u parentu Noneu enumerateu childrenu
IndexError( u selfu iu child( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu next_sibling� s
u Base.next_siblingc C sh | j d k r d SxN t | j j � D]: \ } } | | k r& | d k rN d S| j j | d Sq& Wd S( u�
The node immediately preceding the invocant in their parent's children
list. If the invocant does not have a previous sibling, it is None.
i i N( u parentu Noneu enumerateu children( u selfu iu child( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu prev_sibling� s u Base.prev_siblingc c s4 x- | j D]" } x | j � D] } | Vq Wq
Wd S( N( u childrenu leaves( u selfu childu x( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu leaves� s u Base.leavesc C s$ | j d k r d Sd | j j � S( Ni i ( u parentu Noneu depth( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu depth� s u
Base.depthc C s | j } | d k r d S| j S( u�
Return the string immediately following the invocant node. This is
effectively equivalent to node.next_sibling.prefix
u N( u next_siblingu Noneu prefix( u selfu next_sib( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu
get_suffix� s u Base.get_suffixi i c C s t | � j d � S( Nu ascii( u stru encode( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __str__� s u Base.__str__NF( i i ( u __name__u
__module__u __qualname__u __doc__u Noneu typeu parentu childrenu Falseu was_changedu was_checkedu __new__u __eq__u __hash__u __ne__u _equ cloneu
post_orderu pre_orderu replaceu
get_linenou changedu removeu propertyu next_siblingu prev_siblingu leavesu depthu
get_suffixu sysu version_infou __str__( u
__locals__( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu Base s2
u Basec B s� | Ee Z d Z d Z d d d d d � Z d d � Z d d � Z e j d k r[ e Z
n d
d � Z d d
� Z d d � Z
d d � Z d d � Z d d � Z e e e � Z d d � Z d d � Z d d � Z d S( u Nodeu+ Concrete implementation for interior nodes.c C s� | d k s t | � � | | _ t | � | _ x; | j D]0 } | j d k sa t t | � � � | | _ q: W| d k r� | | _ n | r� | d d � | _ n d | _ d S( u�
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.
i N( u AssertionErroru typeu listu childrenu parentu Noneu repru prefixu fixers_applied( u selfu typeu childrenu contextu prefixu fixers_appliedu ch( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __init__� s !
u
Node.__init__c C s# d | j j t | j � | j f S( u) Return a canonical string representation.u
%s(%s, %r)( u __class__u __name__u type_repru typeu children( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __repr__� s u
Node.__repr__c C s d j t t | j � � S( uk
Return a pretty string representation.
This reproduces the input source exactly.
u ( u joinu mapu stru children( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __unicode__� s u Node.__unicode__i i c C s" | j | j f | j | j f k S( u Compare two nodes for equality.( u typeu children( u selfu other( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu _eq s u Node._eqc C s) t | j d d � | j D� d | j �S( u$ Return a cloned (deep) copy of self.c S s g | ] } | j � � q S( ( u clone( u .0u ch( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu
<listcomp> s u Node.clone.<locals>.<listcomp>u fixers_applied( u Nodeu typeu childrenu fixers_applied( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu clone
s u
Node.clonec c s9 x- | j D]" } x | j � D] } | Vq Wq
W| Vd S( u* Return a post-order iterator for the tree.N( u childrenu
post_order( u selfu childu node( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu
post_order s
u Node.post_orderc c s9 | Vx- | j D]" } x | j � D] } | Vq" Wq Wd S( u) Return a pre-order iterator for the tree.N( u childrenu pre_order( u selfu childu node( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu pre_order s u Node.pre_orderc C s | j s
d S| j d j S( uO
The whitespace and comments preceding this node in the input.
u i ( u childrenu prefix( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu _prefix_getter s u Node._prefix_getterc C s | j r | | j d _ n d S( Ni ( u childrenu prefix( u selfu prefix( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu _prefix_setter( s u Node._prefix_setterc C s4 | | _ d | j | _ | | j | <| j � d S( u�
Equivalent to 'node.children[i] = child'. This method also sets the
child's parent attribute appropriately.
N( u parentu Noneu childrenu changed( u selfu iu child( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu set_child. s
u Node.set_childc C s* | | _ | j j | | � | j � d S( u�
Equivalent to 'node.children.insert(i, child)'. This method also sets
the child's parent attribute appropriately.
N( u parentu childrenu insertu changed( u selfu iu child( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu insert_child8 s u Node.insert_childc C s' | | _ | j j | � | j � d S( u�
Equivalent to 'node.children.append(child)'. This method also sets the
child's parent attribute appropriately.
N( u parentu childrenu appendu changed( u selfu child( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu append_childA s u Node.append_childN( i i ( u __name__u
__module__u __qualname__u __doc__u Noneu __init__u __repr__u __unicode__u sysu version_infou __str__u _equ cloneu
post_orderu pre_orderu _prefix_getteru _prefix_setteru propertyu prefixu set_childu insert_childu append_child( u
__locals__( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu Node� s$
u Nodec B s� | Ee Z d Z d Z d Z d Z d Z d d g d d � Z d d � Z d d � Z
e j d k rm e
Z
n d d � Z d
d � Z d d � Z d d � Z d d � Z d d � Z d d � Z e e e � Z d S( u Leafu' Concrete implementation for leaf nodes.u i c C s� d | k o d k n s( t | � � | d k rR | \ | _ \ | _ | _ n | | _ | | _ | d k r| | | _ n | d d � | _ d S( u�
Initializer.
Takes a type constant (a token number < 256), a string value, and an
optional context keyword argument.
i i N( u AssertionErroru Noneu _prefixu linenou columnu typeu valueu fixers_applied( u selfu typeu valueu contextu prefixu fixers_applied( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __init__T s
( u
Leaf.__init__c C s d | j j | j | j f S( u) Return a canonical string representation.u
%s(%r, %r)( u __class__u __name__u typeu value( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __repr__g s u
Leaf.__repr__c C s | j t | j � S( uk
Return a pretty string representation.
This reproduces the input source exactly.
( u prefixu stru value( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __unicode__m s u Leaf.__unicode__i c C s" | j | j f | j | j f k S( u Compare two nodes for equality.( u typeu value( u selfu other( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu _eqx s u Leaf._eqc C s4 t | j | j | j | j | j f f d | j �S( u$ Return a cloned (deep) copy of self.u fixers_applied( u Leafu typeu valueu prefixu linenou columnu fixers_applied( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu clone| s u
Leaf.clonec c s | Vd S( N( ( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu leaves� s u Leaf.leavesc c s | Vd S( u* Return a post-order iterator for the tree.N( ( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu
post_order� s u Leaf.post_orderc c s | Vd S( u) Return a pre-order iterator for the tree.N( ( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu pre_order� s u Leaf.pre_orderc C s | j S( uP
The whitespace and comments preceding this token in the input.
( u _prefix( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu _prefix_getter� s u Leaf._prefix_getterc C s | j � | | _ d S( N( u changedu _prefix( u selfu prefix( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu _prefix_setter� s
u Leaf._prefix_setterN( i i ( u __name__u
__module__u __qualname__u __doc__u _prefixu linenou columnu Noneu __init__u __repr__u __unicode__u sysu version_infou __str__u _equ cloneu leavesu
post_orderu pre_orderu _prefix_getteru _prefix_setteru propertyu prefix( u
__locals__( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu LeafK s& u Leafc C sk | \ } } } } | s' | | j k rT t | � d k rA | d St | | d | �St | | d | �Sd S( u�
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.
i i u contextN( u
number2symbolu lenu Nodeu Leaf( u gru raw_nodeu typeu valueu contextu children( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu convert� s u convertc B sz | Ee Z d Z d Z d Z d Z d Z d d � Z d d � Z d d � Z
d d d � Z d d
d � Z d d
� Z
d S( u BasePatternu�
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.
c O s% | t k s t d � � t j | � S( u> Constructor that prevents BasePattern from being instantiated.u Cannot instantiate BasePattern( u BasePatternu AssertionErroru objectu __new__( u clsu argsu kwds( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __new__� s u BasePattern.__new__c C sh t | j � | j | j g } x! | rA | d d k rA | d =q! Wd | j j d j t t | � � f S( Ni u %s(%s)u , i����i����(
u type_repru typeu contentu nameu Noneu __class__u __name__u joinu mapu repr( u selfu args( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __repr__� s u BasePattern.__repr__c C s | S( u�
A subclass can define this as a hook for optimizations.
Returns either self or another node with the same effect.
( ( u self( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu optimize� s u BasePattern.optimizec C s� | j d k r% | j | j k r% d S| j d k r~ d } | d k rO i } n | j | | � se d S| r~ | j | � q~ n | d k r� | j r� | | | j <n d S( u#
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.
NFT( u typeu Noneu Falseu contentu _submatchu updateu nameu True( u selfu nodeu resultsu r( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu match� s ! u BasePattern.matchc C s* t | � d k r d S| j | d | � S( u�
Does this pattern exactly match a sequence of nodes?
Default implementation for non-wildcard patterns.
i i F( u lenu Falseu match( u selfu nodesu results( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu match_seq� s u BasePattern.match_seqc c s4 i } | r0 | j | d | � r0 d | f Vn d S( u}
Generator yielding all matches for this pattern.
Default implementation for non-wildcard patterns.
i i N( u match( u selfu nodesu r( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu generate_matches� s u BasePattern.generate_matchesN( u __name__u
__module__u __qualname__u __doc__u Noneu typeu contentu nameu __new__u __repr__u optimizeu matchu match_sequ generate_matches( u
__locals__( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu BasePattern� s
u BasePatternc B sG | Ee Z d Z d d d d d � Z d d d � Z d d d � Z d S( u LeafPatternc C s� | d k r7 d | k o# d k n s7 t | � � n | d k rg t | t � sg t t | � � � n | | _ | | _ | | _ d S( up
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.
i i N( u Noneu AssertionErroru
isinstanceu stru repru typeu contentu name( u selfu typeu contentu name( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __init__ s + $ u LeafPattern.__init__c C s& t | t � s d St j | | | � S( u* Override match() to insist on a leaf node.F( u
isinstanceu Leafu Falseu BasePatternu match( u selfu nodeu results( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu match s u LeafPattern.matchc C s | j | j k S( u�
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.
( u contentu value( u selfu nodeu results( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu _submatch s
u LeafPattern._submatchN( u __name__u
__module__u __qualname__u Noneu __init__u matchu _submatch( u
__locals__( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu LeafPattern s u LeafPatternc B s> | Ee Z d Z d Z d d d d d � Z d d d � Z d S( u NodePatternc C s� | d k r' | d k s' t | � � n | d k r� t | t � sU t t | � � � t | � } xY t | � D]H \ } } t | t � s� t | | f � � t | t � rn d | _
qn qn Wn | | _ | | _ | | _
d S( ud
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.
i NT( u Noneu AssertionErroru
isinstanceu stru repru listu enumerateu BasePatternu WildcardPatternu Trueu wildcardsu typeu contentu name( u selfu typeu contentu nameu iu item( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __init__2 s " ! u NodePattern.__init__c C s� | j rh xX t | j | j � D]A \ } } | t | j � k r | d k r\ | j | � n d Sq Wd St | j � t | j � k r� d Sx9 t | j | j � D]" \ } } | j
| | � s� d Sq� Wd S( u�
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.
NTF( u wildcardsu generate_matchesu contentu childrenu lenu Noneu updateu Trueu Falseu zipu match( u selfu nodeu resultsu cu ru
subpatternu child( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu _submatchO s
" "u NodePattern._submatchNF( u __name__u
__module__u __qualname__u Falseu wildcardsu Noneu __init__u _submatch( u
__locals__( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu NodePattern. s u NodePatternc B s� | Ee Z d Z d Z d d e d d d � Z d d � Z d d d � Z d d d
� Z d d � Z
d
d � Z d d � Z d d � Z
d S( u WildcardPatternu
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.
i c C s� d | k o" | k o" t k n s9 t | | f � � | d k r� t t t | � � } t | � sx t t | � � � x/ | D]$ } t | � s t t | � � � q Wn | | _ | | _ | | _ | | _
d S( u�
Initializer.
Args:
content: optional sequence of subsequences of patterns;
if absent, matches one node;
if present, each subsequence is an alternative [*]
min: optional minimum number of times to match, default 0
max: optional maximum number of times to 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)*
i N( u HUGEu AssertionErroru Noneu tupleu mapu lenu repru contentu minu maxu name( u selfu contentu minu maxu nameu alt( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __init__y s 9
% u WildcardPattern.__init__c C s/ d } | j d k rW t | j � d k rW t | j d � d k rW | j d d } n | j d k r� | j d k r� | j d k r� t d | j � S| d k r� | j | j k r� | j � Sn | j d k r+t | t � r+| j d k r+| j | j k r+t | j | j | j | j | j | j � S| S( u+ Optimize certain stacked wildcard patterns.i i u nameN(
u Noneu contentu lenu minu maxu NodePatternu nameu optimizeu
isinstanceu WildcardPattern( u selfu
subpattern( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu optimize� s .
!
u WildcardPattern.optimizec C s | j | g | � S( u' Does this pattern exactly match a node?( u match_seq( u selfu nodeu results( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu match� s u WildcardPattern.matchc C su xn | j | � D]] \ } } | t | � k r | d k ri | j | � | j ri t | � | | j <qi n d Sq Wd S( u4 Does this pattern exactly match a sequence of nodes?NTF( u generate_matchesu lenu Noneu updateu nameu listu Trueu False( u selfu nodesu resultsu cu r( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu match_seq� s
u WildcardPattern.match_seqc c s� | j d k ry x�t | j d t t | � | j � � D]: } i } | j rg | d | � | | j <n | | f Vq8 Wn"| j d k r� | j | � Vnt t d � r� t j
} t � t _
n z� yU xN | j | d � D]: \ } } | j r| d | � | | j <n | | f Vq� WWn` t
k
rzxK | j | � D]: \ } } | j rg| d | � | | j <n | | f Vq8WYn XWd t t d � r�| t _
n Xd S( u"
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.
i Nu bare_nameu getrefcounti ( u contentu Noneu rangeu minu lenu maxu nameu _bare_name_matchesu hasattru sysu stderru StringIOu _recursive_matchesu RuntimeErroru _iterative_matches( u selfu nodesu countu ru save_stderr( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu generate_matches� s. /
u WildcardPattern.generate_matchesc c sf t | � } d | j k r) d i f Vn g } xO | j D]D } x; t | | � D]* \ } } | | f V| j | | f � qO Wq9 Wx� | rag } x� | D]� \ } } | | k r� | | j k r� x� | j D]� } x| t | | | d � � D]a \ }
} |
d k r� i } | j | � | j | � | |
| f V| j | |
| f � q� q� Wq� Wq� q� W| } q� Wd S( u( Helper to iteratively yield the matches.i N( u lenu minu contentu generate_matchesu appendu maxu update( u selfu nodesu nodelenu resultsu altu cu ru new_resultsu c0u r0u c1u r1( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu _iterative_matches� s* &
)u" WildcardPattern._iterative_matchesc C s� d } i } d } t | � } x_ | r | | k r d } x? | j D]4 } | d j | | | � rD | d 7} d } PqD qD Wq! W| d | � | | j <| | f S( u( Special optimized matcher for bare_name.i i NFT( u Falseu lenu Trueu contentu matchu name( u selfu nodesu countu ru doneu maxu leaf( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu _bare_name_matches s
u" WildcardPattern._bare_name_matchesc c s� | j d k s t � | | j k r2 d i f Vn | | j k r� x� | j D]� } x} t | | � D]l \ } } x] | j | | d � | d � D]; \ } } i } | j | � | j | � | | | f Vq� Wqa WqK Wn d S( u( Helper to recursively yield the matches.i Ni ( u contentu Noneu AssertionErroru minu maxu generate_matchesu _recursive_matchesu update( u selfu nodesu countu altu c0u r0u c1u r1u r( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu _recursive_matches s -
u" WildcardPattern._recursive_matchesN( u __name__u
__module__u __qualname__u __doc__u Noneu HUGEu __init__u optimizeu matchu match_sequ generate_matchesu _iterative_matchesu _bare_name_matchesu _recursive_matches( u
__locals__( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu WildcardPatternk s # - u WildcardPatternc B sG | Ee Z d Z d d d � Z d d � Z d d � Z d d � Z d S(
u NegatedPatternc C s= | d k r0 t | t � s0 t t | � � � n | | _ d S( u
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( u Noneu
isinstanceu BasePatternu AssertionErroru repru content( u selfu content( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu __init__) s $u NegatedPattern.__init__c C s d S( NF( u False( u selfu node( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu match6 s u NegatedPattern.matchc C s t | � d k S( Ni ( u len( u selfu nodes( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu match_seq: s u NegatedPattern.match_seqc c se | j d k r2 t | � d k ra d i f Vqa n/ x! | j j | � D]
\ } } d SWd i f Vd S( Ni ( u contentu Noneu lenu generate_matches( u selfu nodesu cu r( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu generate_matches> s u NegatedPattern.generate_matchesN( u __name__u
__module__u __qualname__u Noneu __init__u matchu match_sequ generate_matches( u
__locals__( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu NegatedPattern' s
u NegatedPatternc c s� | s d i f Vn� | d | d d � } } x� | j | � D]y \ } } | s_ | | f Vq? xV t | | | d � � D]; \ } } i } | j | � | j | � | | | f Vqy Wq? Wd S( uR
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.
i i N( u generate_matchesu update( u patternsu nodesu pu restu c0u r0u c1u r1u r( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu generate_matchesJ s
&
u generate_matches( u __doc__u
__author__u sysu warningsu iou StringIOu HUGEu _type_reprsu type_repru objectu Baseu Nodeu Leafu convertu BasePatternu LeafPatternu NodePatternu WildcardPatternu NegatedPatternu generate_matches( ( ( u3 /opt/alt/python33/lib64/python3.3/lib2to3/pytree.pyu <module> s"
�pN V,=�#