/usr/lib64/python3.9/lib2to3/__pycache__
Edit: /usr/lib64/python3.9/lib2to3/__pycache__/btm_utils.cpython-39.pyc (6148B)
a
i& @ s| d Z ddlmZ ddlmZmZ ddlmZmZ eZ eZ
ej Z eZ
dZdZdZG dd d eZdd d Zd
d Zdd Zd
S )z0Utility functions used by the btm_matcher module )pytree)grammartoken)pattern_symbolspython_symbolsc @ 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.9/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 }|r|j tkr^|j| t|jt|jkrRt|jg}g |_|j}qn |j}d}q|j tkr|j | t|j t|jkrt
|j }g |_ |j}qn |j}d}q|j t j kr|j
r||j
n ||j |j}q|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& | D ]}| }|r| S qdS )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* | j D ]}| E dH q| 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 |}nFttd}| jD ]4}| j |d rlqVt||}|durV|j
| qVn| j tj krt| jdkrtt d}| jD ] }t||}|r|j
| q|jsd}nt| jd |}n| j tj
krt| jd tjr>| jd jdkr>t| jd |S t| jd tjrd| jd jdkst| jdkrt| jd dr| jd jdkrdS d }d}d}d
}d} d
}
| jD ]d}|j tjkrd
}|}n*|j tjkrd }|} n|j tjkr |}t|dr|jd krd }
q|
rT| jd } t| dr^| jdkr^| jd } n
| jd } | j tjkr| jd
krttd}n4tt| jrttt| jd}nttt| jd}n\| j tjkr| jd} | t v rtt | d}nttj| d}n| j tjkrt||}|rL| jd jdkr4d}n| jd jdkrHnt |r|dur|jdd D ]&}t||}|durj|j
| qj|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 ([valueTF= any')r r *+r ) r symsZMatcherr
Z Alternativesr reduce_treer
r indexr Z Alternativer ZUnit
isinstancer ZLeafr0 hasattrZDetailsZRepeaterr r TYPE_ANYgetattrpysymsSTRINGstriptokensNotImplementedErrorr )
r! r Znew_noder' Zreducedr Z details_nodeZalternatives_nodeZ has_repeaterZ
repeater_nodeZhas_variable_nameZ name_leafr r r r r8 g s
r8 c s t | ts| S t| dkr"| d S g }g }g dg }d | D ]d}tt|dd r>tt| fddrv|| q>tt|fddr|| q>|| q>|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 | tu S N)r r xr r r
z/get_characteristic_subpattern..c s t | to| v S rH r: r rI ) common_charsr r rK rL c s t | to| v S rH rM rI ) common_namesr r rK rL )key)r: listr r3 rec_testr max)Z subpatternsZsubpatterns_with_namesZ subpatterns_with_common_namesZ subpatterns_with_common_chars
subpatternr )rN rO r r s6
r c c s8 | D ].}t |ttfr(t||E dH q||V qdS )zPTests test_func on all items of sequence and items of included
sub-iterablesN)r: rQ r rR )ZsequenceZ test_funcrJ r r r rR s rR )N)r+ r Zpgen2r r Zpygramr r r7 r> ZopmaprA r r< r r objectr
r8 r rR r r r r s W
%