Hacked By AnonymousFox
�
{fc @ si d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z d e j f d � � YZ
d S( s& Fixer for has_key().
Calls to .has_key() methods are expressed in terms of the 'in'
operator:
d.has_key(k) -> k in d
CAVEATS:
1) While the primary target of this fixer is dict.has_key(), the
fixer will change any has_key() method call, regardless of its
class.
2) Cases like this will not be converted:
m = d.has_key
if m(k):
...
Only *calls* to has_key() are converted. While it is possible to
convert the above to something like
m = d.__contains__
if m(k):
...
this is currently not done.
i ( t pytree( t token( t
fixer_base( t Namet parenthesizet FixHasKeyc B s e Z e Z d Z d � Z RS( s�
anchor=power<
before=any+
trailer< '.' 'has_key' >
trailer<
'('
( not(arglist | argument<any '=' any>) arg=any
| arglist<(not argument<any '=' any>) arg=any ','>
)
')'
>
after=any*
>
|
negation=not_test<
'not'
anchor=power<
before=any+
trailer< '.' 'has_key' >
trailer<
'('
( not(arglist | argument<any '=' any>) arg=any
| arglist<(not argument<any '=' any>) arg=any ','>
)
')'
>
>
>
c
C sU | s t � | j } | j j | j k rC | j j | j � rC d S| j d � } | d } | j } g | d D] } | j
� ^ qp } | d j
� } | j d � }
|
r� g |
D] } | j
� ^ q� }
n | j | j | j | j | j
| j | j | j f k rt | � } n t | � d k r6| d } n t j | j | � } d | _ t d d
d �} | r�t d d
d �} t j | j | | f � } n t j | j | | | f � }
|
r�t |
� }
t j | j |
f t |
� � }
n | j j | j | j | j | j | j | j | j | j | j f k rHt |
� }
n | |
_ |
S( Nt negationt anchort beforet argt afteri i u u int prefixu not( t AssertionErrort symst parentt typet not_testt patternt matcht Nonet getR t clonet
comparisont and_testt or_testt testt lambdeft argumentR t lenR t Nodet powerR t comp_opt tuplet exprt xor_exprt and_exprt
shift_exprt
arith_exprt termt factor( t selft nodet resultsR
R R R t nR R R
t n_opt n_nott new( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_has_key.pyt transformH sF
#"!
% ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR/ ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_has_key.pyR '