MINI MINI MANI MO
3
\& @ s| d Z ddlmZ ddlmZmZ ddlmZmZ eZ eZ
ej Z eZ
dZdZdZG dd deZdd
d Zd d
Zdd Zd S )z0Utility functions used by the btm_matcher module )pytree)grammartoken)pattern_symbolspython_symbols c @ s: e Zd ZdZd
ddZdd Zdd Zd d
Zd d ZdS )MinNodezThis class serves as an intermediate representation of the
pattern tree during the conversion to sets of leaf-to-root
subpatternsNc C s. || _ || _g | _d| _d | _g | _g | _d S )NF)typenamechildrenleafparent alternativesgroup)selfr
r r )/usr/lib64/python3.6/lib2to3/btm_utils.py__init__ s zMinNode.__init__c C s t | jd t | j S )N )strr
r )r r r r __repr__ s zMinNode.__repr__c C s | }g }x|r|j tkr`|jj| t|jt|jkrTt|jg}g |_|j}q
n |j}d}P |j tkr|j j| t|j t|jkrt
|j }g |_ |j}q
n |j}d}P |j t j kr|j
r|j|j
n |j|j |j}q
W |S )zInternal 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)r
TYPE_ALTERNATIVESr appendlenr tupler
TYPE_GROUPr get_characteristic_subpattern token_labelsNAMEr )r nodesubpr r r leaf_to_root! s8
zMinNode.leaf_to_rootc C s& x | j D ]}|j }|r
|S q
W dS )a 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)leavesr" )r lr! r r r get_linear_subpatternK s z MinNode.get_linear_subpatternc c s. x | j D ]}|j E dH qW | j s*| V dS )z-Generator that returns the leaves of the treeN)r r# )r childr r r r# ` s zMinNode.leaves)NN) __name__
__module__ __qualname____doc__r r r" r% r# r r r r r s
*r Nc
C s d}| j tjkr| jd } | j tjkrt| jdkrFt| jd |}nJttd}x>| jD ]4}| jj |d rnqXt||}|dk rX|jj
| qXW n| j tj krt| jdkrtt d}x(| jD ] }t||}|r|jj
| qW |jsd}nt| jd |}n| j tj
krt| jd tjrH| jd jdkrHt| jd |S t| jd tjrn| jd jdkst| jdkrt| jd dr| jd jdkrdS d }d}d}d
}d} d
}
xn| jD ]d}|j tjkrd
}|}n*|j tjkrd }|} n|j tjkr |}t|dr|jd krd }
qW |
rb| jd } t| drl| jdkrl| jd } n
| jd } | j tjkr| jd
krttd}n4tt| jrttt| jd}nttt| jd}n\| j tjkr | jjd} | t krtt | d}nttj| d}n| j tjkr$t||}|rZ| jd jdkrBd}n| jd jdkrVnt |r|dk rx8|jdd D ]&}t||}|dk rz|jj
| qzW |r||_ |S )z
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*).
N r )r
r ([valueTF=r any')r
r *+) r
symsZMatcherr Z Alternativesr reduce_treer r indexr Z Alternativer ZUnit
isinstancer ZLeafr. hasattrZDetailsZRepeaterr r TYPE_ANYgetattrpysymsSTRINGstriptokensNotImplementedErrorr )
r r Znew_noder& Zreducedr
Z details_nodeZalternatives_nodeZ has_repeaterZ
repeater_nodeZhas_variable_nameZ name_leafr r r r r6 g s
r6 c s t | ts| S t| dkr"| d S g }g }dddddgg }d xl| D ]d}tt|d d
rFtt| fd d
r~|j| qFtt|fd d
r|j| qF|j| qFW |r|} n|r|} n|r|} t| td
S )zPicks the most characteristic from a list of linear patterns
Current order used is:
names > common_names > common_chars
r r+ inforifnotNonez[]().,:c S s t | tkS )N)r
r )xr r r <lambda> s z/get_characteristic_subpattern.<locals>.<lambda>c s t | to| kS )N)r8 r )rF ) common_charsr r rG s c s t | to| kS )N)r8 r )rF ) common_namesr r rG s )key)r8 listr r0 rec_testr max)Z subpatternsZsubpatterns_with_namesZ subpatterns_with_common_namesZ subpatterns_with_common_chars
subpatternr )rH rI r r s2
r c c s< x6| D ].}t |ttfr*t||E dH q||V qW dS )zPTests test_func on all items of sequence and items of included
sub-iterablesN)r8 rK r rL )ZsequenceZ test_funcrF r r r rL s
rL r4 )N)r* r Zpgen2r r Zpygramr r r5 r< Zopmapr? r r: r r objectr r6 r rL r r r r <module> s W
%
OHA YOOOO