File manager

�
{fc@s�dZd
dl
mZ
d
dlmZmZ
d
dlmZmZ
eZ	eZ
ejZeZ
dZdZdZdef
d	��YZd
d
�
Zd�Zd�Zd
S(s0Utility functions used by the btm_matcher modulei
(
tpytree(tgrammarttoken(tpattern_symbolstpython_symbolsi����i����i����tMinNodecBsAeZ
dZddd
�Zd�Zd�Zd�Zd�ZRS(s�This class serves as an intermediate representation of the
    pattern tree during the conversion to sets of leaf-to-root
    subpatternscCsC|
|_||_
g|_t|_d|_g|_g|_dS(
N(	ttypetnametchildrentFalsetleaftNonetparenttalternativestgroup(tselfRR((s)/usr/lib64/python2.7/lib2to3/btm_utils.pyt__init__s
	
	
	
	
	
	
c

Cst|j
�
d
t|j�
S(Nt
 (tstrRR(
R((s)/usr/lib64/python2.7/lib2to3/btm_utils.pyt__repr__s
c
CsU
|}
g}xB
|
rP
|
jt
kr�|
jj|�

t|
j�
t|
j�
kr|t|
j�
g
}g|
_|
j}
qq�|
j}
d
}Pn|
jt	kr
|
j
j|�

t|
j
�
t|
j�
kr�t|
j
�
}g|
_
|
j}
qq
|
j}
d
}Pn|
jtj
kr4
|
jr4
|j|
j�

n|j|
j�

|
j}
qW|S(s�Internal method. Returns a characteristic path of the
        pattern tree. This method must be run for all leaves until the
        linear subpatterns are merged into a singleN(RtTYPE_ALTERNATIVESR
tappendtlenRttupleRRt
TYPE_GROUPRtget_characteristic_subpatternttoken_labelstNAMER(Rtnodetsubp((s)/usr/lib64/python2.7/lib2to3/btm_utils.pytleaf_to_root!s8

	



	
	
	




	
	
	



c
Cs1x*|j�D]}
|
j
�}|r
|Sq
Wd
S(s�Drives the leaf_to_root method. The reason that
        leaf_to_root must be run multiple times is because we need to
        reject 'group' matches; for example the alternative form
        (a | b c) creates a group [b c] that needs to be matched. Since
        matching multiple linear patterns overcomes the automaton's
        capabilities, leaf_to_root merges each group into a single
        choice based on 'characteristic'ity,

        i.e. (a|b c) -> (a|b) if b more characteristic than c

        Returns: The most 'characteristic'(as defined by
          get_characteristic_subpattern) path for the compiled pattern
          tree.
        N(tleavesR(Rt
lR((s)/usr/lib64/python2.7/lib2to3/btm_utils.pytget_linear_subpatternKs


c
csEx-|jD]"}
x|
j
�D]}|V
qWq
W|jsA|V
nd
S(s-Generator that returns the leaves of the treeN(RR(Rtchildt
x((s)/usr/lib64/python2.7/lib2to3/btm_utils.pyR`s




	
N(	t__name__t
__module__t__doc__RRRRR!R(((s)/usr/lib64/python2.7/lib2to3/btm_utils.pyRs			*	c
Csd}|j
tjkr(|jd
}n|j
tjkr�t|j�
dk
rht|jd
|
�}q�tdt	�
}x�|jD]P}|jj
|�
dr�q�nt||�}|dk	r�|jj|�

q�q�Wn$|j
tjkrx
t|j�
dkr_
tdt
�
}x9|jD].}t||�}|r
|jj|�

q
q
W|jsu
d}qu
q�t|jd
|
�}n�|j
tjkr�t|jd
tj�r�
|jd
jdkr�
t|jd|
�St|jd
tj�r�
|jd
jdks=t|j�
dkrAt|jdd�rA|jdjdkrAdSt}d}d}t}d}	t}
x�|jD]�}|j
tjkr�t}|}n<|j
tjkr�t}|}	n|j
tjkr�|}nt|d�ro|jdkrot}
qoqoW|
rA|jd}t|d�rN|jdkrN|jd	}qNn
|jd
}|j
tjkr�|jd
kr�tdt�
}qTtt|j�r�tdtt|j��
}qTtdtt|j��
}n�|j
tjkr0|jjd�
}|tkrtdt|�
}qTtdtjd|�}n$|j
tjkrTt||
�}n|r�|	jd
jd
kryd}q�|	jd
jdkr�q�t �
n|r�|dk	r�xI|jdd!D]4}t||�}|dk	r�|jj|�

q�q�Wq�n|r|
|_!n|S(s�
    Internal function. Reduces a compiled pattern tree to an
    intermediate representation suitable for feeding the
    automaton. This also trims off any optional pattern elements(like
    [a], a*).
    iiRi
t
(t
[tvaluet
=itanyt
'Rt
*t
+i����N("RRtsymstMatcherRtAlternativesRtreduce_treeRRtindexRtAlternativeRtUnitt
isinstanceRtLeafR)thasattrtTrueR	tDetailstRepeaterRRtTYPE_ANYtgetattrtpysymstSTRINGtstripttokenstNotImplementedErrorR(
RRtnew_nodeR"treducedR
tdetails_nodetalternatives_nodethas_repeatert
repeater_nodethas_variable_namet	name_leafR((s)/usr/lib64/python2.7/lib2to3/btm_utils.pyR2hs�











	













	


	

	












	







c
s,
t|t
�s|St|�
d
kr-|dSg}
g}dddddg�
g}d�x�|D]�}tt|d	���
ratt|�f
d
���
r�|j|�

q�tt|�
f
d���
r�|j|�

q�|
j|�

qaqaW|
r�|
}n|r

|}n|r
|}nt|dt�

S(
s�Picks the most characteristic from a list of linear patterns
    Current order used is:
    names > common_names > common_chars
    i
itintfortiftnotRs[]().,:c

Sst|�
t
kS(
N(RR(
R#((s)/usr/lib64/python2.7/lib2to3/btm_utils.pyt<lambda>�tc

st|t
�o|�kS(
N(R6R(
R#(
tcommon_chars(s)/usr/lib64/python2.7/lib2to3/btm_utils.pyRO

RPc

st|t
�o|�kS(
N(R6R(
R#(
tcommon_names(s)/usr/lib64/python2.7/lib2to3/btm_utils.pyRO
RPtkey(R6tlistRR+trec_testRtmax(tsubpatternstsubpatterns_with_namestsubpatterns_with_common_namestsubpatterns_with_common_charst
subpattern((RQRRs)/usr/lib64/python2.7/lib2to3/btm_utils.pyR�s2










	


	


	

	

	ccsWxP|D]H}t|t
tf�rDx*t||
�D]}|V
q2Wq|
|�
V
qWd
S(sPTests test_func on all items of sequence and items of included
    sub-iterablesN(R6RTRRU(tsequencet	test_funcR#t
y((s)/usr/lib64/python2.7/lib2to3/btm_utils.pyRU
s




N(R&RPRtpgen2R
RtpygramRRR/R>topmapRARR<RRtobjectRRR2RRU(((s)/usr/lib64/python2.7/lib2to3/btm_utils.pyt<module>
s



	


X�	%