PK J/�\�R�� fix_imports.pyonu �[��� �
{ fc @ s� d Z d d l m Z d d l m Z m Z i0 d d 6d d 6d d 6d d
6d d 6d
d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d! d" 6d# d$ 6d% d& 6d' d( 6d) d* 6d+ d, 6d- d. 6d/ d0 6d1 d2 6d3 d4 6d5 d6 6d7 d8 6d9 d: 6d; d< 6d= d> 6d? d@ 6dA dB 6dC dD 6dC dE 6dF dG 6dH dI 6dJ dK 6dL dM 6dN dO 6dP dQ 6dP dR 6dP dS 6dT dU 6dV dW 6dV dX 6dY dZ 6d[ d\ 6Z d] � Z e d^ � Z d_ e j f d` � � YZ
da S(b s/ Fix incompatible imports and module references.i ( t
fixer_base( t Namet
attr_chaint iot StringIOt cStringIOt picklet cPicklet builtinst __builtin__t copyregt copy_regt queuet Queuet socketservert SocketServert configparsert ConfigParsert reprlibt reprs tkinter.filedialogt
FileDialogt tkFileDialogs tkinter.simpledialogt SimpleDialogt tkSimpleDialogs tkinter.colorchoosert tkColorChoosers tkinter.commondialogt tkCommonDialogs tkinter.dialogt Dialogs tkinter.dndt Tkdnds tkinter.fontt tkFonts tkinter.messageboxt tkMessageBoxs tkinter.scrolledtextt ScrolledTexts tkinter.constantst Tkconstantss tkinter.tixt Tixs tkinter.ttkt ttkt tkintert Tkintert _markupbaset
markupbaset winregt _winregt _threadt threadt
_dummy_threadt dummy_threads dbm.bsdt dbhashs dbm.dumbt dumbdbms dbm.ndbmt dbms dbm.gnut gdbms
xmlrpc.clientt xmlrpclibs
xmlrpc.servert DocXMLRPCServert SimpleXMLRPCServers http.clientt httplibs
html.entitiest htmlentitydefss html.parsert
HTMLParsers http.cookiest Cookies http.cookiejart cookielibs http.servert BaseHTTPServert SimpleHTTPServert
CGIHTTPServert
subprocesst commandst collectionst
UserStringt UserLists urllib.parset urlparses urllib.robotparsert robotparserc C s d d j t t | � � d S( Nt (t |t )( t joint mapR ( t members( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyt
alternates= s c c sl d j g | D] } d | ^ q
� } t | j � � } d | | f Vd | Vd | | f Vd | Vd S( Ns | s module_name='%s'sy name_import=import_name< 'import' ((%s) |
multiple_imports=dotted_as_names< any* (%s) any* >) >
s� import_from< 'from' (%s) 'import' ['(']
( any | import_as_name< any 'as' any > |
import_as_names< any* >) [')'] >
s� import_name< 'import' (dotted_as_name< (%s) 'as' any > |
multiple_imports=dotted_as_names<
any* dotted_as_name< (%s) 'as' any > any* >) >
s3 power< bare_with_attr=(%s) trailer<'.' any > any* >( RE RH t keys( t mappingt keyt mod_listt
bare_names( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyt
build_patternA s & t
FixImportsc B sM e Z e Z e Z e Z d Z d � Z d � Z d � Z
d � Z d � Z RS( i c C s d j t | j � � S( NRC ( RE RN RJ ( t self( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyRN ` s c C s& | j � | _ t t | � j � d S( N( RN t PATTERNt superRO t compile_pattern( RP ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyRS c s c sa t t | � j � � | � } | r] d | k rY t � f d � t | d � D� � rY t S| St S( Nt bare_with_attrc 3 s | ] } � | � Vq d S( N( ( t .0t obj( t match( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pys <genexpr>q s t parent( RR RO RW t anyR t False( RP t nodet results( ( RW s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyRW j s %c C s& t t | � j | | � i | _ d S( N( RR RO t
start_treet replace( RP t treet filename( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyR] v s c C s� | j d � } | r� | j } t | j | � } | j t | d | j �� d | k ri | | j | <n d | k r� | j | � } | r� | j | | � q� q� nH | d d } | j j | j � } | r� | j t | d | j �� n d S( Nt module_namet prefixt name_importt multiple_importsRT i ( t gett valuet unicodeRJ R^ R Rb RW t transform( RP R[ R\ t
import_modt mod_namet new_namet bare_name( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyRh z s (
t __name__t
__module__t Truet
BM_compatiblet keep_line_ordert MAPPINGRJ t run_orderRN RS RW R] Rh ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyRO U s N( t __doc__t R t
fixer_utilR R Rr RH RN t BaseFixRO ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyt <module> sj
PK J/�\���� � fix_future.pycnu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( sV Remove __future__ imports
from __future__ import foo is replaced with an empty line.
i ( t
fixer_base( t BlankLinet FixFuturec B s# e Z e Z d Z d Z d � Z RS( s; import_from< 'from' module_name="__future__" 'import' any >i
c C s t � } | j | _ | S( N( R t prefix( t selft nodet resultst new( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_future.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNt run_orderR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_future.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_future.pyt <module> s PK J/�\ �6d� � fix_tuple_params.pynu �[��� """Fixer for function definitions with tuple parameters.
def func(((a, b), c), d):
...
->
def func(x, d):
((a, b), c) = x
...
It will also support lambdas:
lambda (x, y): x + y -> lambda t: t[0] + t[1]
# The parens are a syntax error in Python 3
lambda (x): x + y -> lambda x: x + y
"""
# Author: Collin Winter
# Local imports
from .. import pytree
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Assign, Name, Newline, Number, Subscript, syms
def is_docstring(stmt):
return isinstance(stmt, pytree.Node) and \
stmt.children[0].type == token.STRING
class FixTupleParams(fixer_base.BaseFix):
run_order = 4 #use a lower order since lambda is part of other
#patterns
BM_compatible = True
PATTERN = """
funcdef< 'def' any parameters< '(' args=any ')' >
['->' any] ':' suite=any+ >
|
lambda=
lambdef< 'lambda' args=vfpdef< '(' inner=any ')' >
':' body=any
>
"""
def transform(self, node, results):
if "lambda" in results:
return self.transform_lambda(node, results)
new_lines = []
suite = results["suite"]
args = results["args"]
# This crap is so "def foo(...): x = 5; y = 7" is handled correctly.
# TODO(cwinter): suite-cleanup
if suite[0].children[1].type == token.INDENT:
start = 2
indent = suite[0].children[1].value
end = Newline()
else:
start = 0
indent = u"; "
end = pytree.Leaf(token.INDENT, u"")
# We need access to self for new_name(), and making this a method
# doesn't feel right. Closing over self and new_lines makes the
# code below cleaner.
def handle_tuple(tuple_arg, add_prefix=False):
n = Name(self.new_name())
arg = tuple_arg.clone()
arg.prefix = u""
stmt = Assign(arg, n.clone())
if add_prefix:
n.prefix = u" "
tuple_arg.replace(n)
new_lines.append(pytree.Node(syms.simple_stmt,
[stmt, end.clone()]))
if args.type == syms.tfpdef:
handle_tuple(args)
elif args.type == syms.typedargslist:
for i, arg in enumerate(args.children):
if arg.type == syms.tfpdef:
# Without add_prefix, the emitted code is correct,
# just ugly.
handle_tuple(arg, add_prefix=(i > 0))
if not new_lines:
return
# This isn't strictly necessary, but it plays nicely with other fixers.
# TODO(cwinter) get rid of this when children becomes a smart list
for line in new_lines:
line.parent = suite[0]
# TODO(cwinter) suite-cleanup
after = start
if start == 0:
new_lines[0].prefix = u" "
elif is_docstring(suite[0].children[start]):
new_lines[0].prefix = indent
after = start + 1
for line in new_lines:
line.parent = suite[0]
suite[0].children[after:after] = new_lines
for i in range(after+1, after+len(new_lines)+1):
suite[0].children[i].prefix = indent
suite[0].changed()
def transform_lambda(self, node, results):
args = results["args"]
body = results["body"]
inner = simplify_args(results["inner"])
# Replace lambda ((((x)))): x with lambda x: x
if inner.type == token.NAME:
inner = inner.clone()
inner.prefix = u" "
args.replace(inner)
return
params = find_params(args)
to_index = map_to_index(params)
tup_name = self.new_name(tuple_name(params))
new_param = Name(tup_name, prefix=u" ")
args.replace(new_param.clone())
for n in body.post_order():
if n.type == token.NAME and n.value in to_index:
subscripts = [c.clone() for c in to_index[n.value]]
new = pytree.Node(syms.power,
[new_param.clone()] + subscripts)
new.prefix = n.prefix
n.replace(new)
### Helper functions for transform_lambda()
def simplify_args(node):
if node.type in (syms.vfplist, token.NAME):
return node
elif node.type == syms.vfpdef:
# These look like vfpdef< '(' x ')' > where x is NAME
# or another vfpdef instance (leading to recursion).
while node.type == syms.vfpdef:
node = node.children[1]
return node
raise RuntimeError("Received unexpected node %s" % node)
def find_params(node):
if node.type == syms.vfpdef:
return find_params(node.children[1])
elif node.type == token.NAME:
return node.value
return [find_params(c) for c in node.children if c.type != token.COMMA]
def map_to_index(param_list, prefix=[], d=None):
if d is None:
d = {}
for i, obj in enumerate(param_list):
trailer = [Subscript(Number(unicode(i)))]
if isinstance(obj, list):
map_to_index(obj, trailer, d=d)
else:
d[obj] = prefix + trailer
return d
def tuple_name(param_list):
l = []
for obj in param_list:
if isinstance(obj, list):
l.append(tuple_name(obj))
else:
l.append(obj)
return u"_".join(l)
PK J/�\�@Zw
fix_idioms.pynu �[��� """Adjust some old Python 2 idioms to their modern counterparts.
* Change some type comparisons to isinstance() calls:
type(x) == T -> isinstance(x, T)
type(x) is T -> isinstance(x, T)
type(x) != T -> not isinstance(x, T)
type(x) is not T -> not isinstance(x, T)
* Change "while 1:" into "while True:".
* Change both
v = list(EXPR)
v.sort()
foo(v)
and the more general
v = EXPR
v.sort()
foo(v)
into
v = sorted(EXPR)
foo(v)
"""
# Author: Jacques Frechet, Collin Winter
# Local imports
from .. import fixer_base
from ..fixer_util import Call, Comma, Name, Node, BlankLine, syms
CMP = "(n='!=' | '==' | 'is' | n=comp_op< 'is' 'not' >)"
TYPE = "power< 'type' trailer< '(' x=any ')' > >"
class FixIdioms(fixer_base.BaseFix):
explicit = True # The user must ask for this fixer
PATTERN = r"""
isinstance=comparison< %s %s T=any >
|
isinstance=comparison< T=any %s %s >
|
while_stmt< 'while' while='1' ':' any+ >
|
sorted=any<
any*
simple_stmt<
expr_stmt< id1=any '='
power< list='list' trailer< '(' (not arglist<any+>) any ')' > >
>
'\n'
>
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
|
sorted=any<
any*
simple_stmt< expr_stmt< id1=any '=' expr=any > '\n' >
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
""" % (TYPE, CMP, CMP, TYPE)
def match(self, node):
r = super(FixIdioms, self).match(node)
# If we've matched one of the sort/sorted subpatterns above, we
# want to reject matches where the initial assignment and the
# subsequent .sort() call involve different identifiers.
if r and "sorted" in r:
if r["id1"] == r["id2"]:
return r
return None
return r
def transform(self, node, results):
if "isinstance" in results:
return self.transform_isinstance(node, results)
elif "while" in results:
return self.transform_while(node, results)
elif "sorted" in results:
return self.transform_sort(node, results)
else:
raise RuntimeError("Invalid match")
def transform_isinstance(self, node, results):
x = results["x"].clone() # The thing inside of type()
T = results["T"].clone() # The type being compared against
x.prefix = u""
T.prefix = u" "
test = Call(Name(u"isinstance"), [x, Comma(), T])
if "n" in results:
test.prefix = u" "
test = Node(syms.not_test, [Name(u"not"), test])
test.prefix = node.prefix
return test
def transform_while(self, node, results):
one = results["while"]
one.replace(Name(u"True", prefix=one.prefix))
def transform_sort(self, node, results):
sort_stmt = results["sort"]
next_stmt = results["next"]
list_call = results.get("list")
simple_expr = results.get("expr")
if list_call:
list_call.replace(Name(u"sorted", prefix=list_call.prefix))
elif simple_expr:
new = simple_expr.clone()
new.prefix = u""
simple_expr.replace(Call(Name(u"sorted"), [new],
prefix=simple_expr.prefix))
else:
raise RuntimeError("should not have reached here")
sort_stmt.remove()
btwn = sort_stmt.prefix
# Keep any prefix lines between the sort_stmt and the list_call and
# shove them right after the sorted() call.
if u"\n" in btwn:
if next_stmt:
# The new prefix should be everything from the sort_stmt's
# prefix up to the last newline, then the old prefix after a new
# line.
prefix_lines = (btwn.rpartition(u"\n")[0], next_stmt[0].prefix)
next_stmt[0].prefix = u"\n".join(prefix_lines)
else:
assert list_call.parent
assert list_call.next_sibling is None
# Put a blank line after list_call and set its prefix.
end_line = BlankLine()
list_call.parent.append_child(end_line)
assert list_call.next_sibling is end_line
# The new prefix should be everything up to the first new line
# of sort_stmt's prefix.
end_line.prefix = btwn.rpartition(u"\n")[0]
PK J/�\���� �
fix_throw.pycnu �[��� �
{ fc @ s{ d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m Z m
Z
m Z d e j f d � � YZ
d S( s� Fixer for generator.throw(E, V, T).
g.throw(E) -> g.throw(E)
g.throw(E, V) -> g.throw(E(V))
g.throw(E, V, T) -> g.throw(E(V).with_traceback(T))
g.throw("foo"[, V[, T]]) will warn about string exceptions.i ( t pytree( t token( t
fixer_base( t Namet Callt ArgListt Attrt is_tuplet FixThrowc B s e Z e Z d Z d � Z RS( s�
power< any trailer< '.' 'throw' >
trailer< '(' args=arglist< exc=any ',' val=any [',' tb=any] > ')' >
>
|
power< any trailer< '.' 'throw' > trailer< '(' exc=any ')' > >
c C sP | j } | d j � } | j t j k r? | j | d � d S| j d � } | d k r^ d S| j � } t | � r� g | j d d !D] } | j � ^ q� } n d | _
| g } | d } d | k r6| d j � } d | _
t | | � }
t |
t
d � � t | g � g } | j t j | j | � � n | j t | | � � d S(
Nt excs+ Python 3 does not support string exceptionsu vali i����u t argst tbu with_traceback( t symst clonet typeR t STRINGt cannot_convertt gett NoneR t childrent prefixR R R R t replaceR t Nodet power( t selft nodet resultsR R t valt cR
t
throw_argsR t et with_tb( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_throw.pyt transform s* ,
% ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_throw.pyR s N( t __doc__t R t pgen2R R t
fixer_utilR R R R R t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_throw.pyt <module> s
(PK J/�\�� fix_operator.pyonu �[��� �
{ fc @ s^ d Z d d l m Z d d l m Z m Z m Z m Z d � Z d e j f d � � YZ
d S( s� Fixer for operator functions.
operator.isCallable(obj) -> hasattr(obj, '__call__')
operator.sequenceIncludes(obj) -> operator.contains(obj)
operator.isSequenceType(obj) -> isinstance(obj, collections.Sequence)
operator.isMappingType(obj) -> isinstance(obj, collections.Mapping)
operator.isNumberType(obj) -> isinstance(obj, numbers.Number)
operator.repeat(obj, n) -> operator.mul(obj, n)
operator.irepeat(obj, n) -> operator.imul(obj, n)
i����( t
fixer_base( t Callt Namet Stringt touch_importc s � f d � } | S( Nc s
� | _ | S( N( t
invocation( t f( t s( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt dec s ( ( R R ( ( R s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyR s t FixOperatorc B s� e Z e Z d Z d Z d Z d e d e d e � Z d � Z e
d � d � � Z e
d � d
� � Z e
d � d � � Z
e
d
� d � � Z e
d � d � � Z e
d � d � � Z e
d � d � � Z d � Z d � Z d � Z RS( t pres�
method=('isCallable'|'sequenceIncludes'
|'isSequenceType'|'isMappingType'|'isNumberType'
|'repeat'|'irepeat')
s '(' obj=any ')'s�
power< module='operator'
trailer< '.' %(methods)s > trailer< %(obj)s > >
|
power< %(methods)s trailer< %(obj)s > >
t methodst objc C s/ | j | | � } | d k r+ | | | � Sd S( N( t
_check_methodt None( t selft nodet resultst method( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt transform) s s operator.contains(%s)c C s | j | | d � S( Nu contains( t _handle_rename( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _sequenceIncludes. s s hasattr(%s, '__call__')c C sG | d } | j � t d � t d � g } t t d � | d | j �S( NR u , u
'__call__'u hasattrt prefix( t cloneR R R R ( R R R R t args( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _isCallable2 s
!s operator.mul(%s)c C s | j | | d � S( Nu mul( R ( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _repeat8 s s operator.imul(%s)c C s | j | | d � S( Nu imul( R ( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _irepeat< s s$ isinstance(%s, collections.Sequence)c C s | j | | d d � S( Nu collectionsu Sequence( t _handle_type2abc( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _isSequenceType@ s s# isinstance(%s, collections.Mapping)c C s | j | | d d � S( Nu collectionsu Mapping( R ( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _isMappingTypeD s s isinstance(%s, numbers.Number)c C s | j | | d d � S( Nu numbersu Number( R ( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt
_isNumberTypeH s c C s% | d d } | | _ | j � d S( NR i ( t valuet changed( R R R t nameR ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyR L s c C sa t d | | � | d } | j � t d d j | | g � � g } t t d � | d | j �S( NR u , u .u
isinstanceR ( R R R R t joinR R R ( R R R t modulet abcR R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyR Q s
+c C s� t | d | d d j j d � � } t | � r� d | k rC | St | d � f } t | j � | } | j | d | � n d S( Nt _R i t asciiR$ R u You should use '%s' here.( t getattrR t encodet callablet unicodeR t warningR ( R R R R t subt invocation_str( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyR
W s ' ( t __name__t
__module__t Truet
BM_compatiblet orderR R t dictt PATTERNR R R R R R R R R R R R
( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyR s N( t __doc__t lib2to3R t lib2to3.fixer_utilR R R R R t BaseFixR ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt <module>
s " PK J/�\��-�$ $
fix_apply.pycnu �[��� �
{ fc @ so d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m Z d e j
f d � � YZ d S( sI Fixer for apply().
This converts apply(func, v, k) into (func)(*v, **k).i ( t pytree( t token( t
fixer_base( t Callt Commat parenthesizet FixApplyc B s e Z e Z d Z d � Z RS( s.
power< 'apply'
trailer<
'('
arglist<
(not argument<NAME '=' any>) func=any ','
(not argument<NAME '=' any>) args=any [','
(not argument<NAME '=' any>) kwds=any] [',']
>
')'
>
>
c C s� | j } | s t � | d } | d } | j d � } | r� | j | j j k rW d S| j | j j k r� | j d j d k r� d Sn | r� | j | j j k r� | j d j d k r� d S| j } | j � } | j t
j | j f k r(| j | j
k s| j d j t
j k r(t | � } n d | _ | j � } d | _ | d k rj| j � } d | _ n t j t
j d � | g } | d k r�| j t � t j t
j d � | g � d
| d _ n t | | d | �S( Nt funct argst kwdsi s **i����t u *u **u t prefix( t symst AssertionErrort gett typet star_exprt argumentt childrent valueR t cloneR t NAMEt atomt powert
DOUBLESTARR t NoneR t Leaft STARt extendR R ( t selft nodet resultsR R R R R t l_newargs( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_apply.pyt transform sB
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR! ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_apply.pyR s N( t __doc__R
R t pgen2R R t
fixer_utilR R R t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_apply.pyt <module> s
PK J/�\���� �
fix_throw.pyonu �[��� �
{ fc @ s{ d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m Z m
Z
m Z d e j f d � � YZ
d S( s� Fixer for generator.throw(E, V, T).
g.throw(E) -> g.throw(E)
g.throw(E, V) -> g.throw(E(V))
g.throw(E, V, T) -> g.throw(E(V).with_traceback(T))
g.throw("foo"[, V[, T]]) will warn about string exceptions.i ( t pytree( t token( t
fixer_base( t Namet Callt ArgListt Attrt is_tuplet FixThrowc B s e Z e Z d Z d � Z RS( s�
power< any trailer< '.' 'throw' >
trailer< '(' args=arglist< exc=any ',' val=any [',' tb=any] > ')' >
>
|
power< any trailer< '.' 'throw' > trailer< '(' exc=any ')' > >
c C sP | j } | d j � } | j t j k r? | j | d � d S| j d � } | d k r^ d S| j � } t | � r� g | j d d !D] } | j � ^ q� } n d | _
| g } | d } d | k r6| d j � } d | _
t | | � }
t |
t
d � � t | g � g } | j t j | j | � � n | j t | | � � d S(
Nt excs+ Python 3 does not support string exceptionsu vali i����u t argst tbu with_traceback( t symst clonet typeR t STRINGt cannot_convertt gett NoneR t childrent prefixR R R R t replaceR t Nodet power( t selft nodet resultsR R t valt cR
t
throw_argsR t et with_tb( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_throw.pyt transform s* ,
% ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_throw.pyR s N( t __doc__t R t pgen2R R t
fixer_utilR R R R R t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_throw.pyt <module> s
(PK J/�\�W�� � fix_getcwdu.pynu �[��� """
Fixer that changes os.getcwdu() to os.getcwd().
"""
# Author: Victor Stinner
# Local imports
from .. import fixer_base
from ..fixer_util import Name
class FixGetcwdu(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< 'os' trailer< dot='.' name='getcwdu' > any* >
"""
def transform(self, node, results):
name = results["name"]
name.replace(Name(u"getcwd", prefix=name.prefix))
PK J/�\��I I fix_isinstance.pynu �[��� # Copyright 2008 Armin Ronacher.
# Licensed to PSF under a Contributor Agreement.
"""Fixer that cleans up a tuple argument to isinstance after the tokens
in it were fixed. This is mainly used to remove double occurrences of
tokens as a leftover of the long -> int / unicode -> str conversion.
eg. isinstance(x, (int, long)) -> isinstance(x, (int, int))
-> isinstance(x, int)
"""
from .. import fixer_base
from ..fixer_util import token
class FixIsinstance(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power<
'isinstance'
trailer< '(' arglist< any ',' atom< '('
args=testlist_gexp< any+ >
')' > > ')' >
>
"""
run_order = 6
def transform(self, node, results):
names_inserted = set()
testlist = results["args"]
args = testlist.children
new_args = []
iterator = enumerate(args)
for idx, arg in iterator:
if arg.type == token.NAME and arg.value in names_inserted:
if idx < len(args) - 1 and args[idx + 1].type == token.COMMA:
iterator.next()
continue
else:
new_args.append(arg)
if arg.type == token.NAME:
names_inserted.add(arg.value)
if new_args and new_args[-1].type == token.COMMA:
del new_args[-1]
if len(new_args) == 1:
atom = testlist.parent
new_args[0].prefix = atom.prefix
atom.replace(new_args[0])
else:
args[:] = new_args
node.changed()
PK J/�\�ĸ&� � fix_methodattrs.pycnu �[��� �
{ fc @ s^ d Z d d l m Z d d l m Z i d d 6d d 6d d 6Z d
e j f d � � YZ d S(
s; Fix bound method attributes (method.im_? -> method.__?__).
i ( t
fixer_base( t Namet __func__t im_funct __self__t im_selfs __self__.__class__t im_classt FixMethodattrsc B s e Z e Z d Z d � Z RS( sU
power< any+ trailer< '.' attr=('im_func' | 'im_self' | 'im_class') > any* >
c C sA | d d } t t | j � } | j t | d | j �� d S( Nt attri t prefix( t unicodet MAPt valuet replaceR R ( t selft nodet resultsR t new( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_methodattrs.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_methodattrs.pyR s N( t __doc__t R t
fixer_utilR R t BaseFixR ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_methodattrs.pyt <module> s
PK J/�\y� � fix_apply.pynu �[��� # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer for apply().
This converts apply(func, v, k) into (func)(*v, **k)."""
# Local imports
from .. import pytree
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Call, Comma, parenthesize
class FixApply(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< 'apply'
trailer<
'('
arglist<
(not argument<NAME '=' any>) func=any ','
(not argument<NAME '=' any>) args=any [','
(not argument<NAME '=' any>) kwds=any] [',']
>
')'
>
>
"""
def transform(self, node, results):
syms = self.syms
assert results
func = results["func"]
args = results["args"]
kwds = results.get("kwds")
# I feel like we should be able to express this logic in the
# PATTERN above but I don't know how to do it so...
if args:
if args.type == self.syms.star_expr:
return # Make no change.
if (args.type == self.syms.argument and
args.children[0].value == '**'):
return # Make no change.
if kwds and (kwds.type == self.syms.argument and
kwds.children[0].value == '**'):
return # Make no change.
prefix = node.prefix
func = func.clone()
if (func.type not in (token.NAME, syms.atom) and
(func.type != syms.power or
func.children[-2].type == token.DOUBLESTAR)):
# Need to parenthesize
func = parenthesize(func)
func.prefix = ""
args = args.clone()
args.prefix = ""
if kwds is not None:
kwds = kwds.clone()
kwds.prefix = ""
l_newargs = [pytree.Leaf(token.STAR, u"*"), args]
if kwds is not None:
l_newargs.extend([Comma(),
pytree.Leaf(token.DOUBLESTAR, u"**"),
kwds])
l_newargs[-2].prefix = u" " # that's the ** token
# XXX Sometimes we could be cleverer, e.g. apply(f, (x, y) + t)
# can be translated into f(x, y, *t) instead of f(*(x, y) + t)
#new = pytree.Node(syms.power, (func, ArgList(l_newargs)))
return Call(func, l_newargs, prefix=prefix)
PK J/�\ P�T� � fix_set_literal.pynu �[��� """
Optional fixer to transform set() calls to set literals.
"""
# Author: Benjamin Peterson
from lib2to3 import fixer_base, pytree
from lib2to3.fixer_util import token, syms
class FixSetLiteral(fixer_base.BaseFix):
BM_compatible = True
explicit = True
PATTERN = """power< 'set' trailer< '('
(atom=atom< '[' (items=listmaker< any ((',' any)* [',']) >
|
single=any) ']' >
|
atom< '(' items=testlist_gexp< any ((',' any)* [',']) > ')' >
)
')' > >
"""
def transform(self, node, results):
single = results.get("single")
if single:
# Make a fake listmaker
fake = pytree.Node(syms.listmaker, [single.clone()])
single.replace(fake)
items = fake
else:
items = results["items"]
# Build the contents of the literal
literal = [pytree.Leaf(token.LBRACE, u"{")]
literal.extend(n.clone() for n in items.children)
literal.append(pytree.Leaf(token.RBRACE, u"}"))
# Set the prefix of the right brace to that of the ')' or ']'
literal[-1].prefix = items.next_sibling.prefix
maker = pytree.Node(syms.dictsetmaker, literal)
maker.prefix = node.prefix
# If the original was a one tuple, we need to remove the extra comma.
if len(maker.children) == 4:
n = maker.children[2]
n.remove()
maker.children[-1].prefix = n.prefix
# Finally, replace the set call with our shiny new literal.
return maker
PK J/�\��\�� �
fix_import.pynu �[��� """Fixer for import statements.
If spam is being imported from the local directory, this import:
from spam import eggs
Becomes:
from .spam import eggs
And this import:
import spam
Becomes:
from . import spam
"""
# Local imports
from .. import fixer_base
from os.path import dirname, join, exists, sep
from ..fixer_util import FromImport, syms, token
def traverse_imports(names):
"""
Walks over all the names imported in a dotted_as_names node.
"""
pending = [names]
while pending:
node = pending.pop()
if node.type == token.NAME:
yield node.value
elif node.type == syms.dotted_name:
yield "".join([ch.value for ch in node.children])
elif node.type == syms.dotted_as_name:
pending.append(node.children[0])
elif node.type == syms.dotted_as_names:
pending.extend(node.children[::-2])
else:
raise AssertionError("unknown node type")
class FixImport(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
import_from< 'from' imp=any 'import' ['('] any [')'] >
|
import_name< 'import' imp=any >
"""
def start_tree(self, tree, name):
super(FixImport, self).start_tree(tree, name)
self.skip = "absolute_import" in tree.future_features
def transform(self, node, results):
if self.skip:
return
imp = results['imp']
if node.type == syms.import_from:
# Some imps are top-level (eg: 'import ham')
# some are first level (eg: 'import ham.eggs')
# some are third level (eg: 'import ham.eggs as spam')
# Hence, the loop
while not hasattr(imp, 'value'):
imp = imp.children[0]
if self.probably_a_local_import(imp.value):
imp.value = u"." + imp.value
imp.changed()
else:
have_local = False
have_absolute = False
for mod_name in traverse_imports(imp):
if self.probably_a_local_import(mod_name):
have_local = True
else:
have_absolute = True
if have_absolute:
if have_local:
# We won't handle both sibling and absolute imports in the
# same statement at the moment.
self.warning(node, "absolute and local imports together")
return
new = FromImport(u".", [imp])
new.prefix = node.prefix
return new
def probably_a_local_import(self, imp_name):
if imp_name.startswith(u"."):
# Relative imports are certainly not local imports.
return False
imp_name = imp_name.split(u".", 1)[0]
base_path = dirname(self.filename)
base_path = join(base_path, imp_name)
# If there is no __init__.py next to the file its not in a package
# so can't be a relative import.
if not exists(join(dirname(base_path), "__init__.py")):
return False
for ext in [".py", sep, ".pyc", ".so", ".sl", ".pyd"]:
if exists(base_path + ext):
return True
return False
PK J/�\�u��c c fix_standarderror.pyonu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s% Fixer for StandardError -> Exception.i ( t
fixer_base( t Namet FixStandarderrorc B s e Z e Z d Z d � Z RS( s-
'StandardError'
c C s t d d | j �S( Nu Exceptiont prefix( R R ( t selft nodet results( ( s7 /usr/lib64/python2.7/lib2to3/fixes/fix_standarderror.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s7 /usr/lib64/python2.7/lib2to3/fixes/fix_standarderror.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s7 /usr/lib64/python2.7/lib2to3/fixes/fix_standarderror.pyt <module> s PK J/�\_;�>� � fix_set_literal.pycnu �[��� �
{ fc @ sO d Z d d l m Z m Z d d l m Z m Z d e j f d � � YZ d S( s:
Optional fixer to transform set() calls to set literals.
i����( t
fixer_baset pytree( t tokent symst
FixSetLiteralc B s# e Z e Z e Z d Z d � Z RS( sj power< 'set' trailer< '('
(atom=atom< '[' (items=listmaker< any ((',' any)* [',']) >
|
single=any) ']' >
|
atom< '(' items=testlist_gexp< any ((',' any)* [',']) > ')' >
)
')' > >
c C s | j d � } | rI t j t j | j � g � } | j | � | } n
| d } t j t j d � g } | j
d � | j D� � | j t j t j
d � � | j j | d _ t j t j | � } | j | _ t | j � d k r| j d } | j � | j | j d _ n | S( Nt singlet itemsu {c s s | ] } | j � Vq d S( N( t clone( t .0t n( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_set_literal.pys <genexpr>' s u }i����i i ( t getR t NodeR t listmakerR t replacet LeafR t LBRACEt extendt childrent appendt RBRACEt next_siblingt prefixt dictsetmakert lent remove( t selft nodet resultsR t fakeR t literalt makerR ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_set_literal.pyt transform s"
( t __name__t
__module__t Truet
BM_compatiblet explicitt PATTERNR ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_set_literal.pyR s
N( t __doc__t lib2to3R R t lib2to3.fixer_utilR R t BaseFixR ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_set_literal.pyt <module> s PK J/�\�0�| |
fix_input.pyonu �[��� �
{ fc @ sh d Z d d l m Z d d l m Z m Z d d l m Z e j d � Z d e j f d � � YZ
d S( s4 Fixer that changes input(...) into eval(input(...)).i ( t
fixer_base( t Callt Name( t patcomps& power< 'eval' trailer< '(' any ')' > >t FixInputc B s e Z e Z d Z d � Z RS( sL
power< 'input' args=trailer< '(' [any] ')' > >
c C sM t j | j j � r d S| j � } d | _ t t d � | g d | j �S( Nu u evalt prefix( t contextt matcht parentt cloneR R R ( t selft nodet resultst new( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_input.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_input.pyR
s N( t __doc__t R t
fixer_utilR R R t compile_patternR t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_input.pyt <module> s
PK J/�\�1Wl� � fix_sys_exc.pycnu �[��� �
{ fc @ sg d Z d d l m Z d d l m Z m Z m Z m Z m Z m Z m
Z
d e j f d � � YZ d S( s� Fixer for sys.exc_{type, value, traceback}
sys.exc_type -> sys.exc_info()[0]
sys.exc_value -> sys.exc_info()[1]
sys.exc_traceback -> sys.exc_info()[2]
i ( t
fixer_base( t Attrt Callt Namet Numbert Subscriptt Nodet symst FixSysExcc B sC e Z d d d g Z e Z d d j d � e D� � Z d � Z RS( u exc_typeu exc_valueu
exc_tracebacksN
power< 'sys' trailer< dot='.' attribute=(%s) > >
t |c c s | ] } d | Vq d S( s '%s'N( ( t .0t e( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_sys_exc.pys <genexpr> s c C s� | d d } t | j j | j � � } t t d � d | j �} t t d � | � } | d j | d j d _ | j t
| � � t t j
| d | j �S( Nt attributei u exc_infot prefixu syst doti ( R t exc_infot indext valueR R R
R t childrent appendR R R t power( t selft nodet resultst sys_attrR t callt attr( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_sys_exc.pyt transform s ( t __name__t
__module__R t Truet
BM_compatiblet joint PATTERNR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_sys_exc.pyR s N(
t __doc__t R t
fixer_utilR R R R R R R t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_sys_exc.pyt <module> s 4PK J/�\�R�� fix_imports.pycnu �[��� �
{ fc @ s� d Z d d l m Z d d l m Z m Z i0 d d 6d d 6d d 6d d
6d d 6d
d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d! d" 6d# d$ 6d% d& 6d' d( 6d) d* 6d+ d, 6d- d. 6d/ d0 6d1 d2 6d3 d4 6d5 d6 6d7 d8 6d9 d: 6d; d< 6d= d> 6d? d@ 6dA dB 6dC dD 6dC dE 6dF dG 6dH dI 6dJ dK 6dL dM 6dN dO 6dP dQ 6dP dR 6dP dS 6dT dU 6dV dW 6dV dX 6dY dZ 6d[ d\ 6Z d] � Z e d^ � Z d_ e j f d` � � YZ
da S(b s/ Fix incompatible imports and module references.i ( t
fixer_base( t Namet
attr_chaint iot StringIOt cStringIOt picklet cPicklet builtinst __builtin__t copyregt copy_regt queuet Queuet socketservert SocketServert configparsert ConfigParsert reprlibt reprs tkinter.filedialogt
FileDialogt tkFileDialogs tkinter.simpledialogt SimpleDialogt tkSimpleDialogs tkinter.colorchoosert tkColorChoosers tkinter.commondialogt tkCommonDialogs tkinter.dialogt Dialogs tkinter.dndt Tkdnds tkinter.fontt tkFonts tkinter.messageboxt tkMessageBoxs tkinter.scrolledtextt ScrolledTexts tkinter.constantst Tkconstantss tkinter.tixt Tixs tkinter.ttkt ttkt tkintert Tkintert _markupbaset
markupbaset winregt _winregt _threadt threadt
_dummy_threadt dummy_threads dbm.bsdt dbhashs dbm.dumbt dumbdbms dbm.ndbmt dbms dbm.gnut gdbms
xmlrpc.clientt xmlrpclibs
xmlrpc.servert DocXMLRPCServert SimpleXMLRPCServers http.clientt httplibs
html.entitiest htmlentitydefss html.parsert
HTMLParsers http.cookiest Cookies http.cookiejart cookielibs http.servert BaseHTTPServert SimpleHTTPServert
CGIHTTPServert
subprocesst commandst collectionst
UserStringt UserLists urllib.parset urlparses urllib.robotparsert robotparserc C s d d j t t | � � d S( Nt (t |t )( t joint mapR ( t members( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyt
alternates= s c c sl d j g | D] } d | ^ q
� } t | j � � } d | | f Vd | Vd | | f Vd | Vd S( Ns | s module_name='%s'sy name_import=import_name< 'import' ((%s) |
multiple_imports=dotted_as_names< any* (%s) any* >) >
s� import_from< 'from' (%s) 'import' ['(']
( any | import_as_name< any 'as' any > |
import_as_names< any* >) [')'] >
s� import_name< 'import' (dotted_as_name< (%s) 'as' any > |
multiple_imports=dotted_as_names<
any* dotted_as_name< (%s) 'as' any > any* >) >
s3 power< bare_with_attr=(%s) trailer<'.' any > any* >( RE RH t keys( t mappingt keyt mod_listt
bare_names( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyt
build_patternA s & t
FixImportsc B sM e Z e Z e Z e Z d Z d � Z d � Z d � Z
d � Z d � Z RS( i c C s d j t | j � � S( NRC ( RE RN RJ ( t self( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyRN ` s c C s& | j � | _ t t | � j � d S( N( RN t PATTERNt superRO t compile_pattern( RP ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyRS c s c sa t t | � j � � | � } | r] d | k rY t � f d � t | d � D� � rY t S| St S( Nt bare_with_attrc 3 s | ] } � | � Vq d S( N( ( t .0t obj( t match( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pys <genexpr>q s t parent( RR RO RW t anyR t False( RP t nodet results( ( RW s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyRW j s %c C s& t t | � j | | � i | _ d S( N( RR RO t
start_treet replace( RP t treet filename( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyR] v s c C s� | j d � } | r� | j } t | j | � } | j t | d | j �� d | k ri | | j | <n d | k r� | j | � } | r� | j | | � q� q� nH | d d } | j j | j � } | r� | j t | d | j �� n d S( Nt module_namet prefixt name_importt multiple_importsRT i ( t gett valuet unicodeRJ R^ R Rb RW t transform( RP R[ R\ t
import_modt mod_namet new_namet bare_name( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyRh z s (
t __name__t
__module__t Truet
BM_compatiblet keep_line_ordert MAPPINGRJ t run_orderRN RS RW R] Rh ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyRO U s N( t __doc__t R t
fixer_utilR R Rr RH RN t BaseFixRO ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_imports.pyt <module> sj
PK J/�\�&�1 fix_types.pynu �[��� # Copyright 2007 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer for removing uses of the types module.
These work for only the known names in the types module. The forms above
can include types. or not. ie, It is assumed the module is imported either as:
import types
from types import ... # either * or specific types
The import statements are not modified.
There should be another fixer that handles at least the following constants:
type([]) -> list
type(()) -> tuple
type('') -> str
"""
# Local imports
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Name
_TYPE_MAPPING = {
'BooleanType' : 'bool',
'BufferType' : 'memoryview',
'ClassType' : 'type',
'ComplexType' : 'complex',
'DictType': 'dict',
'DictionaryType' : 'dict',
'EllipsisType' : 'type(Ellipsis)',
#'FileType' : 'io.IOBase',
'FloatType': 'float',
'IntType': 'int',
'ListType': 'list',
'LongType': 'int',
'ObjectType' : 'object',
'NoneType': 'type(None)',
'NotImplementedType' : 'type(NotImplemented)',
'SliceType' : 'slice',
'StringType': 'bytes', # XXX ?
'StringTypes' : '(str,)', # XXX ?
'TupleType': 'tuple',
'TypeType' : 'type',
'UnicodeType': 'str',
'XRangeType' : 'range',
}
_pats = ["power< 'types' trailer< '.' name='%s' > >" % t for t in _TYPE_MAPPING]
class FixTypes(fixer_base.BaseFix):
BM_compatible = True
PATTERN = '|'.join(_pats)
def transform(self, node, results):
new_value = unicode(_TYPE_MAPPING.get(results["name"].value))
if new_value:
return Name(new_value, prefix=node.prefix)
return None
PK J/�\��gpA A fix_basestring.pynu �[��� """Fixer for basestring -> str."""
# Author: Christian Heimes
# Local imports
from .. import fixer_base
from ..fixer_util import Name
class FixBasestring(fixer_base.BaseFix):
BM_compatible = True
PATTERN = "'basestring'"
def transform(self, node, results):
return Name(u"str", prefix=node.prefix)
PK J/�\��J�� � fix_exec.pycnu �[��� �
{ fc @ s_ d Z d d l m Z d d l m Z d d l m Z m Z m Z d e j f d � � YZ d S( s� Fixer for exec.
This converts usages of the exec statement into calls to a built-in
exec() function.
exec code in ns1, ns2 -> exec(code, ns1, ns2)
i ( t pytree( t
fixer_base( t Commat Namet Callt FixExecc B s e Z e Z d Z d � Z RS( sx
exec_stmt< 'exec' a=any 'in' b=any [',' c=any] >
|
exec_stmt< 'exec' (not atom<'(' [any] ')'>) a=any >
c C s� | s t � | j } | d } | j d � } | j d � } | j � g } d | d _ | d k r� | j t � | j � g � n | d k r� | j t � | j � g � n t t d � | d | j �S( Nt at bt ct i u exect prefix(
t AssertionErrort symst gett cloneR
t Nonet extendR R R ( t selft nodet resultsR R R R t args( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_exec.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_exec.pyR s N(
t __doc__R R R t
fixer_utilR R R t BaseFixR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_exec.pyt <module>
s PK J/�\4 ��
fix_apply.pyonu �[��� �
{ fc @ so d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m Z d e j
f d � � YZ d S( sI Fixer for apply().
This converts apply(func, v, k) into (func)(*v, **k).i ( t pytree( t token( t
fixer_base( t Callt Commat parenthesizet FixApplyc B s e Z e Z d Z d � Z RS( s.
power< 'apply'
trailer<
'('
arglist<
(not argument<NAME '=' any>) func=any ','
(not argument<NAME '=' any>) args=any [','
(not argument<NAME '=' any>) kwds=any] [',']
>
')'
>
>
c C s� | j } | d } | d } | j d � } | r} | j | j j k rK d S| j | j j k r} | j d j d k r} d Sn | r� | j | j j k r� | j d j d k r� d S| j } | j � } | j t j
| j f k r | j | j k s
| j d j t j
k r t | � } n d | _ | j � } d | _ | d k r^| j � } d | _ n t j t j d � | g } | d k r�| j t � t j t j
d � | g � d
| d _ n t | | d | �S( Nt funct argst kwdsi s **i����t u *u **u t prefix( t symst gett typet star_exprt argumentt childrent valueR t cloneR t NAMEt atomt powert
DOUBLESTARR t NoneR t Leaft STARt extendR R ( t selft nodet resultsR R R R R t l_newargs( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_apply.pyt transform s@
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_apply.pyR s N( t __doc__R
R t pgen2R R t
fixer_utilR R R t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_apply.pyt <module> s
PK J/�\v�� � fix_map.pyonu �[��� �
{ fc @ su d Z d d l m Z d d l m Z d d l m Z m Z m Z m Z d d l
m Z d e j
f d � � YZ d S( s Fixer that changes map(F, ...) into list(map(F, ...)) unless there
exists a 'from future_builtins import map' statement in the top-level
namespace.
As a special case, map(None, X) is changed into list(X). (This is
necessary because the semantics are changed in this case -- the new
map(None, X) is equivalent to [(x,) for x in X].)
We avoid the transformation (except for the special case mentioned
above) if the map() call is directly contained in iter(<>), list(<>),
tuple(<>), sorted(<>), ...join(<>), or for V in <>:.
NOTE: This is still not correct if the original code was depending on
map(F, X, Y, ...) to go on until the longest argument is exhausted,
substituting None for missing values -- like zip(), it now stops as
soon as the shortest argument is exhausted.
i ( t token( t
fixer_base( t Namet Callt ListCompt in_special_context( t python_symbolst FixMapc B s# e Z e Z d Z d Z d � Z RS( s�
map_none=power<
'map'
trailer< '(' arglist< 'None' ',' arg=any [','] > ')' >
>
|
map_lambda=power<
'map'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
>
|
power<
'map' trailer< '(' [arglist=any] ')' >
>
s future_builtins.mapc C s� | j | � r d S| j j t j k rh | j | d � | j � } d | _ t t d � | g � } n d | k r� t
| d j � | d j � | d j � � } n� d | k r� | d j � } n� d
| k r4| d
} | j t j k r4| j d j t
j k r4| j d j d k r4| j | d
� d Sn t | � rDd S| j � } d | _ t t d � | g � } | j | _ | S( Ns You should use a for loop hereu u listt
map_lambdat xpt fpt itt map_nonet argt arglisti t Nonesj cannot convert map(None, ...) with multiple arguments because map() now truncates to the shortest sequence( t should_skipt parentt typet symst simple_stmtt warningt clonet prefixR R R R t childrenR t NAMEt valueR R ( t selft nodet resultst newt args( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_map.pyt transform; s6
( t __name__t
__module__t Truet
BM_compatiblet PATTERNt skip_onR ( ( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_map.pyR s N( t __doc__t pgen2R t R t
fixer_utilR R R R t pygramR R t ConditionalFixR ( ( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_map.pyt <module> s
"PK J/�\8|�g fix_execfile.pyonu �[��� �
{ fc @ sy d Z d d l m Z d d l m Z m Z m Z m Z m Z m Z m
Z
m Z m Z m
Z
d e j f d � � YZ d S( so Fixer for execfile.
This converts usages of the execfile function into calls to the built-in
exec() function.
i ( t
fixer_base(
t Commat Namet Callt LParent RParent Dott Nodet ArgListt Stringt symst FixExecfilec B s e Z e Z d Z d � Z RS( s�
power< 'execfile' trailer< '(' arglist< filename=any [',' globals=any [',' locals=any ] ] > ')' > >
|
power< 'execfile' trailer< '(' filename=any ')' > >
c C s� | d } | j d � } | j d � } | j d j d j � } t | j � t � t d d � g d | �} t t j t d � | g � } t t j
t � t d � g � t t j
t � t
� g � g } | g | }
| j � } d
| _ t d d
� } |
t � | t � | g }
t t d � |
d
� } | g } | d k re| j t � | j � g � n | d k r�| j t � | j � g � n t t d � | d | j �S( Nt filenamet globalst localsi����s "rb"t t rparenu openu readu u 'exec'u compileu u exect prefix( t gett childrent cloneR R R R R
t powerR t trailerR R R R R t Nonet extend( t selft nodet resultsR R
R t execfile_parent open_argst open_callt readt open_exprt filename_argt exec_strt compile_argst compile_callt args( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_execfile.pyt transform s*
$ !
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR& ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_execfile.pyR s N( t __doc__t R t
fixer_utilR R R R R R R R R R
t BaseFixR ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_execfile.pyt <module> s FPK J/�\k(P�z z fix_imports2.pycnu �[��� �
{ fc @ sG d Z d d l m Z i d d 6d d 6Z d e j f d � � YZ d S( sT Fix incompatible imports and module references that must be fixed after
fix_imports.i ( t fix_importst dbmt whichdbt anydbmt FixImports2c B s e Z d Z e Z RS( i ( t __name__t
__module__t run_ordert MAPPINGt mapping( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_imports2.pyR s N( t __doc__t R R t
FixImportsR ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_imports2.pyt <module> s
PK J/�\(%N
fix_except.pynu �[��� """Fixer for except statements with named exceptions.
The following cases will be converted:
- "except E, T:" where T is a name:
except E as T:
- "except E, T:" where T is not a name, tuple or list:
except E as t:
T = t
This is done because the target of an "except" clause must be a
name.
- "except E, T:" where T is a tuple or list literal:
except E as t:
T = t.args
"""
# Author: Collin Winter
# Local imports
from .. import pytree
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Assign, Attr, Name, is_tuple, is_list, syms
def find_excepts(nodes):
for i, n in enumerate(nodes):
if n.type == syms.except_clause:
if n.children[0].value == u'except':
yield (n, nodes[i+2])
class FixExcept(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
try_stmt< 'try' ':' (simple_stmt | suite)
cleanup=(except_clause ':' (simple_stmt | suite))+
tail=(['except' ':' (simple_stmt | suite)]
['else' ':' (simple_stmt | suite)]
['finally' ':' (simple_stmt | suite)]) >
"""
def transform(self, node, results):
syms = self.syms
tail = [n.clone() for n in results["tail"]]
try_cleanup = [ch.clone() for ch in results["cleanup"]]
for except_clause, e_suite in find_excepts(try_cleanup):
if len(except_clause.children) == 4:
(E, comma, N) = except_clause.children[1:4]
comma.replace(Name(u"as", prefix=u" "))
if N.type != token.NAME:
# Generate a new N for the except clause
new_N = Name(self.new_name(), prefix=u" ")
target = N.clone()
target.prefix = u""
N.replace(new_N)
new_N = new_N.clone()
# Insert "old_N = new_N" as the first statement in
# the except body. This loop skips leading whitespace
# and indents
#TODO(cwinter) suite-cleanup
suite_stmts = e_suite.children
for i, stmt in enumerate(suite_stmts):
if isinstance(stmt, pytree.Node):
break
# The assignment is different if old_N is a tuple or list
# In that case, the assignment is old_N = new_N.args
if is_tuple(N) or is_list(N):
assign = Assign(target, Attr(new_N, Name(u'args')))
else:
assign = Assign(target, new_N)
#TODO(cwinter) stopgap until children becomes a smart list
for child in reversed(suite_stmts[:i]):
e_suite.insert_child(0, child)
e_suite.insert_child(i, assign)
elif N.prefix == u"":
# No space after a comma is legal; no space after "as",
# not so much.
N.prefix = u" "
#TODO(cwinter) fix this when children becomes a smart list
children = [c.clone() for c in node.children[:3]] + try_cleanup + tail
return pytree.Node(node.type, children)
PK J/�\��s< < fix_isinstance.pyonu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s, Fixer that cleans up a tuple argument to isinstance after the tokens
in it were fixed. This is mainly used to remove double occurrences of
tokens as a leftover of the long -> int / unicode -> str conversion.
eg. isinstance(x, (int, long)) -> isinstance(x, (int, int))
-> isinstance(x, int)
i ( t
fixer_base( t tokent
FixIsinstancec B s# e Z e Z d Z d Z d � Z RS( s�
power<
'isinstance'
trailer< '(' arglist< any ',' atom< '('
args=testlist_gexp< any+ >
')' > > ')' >
>
i c C sU t � } | d } | j } g } t | � } x� | D]� \ } } | j t j k r� | j | k r� | t | � d k r� | | d j t j k r� | j � q5 q� q5 | j
| � | j t j k r5 | j | j � q5 q5 W| r| d j t j k r| d =n t | � d k r@| j }
|
j
| d _
|
j | d � n | | (| j � d S( Nt argsi i����i ( t sett childrent enumeratet typeR t NAMEt valuet lent COMMAt nextt appendt addt parentt prefixt replacet changed( t selft nodet resultst names_insertedt testlistR t new_argst iteratort idxt argt atom( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_isinstance.pyt transform s*
!0
( t __name__t
__module__t Truet
BM_compatiblet PATTERNt run_orderR ( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_isinstance.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_isinstance.pyt <module>
s PK J/�\c���� � fix_filter.pycnu �[��� �
{ fc @ se d Z d d l m Z d d l m Z d d l m Z m Z m Z m Z d e j
f d � � YZ d S( s� Fixer that changes filter(F, X) into list(filter(F, X)).
We avoid the transformation if the filter() call is directly contained
in iter(<>), list(<>), tuple(<>), sorted(<>), ...join(<>), or
for V in <>:.
NOTE: This is still not correct if the original code was depending on
filter(F, X) to return a string if X is a string and a tuple if X is a
tuple. That would require type inference, which we don't do. Let
Python 2.6 figure it out.
i ( t token( t
fixer_base( t Namet Callt ListCompt in_special_contextt FixFilterc B s# e Z e Z d Z d Z d � Z RS( s�
filter_lambda=power<
'filter'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
>
|
power<
'filter'
trailer< '(' arglist< none='None' ',' seq=any > ')' >
>
|
power<
'filter'
args=trailer< '(' [any] ')' >
>
s future_builtins.filterc C s | j | � r d Sd | k rs t | j d � j � | j d � j � | j d � j � | j d � j � � } n} d | k r� t t d � t d � | d j � t d � � } n= t | � r� d S| j � } d | _ t t d � | g � } | j | _ | S(
Nt
filter_lambdat fpt itt xpt noneu _ft sequ u list( t should_skipR t gett cloneR R t Nonet prefixR ( t selft nodet resultst new( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_filter.pyt transform5 s&
( t __name__t
__module__t Truet
BM_compatiblet PATTERNt skip_onR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_filter.pyR s N( t __doc__t pgen2R t R t
fixer_utilR R R R t ConditionalFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_filter.pyt <module> s "PK J/�\}ׄ L L fix_nonzero.pyonu �[��� �
{ fc @ sI d Z d d l m Z d d l m Z m Z d e j f d � � YZ d S( s* Fixer for __nonzero__ -> __bool__ methods.i ( t
fixer_base( t Namet symst
FixNonzeroc B s e Z e Z d Z d � Z RS( s�
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def' name='__nonzero__'
parameters< '(' NAME ')' > any+ >
any* > >
c C s0 | d } t d d | j �} | j | � d S( Nt nameu __bool__t prefix( R R t replace( t selft nodet resultsR t new( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_nonzero.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_nonzero.pyR s N( t __doc__t R t
fixer_utilR R t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_nonzero.pyt <module> s PK J/�\R�R�� � fix_numliterals.pycnu �[��� �
{ fc @ sS d Z d d l m Z d d l m Z d d l m Z d e j f d � � YZ d S( s- Fixer that turns 1L into 1, 0755 into 0o755.
i ( t token( t
fixer_base( t Numbert FixNumliteralsc B s# e Z e j Z d � Z d � Z RS( c C s# | j j d � p" | j d d k S( Nu 0i����u Ll( t valuet
startswith( t selft node( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_numliterals.pyt match s c C s} | j } | d d k r& | d } nD | j d � rj | j � rj t t | � � d k rj d | d } n t | d | j �S( Ni����u Llu 0i u 0ot prefix( R R t isdigitt lent setR R ( R R t resultst val( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_numliterals.pyt transform s
3( t __name__t
__module__R t NUMBERt _accept_typeR R ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_numliterals.pyR s N( t __doc__t pgen2R t R t
fixer_utilR t BaseFixR ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_numliterals.pyt <module> s PK J/�\B�o�� � fix_dict.pynu �[��� # Copyright 2007 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer for dict methods.
d.keys() -> list(d.keys())
d.items() -> list(d.items())
d.values() -> list(d.values())
d.iterkeys() -> iter(d.keys())
d.iteritems() -> iter(d.items())
d.itervalues() -> iter(d.values())
d.viewkeys() -> d.keys()
d.viewitems() -> d.items()
d.viewvalues() -> d.values()
Except in certain very specific contexts: the iter() can be dropped
when the context is list(), sorted(), iter() or for...in; the list()
can be dropped when the context is list() or sorted() (but not iter()
or for...in!). Special contexts that apply to both: list(), sorted(), tuple()
set(), any(), all(), sum().
Note: iter(d.keys()) could be written as iter(d) but since the
original d.iterkeys() was also redundant we don't fix this. And there
are (rare) contexts where it makes a difference (e.g. when passing it
as an argument to a function that introspects the argument).
"""
# Local imports
from .. import pytree
from .. import patcomp
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Name, Call, LParen, RParen, ArgList, Dot
from .. import fixer_util
iter_exempt = fixer_util.consuming_calls | set(["iter"])
class FixDict(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< head=any+
trailer< '.' method=('keys'|'items'|'values'|
'iterkeys'|'iteritems'|'itervalues'|
'viewkeys'|'viewitems'|'viewvalues') >
parens=trailer< '(' ')' >
tail=any*
>
"""
def transform(self, node, results):
head = results["head"]
method = results["method"][0] # Extract node for method name
tail = results["tail"]
syms = self.syms
method_name = method.value
isiter = method_name.startswith(u"iter")
isview = method_name.startswith(u"view")
if isiter or isview:
method_name = method_name[4:]
assert method_name in (u"keys", u"items", u"values"), repr(method)
head = [n.clone() for n in head]
tail = [n.clone() for n in tail]
special = not tail and self.in_special_context(node, isiter)
args = head + [pytree.Node(syms.trailer,
[Dot(),
Name(method_name,
prefix=method.prefix)]),
results["parens"].clone()]
new = pytree.Node(syms.power, args)
if not (special or isview):
new.prefix = u""
new = Call(Name(u"iter" if isiter else u"list"), [new])
if tail:
new = pytree.Node(syms.power, [new] + tail)
new.prefix = node.prefix
return new
P1 = "power< func=NAME trailer< '(' node=any ')' > any* >"
p1 = patcomp.compile_pattern(P1)
P2 = """for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
"""
p2 = patcomp.compile_pattern(P2)
def in_special_context(self, node, isiter):
if node.parent is None:
return False
results = {}
if (node.parent.parent is not None and
self.p1.match(node.parent.parent, results) and
results["node"] is node):
if isiter:
# iter(d.iterkeys()) -> iter(d.keys()), etc.
return results["func"].value in iter_exempt
else:
# list(d.keys()) -> list(d.keys()), etc.
return results["func"].value in fixer_util.consuming_calls
if not isiter:
return False
# for ... in d.iterkeys() -> for ... in d.keys(), etc.
return self.p2.match(node.parent, results) and results["node"] is node
PK J/�\�� �� � fix_except.pyonu �[��� �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m Z m
Z
m Z m Z d � Z
d e j f d � � YZ d S(
s� Fixer for except statements with named exceptions.
The following cases will be converted:
- "except E, T:" where T is a name:
except E as T:
- "except E, T:" where T is not a name, tuple or list:
except E as t:
T = t
This is done because the target of an "except" clause must be a
name.
- "except E, T:" where T is a tuple or list literal:
except E as t:
T = t.args
i ( t pytree( t token( t
fixer_base( t Assignt Attrt Namet is_tuplet is_listt symsc c sb x[ t | � D]M \ } } | j t j k r
| j d j d k rZ | | | d f VqZ q
q
Wd S( Ni u excepti ( t enumeratet typeR t
except_clauset childrent value( t nodest it n( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_except.pyt find_excepts s t FixExceptc B s e Z e Z d Z d � Z RS( s1
try_stmt< 'try' ':' (simple_stmt | suite)
cleanup=(except_clause ':' (simple_stmt | suite))+
tail=(['except' ':' (simple_stmt | suite)]
['else' ':' (simple_stmt | suite)]
['finally' ':' (simple_stmt | suite)]) >
c C s, | j } g | d D] } | j � ^ q } g | d D] } | j � ^ q7 } x�t | � D]�\ } } t | j � d k r\ | j d d !\ }
} } | j t d d d �� | j t j k r�t | j
� d d �}
| j � } d | _ | j |
� |
j � }
| j } x0 t | � D]" \ } } t
| t j � r Pq q Wt | � s[t | � r|t | t |
t d � � � } n t | |
� } x( t | | � D] } | j d
| � q�W| j | | � q�| j d k r�d | _ q�q\ q\ Wg | j d D] } | j � ^ q�| | } t j | j | � S( Nt tailt cleanupi i u ast prefixu u u argsi i ( R t cloneR t lenR t replaceR R
R t NAMEt new_nameR R t
isinstanceR t NodeR R R R t reversedt insert_child( t selft nodet resultsR R R t cht try_cleanupR t e_suitet Et commat Nt new_Nt targett suite_stmtsR t stmtt assignt childt cR ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_except.pyt transform/ s6 ##
!.( t __name__t
__module__t Truet
BM_compatiblet PATTERNR/ ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_except.pyR $ s N( t __doc__t R t pgen2R R t
fixer_utilR R R R R R R t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_except.pyt <module> s . PK J/�\ `pw w fix_exec.pyonu �[��� �
{ fc @ s_ d Z d d l m Z d d l m Z d d l m Z m Z m Z d e j f d � � YZ d S( s� Fixer for exec.
This converts usages of the exec statement into calls to a built-in
exec() function.
exec code in ns1, ns2 -> exec(code, ns1, ns2)
i ( t pytree( t
fixer_base( t Commat Namet Callt FixExecc B s e Z e Z d Z d � Z RS( sx
exec_stmt< 'exec' a=any 'in' b=any [',' c=any] >
|
exec_stmt< 'exec' (not atom<'(' [any] ')'>) a=any >
c C s� | j } | d } | j d � } | j d � } | j � g } d | d _ | d k rx | j t � | j � g � n | d k r� | j t � | j � g � n t t d � | d | j �S( Nt at bt ct i u exect prefix( t symst gett cloneR
t Nonet extendR R R ( t selft nodet resultsR R R R t args( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_exec.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_exec.pyR s N(
t __doc__R R R t
fixer_utilR R R t BaseFixR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_exec.pyt <module>
s PK J/�\!x �P P fix_zip.pycnu �[��� �
{ fc @ sO d Z d d l m Z d d l m Z m Z m Z d e j f d � � YZ d S( s7
Fixer that changes zip(seq0, seq1, ...) into list(zip(seq0, seq1, ...)
unless there exists a 'from future_builtins import zip' statement in the
top-level namespace.
We avoid the transformation if the zip() call is directly contained in
iter(<>), list(<>), tuple(<>), sorted(<>), ...join(<>), or for V in <>:.
i ( t
fixer_base( t Namet Callt in_special_contextt FixZipc B s# e Z e Z d Z d Z d � Z RS( s:
power< 'zip' args=trailer< '(' [any] ')' >
>
s future_builtins.zipc C s` | j | � r d St | � r# d S| j � } d | _ t t d � | g � } | j | _ | S( Nu u list( t should_skipR t Nonet clonet prefixR R ( t selft nodet resultst new( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_zip.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNt skip_onR
( ( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_zip.pyR s N( t __doc__t R t
fixer_utilR R R t ConditionalFixR ( ( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_zip.pyt <module> s PK J/�\~&�� � fix_urllib.pyonu �[��� �
{ fc @ ss d Z d d l m Z m Z d d l m Z d d l m Z m Z m Z m
Z
m Z m Z m
Z
i d d d d d d
d d d
g f d d d d d d d d d d d d d d d d g f d d g f g d 6d d
d! d" d# d$ d% d& d' d( d) d* d+ d, d- d. d/ d0 d1 d2 d3 d4 d5 d6 d7 g f d d8 d9 g f g d: 6Z e d: j e d d; � d< � Z d= e f d> � � YZ d? S(@ s� Fix changes imports of urllib which are now incompatible.
This is rather similar to fix_imports, but because of the more
complex nature of the fixing for urllib, it has its own fixer.
i����( t
alternatest
FixImports( t
fixer_base( t Namet Commat
FromImportt Newlinet find_indentationt Nodet symss urllib.requestt URLopenert FancyURLopenert urlretrievet
_urlopenert urlopent
urlcleanupt pathname2urlt url2pathnames urllib.parset quotet
quote_plust unquotet unquote_plust urlencodet splitattrt splithostt
splitnportt splitpasswdt splitportt
splitqueryt splittagt splittypet splitusert
splitvalues urllib.errort ContentTooShortErrort urllibt install_openert build_openert Requestt OpenerDirectort BaseHandlert HTTPDefaultErrorHandlert HTTPRedirectHandlert HTTPCookieProcessort ProxyHandlert HTTPPasswordMgrt HTTPPasswordMgrWithDefaultRealmt AbstractBasicAuthHandlert HTTPBasicAuthHandlert ProxyBasicAuthHandlert AbstractDigestAuthHandlert HTTPDigestAuthHandlert ProxyDigestAuthHandlert HTTPHandlert HTTPSHandlert FileHandlert
FTPHandlert CacheFTPHandlert UnknownHandlert URLErrort HTTPErrort urllib2i c c s� t � } x� t j � D]w \ } } xh | D]` } | \ } } t | � } d | | f Vd | | | f Vd | Vd | Vd | | f Vq) Wq Wd S( Ns� import_name< 'import' (module=%r
| dotted_as_names< any* module=%r any* >) >
s� import_from< 'from' mod_member=%r 'import'
( member=%s | import_as_name< member=%s 'as' any > |
import_as_names< members=any* >) >
sI import_from< 'from' module_star=%r 'import' star='*' >
st import_name< 'import'
dotted_as_name< module_as=%r 'as' any > >
sK power< bare_with_attr=%r trailer< '.' member=%s > any* >
( t sett MAPPINGt itemsR ( t baret
old_modulet changest changet
new_modulet members( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt
build_pattern1 s
t FixUrllibc B s5 e Z d � Z d � Z d � Z d � Z d � Z RS( c C s d j t � � S( Nt |( t joinRF ( t self( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyRF J s c C s� | j d � } | j } g } x? t | j d D], } | j t | d d | �t � g � q0 W| j t t | j d d d | �� | j | � d S( s� Transform for the basic import case. Replaces the old
import name with a comma separated list of its
replacements.
t modulei����i t prefixN( t getRL R> t valuet extendR R t appendt replace( RJ t nodet resultst
import_modt preft namest name( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt transform_importM s *(c C s� | j d � } | j } | j d � } | r� t | t � rI | d } n d
} x6 t | j D]' } | j | d k r] | d } Pq] q] W| r� | j t | d | �� q�| j | d � n/g } i } | d }
x� |
D]� } | j
t j k r| j
d j } | j
d j } n | j } d
} | d k r� xl t | j D]Z } | | d k r>| d | k rx| j | d � n | j | d g � j | � q>q>Wq� q� Wg }
t | � } t } d
� } x� | D]� } | | } g } x8 | d D], } | j | | | � � | j t � � q�W| j | | d | � � t | | � } | sa| j j j | � rm| | _ n |
j | � t } q�W|
r�g } x( |
d D] } | j | t � g � q�W| j |
d � | j | � n | j | d � d
S( s� Transform for imports of specific module elements. Replaces
the module to be imported from with the appropriate new
module.
t
mod_membert memberi i RL s! This is an invalid module elementRE i u ,c S sz | j t j k rd t | j d j d | �| j d j � | j d j � g } t t j | � g St | j d | �g S( Ni RL i i ( t typeR t import_as_nameR t childrenRN t cloneR ( RW RL t kids( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt handle_name� s i����s All module elements are invalidN( RM RL t
isinstancet listt NoneR> RN RQ R t cannot_convertR[ R R\ R] RP t
setdefaultR t TrueRO R R t parentt endswitht FalseR ( RJ RR RS RY RU RZ t new_nameRC t modulest mod_dictRE t as_namet member_namet new_nodest indentationt firstR` RK t eltsRV t eltt newt nodest new_node( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt transform_member] sh
+
c C s� | j d � } | j d � } d } t | t � r@ | d } n x6 t | j D]' } | j | d k rN | d } PqN qN W| r� | j t | d | j �� n | j | d � d S( s. Transform for calls to module members in code.t bare_with_attrRZ i i RL s! This is an invalid module elementN(
RM Rc Ra Rb R> RN RQ R RL Rd ( RJ RR RS t
module_dotRZ Rj RC ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt
transform_dot� s
c C s� | j d � r" | j | | � n� | j d � rD | j | | � nf | j d � rf | j | | � nD | j d � r� | j | d � n" | j d � r� | j | d � n d S( NRK RY Rx t module_stars Cannot handle star imports.t module_ass# This module is now multiple modules( RM RX Rw Rz Rd ( RJ RR RS ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt transform� s ( t __name__t
__module__RF RX Rw Rz R} ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyRG H s
L N( t __doc__t lib2to3.fixes.fix_importsR R t lib2to3R t lib2to3.fixer_utilR R R R R R R R> RP RF RG ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt <module> sD 4 PK J/�\c���� � fix_filter.pyonu �[��� �
{ fc @ se d Z d d l m Z d d l m Z d d l m Z m Z m Z m Z d e j
f d � � YZ d S( s� Fixer that changes filter(F, X) into list(filter(F, X)).
We avoid the transformation if the filter() call is directly contained
in iter(<>), list(<>), tuple(<>), sorted(<>), ...join(<>), or
for V in <>:.
NOTE: This is still not correct if the original code was depending on
filter(F, X) to return a string if X is a string and a tuple if X is a
tuple. That would require type inference, which we don't do. Let
Python 2.6 figure it out.
i ( t token( t
fixer_base( t Namet Callt ListCompt in_special_contextt FixFilterc B s# e Z e Z d Z d Z d � Z RS( s�
filter_lambda=power<
'filter'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
>
|
power<
'filter'
trailer< '(' arglist< none='None' ',' seq=any > ')' >
>
|
power<
'filter'
args=trailer< '(' [any] ')' >
>
s future_builtins.filterc C s | j | � r d Sd | k rs t | j d � j � | j d � j � | j d � j � | j d � j � � } n} d | k r� t t d � t d � | d j � t d � � } n= t | � r� d S| j � } d | _ t t d � | g � } | j | _ | S(
Nt
filter_lambdat fpt itt xpt noneu _ft sequ u list( t should_skipR t gett cloneR R t Nonet prefixR ( t selft nodet resultst new( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_filter.pyt transform5 s&
( t __name__t
__module__t Truet
BM_compatiblet PATTERNt skip_onR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_filter.pyR s N( t __doc__t pgen2R t R t
fixer_utilR R R R t ConditionalFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_filter.pyt <module> s "PK J/�\ܬ'! ! fix_imports2.pynu �[��� """Fix incompatible imports and module references that must be fixed after
fix_imports."""
from . import fix_imports
MAPPING = {
'whichdb': 'dbm',
'anydbm': 'dbm',
}
class FixImports2(fix_imports.FixImports):
run_order = 7
mapping = MAPPING
PK J/�\n��� � fix_paren.pynu �[��� """Fixer that addes parentheses where they are required
This converts ``[x for x in 1, 2]`` to ``[x for x in (1, 2)]``."""
# By Taek Joo Kim and Benjamin Peterson
# Local imports
from .. import fixer_base
from ..fixer_util import LParen, RParen
# XXX This doesn't support nested for loops like [x for x in 1, 2 for x in 1, 2]
class FixParen(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
atom< ('[' | '(')
(listmaker< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>
|
testlist_gexp< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>)
(']' | ')') >
"""
def transform(self, node, results):
target = results["target"]
lparen = LParen()
lparen.prefix = target.prefix
target.prefix = u"" # Make it hug the parentheses
target.insert_child(0, lparen)
target.append_child(RParen())
PK J/�\�E[/ / __init__.pynu �[��� # Dummy file to make this directory a package.
PK J/�\���W W fix_long.pycnu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s/ Fixer that turns 'long' into 'int' everywhere.
i����( t
fixer_base( t is_probably_builtint FixLongc B s e Z e Z d Z d � Z RS( s 'long'c C s& t | � r" d | _ | j � n d S( Nu int( R t valuet changed( t selft nodet results( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_long.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_long.pyR s N( t __doc__t lib2to3R t lib2to3.fixer_utilR t BaseFixR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_long.pyt <module> s PK J/�\�tڢ� � fix_buffer.pyonu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s4 Fixer that changes buffer(...) into memoryview(...).i ( t
fixer_base( t Namet FixBufferc B s# e Z e Z e Z d Z d � Z RS( sR
power< name='buffer' trailer< '(' [any] ')' > any* >
c C s* | d } | j t d d | j �� d S( Nt nameu
memoryviewt prefix( t replaceR R ( t selft nodet resultsR ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_buffer.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet explicitt PATTERNR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_buffer.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_buffer.pyt <module> s PK J/�\p�V\�
�
fix_operator.pynu �[��� """Fixer for operator functions.
operator.isCallable(obj) -> hasattr(obj, '__call__')
operator.sequenceIncludes(obj) -> operator.contains(obj)
operator.isSequenceType(obj) -> isinstance(obj, collections.Sequence)
operator.isMappingType(obj) -> isinstance(obj, collections.Mapping)
operator.isNumberType(obj) -> isinstance(obj, numbers.Number)
operator.repeat(obj, n) -> operator.mul(obj, n)
operator.irepeat(obj, n) -> operator.imul(obj, n)
"""
# Local imports
from lib2to3 import fixer_base
from lib2to3.fixer_util import Call, Name, String, touch_import
def invocation(s):
def dec(f):
f.invocation = s
return f
return dec
class FixOperator(fixer_base.BaseFix):
BM_compatible = True
order = "pre"
methods = """
method=('isCallable'|'sequenceIncludes'
|'isSequenceType'|'isMappingType'|'isNumberType'
|'repeat'|'irepeat')
"""
obj = "'(' obj=any ')'"
PATTERN = """
power< module='operator'
trailer< '.' %(methods)s > trailer< %(obj)s > >
|
power< %(methods)s trailer< %(obj)s > >
""" % dict(methods=methods, obj=obj)
def transform(self, node, results):
method = self._check_method(node, results)
if method is not None:
return method(node, results)
@invocation("operator.contains(%s)")
def _sequenceIncludes(self, node, results):
return self._handle_rename(node, results, u"contains")
@invocation("hasattr(%s, '__call__')")
def _isCallable(self, node, results):
obj = results["obj"]
args = [obj.clone(), String(u", "), String(u"'__call__'")]
return Call(Name(u"hasattr"), args, prefix=node.prefix)
@invocation("operator.mul(%s)")
def _repeat(self, node, results):
return self._handle_rename(node, results, u"mul")
@invocation("operator.imul(%s)")
def _irepeat(self, node, results):
return self._handle_rename(node, results, u"imul")
@invocation("isinstance(%s, collections.Sequence)")
def _isSequenceType(self, node, results):
return self._handle_type2abc(node, results, u"collections", u"Sequence")
@invocation("isinstance(%s, collections.Mapping)")
def _isMappingType(self, node, results):
return self._handle_type2abc(node, results, u"collections", u"Mapping")
@invocation("isinstance(%s, numbers.Number)")
def _isNumberType(self, node, results):
return self._handle_type2abc(node, results, u"numbers", u"Number")
def _handle_rename(self, node, results, name):
method = results["method"][0]
method.value = name
method.changed()
def _handle_type2abc(self, node, results, module, abc):
touch_import(None, module, node)
obj = results["obj"]
args = [obj.clone(), String(u", " + u".".join([module, abc]))]
return Call(Name(u"isinstance"), args, prefix=node.prefix)
def _check_method(self, node, results):
method = getattr(self, "_" + results["method"][0].value.encode("ascii"))
if callable(method):
if "module" in results:
return method
else:
sub = (unicode(results["obj"]),)
invocation_str = unicode(method.invocation) % sub
self.warning(node, u"You should use '%s' here." % invocation_str)
return None
PK J/�\ܾ�� � fix_xreadlines.pyonu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( sp Fix "for x in f.xreadlines()" -> "for x in f".
This fixer will also convert g(f.xreadlines) into g(f.__iter__).i ( t
fixer_base( t Namet
FixXreadlinesc B s e Z e Z d Z d � Z RS( s�
power< call=any+ trailer< '.' 'xreadlines' > trailer< '(' ')' > >
|
power< any+ trailer< '.' no_call='xreadlines' > >
c C sb | j d � } | r4 | j t d d | j �� n* | j g | d D] } | j � ^ qE � d S( Nt no_callu __iter__t prefixt call( t gett replaceR R t clone( t selft nodet resultsR t x( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_xreadlines.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR
( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_xreadlines.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_xreadlines.pyt <module> s PK J/�\�xA�
�
fix_next.pyonu �[��� �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z d d l m Z m
Z
m Z d Z d e j
f d � � YZ d � Z d
� Z d � Z d S(
s. Fixer for it.next() -> next(it), per PEP 3114.i ( t token( t python_symbols( t
fixer_base( t Namet Callt find_bindings; Calls to builtin next() possibly shadowed by global bindingt FixNextc B s, e Z e Z d Z d Z d � Z d � Z RS( s�
power< base=any+ trailer< '.' attr='next' > trailer< '(' ')' > >
|
power< head=any+ trailer< '.' attr='next' > not trailer< '(' ')' > >
|
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def'
name='next'
parameters< '(' NAME ')' > any+ >
any* > >
|
global=global_stmt< 'global' any* 'next' any* >
t prec C sW t t | � j | | � t d | � } | rJ | j | t � t | _ n t | _ d S( Nu next( t superR t
start_treeR t warningt bind_warningt Truet
shadowed_nextt False( t selft treet filenamet n( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyR $ s c C s� | j d � } | j d � } | j d � } | r� | j r[ | j t d d | j �� qg | D] } | j � ^ qb } d | d _ | j t t d d | j �| � � n� | r� t d d | j �} | j | � n� | rWt | � rA| d } d
j g | D] } t | � ^ q� j
� d k r=| j | t � n d S| j t d � � n( d | k r| j | t � t
| _ n d S(
Nt baset attrt nameu __next__t prefixu i u nextt headt u __builtin__t global( t getR
t replaceR R t cloneR t is_assign_targett joint strt stripR
R R ( R t nodet resultsR R R R R ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyt transform. s,
(
4 ( t __name__t
__module__R t
BM_compatiblet PATTERNt orderR R# ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyR s
c C s] t | � } | d k r t Sx: | j D]/ } | j t j k rB t St | | � r& t Sq& Wt S( N( t find_assignt NoneR t childrent typeR t EQUALt
is_subtreeR ( R! t assignt child( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyR Q s c C sH | j t j k r | S| j t j k s7 | j d k r; d St | j � S( N( R, t symst expr_stmtt simple_stmtt parentR* R) ( R! ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyR) ] s
!c s- | � k r t St � f d � | j D� � S( Nc 3 s | ] } t | � � Vq d S( N( R. ( t .0t c( R! ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pys <genexpr>g s ( R t anyR+ ( t rootR! ( ( R! s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyR. d s N( t __doc__t pgen2R t pygramR R1 R R t
fixer_utilR R R R t BaseFixR R R) R. ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyt <module> s @ PK J/�\R�R�� � fix_numliterals.pyonu �[��� �
{ fc @ sS d Z d d l m Z d d l m Z d d l m Z d e j f d � � YZ d S( s- Fixer that turns 1L into 1, 0755 into 0o755.
i ( t token( t
fixer_base( t Numbert FixNumliteralsc B s# e Z e j Z d � Z d � Z RS( c C s# | j j d � p" | j d d k S( Nu 0i����u Ll( t valuet
startswith( t selft node( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_numliterals.pyt match s c C s} | j } | d d k r& | d } nD | j d � rj | j � rj t t | � � d k rj d | d } n t | d | j �S( Ni����u Llu 0i u 0ot prefix( R R t isdigitt lent setR R ( R R t resultst val( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_numliterals.pyt transform s
3( t __name__t
__module__R t NUMBERt _accept_typeR R ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_numliterals.pyR s N( t __doc__t pgen2R t R t
fixer_utilR t BaseFixR ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_numliterals.pyt <module> s PK J/�\��\�� � fix_unicode.pycnu �[��� �
{ fc @ sW d Z d d l m Z d d l m Z i d d 6d d 6Z d e j f d � � YZ d
S( s� Fixer for unicode.
* Changes unicode to str and unichr to chr.
* If "...\u..." is not unicode literal change it into "...\\u...".
* Change u"..." into "...".
i ( t token( t
fixer_baseu chru unichru stru unicodet
FixUnicodec B s& e Z e Z d Z d � Z d � Z RS( s STRING | 'unicode' | 'unichr'c C s/ t t | � j | | � d | j k | _ d S( Nt unicode_literals( t superR t
start_treet future_featuresR ( t selft treet filename( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_unicode.pyR s c C s | j t j k r2 | j � } t | j | _ | S| j t j k r| j } | j r� | d d k r� d | k r� d j g | j d � D]$ } | j
d d � j
d d � ^ q� � } n | d d k r� | d
} n | | j k r� | S| j � } | | _ | Sd S( Ni u '"u \u \\u \uu \\uu \Uu \\Uu uUi ( t typeR t NAMEt clonet _mappingt valuet STRINGR t joint splitt replace( R t nodet resultst newt valt v( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_unicode.pyt transform s" &=
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR R ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_unicode.pyR s N( t __doc__t pgen2R t R R
t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_unicode.pyt <module> s PK J/�\��J�� �
fix_types.pyonu �[��� �
{ fc @ s d Z d d l m Z d d l m Z d d l m Z i d d 6d d 6d d
6d d 6d
d 6d
d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d! d" 6d# d$ 6d% d& 6d d' 6d( d) 6d* d+ 6Z g e D] Z d, e ^ q� Z d- e j
f d. � � YZ d/ S(0 s� Fixer for removing uses of the types module.
These work for only the known names in the types module. The forms above
can include types. or not. ie, It is assumed the module is imported either as:
import types
from types import ... # either * or specific types
The import statements are not modified.
There should be another fixer that handles at least the following constants:
type([]) -> list
type(()) -> tuple
type('') -> str
i ( t token( t
fixer_base( t Namet boolt BooleanTypet
memoryviewt
BufferTypet typet ClassTypet complext ComplexTypet dictt DictTypet DictionaryTypes type(Ellipsis)t EllipsisTypet floatt FloatTypet intt IntTypet listt ListTypet LongTypet objectt
ObjectTypes
type(None)t NoneTypes type(NotImplemented)t NotImplementedTypet slicet SliceTypet bytest
StringTypes (str,)t StringTypest tuplet TupleTypet TypeTypet strt UnicodeTypet ranget
XRangeTypes) power< 'types' trailer< '.' name='%s' > >t FixTypesc B s& e Z e Z d j e � Z d � Z RS( t |c C s9 t t j | d j � � } | r5 t | d | j �Sd S( Nt namet prefix( t unicodet
_TYPE_MAPPINGt gett valueR R) t None( t selft nodet resultst new_value( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_types.pyt transform: s ( t __name__t
__module__t Truet
BM_compatiblet joint _patst PATTERNR3 ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_types.pyR& 6 s N( t __doc__t pgen2R t R t
fixer_utilR R+ t tR9 t BaseFixR& ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_types.pyt <module> s6
PK J/�\�P�r
fix_itertools.pyonu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( sT Fixer for itertools.(imap|ifilter|izip) --> (map|filter|zip) and
itertools.ifilterfalse --> itertools.filterfalse (bugs 2360-2363)
imports from itertools are fixed in fix_itertools_import.py
If itertools is imported as something else (ie: import itertools as it;
it.izip(spam, eggs)) method calls will not get fixed.
i ( t
fixer_base( t Namet FixItertoolsc B s0 e Z e Z d Z d e � Z d Z d � Z RS( s7 ('imap'|'ifilter'|'izip'|'izip_longest'|'ifilterfalse')s�
power< it='itertools'
trailer<
dot='.' func=%(it_funcs)s > trailer< '(' [any] ')' > >
|
power< func=%(it_funcs)s trailer< '(' [any] ')' > >
i c C s� d } | d d } d | k rt | j d k rt | d | d } } | j } | j � | j � | j j | � n | p� | j } | j t | j d d | �� d S(
Nt funci t itu ifilterfalseu izip_longestt doti t prefix( u ifilterfalseu izip_longest( t Nonet valueR t removet parentt replaceR ( t selft nodet resultsR R R R ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_itertools.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet it_funcst localst PATTERNt run_orderR ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_itertools.pyR s
N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_itertools.pyt <module> s PK J/�\�tڢ� � fix_buffer.pycnu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s4 Fixer that changes buffer(...) into memoryview(...).i ( t
fixer_base( t Namet FixBufferc B s# e Z e Z e Z d Z d � Z RS( sR
power< name='buffer' trailer< '(' [any] ')' > any* >
c C s* | d } | j t d d | j �� d S( Nt nameu
memoryviewt prefix( t replaceR R ( t selft nodet resultsR ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_buffer.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet explicitt PATTERNR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_buffer.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_buffer.pyt <module> s PK J/�\�,�b� �
fix_raise.pycnu �[��� �
{ fc @ s{ d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m Z m
Z
m Z d e j f d � � YZ
d S( s[ Fixer for 'raise E, V, T'
raise -> raise
raise E -> raise E
raise E, V -> raise E(V)
raise E, V, T -> raise E(V).with_traceback(T)
raise E, None, T -> raise E.with_traceback(T)
raise (((E, E'), E''), E'''), V -> raise E(V)
raise "foo", V, T -> warns about string exceptions
CAVEATS:
1) "raise E, V" will be incorrectly translated if V is an exception
instance. The correct Python 3 idiom is
raise E from V
but since we can't detect instance-hood by syntax alone and since
any client code would have to be changed as well, we don't automate
this.
i ( t pytree( t token( t
fixer_base( t Namet Callt Attrt ArgListt is_tuplet FixRaisec B s e Z e Z d Z d � Z RS( sB
raise_stmt< 'raise' exc=any [',' val=any [',' tb=any]] >
c
C s | j } | d j � } | j t j k rE d } | j | | � d St | � r� x* t | � r} | j d j d j � } qT Wd | _ n d | k r� t j
| j t d � | g � } | j | _ | S| d j � } t | � rg | j d d !D] } | j � ^ q� } n d | _ | g } d
| k r�| d
j � }
d |
_ | } | j t j
k sm| j d k rt | | � } n t | t d � � t |
g � g } t j
| j t d � g | � } | j | _ | St j
| j t d � t | | � g d
| j �Sd S( Nt excs+ Python 3 does not support string exceptionsi i u t valu raisei����u t tbu Noneu with_tracebackt prefix( t symst clonet typeR t STRINGt cannot_convertR t childrenR R t Nodet
raise_stmtR t NAMEt valueR R R t simple_stmt(
t selft nodet resultsR
R t msgt newR
t ct argsR t et with_tb( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_raise.pyt transform& s@ ! , !%" ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR! ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_raise.pyR s N( t __doc__t R t pgen2R R t
fixer_utilR R R R R t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_raise.pyt <module> s
(PK J/�\}V�G G
fix_reduce.pynu �[��� # Copyright 2008 Armin Ronacher.
# Licensed to PSF under a Contributor Agreement.
"""Fixer for reduce().
Makes sure reduce() is imported from the functools module if reduce is
used in that module.
"""
from lib2to3 import fixer_base
from lib2to3.fixer_util import touch_import
class FixReduce(fixer_base.BaseFix):
BM_compatible = True
order = "pre"
PATTERN = """
power< 'reduce'
trailer< '('
arglist< (
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any) |
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any ','
not(argument<any '=' any>) any)
) >
')' >
>
"""
def transform(self, node, results):
touch_import(u'functools', u'reduce', node)
PK J/�\Tv˒R R fix_tuple_params.pycnu �[��� �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m Z m
Z
m Z m Z d � Z
d e j f d � � YZ d � Z d
� Z g d
d � Z d � Z d
S( s: Fixer for function definitions with tuple parameters.
def func(((a, b), c), d):
...
->
def func(x, d):
((a, b), c) = x
...
It will also support lambdas:
lambda (x, y): x + y -> lambda t: t[0] + t[1]
# The parens are a syntax error in Python 3
lambda (x): x + y -> lambda x: x + y
i ( t pytree( t token( t
fixer_base( t Assignt Namet Newlinet Numbert Subscriptt symsc C s) t | t j � o( | j d j t j k S( Ni ( t
isinstanceR t Nodet childrent typeR t STRING( t stmt( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyt is_docstring s t FixTupleParamsc B s, e Z d Z e Z d Z d � Z d � Z RS( i s
funcdef< 'def' any parameters< '(' args=any ')' >
['->' any] ':' suite=any+ >
|
lambda=
lambdef< 'lambda' args=vfpdef< '(' inner=any ')' >
':' body=any
>
c s0 d | k r � j | | � Sg � | d } | d } | d j d j t j k ry d } | d j d j } t � � n! d } d } t j t j d � � t � � � f d � } | j t
j k r� | | � n` | j t
j k r1xK t
| j � D]7 \ } } | j t
j k r� | | d
| d k �q� q� Wn � s;d Sx � D] }
| d |
_ qBW| } | d k r{d � d _ n1 t | d j | � r�| � d _ | d } n x � D] }
| d |
_ q�W� | d j | | +x= t | d | t � � d � D] } | | d j | _ q W| d j � d S( Nt lambdat suitet argsi i i u ; u c s� t � j � � } | j � } d | _ t | | j � � } | rN d | _ n | j | � � j t j t j
| � j � g � � d S( Nu u ( R t new_namet clonet prefixR t replacet appendR R
R t simple_stmt( t tuple_argt
add_prefixt nt argR ( t endt new_linest self( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyt handle_tupleC s
R u ( t transform_lambdaR R R t INDENTt valueR R t Leaft FalseR t tfpdeft
typedargslistt enumeratet parentR R t ranget lent changed( R t nodet resultsR R t startt indentR! t iR t linet after( ( R R R s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyt transform. sF
(c C sN | d } | d } t | d � } | j t j k r\ | j � } d | _ | j | � d St | � } t | � } | j t
| � � } t | d d �} | j | j � � x� | j � D]� }
|
j t j k r� |
j
| k r� g | |
j
D] } | j � ^ q� } t j t j | j � g | � }
|
j |
_ |
j |
� q� q� Wd S( NR t bodyt inneru R ( t
simplify_argsR R t NAMER R R t find_paramst map_to_indexR t
tuple_nameR t
post_orderR$ R R
R t power( R R. R/ R R6 R7 t paramst to_indext tup_namet new_paramR t ct
subscriptst new( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR" n s(
!& ( t __name__t
__module__t run_ordert Truet
BM_compatiblet PATTERNR5 R" ( ( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR s
@c C so | j t j t j f k r | S| j t j k r[ x# | j t j k rV | j d } q4 W| St d | � � d S( Ni s Received unexpected node %s( R R t vfplistR R9 t vfpdefR t RuntimeError( R. ( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR8 � s c C sn | j t j k r# t | j d � S| j t j k r< | j Sg | j D]$ } | j t j k rF t | � ^ qF S( Ni ( R R RM R: R R R9 R$ t COMMA( R. RC ( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR: � s
c C s� | d k r i } n xh t | � D]Z \ } } t t t | � � � g } t | t � rn t | | d | �q" | | | | <q" W| S( Nt d( t NoneR) R R t unicodeR t listR; ( t
param_listR RP R2 t objt trailer( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR; � s c C sV g } x@ | D]8 } t | t � r8 | j t | � � q
| j | � q
Wd j | � S( Nu _( R RS R R< t join( RT t lRU ( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR< � s
N( t __doc__t R t pgen2R R t
fixer_utilR R R R R R R t BaseFixR R8 R: RQ R; R< ( ( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyt <module> s . l PK J/�\sGћ� � fix_getcwdu.pycnu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s1
Fixer that changes os.getcwdu() to os.getcwd().
i ( t
fixer_base( t Namet
FixGetcwduc B s e Z e Z d Z d � Z RS( sR
power< 'os' trailer< dot='.' name='getcwdu' > any* >
c C s* | d } | j t d d | j �� d S( Nt nameu getcwdt prefix( t replaceR R ( t selft nodet resultsR ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_getcwdu.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_getcwdu.pyR
s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_getcwdu.pyt <module> s PK J/�\Tv˒R R fix_tuple_params.pyonu �[��� �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m Z m
Z
m Z m Z d � Z
d e j f d � � YZ d � Z d
� Z g d
d � Z d � Z d
S( s: Fixer for function definitions with tuple parameters.
def func(((a, b), c), d):
...
->
def func(x, d):
((a, b), c) = x
...
It will also support lambdas:
lambda (x, y): x + y -> lambda t: t[0] + t[1]
# The parens are a syntax error in Python 3
lambda (x): x + y -> lambda x: x + y
i ( t pytree( t token( t
fixer_base( t Assignt Namet Newlinet Numbert Subscriptt symsc C s) t | t j � o( | j d j t j k S( Ni ( t
isinstanceR t Nodet childrent typeR t STRING( t stmt( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyt is_docstring s t FixTupleParamsc B s, e Z d Z e Z d Z d � Z d � Z RS( i s
funcdef< 'def' any parameters< '(' args=any ')' >
['->' any] ':' suite=any+ >
|
lambda=
lambdef< 'lambda' args=vfpdef< '(' inner=any ')' >
':' body=any
>
c s0 d | k r � j | | � Sg � | d } | d } | d j d j t j k ry d } | d j d j } t � � n! d } d } t j t j d � � t � � � f d � } | j t
j k r� | | � n` | j t
j k r1xK t
| j � D]7 \ } } | j t
j k r� | | d
| d k �q� q� Wn � s;d Sx � D] }
| d |
_ qBW| } | d k r{d � d _ n1 t | d j | � r�| � d _ | d } n x � D] }
| d |
_ q�W� | d j | | +x= t | d | t � � d � D] } | | d j | _ q W| d j � d S( Nt lambdat suitet argsi i i u ; u c s� t � j � � } | j � } d | _ t | | j � � } | rN d | _ n | j | � � j t j t j
| � j � g � � d S( Nu u ( R t new_namet clonet prefixR t replacet appendR R
R t simple_stmt( t tuple_argt
add_prefixt nt argR ( t endt new_linest self( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyt handle_tupleC s
R u ( t transform_lambdaR R R t INDENTt valueR R t Leaft FalseR t tfpdeft
typedargslistt enumeratet parentR R t ranget lent changed( R t nodet resultsR R t startt indentR! t iR t linet after( ( R R R s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyt transform. sF
(c C sN | d } | d } t | d � } | j t j k r\ | j � } d | _ | j | � d St | � } t | � } | j t
| � � } t | d d �} | j | j � � x� | j � D]� }
|
j t j k r� |
j
| k r� g | |
j
D] } | j � ^ q� } t j t j | j � g | � }
|
j |
_ |
j |
� q� q� Wd S( NR t bodyt inneru R ( t
simplify_argsR R t NAMER R R t find_paramst map_to_indexR t
tuple_nameR t
post_orderR$ R R
R t power( R R. R/ R R6 R7 t paramst to_indext tup_namet new_paramR t ct
subscriptst new( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR" n s(
!& ( t __name__t
__module__t run_ordert Truet
BM_compatiblet PATTERNR5 R" ( ( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR s
@c C so | j t j t j f k r | S| j t j k r[ x# | j t j k rV | j d } q4 W| St d | � � d S( Ni s Received unexpected node %s( R R t vfplistR R9 t vfpdefR t RuntimeError( R. ( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR8 � s c C sn | j t j k r# t | j d � S| j t j k r< | j Sg | j D]$ } | j t j k rF t | � ^ qF S( Ni ( R R RM R: R R R9 R$ t COMMA( R. RC ( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR: � s
c C s� | d k r i } n xh t | � D]Z \ } } t t t | � � � g } t | t � rn t | | d | �q" | | | | <q" W| S( Nt d( t NoneR) R R t unicodeR t listR; ( t
param_listR RP R2 t objt trailer( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR; � s c C sV g } x@ | D]8 } t | t � r8 | j t | � � q
| j | � q
Wd j | � S( Nu _( R RS R R< t join( RT t lRU ( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyR< � s
N( t __doc__t R t pgen2R R t
fixer_utilR R R R R R R t BaseFixR R8 R: RQ R; R< ( ( ( s6 /usr/lib64/python2.7/lib2to3/fixes/fix_tuple_params.pyt <module> s . l PK J/�\�V%e~ ~ fix_has_key.pycnu �[��� �
{ 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 ' s N( t __doc__t R t pgen2R R t
fixer_utilR R t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_has_key.pyt <module> s
PK J/�\��\� � fix_standarderror.pynu �[��� # Copyright 2007 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer for StandardError -> Exception."""
# Local imports
from .. import fixer_base
from ..fixer_util import Name
class FixStandarderror(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
'StandardError'
"""
def transform(self, node, results):
return Name(u"Exception", prefix=node.prefix)
PK J/�\�P��. . fix_itertools_imports.pynu �[��� """ Fixer for imports of itertools.(imap|ifilter|izip|ifilterfalse) """
# Local imports
from lib2to3 import fixer_base
from lib2to3.fixer_util import BlankLine, syms, token
class FixItertoolsImports(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
import_from< 'from' 'itertools' 'import' imports=any >
""" %(locals())
def transform(self, node, results):
imports = results['imports']
if imports.type == syms.import_as_name or not imports.children:
children = [imports]
else:
children = imports.children
for child in children[::2]:
if child.type == token.NAME:
member = child.value
name_node = child
elif child.type == token.STAR:
# Just leave the import as is.
return
else:
assert child.type == syms.import_as_name
name_node = child.children[0]
member_name = name_node.value
if member_name in (u'imap', u'izip', u'ifilter'):
child.value = None
child.remove()
elif member_name in (u'ifilterfalse', u'izip_longest'):
node.changed()
name_node.value = (u'filterfalse' if member_name[1] == u'f'
else u'zip_longest')
# Make sure the import statement is still sane
children = imports.children[:] or [imports]
remove_comma = True
for child in children:
if remove_comma and child.type == token.COMMA:
child.remove()
else:
remove_comma ^= True
while children and children[-1].type == token.COMMA:
children.pop().remove()
# If there are no imports left, just get rid of the entire statement
if (not (imports.children or getattr(imports, 'value', None)) or
imports.parent is None):
p = node.prefix
node = BlankLine()
node.prefix = p
return node
PK J/�\�
J J
fix_intern.pynu �[��� # Copyright 2006 Georg Brandl.
# Licensed to PSF under a Contributor Agreement.
"""Fixer for intern().
intern(s) -> sys.intern(s)"""
# Local imports
from .. import pytree
from .. import fixer_base
from ..fixer_util import Name, Attr, touch_import
class FixIntern(fixer_base.BaseFix):
BM_compatible = True
order = "pre"
PATTERN = """
power< 'intern'
trailer< lpar='('
( not(arglist | argument<any '=' any>) obj=any
| obj=arglist<(not argument<any '=' any>) any ','> )
rpar=')' >
after=any*
>
"""
def transform(self, node, results):
if results:
# I feel like we should be able to express this logic in the
# PATTERN above but I don't know how to do it so...
obj = results['obj']
if obj:
if obj.type == self.syms.star_expr:
return # Make no change.
if (obj.type == self.syms.argument and
obj.children[0].value == '**'):
return # Make no change.
syms = self.syms
obj = results["obj"].clone()
if obj.type == syms.arglist:
newarglist = obj.clone()
else:
newarglist = pytree.Node(syms.arglist, [obj.clone()])
after = results["after"]
if after:
after = [n.clone() for n in after]
new = pytree.Node(syms.power,
Attr(Name(u"sys"), Name(u"intern")) +
[pytree.Node(syms.trailer,
[results["lpar"].clone(),
newarglist,
results["rpar"].clone()])] + after)
new.prefix = node.prefix
touch_import(None, u'sys', node)
return new
PK J/�\ܾ�� � fix_xreadlines.pycnu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( sp Fix "for x in f.xreadlines()" -> "for x in f".
This fixer will also convert g(f.xreadlines) into g(f.__iter__).i ( t
fixer_base( t Namet
FixXreadlinesc B s e Z e Z d Z d � Z RS( s�
power< call=any+ trailer< '.' 'xreadlines' > trailer< '(' ')' > >
|
power< any+ trailer< '.' no_call='xreadlines' > >
c C sb | j d � } | r4 | j t d d | j �� n* | j g | d D] } | j � ^ qE � d S( Nt no_callu __iter__t prefixt call( t gett replaceR R t clone( t selft nodet resultsR t x( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_xreadlines.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR
( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_xreadlines.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_xreadlines.pyt <module> s PK J/�\��5��
�
fix_exitfunc.pyonu �[��� �
{ fc @ sg d Z d d l m Z m Z d d l m Z m Z m Z m Z m Z m
Z
d e j f d � � YZ d S( s7
Convert use of sys.exitfunc to use the atexit module.
i����( t pytreet
fixer_base( t Namet Attrt Callt Commat Newlinet symst FixExitfuncc B s5 e Z e Z e Z d Z d � Z d � Z d � Z RS( s�
(
sys_import=import_name<'import'
('sys'
|
dotted_as_names< (any ',')* 'sys' (',' any)* >
)
>
|
expr_stmt<
power< 'sys' trailer< '.' 'exitfunc' > >
'=' func=any >
)
c G s t t | � j | � d S( N( t superR t __init__( t selft args( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_exitfunc.pyR
s c C s& t t | � j | | � d | _ d S( N( R R t
start_treet Nonet
sys_import( R t treet filename( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_exitfunc.pyR
! s c C s� d | k r/ | j d k r+ | d | _ n d S| d j � } d | _ t j t j t t d � t d � � � } t
| | g | j � } | j | � | j d k r� | j | d � d S| j j
d } | j t j k r| j t � � | j t d d � � n� | j j } | j
j | j � } | j } t j t j t d � t d d � g � }
t j t j |
g � } | j | d t � � | j | d
| � d S( NR t funcu u atexitu registersK Can't find sys import; Please add an atexit import at the top of your file.i u u importi ( R R t clonet prefixR t NodeR t powerR R R t replacet warningt childrent typet dotted_as_namest append_childR t parentt indext import_namet simple_stmtt insert_childR ( R t nodet resultsR t registert callt namest containing_stmtt positiont stmt_containert
new_importt new( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_exitfunc.pyt transform% s2
( t __name__t
__module__t Truet keep_line_ordert
BM_compatiblet PATTERNR
R
R, ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_exitfunc.pyR s N(
t __doc__t lib2to3R R t lib2to3.fixer_utilR R R R R R t BaseFixR ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_exitfunc.pyt <module> s .PK J/�\�d�{� � fix_raw_input.pyonu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s2 Fixer that changes raw_input(...) into input(...).i ( t
fixer_base( t Namet FixRawInputc B s e Z e Z d Z d � Z RS( sU
power< name='raw_input' trailer< '(' [any] ')' > any* >
c C s* | d } | j t d d | j �� d S( Nt nameu inputt prefix( t replaceR R ( t selft nodet resultsR ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_raw_input.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_raw_input.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_raw_input.pyt <module> s PK J/�\��cۛ � fix_metaclass.pyonu �[��� �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z m Z m Z m Z d � Z
d � Z d � Z d � Z
d � Z d
� Z d e j f d � � YZ d
S( s� Fixer for __metaclass__ = X -> (metaclass=X) methods.
The various forms of classef (inherits nothing, inherits once, inherints
many) don't parse the same in the CST so we look at ALL classes for
a __metaclass__ and if we find one normalize the inherits to all be
an arglist.
For one-liner classes ('class X: pass') there is no indent/dedent so
we normalize those into having a suite.
Moving the __metaclass__ into the classdef can also cause the class
body to be empty so there is some special casing for that as well.
This fixer also tries very hard to keep original indenting and spacing
in all those corner cases.
i ( t
fixer_base( t token( t Namet symst Nodet Leafc C s� x� | j D]� } | j t j k r, t | � S| j t j k r
| j r
| j d } | j t j k r� | j r� | j d } t | t � r� | j d k r� t
Sq� q
q
Wt S( s� we have to check the cls_node without changing it.
There are two possibilities:
1) clsdef => suite => simple_stmt => expr_stmt => Leaf('__meta')
2) clsdef => simple_stmt => expr_stmt => Leaf('__meta')
i t
__metaclass__( t childrent typeR t suitet
has_metaclasst simple_stmtt expr_stmtt
isinstanceR t valuet Truet False( t parentt nodet expr_nodet left_side( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyR
s
c C s� x' | j D] } | j t j k r
d Sq
Wx? t | j � D]" \ } } | j t j k r: Pq: q: Wt d � � t t j g � } xC | j | d r� | j | d } | j | j
� � | j � q� W| j | � | } d S( sf one-line classes don't get a suite in the parse tree so we add
one to normalize the tree
Ns No class suite and no ':'!i ( R R R R t enumerateR t COLONt
ValueErrorR t append_childt clonet remove( t cls_nodeR t iR t move_node( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt fixup_parse_tree- s
c
C s� x7 t | j � D]" \ } } | j t j k r Pq q Wd S| j � t t j g � } t t j | g � } x; | j | r� | j | } | j
| j � � | j � qn W| j | | � | j d j d } | j d j d } | j
| _
d S( s� if there is a semi-colon all the parts count as part of the same
simple_stmt. We just want the __metaclass__ part so we move
everything after the semi-colon into its own simple_stmt node
Ni ( R R R R t SEMIR R R R R R R t insert_childt prefix(
R R t stmt_nodet semi_indR t new_exprt new_stmtR t new_leaf1t old_leaf1( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt fixup_simple_stmtG s
c C s: | j r6 | j d j t j k r6 | j d j � n d S( Ni����( R R R t NEWLINER ( R ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt remove_trailing_newline_ s "c c s� x3 | j D] } | j t j k r
Pq
q
Wt d � � x� t t | j � � D]� \ } } | j t j k rL | j rL | j d } | j t j k r� | j r� | j d } t | t
� r� | j d k r� t | | | � t
| � | | | f Vq� q� qL qL Wd S( Ns No class suite!i u
__metaclass__( R R R R R t listR R R R
R R R( R* ( R R R t simple_nodeR t left_node( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt
find_metasd s "
c C s� | j d d d � } x, | rD | j � } | j t j k r Pq q Wxm | r� | j � } t | t � r� | j t j k r� | j r� d | _ n d S| j | j d d d � � qH Wd S( s� If an INDENT is followed by a thing with a prefix then nuke the prefix
Otherwise we get in trouble when removing __metaclass__ at suite start
Ni����u (
R t popR R t INDENTR
R t DEDENTR! t extend( R t kidsR ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt fixup_indent{ s ! t FixMetaclassc B s e Z e Z d Z d � Z RS( s
classdef<any*>
c C s t | � s d St | � d } x- t | � D] \ } } } | } | j � q- W| j d j } t | j � d k r� | j d j t j k r� | j d } q�| j d j
� } t t j | g � } | j d | � n� t | j � d k rt t j g � } | j
d | � n~ t | j � d k r�t t j g � } | j
d t t j d � � | j
d | � | j
d t t j d � � n t d � � | j d j d }
d
|
_ |
j } | j r�| j t t j d � � d |
_ n d
|
_ | j d } d
| j d _ d
| j d _ | j | � t | � | j s�| j � t | d � }
| |
_ | j |
� | j t t j d � � n� t | j � d k r | j d j t j k r | j d j t j k r t | d � }
| j
d |
� | j
d t t j d � � n d S( Ni i i i i i u )u (s Unexpected class definitiont metaclassu ,u u i u passu
i����i����( R
R t NoneR. R R R t lenR t arglistR R t set_childR R R t RPARt LPARR R R! R t COMMAR4 R) R0 R1 ( t selfR t resultst last_metaclassR R t stmtt text_typeR9 R t meta_txtt orig_meta_prefixR t pass_leaf( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt transform� s^
( t __name__t
__module__R t
BM_compatiblet PATTERNRF ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyR5 � s N( t __doc__t R t pygramR t
fixer_utilR R R R R
R R( R* R. R4 t BaseFixR5 ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt <module> s " PK J/�\�� fix_operator.pycnu �[��� �
{ fc @ s^ d Z d d l m Z d d l m Z m Z m Z m Z d � Z d e j f d � � YZ
d S( s� Fixer for operator functions.
operator.isCallable(obj) -> hasattr(obj, '__call__')
operator.sequenceIncludes(obj) -> operator.contains(obj)
operator.isSequenceType(obj) -> isinstance(obj, collections.Sequence)
operator.isMappingType(obj) -> isinstance(obj, collections.Mapping)
operator.isNumberType(obj) -> isinstance(obj, numbers.Number)
operator.repeat(obj, n) -> operator.mul(obj, n)
operator.irepeat(obj, n) -> operator.imul(obj, n)
i����( t
fixer_base( t Callt Namet Stringt touch_importc s � f d � } | S( Nc s
� | _ | S( N( t
invocation( t f( t s( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt dec s ( ( R R ( ( R s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyR s t FixOperatorc B s� e Z e Z d Z d Z d Z d e d e d e � Z d � Z e
d � d � � Z e
d � d
� � Z e
d � d � � Z
e
d
� d � � Z e
d � d � � Z e
d � d � � Z e
d � d � � Z d � Z d � Z d � Z RS( t pres�
method=('isCallable'|'sequenceIncludes'
|'isSequenceType'|'isMappingType'|'isNumberType'
|'repeat'|'irepeat')
s '(' obj=any ')'s�
power< module='operator'
trailer< '.' %(methods)s > trailer< %(obj)s > >
|
power< %(methods)s trailer< %(obj)s > >
t methodst objc C s/ | j | | � } | d k r+ | | | � Sd S( N( t
_check_methodt None( t selft nodet resultst method( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt transform) s s operator.contains(%s)c C s | j | | d � S( Nu contains( t _handle_rename( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _sequenceIncludes. s s hasattr(%s, '__call__')c C sG | d } | j � t d � t d � g } t t d � | d | j �S( NR u , u
'__call__'u hasattrt prefix( t cloneR R R R ( R R R R t args( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _isCallable2 s
!s operator.mul(%s)c C s | j | | d � S( Nu mul( R ( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _repeat8 s s operator.imul(%s)c C s | j | | d � S( Nu imul( R ( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _irepeat< s s$ isinstance(%s, collections.Sequence)c C s | j | | d d � S( Nu collectionsu Sequence( t _handle_type2abc( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _isSequenceType@ s s# isinstance(%s, collections.Mapping)c C s | j | | d d � S( Nu collectionsu Mapping( R ( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt _isMappingTypeD s s isinstance(%s, numbers.Number)c C s | j | | d d � S( Nu numbersu Number( R ( R R R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt
_isNumberTypeH s c C s% | d d } | | _ | j � d S( NR i ( t valuet changed( R R R t nameR ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyR L s c C sa t d | | � | d } | j � t d d j | | g � � g } t t d � | d | j �S( NR u , u .u
isinstanceR ( R R R R t joinR R R ( R R R t modulet abcR R ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyR Q s
+c C s� t | d | d d j j d � � } t | � r� d | k rC | St | d � f } t | j � | } | j | d | � n d S( Nt _R i t asciiR$ R u You should use '%s' here.( t getattrR t encodet callablet unicodeR t warningR ( R R R R t subt invocation_str( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyR
W s ' ( t __name__t
__module__t Truet
BM_compatiblet orderR R t dictt PATTERNR R R R R R R R R R R R
( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyR s N( t __doc__t lib2to3R t lib2to3.fixer_utilR R R R R t BaseFixR ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_operator.pyt <module>
s " PK J/�\���W W fix_long.pyonu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s/ Fixer that turns 'long' into 'int' everywhere.
i����( t
fixer_base( t is_probably_builtint FixLongc B s e Z e Z d Z d � Z RS( s 'long'c C s& t | � r" d | _ | j � n d S( Nu int( R t valuet changed( t selft nodet results( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_long.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_long.pyR s N( t __doc__t lib2to3R t lib2to3.fixer_utilR t BaseFixR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_long.pyt <module> s PK J/�\mU�
fix_paren.pycnu �[��� �
{ fc @ sI d Z d d l m Z d d l m Z m Z d e j f d � � YZ d S( su Fixer that addes parentheses where they are required
This converts ``[x for x in 1, 2]`` to ``[x for x in (1, 2)]``.i ( t
fixer_base( t LParent RParent FixParenc B s e Z e Z d Z d � Z RS( s
atom< ('[' | '(')
(listmaker< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>
|
testlist_gexp< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>)
(']' | ')') >
c C sL | d } t � } | j | _ d | _ | j d | � | j t � � d S( Nt targetu i ( R t prefixt insert_childt append_childR ( t selft nodet resultsR t lparen( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_paren.pyt transform% s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_paren.pyR s N( t __doc__t R t
fixer_utilR R t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_paren.pyt <module> s PK J/�\t� fix_asserts.pycnu �[��� �
{ fc @ s� d Z d d l m Z d d l m Z e d d d d d d d
d d d
d d d d d d d d d d d d
d d d d d d � Z d e f d � � YZ d S( s5 Fixer that replaces deprecated unittest method names.i ( t BaseFix( t Namet assert_t
assertTruet assertEqualst assertEqualt assertNotEqualst assertNotEqualt assertAlmostEqualst assertAlmostEqualt assertNotAlmostEqualst assertNotAlmostEqualt assertRegexpMatchest assertRegext assertRaisesRegexpt assertRaisesRegext failUnlessEqualt failIfEqualt failUnlessAlmostEqualt failIfAlmostEqualt
failUnlesst failUnlessRaisest assertRaisest failIft assertFalset
FixAssertsc B s- e Z d d j e e e � � Z d � Z RS( sH
power< any+ trailer< '.' meth=(%s)> any* >
t |c C s8 | d d } | j t t t | � d | j �� d S( Nt methi t prefix( t replaceR t NAMESt strR ( t selft nodet resultst name( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_asserts.pyt transform s ( t __name__t
__module__t joint mapt reprR t PATTERNR$ ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_asserts.pyR s N( t __doc__t
fixer_baseR t
fixer_utilR t dictR R ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_asserts.pyt <module> s$ PK J/�\G~�Z fix_repr.pycnu �[��� �
{ fc @ sO d Z d d l m Z d d l m Z m Z m Z d e j f d � � YZ d S( s/ Fixer that transforms `xyzzy` into repr(xyzzy).i ( t
fixer_base( t Callt Namet parenthesizet FixReprc B s e Z e Z d Z d � Z RS( s7
atom < '`' expr=any '`' >
c C sS | d j � } | j | j j k r4 t | � } n t t d � | g d | j �S( Nt expru reprt prefix( t clonet typet symst testlist1R R R R ( t selft nodet resultsR ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_repr.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_repr.pyR s N( t __doc__t R t
fixer_utilR R R t BaseFixR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_repr.pyt <module> s PK K/�\ ��] ] fix_has_key.pyonu �[��� �
{ 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 sI | j } | j j | j k r7 | j j | j � r7 d S| j d � } | d } | j } g | d D] } | j � ^ qd } | d j � } | j d � }
|
r� g |
D] } | j � ^ q� }
n | j | j
| j | j | j | j
| j | j f k r t | � } n t | � d k r*| 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 r<t |
� }
n | |
_ |
S( Nt negationt anchort beforet argt afteri i u u int prefixu not( t 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 sD
#"!
% ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR. ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_has_key.pyR ' s N( t __doc__t R t pgen2R R t
fixer_utilR R t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_has_key.pyt <module> s
PK K/�\mU�
fix_paren.pyonu �[��� �
{ fc @ sI d Z d d l m Z d d l m Z m Z d e j f d � � YZ d S( su Fixer that addes parentheses where they are required
This converts ``[x for x in 1, 2]`` to ``[x for x in (1, 2)]``.i ( t
fixer_base( t LParent RParent FixParenc B s e Z e Z d Z d � Z RS( s
atom< ('[' | '(')
(listmaker< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>
|
testlist_gexp< any
comp_for<
'for' NAME 'in'
target=testlist_safe< any (',' any)+ [',']
>
[any]
>
>)
(']' | ')') >
c C sL | d } t � } | j | _ d | _ | j d | � | j t � � d S( Nt targetu i ( R t prefixt insert_childt append_childR ( t selft nodet resultsR t lparen( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_paren.pyt transform% s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_paren.pyR s N( t __doc__t R t
fixer_utilR R t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_paren.pyt <module> s PK K/�\&�[� fix_xrange.pyonu �[��� �
{ fc @ s_ d Z d d l m Z d d l m Z m Z m Z d d l m Z d e j f d � � YZ d S( s/ Fixer that changes xrange(...) into range(...).i ( t
fixer_base( t Namet Callt consuming_calls( t patcompt FixXrangec B st e Z e Z d Z d � Z d � Z d � Z d � Z d � Z d Z
e j e
� Z
d Z e j e � Z d � Z RS( s�
power<
(name='range'|name='xrange') trailer< '(' args=any ')' >
rest=any* >
c C s) t t | � j | | � t � | _ d S( N( t superR t
start_treet sett transformed_xranges( t selft treet filename( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyR s c C s
d | _ d S( N( t NoneR ( R
R R ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyt finish_tree s c C s^ | d } | j d k r) | j | | � S| j d k rH | j | | � St t | � � � d S( Nt nameu xrangeu range( t valuet transform_xranget transform_ranget
ValueErrort repr( R
t nodet resultsR ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyt transform s
c C s@ | d } | j t d d | j �� | j j t | � � d S( NR u ranget prefix( t replaceR R R t addt id( R
R R R ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyR $ s
c C s� t | � | j k r� | j | � r� t t d � | d j � g � } t t d � | g d | j �} x | d D] } | j | � qs W| Sd S( Nu ranget argsu listR t rest( R R t in_special_contextR R t cloneR t append_child( R
R R t
range_callt list_callt n( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyR * s " s3 power< func=NAME trailer< '(' node=any ')' > any* >s� for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
| comparison< any 'in' node=any any*>
c C s� | j d k r t Si } | j j d k rg | j j | j j | � rg | d | k rg | d j t k S| j j | j | � o� | d | k S( NR t func( t parentR
t Falset p1t matchR R t p2( R
R R ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyR ? s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR R R R R t P1R t compile_patternR' t P2R) R ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyR s N(
t __doc__t R t
fixer_utilR R R R t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyt <module> s PK K/�\_}�< < fix_dict.pyonu �[��� �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m
Z
m Z m Z m
Z
d d l m Z e j e d g � BZ d e j f d
� � YZ d S( sj Fixer for dict methods.
d.keys() -> list(d.keys())
d.items() -> list(d.items())
d.values() -> list(d.values())
d.iterkeys() -> iter(d.keys())
d.iteritems() -> iter(d.items())
d.itervalues() -> iter(d.values())
d.viewkeys() -> d.keys()
d.viewitems() -> d.items()
d.viewvalues() -> d.values()
Except in certain very specific contexts: the iter() can be dropped
when the context is list(), sorted(), iter() or for...in; the list()
can be dropped when the context is list() or sorted() (but not iter()
or for...in!). Special contexts that apply to both: list(), sorted(), tuple()
set(), any(), all(), sum().
Note: iter(d.keys()) could be written as iter(d) but since the
original d.iterkeys() was also redundant we don't fix this. And there
are (rare) contexts where it makes a difference (e.g. when passing it
as an argument to a function that introspects the argument).
i ( t pytree( t patcomp( t token( t
fixer_base( t Namet Callt LParent RParent ArgListt Dot( t
fixer_utilt itert FixDictc B sP e Z e Z d Z d � Z d Z e j e � Z d Z
e j e
� Z d � Z RS( s
power< head=any+
trailer< '.' method=('keys'|'items'|'values'|
'iterkeys'|'iteritems'|'itervalues'|
'viewkeys'|'viewitems'|'viewvalues') >
parens=trailer< '(' ')' >
tail=any*
>
c C s� | d } | d d } | d } | j } | j } | j d � } | j d � } | s^ | rk | d } n g | D] }
|
j � ^ qr } g | D] }
|
j � ^ q� } | o� | j | | � } | t j | j t � t | d | j
�g � | d j � g } t j | j | � }
| p!| sTd
|
_
t t | r?d n d � |
g � }
n | ryt j | j |
g | � }
n | j
|
_
|
S( Nt headt methodi t tailu iteru viewi t prefixt parensu u list(
t symst valuet
startswitht clonet in_special_contextR t Nodet trailerR R R t powerR ( t selft nodet resultsR
R R R t method_namet isitert isviewt nt specialt argst new( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_dict.pyt transform7 s2
' s3 power< func=NAME trailer< '(' node=any ')' > any* >sm for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
c C s� | j d k r t Si } | j j d k r� | j j | j j | � r� | d | k r� | rm | d j t k S| d j t j k Sn | s� t S| j j | j | � o� | d | k S( NR t func(
t parentt Nonet Falset p1t matchR t iter_exemptR
t consuming_callst p2( R R R R ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_dict.pyR [ s (
t __name__t
__module__t Truet
BM_compatiblet PATTERNR$ t P1R t compile_patternR) t P2R- R ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_dict.pyR * s
N( t __doc__t R R t pgen2R R R
R R R R R R R, t setR+ t BaseFixR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_dict.pyt <module> s .PK K/�\��H|�
�
fix_xrange.pynu �[��� # Copyright 2007 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer that changes xrange(...) into range(...)."""
# Local imports
from .. import fixer_base
from ..fixer_util import Name, Call, consuming_calls
from .. import patcomp
class FixXrange(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power<
(name='range'|name='xrange') trailer< '(' args=any ')' >
rest=any* >
"""
def start_tree(self, tree, filename):
super(FixXrange, self).start_tree(tree, filename)
self.transformed_xranges = set()
def finish_tree(self, tree, filename):
self.transformed_xranges = None
def transform(self, node, results):
name = results["name"]
if name.value == u"xrange":
return self.transform_xrange(node, results)
elif name.value == u"range":
return self.transform_range(node, results)
else:
raise ValueError(repr(name))
def transform_xrange(self, node, results):
name = results["name"]
name.replace(Name(u"range", prefix=name.prefix))
# This prevents the new range call from being wrapped in a list later.
self.transformed_xranges.add(id(node))
def transform_range(self, node, results):
if (id(node) not in self.transformed_xranges and
not self.in_special_context(node)):
range_call = Call(Name(u"range"), [results["args"].clone()])
# Encase the range call in list().
list_call = Call(Name(u"list"), [range_call],
prefix=node.prefix)
# Put things that were after the range() call after the list call.
for n in results["rest"]:
list_call.append_child(n)
return list_call
P1 = "power< func=NAME trailer< '(' node=any ')' > any* >"
p1 = patcomp.compile_pattern(P1)
P2 = """for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
| comparison< any 'in' node=any any*>
"""
p2 = patcomp.compile_pattern(P2)
def in_special_context(self, node):
if node.parent is None:
return False
results = {}
if (node.parent.parent is not None and
self.p1.match(node.parent.parent, results) and
results["node"] is node):
# list(d.keys()) -> list(d.keys()), etc.
return results["func"].value in consuming_calls
# for ... in d.iterkeys() -> for ... in d.keys(), etc.
return self.p2.match(node.parent, results) and results["node"] is node
PK K/�\D�Y� �
fix_map.pynu �[��� # Copyright 2007 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer that changes map(F, ...) into list(map(F, ...)) unless there
exists a 'from future_builtins import map' statement in the top-level
namespace.
As a special case, map(None, X) is changed into list(X). (This is
necessary because the semantics are changed in this case -- the new
map(None, X) is equivalent to [(x,) for x in X].)
We avoid the transformation (except for the special case mentioned
above) if the map() call is directly contained in iter(<>), list(<>),
tuple(<>), sorted(<>), ...join(<>), or for V in <>:.
NOTE: This is still not correct if the original code was depending on
map(F, X, Y, ...) to go on until the longest argument is exhausted,
substituting None for missing values -- like zip(), it now stops as
soon as the shortest argument is exhausted.
"""
# Local imports
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Name, Call, ListComp, in_special_context
from ..pygram import python_symbols as syms
class FixMap(fixer_base.ConditionalFix):
BM_compatible = True
PATTERN = """
map_none=power<
'map'
trailer< '(' arglist< 'None' ',' arg=any [','] > ')' >
>
|
map_lambda=power<
'map'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
>
|
power<
'map' trailer< '(' [arglist=any] ')' >
>
"""
skip_on = 'future_builtins.map'
def transform(self, node, results):
if self.should_skip(node):
return
if node.parent.type == syms.simple_stmt:
self.warning(node, "You should use a for loop here")
new = node.clone()
new.prefix = u""
new = Call(Name(u"list"), [new])
elif "map_lambda" in results:
new = ListComp(results["xp"].clone(),
results["fp"].clone(),
results["it"].clone())
else:
if "map_none" in results:
new = results["arg"].clone()
else:
if "arglist" in results:
args = results["arglist"]
if args.type == syms.arglist and \
args.children[0].type == token.NAME and \
args.children[0].value == "None":
self.warning(node, "cannot convert map(None, ...) "
"with multiple arguments because map() "
"now truncates to the shortest sequence")
return
if in_special_context(node):
return None
new = node.clone()
new.prefix = u""
new = Call(Name(u"list"), [new])
new.prefix = node.prefix
return new
PK K/�\l�SO O
fix_buffer.pynu �[��� # Copyright 2007 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer that changes buffer(...) into memoryview(...)."""
# Local imports
from .. import fixer_base
from ..fixer_util import Name
class FixBuffer(fixer_base.BaseFix):
BM_compatible = True
explicit = True # The user must ask for this fixer
PATTERN = """
power< name='buffer' trailer< '(' [any] ')' > any* >
"""
def transform(self, node, results):
name = results["name"]
name.replace(Name(u"memoryview", prefix=name.prefix))
PK K/�\��� fix_itertools.pynu �[��� """ Fixer for itertools.(imap|ifilter|izip) --> (map|filter|zip) and
itertools.ifilterfalse --> itertools.filterfalse (bugs 2360-2363)
imports from itertools are fixed in fix_itertools_import.py
If itertools is imported as something else (ie: import itertools as it;
it.izip(spam, eggs)) method calls will not get fixed.
"""
# Local imports
from .. import fixer_base
from ..fixer_util import Name
class FixItertools(fixer_base.BaseFix):
BM_compatible = True
it_funcs = "('imap'|'ifilter'|'izip'|'izip_longest'|'ifilterfalse')"
PATTERN = """
power< it='itertools'
trailer<
dot='.' func=%(it_funcs)s > trailer< '(' [any] ')' > >
|
power< func=%(it_funcs)s trailer< '(' [any] ')' > >
""" %(locals())
# Needs to be run after fix_(map|zip|filter)
run_order = 6
def transform(self, node, results):
prefix = None
func = results['func'][0]
if ('it' in results and
func.value not in (u'ifilterfalse', u'izip_longest')):
dot, it = (results['dot'], results['it'])
# Remove the 'itertools'
prefix = it.prefix
it.remove()
# Replace the node which contains ('.', 'function') with the
# function (to be consistent with the second part of the pattern)
dot.remove()
func.parent.replace(func)
prefix = prefix or func.prefix
func.replace(Name(func.value[1:], prefix=prefix))
PK K/�\�@`�; ;
fix_filter.pynu �[��� # Copyright 2007 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer that changes filter(F, X) into list(filter(F, X)).
We avoid the transformation if the filter() call is directly contained
in iter(<>), list(<>), tuple(<>), sorted(<>), ...join(<>), or
for V in <>:.
NOTE: This is still not correct if the original code was depending on
filter(F, X) to return a string if X is a string and a tuple if X is a
tuple. That would require type inference, which we don't do. Let
Python 2.6 figure it out.
"""
# Local imports
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Name, Call, ListComp, in_special_context
class FixFilter(fixer_base.ConditionalFix):
BM_compatible = True
PATTERN = """
filter_lambda=power<
'filter'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
>
|
power<
'filter'
trailer< '(' arglist< none='None' ',' seq=any > ')' >
>
|
power<
'filter'
args=trailer< '(' [any] ')' >
>
"""
skip_on = "future_builtins.filter"
def transform(self, node, results):
if self.should_skip(node):
return
if "filter_lambda" in results:
new = ListComp(results.get("fp").clone(),
results.get("fp").clone(),
results.get("it").clone(),
results.get("xp").clone())
elif "none" in results:
new = ListComp(Name(u"_f"),
Name(u"_f"),
results["seq"].clone(),
Name(u"_f"))
else:
if in_special_context(node):
return None
new = node.clone()
new.prefix = u""
new = Call(Name(u"list"), [new])
new.prefix = node.prefix
return new
PK K/�\�6��� �
fix_ne.pycnu �[��� �
{ fc @ sS d Z d d l m Z d d l m Z d d l m Z d e j f d � � YZ d S( s Fixer that turns <> into !=.i ( t pytree( t token( t
fixer_baset FixNec B s# e Z e j Z d � Z d � Z RS( c C s
| j d k S( Nu <>( t value( t selft node( ( s, /usr/lib64/python2.7/lib2to3/fixes/fix_ne.pyt match s c C s" t j t j d d | j �} | S( Nu !=t prefix( R t LeafR t NOTEQUALR ( R R t resultst new( ( s, /usr/lib64/python2.7/lib2to3/fixes/fix_ne.pyt transform s ( t __name__t
__module__R R
t _accept_typeR R
( ( ( s, /usr/lib64/python2.7/lib2to3/fixes/fix_ne.pyR s N( t __doc__t R t pgen2R R t BaseFixR ( ( ( s, /usr/lib64/python2.7/lib2to3/fixes/fix_ne.pyt <module> s PK K/�\^ K�m m fix_next.pynu �[��� """Fixer for it.next() -> next(it), per PEP 3114."""
# Author: Collin Winter
# Things that currently aren't covered:
# - listcomp "next" names aren't warned
# - "with" statement targets aren't checked
# Local imports
from ..pgen2 import token
from ..pygram import python_symbols as syms
from .. import fixer_base
from ..fixer_util import Name, Call, find_binding
bind_warning = "Calls to builtin next() possibly shadowed by global binding"
class FixNext(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< base=any+ trailer< '.' attr='next' > trailer< '(' ')' > >
|
power< head=any+ trailer< '.' attr='next' > not trailer< '(' ')' > >
|
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def'
name='next'
parameters< '(' NAME ')' > any+ >
any* > >
|
global=global_stmt< 'global' any* 'next' any* >
"""
order = "pre" # Pre-order tree traversal
def start_tree(self, tree, filename):
super(FixNext, self).start_tree(tree, filename)
n = find_binding(u'next', tree)
if n:
self.warning(n, bind_warning)
self.shadowed_next = True
else:
self.shadowed_next = False
def transform(self, node, results):
assert results
base = results.get("base")
attr = results.get("attr")
name = results.get("name")
if base:
if self.shadowed_next:
attr.replace(Name(u"__next__", prefix=attr.prefix))
else:
base = [n.clone() for n in base]
base[0].prefix = u""
node.replace(Call(Name(u"next", prefix=node.prefix), base))
elif name:
n = Name(u"__next__", prefix=name.prefix)
name.replace(n)
elif attr:
# We don't do this transformation if we're assigning to "x.next".
# Unfortunately, it doesn't seem possible to do this in PATTERN,
# so it's being done here.
if is_assign_target(node):
head = results["head"]
if "".join([str(n) for n in head]).strip() == u'__builtin__':
self.warning(node, bind_warning)
return
attr.replace(Name(u"__next__"))
elif "global" in results:
self.warning(node, bind_warning)
self.shadowed_next = True
### The following functions help test if node is part of an assignment
### target.
def is_assign_target(node):
assign = find_assign(node)
if assign is None:
return False
for child in assign.children:
if child.type == token.EQUAL:
return False
elif is_subtree(child, node):
return True
return False
def find_assign(node):
if node.type == syms.expr_stmt:
return node
if node.type == syms.simple_stmt or node.parent is None:
return None
return find_assign(node.parent)
def is_subtree(root, node):
if root == node:
return True
return any(is_subtree(c, node) for c in root.children)
PK K/�\\g7�' ' fix_basestring.pycnu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s Fixer for basestring -> str.i ( t
fixer_base( t Namet
FixBasestringc B s e Z e Z d Z d � Z RS( s 'basestring'c C s t d d | j �S( Nu strt prefix( R R ( t selft nodet results( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_basestring.pyt transform
s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_basestring.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_basestring.pyt <module> s PK K/�\�:?PV V fix_nonzero.pynu �[��� """Fixer for __nonzero__ -> __bool__ methods."""
# Author: Collin Winter
# Local imports
from .. import fixer_base
from ..fixer_util import Name, syms
class FixNonzero(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def' name='__nonzero__'
parameters< '(' NAME ')' > any+ >
any* > >
"""
def transform(self, node, results):
name = results["name"]
new = Name(u"__bool__", prefix=name.prefix)
name.replace(new)
PK K/�\�ĸ&� � fix_methodattrs.pyonu �[��� �
{ fc @ s^ d Z d d l m Z d d l m Z i d d 6d d 6d d 6Z d
e j f d � � YZ d S(
s; Fix bound method attributes (method.im_? -> method.__?__).
i ( t
fixer_base( t Namet __func__t im_funct __self__t im_selfs __self__.__class__t im_classt FixMethodattrsc B s e Z e Z d Z d � Z RS( sU
power< any+ trailer< '.' attr=('im_func' | 'im_self' | 'im_class') > any* >
c C sA | d d } t t | j � } | j t | d | j �� d S( Nt attri t prefix( t unicodet MAPt valuet replaceR R ( t selft nodet resultsR t new( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_methodattrs.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_methodattrs.pyR s N( t __doc__t R t
fixer_utilR R t BaseFixR ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_methodattrs.pyt <module> s
PK K/�\6��zh h fix_funcattrs.pyonu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s3 Fix function attribute names (f.func_x -> f.__x__).i ( t
fixer_base( t Namet FixFuncattrsc B s e Z e Z d Z d � Z RS( s�
power< any+ trailer< '.' attr=('func_closure' | 'func_doc' | 'func_globals'
| 'func_name' | 'func_defaults' | 'func_code'
| 'func_dict') > any* >
c C s9 | d d } | j t d | j d d | j �� d S( Nt attri u __%s__i t prefix( t replaceR t valueR ( t selft nodet resultsR ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_funcattrs.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR
( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_funcattrs.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_funcattrs.pyt <module> s PK K/�\�0�| |
fix_input.pycnu �[��� �
{ fc @ sh d Z d d l m Z d d l m Z m Z d d l m Z e j d � Z d e j f d � � YZ
d S( s4 Fixer that changes input(...) into eval(input(...)).i ( t
fixer_base( t Callt Name( t patcomps& power< 'eval' trailer< '(' any ')' > >t FixInputc B s e Z e Z d Z d � Z RS( sL
power< 'input' args=trailer< '(' [any] ')' > >
c C sM t j | j j � r d S| j � } d | _ t t d � | g d | j �S( Nu u evalt prefix( t contextt matcht parentt cloneR R R ( t selft nodet resultst new( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_input.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_input.pyR
s N( t __doc__t R t
fixer_utilR R R t compile_patternR t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_input.pyt <module> s
PK K/�\��锪 � fix_renames.pynu �[��� """Fix incompatible renames
Fixes:
* sys.maxint -> sys.maxsize
"""
# Author: Christian Heimes
# based on Collin Winter's fix_import
# Local imports
from .. import fixer_base
from ..fixer_util import Name, attr_chain
MAPPING = {"sys": {"maxint" : "maxsize"},
}
LOOKUP = {}
def alternates(members):
return "(" + "|".join(map(repr, members)) + ")"
def build_pattern():
#bare = set()
for module, replace in MAPPING.items():
for old_attr, new_attr in replace.items():
LOOKUP[(module, old_attr)] = new_attr
#bare.add(module)
#bare.add(old_attr)
#yield """
# import_name< 'import' (module=%r
# | dotted_as_names< any* module=%r any* >) >
# """ % (module, module)
yield """
import_from< 'from' module_name=%r 'import'
( attr_name=%r | import_as_name< attr_name=%r 'as' any >) >
""" % (module, old_attr, old_attr)
yield """
power< module_name=%r trailer< '.' attr_name=%r > any* >
""" % (module, old_attr)
#yield """bare_name=%s""" % alternates(bare)
class FixRenames(fixer_base.BaseFix):
BM_compatible = True
PATTERN = "|".join(build_pattern())
order = "pre" # Pre-order tree traversal
# Don't match the node if it's within another match
def match(self, node):
match = super(FixRenames, self).match
results = match(node)
if results:
if any(match(obj) for obj in attr_chain(node, "parent")):
return False
return results
return False
#def start_tree(self, tree, filename):
# super(FixRenames, self).start_tree(tree, filename)
# self.replace = {}
def transform(self, node, results):
mod_name = results.get("module_name")
attr_name = results.get("attr_name")
#bare_name = results.get("bare_name")
#import_mod = results.get("module")
if mod_name and attr_name:
new_attr = unicode(LOOKUP[(mod_name.value, attr_name.value)])
attr_name.replace(Name(new_attr, prefix=attr_name.prefix))
PK K/�\�{�F fix_numliterals.pynu �[��� """Fixer that turns 1L into 1, 0755 into 0o755.
"""
# Copyright 2007 Georg Brandl.
# Licensed to PSF under a Contributor Agreement.
# Local imports
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Number
class FixNumliterals(fixer_base.BaseFix):
# This is so simple that we don't need the pattern compiler.
_accept_type = token.NUMBER
def match(self, node):
# Override
return (node.value.startswith(u"0") or node.value[-1] in u"Ll")
def transform(self, node, results):
val = node.value
if val[-1] in u'Ll':
val = val[:-1]
elif val.startswith(u'0') and val.isdigit() and len(set(val)) > 1:
val = u"0o" + val[1:]
return Number(val, prefix=node.prefix)
PK K/�\�xW fix_intern.pyonu �[��� �
{ fc @ s_ d Z d d l m Z d d l m Z d d l m Z m Z m Z d e j f d � � YZ d S( s/ Fixer for intern().
intern(s) -> sys.intern(s)i ( t pytree( t
fixer_base( t Namet Attrt touch_importt FixInternc B s# e Z e Z d Z d Z d � Z RS( t pres�
power< 'intern'
trailer< lpar='('
( not(arglist | argument<any '=' any>) obj=any
| obj=arglist<(not argument<any '=' any>) any ','> )
rpar=')' >
after=any*
>
c C so | rd | d } | rd | j | j j k r/ d S| j | j j k ra | j d j d k ra d Sqd n | j } | d j � } | j | j k r� | j � } n t j | j | j � g � } | d } | r� g | D] } | j � ^ q� } n t j | j
t t d � t d � � t j | j
| d j � | | d j � g � g | � } | j | _ t d d | � | S( Nt obji s **t afteru sysu internt lpart rpar( t typet symst star_exprt argumentt childrent valuet clonet arglistR t Nodet powerR R t trailert prefixR t None( t selft nodet resultsR R t
newarglistR t nt new( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_intern.pyt transform s*
" U ( t __name__t
__module__t Truet
BM_compatiblet ordert PATTERNR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_intern.pyR s
N(
t __doc__t R R t
fixer_utilR R R t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_intern.pyt <module> s PK K/�\6��zh h fix_funcattrs.pycnu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s3 Fix function attribute names (f.func_x -> f.__x__).i ( t
fixer_base( t Namet FixFuncattrsc B s e Z e Z d Z d � Z RS( s�
power< any+ trailer< '.' attr=('func_closure' | 'func_doc' | 'func_globals'
| 'func_name' | 'func_defaults' | 'func_code'
| 'func_dict') > any* >
c C s9 | d d } | j t d | j d d | j �� d S( Nt attri u __%s__i t prefix( t replaceR t valueR ( t selft nodet resultsR ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_funcattrs.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR
( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_funcattrs.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_funcattrs.pyt <module> s PK K/�\�4�' fix_execfile.pynu �[��� # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer for execfile.
This converts usages of the execfile function into calls to the built-in
exec() function.
"""
from .. import fixer_base
from ..fixer_util import (Comma, Name, Call, LParen, RParen, Dot, Node,
ArgList, String, syms)
class FixExecfile(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< 'execfile' trailer< '(' arglist< filename=any [',' globals=any [',' locals=any ] ] > ')' > >
|
power< 'execfile' trailer< '(' filename=any ')' > >
"""
def transform(self, node, results):
assert results
filename = results["filename"]
globals = results.get("globals")
locals = results.get("locals")
# Copy over the prefix from the right parentheses end of the execfile
# call.
execfile_paren = node.children[-1].children[-1].clone()
# Construct open().read().
open_args = ArgList([filename.clone(), Comma(), String('"rb"', ' ')],
rparen=execfile_paren)
open_call = Node(syms.power, [Name(u"open"), open_args])
read = [Node(syms.trailer, [Dot(), Name(u'read')]),
Node(syms.trailer, [LParen(), RParen()])]
open_expr = [open_call] + read
# Wrap the open call in a compile call. This is so the filename will be
# preserved in the execed code.
filename_arg = filename.clone()
filename_arg.prefix = u" "
exec_str = String(u"'exec'", u" ")
compile_args = open_expr + [Comma(), filename_arg, Comma(), exec_str]
compile_call = Call(Name(u"compile"), compile_args, u"")
# Finally, replace the execfile call with an exec call.
args = [compile_call]
if globals is not None:
args.extend([Comma(), globals.clone()])
if locals is not None:
args.extend([Comma(), locals.clone()])
return Call(Name(u"exec"), args, prefix=node.prefix)
PK K/�\�Yω� � fix_has_key.pynu �[��� # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""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.
"""
# Local imports
from .. import pytree
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Name, parenthesize
class FixHasKey(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
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 ','>
)
')'
>
>
>
"""
def transform(self, node, results):
assert results
syms = self.syms
if (node.parent.type == syms.not_test and
self.pattern.match(node.parent)):
# Don't transform a node matching the first alternative of the
# pattern when its parent matches the second alternative
return None
negation = results.get("negation")
anchor = results["anchor"]
prefix = node.prefix
before = [n.clone() for n in results["before"]]
arg = results["arg"].clone()
after = results.get("after")
if after:
after = [n.clone() for n in after]
if arg.type in (syms.comparison, syms.not_test, syms.and_test,
syms.or_test, syms.test, syms.lambdef, syms.argument):
arg = parenthesize(arg)
if len(before) == 1:
before = before[0]
else:
before = pytree.Node(syms.power, before)
before.prefix = u" "
n_op = Name(u"in", prefix=u" ")
if negation:
n_not = Name(u"not", prefix=u" ")
n_op = pytree.Node(syms.comp_op, (n_not, n_op))
new = pytree.Node(syms.comparison, (arg, n_op, before))
if after:
new = parenthesize(new)
new = pytree.Node(syms.power, (new,) + tuple(after))
if node.parent.type in (syms.comparison, syms.expr, syms.xor_expr,
syms.and_expr, syms.shift_expr,
syms.arith_expr, syms.term,
syms.factor, syms.power):
new = parenthesize(new)
new.prefix = prefix
return new
PK K/�\���� � fix_future.pyonu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( sV Remove __future__ imports
from __future__ import foo is replaced with an empty line.
i ( t
fixer_base( t BlankLinet FixFuturec B s# e Z e Z d Z d Z d � Z RS( s; import_from< 'from' module_name="__future__" 'import' any >i
c C s t � } | j | _ | S( N( R t prefix( t selft nodet resultst new( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_future.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNt run_orderR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_future.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_future.pyt <module> s PK K/�\m)ĥ� � fix_reduce.pyonu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( sq Fixer for reduce().
Makes sure reduce() is imported from the functools module if reduce is
used in that module.
i����( t
fixer_base( t touch_importt FixReducec B s# e Z e Z d Z d Z d � Z RS( t presi
power< 'reduce'
trailer< '('
arglist< (
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any) |
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any ','
not(argument<any '=' any>) any)
) >
')' >
>
c C s t d d | � d S( Nu functoolsu reduce( R ( t selft nodet results( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_reduce.pyt transform" s ( t __name__t
__module__t Truet
BM_compatiblet ordert PATTERNR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_reduce.pyR s N( t __doc__t lib2to3R t lib2to3.fixer_utilR t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_reduce.pyt <module> s PK K/�\�?�յ � fix_import.pyonu �[��� �
{ fc @ sz d Z d d l m Z d d l m Z m Z m Z m Z d d l m Z m
Z
m Z d � Z d e j
f d � � YZ d S(
s� Fixer for import statements.
If spam is being imported from the local directory, this import:
from spam import eggs
Becomes:
from .spam import eggs
And this import:
import spam
Becomes:
from . import spam
i ( t
fixer_basei����( t dirnamet joint existst sep( t
FromImportt symst tokenc c s� | g } x� | r� | j � } | j t j k r; | j Vq | j t j k rw d j g | j D] } | j ^ q] � Vq | j t j k r� | j
| j d � q | j t j k r� | j | j d d d � � q t
d � � q Wd S( sF
Walks over all the names imported in a dotted_as_names node.
t i Ni����s unknown node type( t popt typeR t NAMEt valueR t dotted_nameR t childrent dotted_as_namet appendt dotted_as_namest extendt AssertionError( t namest pendingt nodet ch( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyt traverse_imports s * t FixImportc B s/ e Z e Z d Z d � Z d � Z d � Z RS( sj
import_from< 'from' imp=any 'import' ['('] any [')'] >
|
import_name< 'import' imp=any >
c C s/ t t | � j | | � d | j k | _ d S( Nt absolute_import( t superR t
start_treet future_featurest skip( t selft treet name( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyR / s c C s | j r
d S| d } | j t j k r~ x t | d � sK | j d } q, W| j | j � rd | j | _ | j � qn� t } t } x2 t
| � D]$ } | j | � r� t } q� t } q� W| r� | r� | j | d � n d St
d | g � } | j | _ | Sd S( Nt impR i u .s# absolute and local imports together( R R
R t import_fromt hasattrR t probably_a_local_importR t changedt FalseR t Truet warningR t prefix( R R t resultsR" t
have_localt
have_absolutet mod_namet new( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyt transform3 s,
c C s� | j d � r t S| j d d � d } t | j � } t | | � } t t t | � d � � sf t Sx4 d t d d d d g D] } t | | � r t Sq Wt S(
Nu .i i s __init__.pys .pys .pycs .sos .sls .pyd( t
startswithR' t splitR t filenameR R R R( ( R t imp_namet base_patht ext( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyR% U s ( t __name__t
__module__R( t
BM_compatiblet PATTERNR R0 R% ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyR & s
"N( t __doc__R R t os.pathR R R R t
fixer_utilR R R R t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyt <module> s
" PK K/�\��J�� �
fix_types.pycnu �[��� �
{ fc @ s d Z d d l m Z d d l m Z d d l m Z i d d 6d d 6d d
6d d 6d
d 6d
d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d d 6d! d" 6d# d$ 6d% d& 6d d' 6d( d) 6d* d+ 6Z g e D] Z d, e ^ q� Z d- e j
f d. � � YZ d/ S(0 s� Fixer for removing uses of the types module.
These work for only the known names in the types module. The forms above
can include types. or not. ie, It is assumed the module is imported either as:
import types
from types import ... # either * or specific types
The import statements are not modified.
There should be another fixer that handles at least the following constants:
type([]) -> list
type(()) -> tuple
type('') -> str
i ( t token( t
fixer_base( t Namet boolt BooleanTypet
memoryviewt
BufferTypet typet ClassTypet complext ComplexTypet dictt DictTypet DictionaryTypes type(Ellipsis)t EllipsisTypet floatt FloatTypet intt IntTypet listt ListTypet LongTypet objectt
ObjectTypes
type(None)t NoneTypes type(NotImplemented)t NotImplementedTypet slicet SliceTypet bytest
StringTypes (str,)t StringTypest tuplet TupleTypet TypeTypet strt UnicodeTypet ranget
XRangeTypes) power< 'types' trailer< '.' name='%s' > >t FixTypesc B s& e Z e Z d j e � Z d � Z RS( t |c C s9 t t j | d j � � } | r5 t | d | j �Sd S( Nt namet prefix( t unicodet
_TYPE_MAPPINGt gett valueR R) t None( t selft nodet resultst new_value( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_types.pyt transform: s ( t __name__t
__module__t Truet
BM_compatiblet joint _patst PATTERNR3 ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_types.pyR& 6 s N( t __doc__t pgen2R t R t
fixer_utilR R+ t tR9 t BaseFixR& ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_types.pyt <module> s6
PK K/�\�7h# #
fix_future.pynu �[��� """Remove __future__ imports
from __future__ import foo is replaced with an empty line.
"""
# Author: Christian Heimes
# Local imports
from .. import fixer_base
from ..fixer_util import BlankLine
class FixFuture(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """import_from< 'from' module_name="__future__" 'import' any >"""
# This should be run last -- some things check for the import
run_order = 10
def transform(self, node, results):
new = BlankLine()
new.prefix = node.prefix
return new
PK K/�\�� �� � fix_except.pycnu �[��� �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m Z m
Z
m Z m Z d � Z
d e j f d � � YZ d S(
s� Fixer for except statements with named exceptions.
The following cases will be converted:
- "except E, T:" where T is a name:
except E as T:
- "except E, T:" where T is not a name, tuple or list:
except E as t:
T = t
This is done because the target of an "except" clause must be a
name.
- "except E, T:" where T is a tuple or list literal:
except E as t:
T = t.args
i ( t pytree( t token( t
fixer_base( t Assignt Attrt Namet is_tuplet is_listt symsc c sb x[ t | � D]M \ } } | j t j k r
| j d j d k rZ | | | d f VqZ q
q
Wd S( Ni u excepti ( t enumeratet typeR t
except_clauset childrent value( t nodest it n( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_except.pyt find_excepts s t FixExceptc B s e Z e Z d Z d � Z RS( s1
try_stmt< 'try' ':' (simple_stmt | suite)
cleanup=(except_clause ':' (simple_stmt | suite))+
tail=(['except' ':' (simple_stmt | suite)]
['else' ':' (simple_stmt | suite)]
['finally' ':' (simple_stmt | suite)]) >
c C s, | j } g | d D] } | j � ^ q } g | d D] } | j � ^ q7 } x�t | � D]�\ } } t | j � d k r\ | j d d !\ }
} } | j t d d d �� | j t j k r�t | j
� d d �}
| j � } d | _ | j |
� |
j � }
| j } x0 t | � D]" \ } } t
| t j � r Pq q Wt | � s[t | � r|t | t |
t d � � � } n t | |
� } x( t | | � D] } | j d
| � q�W| j | | � q�| j d k r�d | _ q�q\ q\ Wg | j d D] } | j � ^ q�| | } t j | j | � S( Nt tailt cleanupi i u ast prefixu u u argsi i ( R t cloneR t lenR t replaceR R
R t NAMEt new_nameR R t
isinstanceR t NodeR R R R t reversedt insert_child( t selft nodet resultsR R R t cht try_cleanupR t e_suitet Et commat Nt new_Nt targett suite_stmtsR t stmtt assignt childt cR ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_except.pyt transform/ s6 ##
!.( t __name__t
__module__t Truet
BM_compatiblet PATTERNR/ ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_except.pyR $ s N( t __doc__t R t pgen2R R t
fixer_utilR R R R R R R t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_except.pyt <module> s . PK K/�\�:C
t t fix_ws_comma.pycnu �[��� �
{ fc @ sS d Z d d l m Z d d l m Z d d l m Z d e j f d � � YZ d S( s� Fixer that changes 'a ,b' into 'a, b'.
This also changes '{a :b}' into '{a: b}', but does not touch other
uses of colons. It does not touch other uses of whitespace.
i ( t pytree( t token( t
fixer_baset
FixWsCommac B sS e Z e Z d Z e j e j d � Z e j e j d � Z e e f Z
d � Z RS( sH
any<(not(',') any)+ ',' ((not(',') any)+ ',')* [not(',') any]>
u ,u :c C s� | j � } t } x� | j D]u } | | j k rg | j } | j � r^ d | k r^ d | _ n t } q | r� | j } | s� d | _ q� n t } q W| S( Nu
u u ( t clonet Falset childrent SEPSt prefixt isspacet True( t selft nodet resultst newt commat childR ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_ws_comma.pyt transform s
( t __name__t
__module__R
t explicitt PATTERNR t LeafR t COMMAt COLONR R ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_ws_comma.pyR s N( t __doc__t R t pgen2R R t BaseFixR ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_ws_comma.pyt <module> s PK K/�\�:C
t t fix_ws_comma.pyonu �[��� �
{ fc @ sS d Z d d l m Z d d l m Z d d l m Z d e j f d � � YZ d S( s� Fixer that changes 'a ,b' into 'a, b'.
This also changes '{a :b}' into '{a: b}', but does not touch other
uses of colons. It does not touch other uses of whitespace.
i ( t pytree( t token( t
fixer_baset
FixWsCommac B sS e Z e Z d Z e j e j d � Z e j e j d � Z e e f Z
d � Z RS( sH
any<(not(',') any)+ ',' ((not(',') any)+ ',')* [not(',') any]>
u ,u :c C s� | j � } t } x� | j D]u } | | j k rg | j } | j � r^ d | k r^ d | _ n t } q | r� | j } | s� d | _ q� n t } q W| S( Nu
u u ( t clonet Falset childrent SEPSt prefixt isspacet True( t selft nodet resultst newt commat childR ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_ws_comma.pyt transform s
( t __name__t
__module__R
t explicitt PATTERNR t LeafR t COMMAt COLONR R ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_ws_comma.pyR s N( t __doc__t R t pgen2R R t BaseFixR ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_ws_comma.pyt <module> s PK K/�\��B� � fix_funcattrs.pynu �[��� """Fix function attribute names (f.func_x -> f.__x__)."""
# Author: Collin Winter
# Local imports
from .. import fixer_base
from ..fixer_util import Name
class FixFuncattrs(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< any+ trailer< '.' attr=('func_closure' | 'func_doc' | 'func_globals'
| 'func_name' | 'func_defaults' | 'func_code'
| 'func_dict') > any* >
"""
def transform(self, node, results):
attr = results["attr"][0]
attr.replace(Name((u"__%s__" % attr.value[5:]),
prefix=attr.prefix))
PK K/�\���� �
fix_urllib.pynu �[��� """Fix changes imports of urllib which are now incompatible.
This is rather similar to fix_imports, but because of the more
complex nature of the fixing for urllib, it has its own fixer.
"""
# Author: Nick Edds
# Local imports
from lib2to3.fixes.fix_imports import alternates, FixImports
from lib2to3 import fixer_base
from lib2to3.fixer_util import (Name, Comma, FromImport, Newline,
find_indentation, Node, syms)
MAPPING = {"urllib": [
("urllib.request",
["URLopener", "FancyURLopener", "urlretrieve",
"_urlopener", "urlopen", "urlcleanup",
"pathname2url", "url2pathname"]),
("urllib.parse",
["quote", "quote_plus", "unquote", "unquote_plus",
"urlencode", "splitattr", "splithost", "splitnport",
"splitpasswd", "splitport", "splitquery", "splittag",
"splittype", "splituser", "splitvalue", ]),
("urllib.error",
["ContentTooShortError"])],
"urllib2" : [
("urllib.request",
["urlopen", "install_opener", "build_opener",
"Request", "OpenerDirector", "BaseHandler",
"HTTPDefaultErrorHandler", "HTTPRedirectHandler",
"HTTPCookieProcessor", "ProxyHandler",
"HTTPPasswordMgr",
"HTTPPasswordMgrWithDefaultRealm",
"AbstractBasicAuthHandler",
"HTTPBasicAuthHandler", "ProxyBasicAuthHandler",
"AbstractDigestAuthHandler",
"HTTPDigestAuthHandler", "ProxyDigestAuthHandler",
"HTTPHandler", "HTTPSHandler", "FileHandler",
"FTPHandler", "CacheFTPHandler",
"UnknownHandler"]),
("urllib.error",
["URLError", "HTTPError"]),
]
}
# Duplicate the url parsing functions for urllib2.
MAPPING["urllib2"].append(MAPPING["urllib"][1])
def build_pattern():
bare = set()
for old_module, changes in MAPPING.items():
for change in changes:
new_module, members = change
members = alternates(members)
yield """import_name< 'import' (module=%r
| dotted_as_names< any* module=%r any* >) >
""" % (old_module, old_module)
yield """import_from< 'from' mod_member=%r 'import'
( member=%s | import_as_name< member=%s 'as' any > |
import_as_names< members=any* >) >
""" % (old_module, members, members)
yield """import_from< 'from' module_star=%r 'import' star='*' >
""" % old_module
yield """import_name< 'import'
dotted_as_name< module_as=%r 'as' any > >
""" % old_module
# bare_with_attr has a special significance for FixImports.match().
yield """power< bare_with_attr=%r trailer< '.' member=%s > any* >
""" % (old_module, members)
class FixUrllib(FixImports):
def build_pattern(self):
return "|".join(build_pattern())
def transform_import(self, node, results):
"""Transform for the basic import case. Replaces the old
import name with a comma separated list of its
replacements.
"""
import_mod = results.get("module")
pref = import_mod.prefix
names = []
# create a Node list of the replacement modules
for name in MAPPING[import_mod.value][:-1]:
names.extend([Name(name[0], prefix=pref), Comma()])
names.append(Name(MAPPING[import_mod.value][-1][0], prefix=pref))
import_mod.replace(names)
def transform_member(self, node, results):
"""Transform for imports of specific module elements. Replaces
the module to be imported from with the appropriate new
module.
"""
mod_member = results.get("mod_member")
pref = mod_member.prefix
member = results.get("member")
# Simple case with only a single member being imported
if member:
# this may be a list of length one, or just a node
if isinstance(member, list):
member = member[0]
new_name = None
for change in MAPPING[mod_member.value]:
if member.value in change[1]:
new_name = change[0]
break
if new_name:
mod_member.replace(Name(new_name, prefix=pref))
else:
self.cannot_convert(node, "This is an invalid module element")
# Multiple members being imported
else:
# a dictionary for replacements, order matters
modules = []
mod_dict = {}
members = results["members"]
for member in members:
# we only care about the actual members
if member.type == syms.import_as_name:
as_name = member.children[2].value
member_name = member.children[0].value
else:
member_name = member.value
as_name = None
if member_name != u",":
for change in MAPPING[mod_member.value]:
if member_name in change[1]:
if change[0] not in mod_dict:
modules.append(change[0])
mod_dict.setdefault(change[0], []).append(member)
new_nodes = []
indentation = find_indentation(node)
first = True
def handle_name(name, prefix):
if name.type == syms.import_as_name:
kids = [Name(name.children[0].value, prefix=prefix),
name.children[1].clone(),
name.children[2].clone()]
return [Node(syms.import_as_name, kids)]
return [Name(name.value, prefix=prefix)]
for module in modules:
elts = mod_dict[module]
names = []
for elt in elts[:-1]:
names.extend(handle_name(elt, pref))
names.append(Comma())
names.extend(handle_name(elts[-1], pref))
new = FromImport(module, names)
if not first or node.parent.prefix.endswith(indentation):
new.prefix = indentation
new_nodes.append(new)
first = False
if new_nodes:
nodes = []
for new_node in new_nodes[:-1]:
nodes.extend([new_node, Newline()])
nodes.append(new_nodes[-1])
node.replace(nodes)
else:
self.cannot_convert(node, "All module elements are invalid")
def transform_dot(self, node, results):
"""Transform for calls to module members in code."""
module_dot = results.get("bare_with_attr")
member = results.get("member")
new_name = None
if isinstance(member, list):
member = member[0]
for change in MAPPING[module_dot.value]:
if member.value in change[1]:
new_name = change[0]
break
if new_name:
module_dot.replace(Name(new_name,
prefix=module_dot.prefix))
else:
self.cannot_convert(node, "This is an invalid module element")
def transform(self, node, results):
if results.get("module"):
self.transform_import(node, results)
elif results.get("mod_member"):
self.transform_member(node, results)
elif results.get("bare_with_attr"):
self.transform_dot(node, results)
# Renaming and star imports are not supported for these modules.
elif results.get("module_star"):
self.cannot_convert(node, "Cannot handle star imports.")
elif results.get("module_as"):
self.cannot_convert(node, "This module is now multiple modules")
PK K/�\o �^v v fix_raise.pynu �[��� """Fixer for 'raise E, V, T'
raise -> raise
raise E -> raise E
raise E, V -> raise E(V)
raise E, V, T -> raise E(V).with_traceback(T)
raise E, None, T -> raise E.with_traceback(T)
raise (((E, E'), E''), E'''), V -> raise E(V)
raise "foo", V, T -> warns about string exceptions
CAVEATS:
1) "raise E, V" will be incorrectly translated if V is an exception
instance. The correct Python 3 idiom is
raise E from V
but since we can't detect instance-hood by syntax alone and since
any client code would have to be changed as well, we don't automate
this.
"""
# Author: Collin Winter
# Local imports
from .. import pytree
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Name, Call, Attr, ArgList, is_tuple
class FixRaise(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
raise_stmt< 'raise' exc=any [',' val=any [',' tb=any]] >
"""
def transform(self, node, results):
syms = self.syms
exc = results["exc"].clone()
if exc.type == token.STRING:
msg = "Python 3 does not support string exceptions"
self.cannot_convert(node, msg)
return
# Python 2 supports
# raise ((((E1, E2), E3), E4), E5), V
# as a synonym for
# raise E1, V
# Since Python 3 will not support this, we recurse down any tuple
# literals, always taking the first element.
if is_tuple(exc):
while is_tuple(exc):
# exc.children[1:-1] is the unparenthesized tuple
# exc.children[1].children[0] is the first element of the tuple
exc = exc.children[1].children[0].clone()
exc.prefix = u" "
if "val" not in results:
# One-argument raise
new = pytree.Node(syms.raise_stmt, [Name(u"raise"), exc])
new.prefix = node.prefix
return new
val = results["val"].clone()
if is_tuple(val):
args = [c.clone() for c in val.children[1:-1]]
else:
val.prefix = u""
args = [val]
if "tb" in results:
tb = results["tb"].clone()
tb.prefix = u""
e = exc
# If there's a traceback and None is passed as the value, then don't
# add a call, since the user probably just wants to add a
# traceback. See issue #9661.
if val.type != token.NAME or val.value != u"None":
e = Call(exc, args)
with_tb = Attr(e, Name(u'with_traceback')) + [ArgList([tb])]
new = pytree.Node(syms.simple_stmt, [Name(u"raise")] + with_tb)
new.prefix = node.prefix
return new
else:
return pytree.Node(syms.raise_stmt,
[Name(u"raise"), Call(exc, args)],
prefix=node.prefix)
PK K/�\�1Wl� � fix_sys_exc.pyonu �[��� �
{ fc @ sg d Z d d l m Z d d l m Z m Z m Z m Z m Z m Z m
Z
d e j f d � � YZ d S( s� Fixer for sys.exc_{type, value, traceback}
sys.exc_type -> sys.exc_info()[0]
sys.exc_value -> sys.exc_info()[1]
sys.exc_traceback -> sys.exc_info()[2]
i ( t
fixer_base( t Attrt Callt Namet Numbert Subscriptt Nodet symst FixSysExcc B sC e Z d d d g Z e Z d d j d � e D� � Z d � Z RS( u exc_typeu exc_valueu
exc_tracebacksN
power< 'sys' trailer< dot='.' attribute=(%s) > >
t |c c s | ] } d | Vq d S( s '%s'N( ( t .0t e( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_sys_exc.pys <genexpr> s c C s� | d d } t | j j | j � � } t t d � d | j �} t t d � | � } | d j | d j d _ | j t
| � � t t j
| d | j �S( Nt attributei u exc_infot prefixu syst doti ( R t exc_infot indext valueR R R
R t childrent appendR R R t power( t selft nodet resultst sys_attrR t callt attr( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_sys_exc.pyt transform s ( t __name__t
__module__R t Truet
BM_compatiblet joint PATTERNR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_sys_exc.pyR s N(
t __doc__t R t
fixer_utilR R R R R R R t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_sys_exc.pyt <module> s 4PK K/�\ݔ�N� � fix_long.pynu �[��� # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer that turns 'long' into 'int' everywhere.
"""
# Local imports
from lib2to3 import fixer_base
from lib2to3.fixer_util import is_probably_builtin
class FixLong(fixer_base.BaseFix):
BM_compatible = True
PATTERN = "'long'"
def transform(self, node, results):
if is_probably_builtin(node):
node.value = u"int"
node.changed()
PK K/�\�u��c c fix_standarderror.pycnu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s% Fixer for StandardError -> Exception.i ( t
fixer_base( t Namet FixStandarderrorc B s e Z e Z d Z d � Z RS( s-
'StandardError'
c C s t d d | j �S( Nu Exceptiont prefix( R R ( t selft nodet results( ( s7 /usr/lib64/python2.7/lib2to3/fixes/fix_standarderror.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s7 /usr/lib64/python2.7/lib2to3/fixes/fix_standarderror.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s7 /usr/lib64/python2.7/lib2to3/fixes/fix_standarderror.pyt <module> s PK K/�\e�˺� � fix_dict.pycnu �[��� �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m
Z
m Z m Z m
Z
d d l m Z e j e d g � BZ d e j f d
� � YZ d S( sj Fixer for dict methods.
d.keys() -> list(d.keys())
d.items() -> list(d.items())
d.values() -> list(d.values())
d.iterkeys() -> iter(d.keys())
d.iteritems() -> iter(d.items())
d.itervalues() -> iter(d.values())
d.viewkeys() -> d.keys()
d.viewitems() -> d.items()
d.viewvalues() -> d.values()
Except in certain very specific contexts: the iter() can be dropped
when the context is list(), sorted(), iter() or for...in; the list()
can be dropped when the context is list() or sorted() (but not iter()
or for...in!). Special contexts that apply to both: list(), sorted(), tuple()
set(), any(), all(), sum().
Note: iter(d.keys()) could be written as iter(d) but since the
original d.iterkeys() was also redundant we don't fix this. And there
are (rare) contexts where it makes a difference (e.g. when passing it
as an argument to a function that introspects the argument).
i ( t pytree( t patcomp( t token( t
fixer_base( t Namet Callt LParent RParent ArgListt Dot( t
fixer_utilt itert FixDictc B sP e Z e Z d Z d � Z d Z e j e � Z d Z
e j e
� Z d � Z RS( s
power< head=any+
trailer< '.' method=('keys'|'items'|'values'|
'iterkeys'|'iteritems'|'itervalues'|
'viewkeys'|'viewitems'|'viewvalues') >
parens=trailer< '(' ')' >
tail=any*
>
c C s� | d } | d d } | d } | j } | j } | j d � } | j d � } | s^ | rk | d } n | d k s� t t | � � � g | D] }
|
j � ^ q� } g | D] }
|
j � ^ q� } | o� | j | | � } | t j | j t
� t | d | j �g � | d j � g } t j | j
| � }
| p?| srd
|
_ t t | r]d n d � |
g � }
n | r�t j | j
|
g | � }
n | j |
_ |
S( Nt headt methodi t tailu iteru viewi u keysu itemsu valuest prefixt parensu u list( u keysu itemsu values( t symst valuet
startswitht AssertionErrort reprt clonet in_special_contextR t Nodet trailerR R R t powerR ( t selft nodet resultsR
R R R t method_namet isitert isviewt nt specialt argst new( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_dict.pyt transform7 s4
' s3 power< func=NAME trailer< '(' node=any ')' > any* >sm for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
c C s� | j d k r t Si } | j j d k r� | j j | j j | � r� | d | k r� | rm | d j t k S| d j t j k Sn | s� t S| j j | j | � o� | d | k S( NR t func(
t parentt Nonet Falset p1t matchR t iter_exemptR
t consuming_callst p2( R R R R ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_dict.pyR [ s (
t __name__t
__module__t Truet
BM_compatiblet PATTERNR& t P1R t compile_patternR+ t P2R/ R ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_dict.pyR * s
N( t __doc__t R R t pgen2R R R
R R R R R R R. t setR- t BaseFixR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_dict.pyt <module> s .PK K/�\,���V
V
fix_print.pyonu �[��� �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m
Z
m Z m Z e j
d � Z d e j f d � � YZ d
S( s Fixer for print.
Change:
'print' into 'print()'
'print ...' into 'print(...)'
'print ... ,' into 'print(..., end=" ")'
'print >>x, ...' into 'print(..., file=x)'
No changes are applied if print_function is imported from __future__
i ( t patcomp( t pytree( t token( t
fixer_base( t Namet Callt Commat Stringt is_tuples" atom< '(' [atom|STRING|NAME] ')' >t FixPrintc B s& e Z e Z d Z d � Z d � Z RS( sP
simple_stmt< any* bare='print' any* > | print_stmt
c C s� | j d � } | r> | j t t d � g d | j �� d S| j d } t | � d k rt t j | d � rt d Sd } } } | r� | d t
� k r� | d } d } n | r� | d t j t
j d � k r� | d j � } | d } n g | D] } | j � ^ q� } | r%d
| d _ n | d k sI| d k sI| d k r�| d k rw| j | d t t | � � � n | d k r�| j | d t t | � � � n | d k r�| j | d
| � q�n t t d � | � }
| j |
_ |
S( Nt bareu printt prefixi i i����t u >>i u u sepu endu file( t gett replaceR R R t childrent lent parend_exprt matcht NoneR R t LeafR t
RIGHTSHIFTt clonet add_kwargR t repr( t selft nodet resultst
bare_printt argst sept endt filet argt l_argst n_stmt( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_print.pyt transform% s8
%
%
$ " " c C sr d | _ t j | j j t | � t j t j d � | f � } | ra | j t
� � d | _ n | j | � d S( Nu u =u ( R R t Nodet symst argumentR R R t EQUALt appendR ( R t l_nodest s_kwdt n_exprt
n_argument( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_print.pyR M s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR$ R ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_print.pyR s (N( t __doc__t R R t pgen2R R t
fixer_utilR R R R R t compile_patternR t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_print.pyt <module> s ( PK K/�\�ؒ� � __init__.pyonu �[��� �
{ fc @ s d S( N( ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/__init__.pyt <module> t PK K/�\8r� = = fix_ne.pynu �[��� # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer that turns <> into !=."""
# Local imports
from .. import pytree
from ..pgen2 import token
from .. import fixer_base
class FixNe(fixer_base.BaseFix):
# This is so simple that we don't need the pattern compiler.
_accept_type = token.NOTEQUAL
def match(self, node):
# Override
return node.value == u"<>"
def transform(self, node, results):
new = pytree.Leaf(token.NOTEQUAL, u"!=", prefix=node.prefix)
return new
PK K/�\Hm� � fix_itertools_imports.pycnu �[��� �
{ fc @ sO d Z d d l m Z d d l m Z m Z m Z d e j f d � � YZ d S( sA Fixer for imports of itertools.(imap|ifilter|izip|ifilterfalse) i����( t
fixer_base( t BlankLinet symst tokent FixItertoolsImportsc B s$ e Z e Z d e � Z d � Z RS( sT
import_from< 'from' 'itertools' 'import' imports=any >
c C s� | d } | j t j k s& | j r2 | g } n | j } x� | d d d � D]� } | j t j k ry | j } | } n; | j t j k r� d S| j t j k s� t � | j d } | j } | d k r� d | _ | j
� qO | d k rO | j � | d d
k r d n d | _ qO qO W| j p+| g } t } x= | D]5 } | rf| j t j
k rf| j
� q;| t N} q;Wx0 | r�| d
j t j
k r�| j � j
� qwW| j p�t | d d � s�| j d k r�| j }
t � } |
| _ | Sd S( Nt importsi i u imapu izipu ifilteru ifilterfalseu izip_longesti u fu filterfalseu zip_longesti����t value( u imapu izipu ifilter( u ifilterfalseu izip_longest( t typeR t import_as_namet childrenR t NAMER t STARt AssertionErrort Nonet removet changedt Truet COMMAt popt getattrt parentt prefixR ( t selft nodet resultsR R t childt membert name_nodet member_namet remove_commat p( ( s; /usr/lib64/python2.7/lib2to3/fixes/fix_itertools_imports.pyt transform sD
( t __name__t
__module__R t
BM_compatiblet localst PATTERNR ( ( ( s; /usr/lib64/python2.7/lib2to3/fixes/fix_itertools_imports.pyR s
N( t __doc__t lib2to3R t lib2to3.fixer_utilR R R t BaseFixR ( ( ( s; /usr/lib64/python2.7/lib2to3/fixes/fix_itertools_imports.pyt <module> s PK K/�\+�E�2 2 fix_throw.pynu �[��� """Fixer for generator.throw(E, V, T).
g.throw(E) -> g.throw(E)
g.throw(E, V) -> g.throw(E(V))
g.throw(E, V, T) -> g.throw(E(V).with_traceback(T))
g.throw("foo"[, V[, T]]) will warn about string exceptions."""
# Author: Collin Winter
# Local imports
from .. import pytree
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Name, Call, ArgList, Attr, is_tuple
class FixThrow(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< any trailer< '.' 'throw' >
trailer< '(' args=arglist< exc=any ',' val=any [',' tb=any] > ')' >
>
|
power< any trailer< '.' 'throw' > trailer< '(' exc=any ')' > >
"""
def transform(self, node, results):
syms = self.syms
exc = results["exc"].clone()
if exc.type is token.STRING:
self.cannot_convert(node, "Python 3 does not support string exceptions")
return
# Leave "g.throw(E)" alone
val = results.get(u"val")
if val is None:
return
val = val.clone()
if is_tuple(val):
args = [c.clone() for c in val.children[1:-1]]
else:
val.prefix = u""
args = [val]
throw_args = results["args"]
if "tb" in results:
tb = results["tb"].clone()
tb.prefix = u""
e = Call(exc, args)
with_tb = Attr(e, Name(u'with_traceback')) + [ArgList([tb])]
throw_args.replace(pytree.Node(syms.power, with_tb))
else:
throw_args.replace(Call(exc, args))
PK K/�\I�4� fix_metaclass.pynu �[��� """Fixer for __metaclass__ = X -> (metaclass=X) methods.
The various forms of classef (inherits nothing, inherits once, inherints
many) don't parse the same in the CST so we look at ALL classes for
a __metaclass__ and if we find one normalize the inherits to all be
an arglist.
For one-liner classes ('class X: pass') there is no indent/dedent so
we normalize those into having a suite.
Moving the __metaclass__ into the classdef can also cause the class
body to be empty so there is some special casing for that as well.
This fixer also tries very hard to keep original indenting and spacing
in all those corner cases.
"""
# Author: Jack Diederich
# Local imports
from .. import fixer_base
from ..pygram import token
from ..fixer_util import Name, syms, Node, Leaf
def has_metaclass(parent):
""" we have to check the cls_node without changing it.
There are two possibilities:
1) clsdef => suite => simple_stmt => expr_stmt => Leaf('__meta')
2) clsdef => simple_stmt => expr_stmt => Leaf('__meta')
"""
for node in parent.children:
if node.type == syms.suite:
return has_metaclass(node)
elif node.type == syms.simple_stmt and node.children:
expr_node = node.children[0]
if expr_node.type == syms.expr_stmt and expr_node.children:
left_side = expr_node.children[0]
if isinstance(left_side, Leaf) and \
left_side.value == '__metaclass__':
return True
return False
def fixup_parse_tree(cls_node):
""" one-line classes don't get a suite in the parse tree so we add
one to normalize the tree
"""
for node in cls_node.children:
if node.type == syms.suite:
# already in the preferred format, do nothing
return
# !%@#! oneliners have no suite node, we have to fake one up
for i, node in enumerate(cls_node.children):
if node.type == token.COLON:
break
else:
raise ValueError("No class suite and no ':'!")
# move everything into a suite node
suite = Node(syms.suite, [])
while cls_node.children[i+1:]:
move_node = cls_node.children[i+1]
suite.append_child(move_node.clone())
move_node.remove()
cls_node.append_child(suite)
node = suite
def fixup_simple_stmt(parent, i, stmt_node):
""" if there is a semi-colon all the parts count as part of the same
simple_stmt. We just want the __metaclass__ part so we move
everything after the semi-colon into its own simple_stmt node
"""
for semi_ind, node in enumerate(stmt_node.children):
if node.type == token.SEMI: # *sigh*
break
else:
return
node.remove() # kill the semicolon
new_expr = Node(syms.expr_stmt, [])
new_stmt = Node(syms.simple_stmt, [new_expr])
while stmt_node.children[semi_ind:]:
move_node = stmt_node.children[semi_ind]
new_expr.append_child(move_node.clone())
move_node.remove()
parent.insert_child(i, new_stmt)
new_leaf1 = new_stmt.children[0].children[0]
old_leaf1 = stmt_node.children[0].children[0]
new_leaf1.prefix = old_leaf1.prefix
def remove_trailing_newline(node):
if node.children and node.children[-1].type == token.NEWLINE:
node.children[-1].remove()
def find_metas(cls_node):
# find the suite node (Mmm, sweet nodes)
for node in cls_node.children:
if node.type == syms.suite:
break
else:
raise ValueError("No class suite!")
# look for simple_stmt[ expr_stmt[ Leaf('__metaclass__') ] ]
for i, simple_node in list(enumerate(node.children)):
if simple_node.type == syms.simple_stmt and simple_node.children:
expr_node = simple_node.children[0]
if expr_node.type == syms.expr_stmt and expr_node.children:
# Check if the expr_node is a simple assignment.
left_node = expr_node.children[0]
if isinstance(left_node, Leaf) and \
left_node.value == u'__metaclass__':
# We found an assignment to __metaclass__.
fixup_simple_stmt(node, i, simple_node)
remove_trailing_newline(simple_node)
yield (node, i, simple_node)
def fixup_indent(suite):
""" If an INDENT is followed by a thing with a prefix then nuke the prefix
Otherwise we get in trouble when removing __metaclass__ at suite start
"""
kids = suite.children[::-1]
# find the first indent
while kids:
node = kids.pop()
if node.type == token.INDENT:
break
# find the first Leaf
while kids:
node = kids.pop()
if isinstance(node, Leaf) and node.type != token.DEDENT:
if node.prefix:
node.prefix = u''
return
else:
kids.extend(node.children[::-1])
class FixMetaclass(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
classdef<any*>
"""
def transform(self, node, results):
if not has_metaclass(node):
return
fixup_parse_tree(node)
# find metaclasses, keep the last one
last_metaclass = None
for suite, i, stmt in find_metas(node):
last_metaclass = stmt
stmt.remove()
text_type = node.children[0].type # always Leaf(nnn, 'class')
# figure out what kind of classdef we have
if len(node.children) == 7:
# Node(classdef, ['class', 'name', '(', arglist, ')', ':', suite])
# 0 1 2 3 4 5 6
if node.children[3].type == syms.arglist:
arglist = node.children[3]
# Node(classdef, ['class', 'name', '(', 'Parent', ')', ':', suite])
else:
parent = node.children[3].clone()
arglist = Node(syms.arglist, [parent])
node.set_child(3, arglist)
elif len(node.children) == 6:
# Node(classdef, ['class', 'name', '(', ')', ':', suite])
# 0 1 2 3 4 5
arglist = Node(syms.arglist, [])
node.insert_child(3, arglist)
elif len(node.children) == 4:
# Node(classdef, ['class', 'name', ':', suite])
# 0 1 2 3
arglist = Node(syms.arglist, [])
node.insert_child(2, Leaf(token.RPAR, u')'))
node.insert_child(2, arglist)
node.insert_child(2, Leaf(token.LPAR, u'('))
else:
raise ValueError("Unexpected class definition")
# now stick the metaclass in the arglist
meta_txt = last_metaclass.children[0].children[0]
meta_txt.value = 'metaclass'
orig_meta_prefix = meta_txt.prefix
if arglist.children:
arglist.append_child(Leaf(token.COMMA, u','))
meta_txt.prefix = u' '
else:
meta_txt.prefix = u''
# compact the expression "metaclass = Meta" -> "metaclass=Meta"
expr_stmt = last_metaclass.children[0]
assert expr_stmt.type == syms.expr_stmt
expr_stmt.children[1].prefix = u''
expr_stmt.children[2].prefix = u''
arglist.append_child(last_metaclass)
fixup_indent(suite)
# check for empty suite
if not suite.children:
# one-liner that was just __metaclass_
suite.remove()
pass_leaf = Leaf(text_type, u'pass')
pass_leaf.prefix = orig_meta_prefix
node.append_child(pass_leaf)
node.append_child(Leaf(token.NEWLINE, u'\n'))
elif len(suite.children) > 1 and \
(suite.children[-2].type == token.INDENT and
suite.children[-1].type == token.DEDENT):
# there was only one line in the class body and it was __metaclass__
pass_leaf = Leaf(text_type, u'pass')
suite.insert_child(-1, pass_leaf)
suite.insert_child(-1, Leaf(token.NEWLINE, u'\n'))
PK K/�\�d�{� � fix_raw_input.pycnu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s2 Fixer that changes raw_input(...) into input(...).i ( t
fixer_base( t Namet FixRawInputc B s e Z e Z d Z d � Z RS( sU
power< name='raw_input' trailer< '(' [any] ')' > any* >
c C s* | d } | j t d d | j �� d S( Nt nameu inputt prefix( t replaceR R ( t selft nodet resultsR ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_raw_input.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_raw_input.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_raw_input.pyt <module> s PK K/�\~&�� � fix_urllib.pycnu �[��� �
{ fc @ ss d Z d d l m Z m Z d d l m Z d d l m Z m Z m Z m
Z
m Z m Z m
Z
i d d d d d d
d d d
g f d d d d d d d d d d d d d d d d g f d d g f g d 6d d
d! d" d# d$ d% d& d' d( d) d* d+ d, d- d. d/ d0 d1 d2 d3 d4 d5 d6 d7 g f d d8 d9 g f g d: 6Z e d: j e d d; � d< � Z d= e f d> � � YZ d? S(@ s� Fix changes imports of urllib which are now incompatible.
This is rather similar to fix_imports, but because of the more
complex nature of the fixing for urllib, it has its own fixer.
i����( t
alternatest
FixImports( t
fixer_base( t Namet Commat
FromImportt Newlinet find_indentationt Nodet symss urllib.requestt URLopenert FancyURLopenert urlretrievet
_urlopenert urlopent
urlcleanupt pathname2urlt url2pathnames urllib.parset quotet
quote_plust unquotet unquote_plust urlencodet splitattrt splithostt
splitnportt splitpasswdt splitportt
splitqueryt splittagt splittypet splitusert
splitvalues urllib.errort ContentTooShortErrort urllibt install_openert build_openert Requestt OpenerDirectort BaseHandlert HTTPDefaultErrorHandlert HTTPRedirectHandlert HTTPCookieProcessort ProxyHandlert HTTPPasswordMgrt HTTPPasswordMgrWithDefaultRealmt AbstractBasicAuthHandlert HTTPBasicAuthHandlert ProxyBasicAuthHandlert AbstractDigestAuthHandlert HTTPDigestAuthHandlert ProxyDigestAuthHandlert HTTPHandlert HTTPSHandlert FileHandlert
FTPHandlert CacheFTPHandlert UnknownHandlert URLErrort HTTPErrort urllib2i c c s� t � } x� t j � D]w \ } } xh | D]` } | \ } } t | � } d | | f Vd | | | f Vd | Vd | Vd | | f Vq) Wq Wd S( Ns� import_name< 'import' (module=%r
| dotted_as_names< any* module=%r any* >) >
s� import_from< 'from' mod_member=%r 'import'
( member=%s | import_as_name< member=%s 'as' any > |
import_as_names< members=any* >) >
sI import_from< 'from' module_star=%r 'import' star='*' >
st import_name< 'import'
dotted_as_name< module_as=%r 'as' any > >
sK power< bare_with_attr=%r trailer< '.' member=%s > any* >
( t sett MAPPINGt itemsR ( t baret
old_modulet changest changet
new_modulet members( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt
build_pattern1 s
t FixUrllibc B s5 e Z d � Z d � Z d � Z d � Z d � Z RS( c C s d j t � � S( Nt |( t joinRF ( t self( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyRF J s c C s� | j d � } | j } g } x? t | j d D], } | j t | d d | �t � g � q0 W| j t t | j d d d | �� | j | � d S( s� Transform for the basic import case. Replaces the old
import name with a comma separated list of its
replacements.
t modulei����i t prefixN( t getRL R> t valuet extendR R t appendt replace( RJ t nodet resultst
import_modt preft namest name( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt transform_importM s *(c C s� | j d � } | j } | j d � } | r� t | t � rI | d } n d
} x6 t | j D]' } | j | d k r] | d } Pq] q] W| r� | j t | d | �� q�| j | d � n/g } i } | d }
x� |
D]� } | j
t j k r| j
d j } | j
d j } n | j } d
} | d k r� xl t | j D]Z } | | d k r>| d | k rx| j | d � n | j | d g � j | � q>q>Wq� q� Wg }
t | � } t } d
� } x� | D]� } | | } g } x8 | d D], } | j | | | � � | j t � � q�W| j | | d | � � t | | � } | sa| j j j | � rm| | _ n |
j | � t } q�W|
r�g } x( |
d D] } | j | t � g � q�W| j |
d � | j | � n | j | d � d
S( s� Transform for imports of specific module elements. Replaces
the module to be imported from with the appropriate new
module.
t
mod_membert memberi i RL s! This is an invalid module elementRE i u ,c S sz | j t j k rd t | j d j d | �| j d j � | j d j � g } t t j | � g St | j d | �g S( Ni RL i i ( t typeR t import_as_nameR t childrenRN t cloneR ( RW RL t kids( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt handle_name� s i����s All module elements are invalidN( RM RL t
isinstancet listt NoneR> RN RQ R t cannot_convertR[ R R\ R] RP t
setdefaultR t TrueRO R R t parentt endswitht FalseR ( RJ RR RS RY RU RZ t new_nameRC t modulest mod_dictRE t as_namet member_namet new_nodest indentationt firstR` RK t eltsRV t eltt newt nodest new_node( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt transform_member] sh
+
c C s� | j d � } | j d � } d } t | t � r@ | d } n x6 t | j D]' } | j | d k rN | d } PqN qN W| r� | j t | d | j �� n | j | d � d S( s. Transform for calls to module members in code.t bare_with_attrRZ i i RL s! This is an invalid module elementN(
RM Rc Ra Rb R> RN RQ R RL Rd ( RJ RR RS t
module_dotRZ Rj RC ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt
transform_dot� s
c C s� | j d � r" | j | | � n� | j d � rD | j | | � nf | j d � rf | j | | � nD | j d � r� | j | d � n" | j d � r� | j | d � n d S( NRK RY Rx t module_stars Cannot handle star imports.t module_ass# This module is now multiple modules( RM RX Rw Rz Rd ( RJ RR RS ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt transform� s ( t __name__t
__module__RF RX Rw Rz R} ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyRG H s
L N( t __doc__t lib2to3.fixes.fix_importsR R t lib2to3R t lib2to3.fixer_utilR R R R R R R R> RP RF RG ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_urllib.pyt <module> sD 4 PK K/�\sGћ� � fix_getcwdu.pyonu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s1
Fixer that changes os.getcwdu() to os.getcwd().
i ( t
fixer_base( t Namet
FixGetcwduc B s e Z e Z d Z d � Z RS( sR
power< 'os' trailer< dot='.' name='getcwdu' > any* >
c C s* | d } | j t d d | j �� d S( Nt nameu getcwdt prefix( t replaceR R ( t selft nodet resultsR ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_getcwdu.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_getcwdu.pyR
s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_getcwdu.pyt <module> s PK K/�\&�[� fix_xrange.pycnu �[��� �
{ fc @ s_ d Z d d l m Z d d l m Z m Z m Z d d l m Z d e j f d � � YZ d S( s/ Fixer that changes xrange(...) into range(...).i ( t
fixer_base( t Namet Callt consuming_calls( t patcompt FixXrangec B st e Z e Z d Z d � Z d � Z d � Z d � Z d � Z d Z
e j e
� Z
d Z e j e � Z d � Z RS( s�
power<
(name='range'|name='xrange') trailer< '(' args=any ')' >
rest=any* >
c C s) t t | � j | | � t � | _ d S( N( t superR t
start_treet sett transformed_xranges( t selft treet filename( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyR s c C s
d | _ d S( N( t NoneR ( R
R R ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyt finish_tree s c C s^ | d } | j d k r) | j | | � S| j d k rH | j | | � St t | � � � d S( Nt nameu xrangeu range( t valuet transform_xranget transform_ranget
ValueErrort repr( R
t nodet resultsR ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyt transform s
c C s@ | d } | j t d d | j �� | j j t | � � d S( NR u ranget prefix( t replaceR R R t addt id( R
R R R ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyR $ s
c C s� t | � | j k r� | j | � r� t t d � | d j � g � } t t d � | g d | j �} x | d D] } | j | � qs W| Sd S( Nu ranget argsu listR t rest( R R t in_special_contextR R t cloneR t append_child( R
R R t
range_callt list_callt n( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyR * s " s3 power< func=NAME trailer< '(' node=any ')' > any* >s� for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
| comparison< any 'in' node=any any*>
c C s� | j d k r t Si } | j j d k rg | j j | j j | � rg | d | k rg | d j t k S| j j | j | � o� | d | k S( NR t func( t parentR
t Falset p1t matchR R t p2( R
R R ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyR ? s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR R R R R t P1R t compile_patternR' t P2R) R ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyR s N(
t __doc__t R t
fixer_utilR R R R t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_xrange.pyt <module> s PK K/�\��s< < fix_isinstance.pycnu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s, Fixer that cleans up a tuple argument to isinstance after the tokens
in it were fixed. This is mainly used to remove double occurrences of
tokens as a leftover of the long -> int / unicode -> str conversion.
eg. isinstance(x, (int, long)) -> isinstance(x, (int, int))
-> isinstance(x, int)
i ( t
fixer_base( t tokent
FixIsinstancec B s# e Z e Z d Z d Z d � Z RS( s�
power<
'isinstance'
trailer< '(' arglist< any ',' atom< '('
args=testlist_gexp< any+ >
')' > > ')' >
>
i c C sU t � } | d } | j } g } t | � } x� | D]� \ } } | j t j k r� | j | k r� | t | � d k r� | | d j t j k r� | j � q5 q� q5 | j
| � | j t j k r5 | j | j � q5 q5 W| r| d j t j k r| d =n t | � d k r@| j }
|
j
| d _
|
j | d � n | | (| j � d S( Nt argsi i����i ( t sett childrent enumeratet typeR t NAMEt valuet lent COMMAt nextt appendt addt parentt prefixt replacet changed( t selft nodet resultst names_insertedt testlistR t new_argst iteratort idxt argt atom( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_isinstance.pyt transform s*
!0
( t __name__t
__module__t Truet
BM_compatiblet PATTERNt run_orderR ( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_isinstance.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_isinstance.pyt <module>
s PK K/�\��Q Q fix_idioms.pyonu �[��� �
{ fc @ sm d Z d d l m Z d d l m Z m Z m Z m Z m Z m Z d Z
d Z d e j f d � � YZ
d S( s� Adjust some old Python 2 idioms to their modern counterparts.
* Change some type comparisons to isinstance() calls:
type(x) == T -> isinstance(x, T)
type(x) is T -> isinstance(x, T)
type(x) != T -> not isinstance(x, T)
type(x) is not T -> not isinstance(x, T)
* Change "while 1:" into "while True:".
* Change both
v = list(EXPR)
v.sort()
foo(v)
and the more general
v = EXPR
v.sort()
foo(v)
into
v = sorted(EXPR)
foo(v)
i ( t
fixer_base( t Callt Commat Namet Nodet BlankLinet symss0 (n='!=' | '==' | 'is' | n=comp_op< 'is' 'not' >)s( power< 'type' trailer< '(' x=any ')' > >t FixIdiomsc B sQ e Z e Z d e e e e f Z d � Z d � Z d � Z d � Z
d � Z RS( s�
isinstance=comparison< %s %s T=any >
|
isinstance=comparison< T=any %s %s >
|
while_stmt< 'while' while='1' ':' any+ >
|
sorted=any<
any*
simple_stmt<
expr_stmt< id1=any '='
power< list='list' trailer< '(' (not arglist<any+>) any ')' > >
>
'\n'
>
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
|
sorted=any<
any*
simple_stmt< expr_stmt< id1=any '=' expr=any > '\n' >
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
c C sJ t t | � j | � } | rF d | k rF | d | d k rB | Sd S| S( Nt sortedt id1t id2( t superR t matcht None( t selft nodet r( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyR O s c C sd d | k r | j | | � Sd | k r8 | j | | � Sd | k rT | j | | � St d � � d S( Nt
isinstancet whileR s
Invalid match( t transform_isinstancet transform_whilet transform_sortt RuntimeError( R R t results( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyt transformZ s c C s� | d j � } | d j � } d | _ d | _ t t d � | t � | g � } d | k r� d | _ t t j t d � | g � } n | j | _ | S( Nt xt Tu u u
isinstancet nu not( t clonet prefixR R R R R t not_test( R R R R R t test( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyR d s ! ! c C s* | d } | j t d d | j �� d S( NR u TrueR ( t replaceR R ( R R R t one( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyR p s
c C s= | d } | d } | j d � } | j d � } | rW | j t d d | j �� nR | r� | j � } d | _ | j t t d � | g d | j �� n t d � � | j � | j } d | k r9| r| j d � d
| d
j f } d j | � | d
_ q9t
� }
| j j |
� | j d � d
|
_ n d S( Nt sortt nextt listt expru sortedR u s should not have reached hereu
i (
t getR R R R R R t removet
rpartitiont joinR t parentt append_child( R R R t sort_stmtt next_stmtt list_callt simple_exprt newt btwnt prefix_linest end_line( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyR t s*
( t __name__t
__module__t Truet explicitt TYPEt CMPt PATTERNR R R R R ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyR % s '
N( t __doc__t R t
fixer_utilR R R R R R R9 R8 t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyt <module> s
.PK K/�\�s��� � fix_input.pynu �[��� """Fixer that changes input(...) into eval(input(...))."""
# Author: Andre Roberge
# Local imports
from .. import fixer_base
from ..fixer_util import Call, Name
from .. import patcomp
context = patcomp.compile_pattern("power< 'eval' trailer< '(' any ')' > >")
class FixInput(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< 'input' args=trailer< '(' [any] ')' > >
"""
def transform(self, node, results):
# If we're already wrapped in an eval() call, we're done.
if context.match(node.parent.parent):
return
new = node.clone()
new.prefix = u""
return Call(Name(u"eval"), [new], prefix=node.prefix)
PK K/�\v�� � fix_map.pycnu �[��� �
{ fc @ su d Z d d l m Z d d l m Z d d l m Z m Z m Z m Z d d l
m Z d e j
f d � � YZ d S( s Fixer that changes map(F, ...) into list(map(F, ...)) unless there
exists a 'from future_builtins import map' statement in the top-level
namespace.
As a special case, map(None, X) is changed into list(X). (This is
necessary because the semantics are changed in this case -- the new
map(None, X) is equivalent to [(x,) for x in X].)
We avoid the transformation (except for the special case mentioned
above) if the map() call is directly contained in iter(<>), list(<>),
tuple(<>), sorted(<>), ...join(<>), or for V in <>:.
NOTE: This is still not correct if the original code was depending on
map(F, X, Y, ...) to go on until the longest argument is exhausted,
substituting None for missing values -- like zip(), it now stops as
soon as the shortest argument is exhausted.
i ( t token( t
fixer_base( t Namet Callt ListCompt in_special_context( t python_symbolst FixMapc B s# e Z e Z d Z d Z d � Z RS( s�
map_none=power<
'map'
trailer< '(' arglist< 'None' ',' arg=any [','] > ')' >
>
|
map_lambda=power<
'map'
trailer<
'('
arglist<
lambdef< 'lambda'
(fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
>
','
it=any
>
')'
>
>
|
power<
'map' trailer< '(' [arglist=any] ')' >
>
s future_builtins.mapc C s� | j | � r d S| j j t j k rh | j | d � | j � } d | _ t t d � | g � } n d | k r� t
| d j � | d j � | d j � � } n� d | k r� | d j � } n� d
| k r4| d
} | j t j k r4| j d j t
j k r4| j d j d k r4| j | d
� d Sn t | � rDd S| j � } d | _ t t d � | g � } | j | _ | S( Ns You should use a for loop hereu u listt
map_lambdat xpt fpt itt map_nonet argt arglisti t Nonesj cannot convert map(None, ...) with multiple arguments because map() now truncates to the shortest sequence( t should_skipt parentt typet symst simple_stmtt warningt clonet prefixR R R R t childrenR t NAMEt valueR R ( t selft nodet resultst newt args( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_map.pyt transform; s6
( t __name__t
__module__t Truet
BM_compatiblet PATTERNt skip_onR ( ( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_map.pyR s N( t __doc__t pgen2R t R t
fixer_utilR R R R t pygramR R t ConditionalFixR ( ( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_map.pyt <module> s
"PK K/�\CTw� � fix_renames.pycnu �[��� �
{ fc @ su d Z d d l m Z d d l m Z m Z i i d d 6d 6Z i Z d � Z d � Z d e j
f d
� � YZ d S( s? Fix incompatible renames
Fixes:
* sys.maxint -> sys.maxsize
i ( t
fixer_base( t Namet
attr_chaint maxsizet maxintt sysc C s d d j t t | � � d S( Nt (t |t )( t joint mapt repr( t members( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyt
alternates s c c so xh t j � D]Z \ } } xK | j � D]= \ } } | t | | f <d | | | f Vd | | f Vq& Wq
Wd S( Ns�
import_from< 'from' module_name=%r 'import'
( attr_name=%r | import_as_name< attr_name=%r 'as' any >) >
s^
power< module_name=%r trailer< '.' attr_name=%r > any* >
( t MAPPINGt itemst LOOKUP( t modulet replacet old_attrt new_attr( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyt
build_pattern s
t
FixRenamesc B s8 e Z e Z d j e � � Z d Z d � Z d � Z RS( R t prec sU t t | � j � � | � } | rQ t � f d � t | d � D� � rM t S| St S( Nc 3 s | ] } � | � Vq d S( N( ( t .0t obj( t match( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pys <genexpr>5 s t parent( t superR R t anyR t False( t selft nodet results( ( R s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyR 1 s %c C si | j d � } | j d � } | re | re t t | j | j f � } | j t | d | j �� n d S( Nt module_namet attr_namet prefix( t gett unicodeR t valueR R R$ ( R R R! t mod_nameR# R ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyt transform> s
(
t __name__t
__module__t Truet
BM_compatibleR R t PATTERNt orderR R) ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyR * s
N( t __doc__t R t
fixer_utilR R R R R
R t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyt <module> s PK K/�\m)ĥ� � fix_reduce.pycnu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( sq Fixer for reduce().
Makes sure reduce() is imported from the functools module if reduce is
used in that module.
i����( t
fixer_base( t touch_importt FixReducec B s# e Z e Z d Z d Z d � Z RS( t presi
power< 'reduce'
trailer< '('
arglist< (
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any) |
(not(argument<any '=' any>) any ','
not(argument<any '=' any>) any ','
not(argument<any '=' any>) any)
) >
')' >
>
c C s t d d | � d S( Nu functoolsu reduce( R ( t selft nodet results( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_reduce.pyt transform" s ( t __name__t
__module__t Truet
BM_compatiblet ordert PATTERNR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_reduce.pyR s N( t __doc__t lib2to3R t lib2to3.fixer_utilR t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_reduce.pyt <module> s PK K/�\���Z� � fix_itertools_imports.pyonu �[��� �
{ fc @ sO d Z d d l m Z d d l m Z m Z m Z d e j f d � � YZ d S( sA Fixer for imports of itertools.(imap|ifilter|izip|ifilterfalse) i����( t
fixer_base( t BlankLinet symst tokent FixItertoolsImportsc B s$ e Z e Z d e � Z d � Z RS( sT
import_from< 'from' 'itertools' 'import' imports=any >
c C s� | d } | j t j k s& | j r2 | g } n | j } x� | d d d � D]� } | j t j k ry | j } | } n# | j t j k r� d S| j d } | j } | d k r� d | _ | j � qO | d k rO | j
� | d d
k r� d n d | _ qO qO W| j p| g } t } x= | D]5 } | rN| j t j k rN| j � q#| t N} q#Wx0 | r�| d
j t j k r�| j
� j � q_W| j p�t | d d � s�| j d k r�| j }
t � } |
| _ | Sd S( Nt importsi i u imapu izipu ifilteru ifilterfalseu izip_longesti u fu filterfalseu zip_longesti����t value( u imapu izipu ifilter( u ifilterfalseu izip_longest( t typeR t import_as_namet childrenR t NAMER t STARt Nonet removet changedt Truet COMMAt popt getattrt parentt prefixR ( t selft nodet resultsR R t childt membert name_nodet member_namet remove_commat p( ( s; /usr/lib64/python2.7/lib2to3/fixes/fix_itertools_imports.pyt transform sB
( t __name__t
__module__R t
BM_compatiblet localst PATTERNR ( ( ( s; /usr/lib64/python2.7/lib2to3/fixes/fix_itertools_imports.pyR s
N( t __doc__t lib2to3R t lib2to3.fixer_utilR R R t BaseFixR ( ( ( s; /usr/lib64/python2.7/lib2to3/fixes/fix_itertools_imports.pyt <module> s PK K/�\CTw� � fix_renames.pyonu �[��� �
{ fc @ su d Z d d l m Z d d l m Z m Z i i d d 6d 6Z i Z d � Z d � Z d e j
f d
� � YZ d S( s? Fix incompatible renames
Fixes:
* sys.maxint -> sys.maxsize
i ( t
fixer_base( t Namet
attr_chaint maxsizet maxintt sysc C s d d j t t | � � d S( Nt (t |t )( t joint mapt repr( t members( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyt
alternates s c c so xh t j � D]Z \ } } xK | j � D]= \ } } | t | | f <d | | | f Vd | | f Vq& Wq
Wd S( Ns�
import_from< 'from' module_name=%r 'import'
( attr_name=%r | import_as_name< attr_name=%r 'as' any >) >
s^
power< module_name=%r trailer< '.' attr_name=%r > any* >
( t MAPPINGt itemst LOOKUP( t modulet replacet old_attrt new_attr( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyt
build_pattern s
t
FixRenamesc B s8 e Z e Z d j e � � Z d Z d � Z d � Z RS( R t prec sU t t | � j � � | � } | rQ t � f d � t | d � D� � rM t S| St S( Nc 3 s | ] } � | � Vq d S( N( ( t .0t obj( t match( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pys <genexpr>5 s t parent( t superR R t anyR t False( t selft nodet results( ( R s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyR 1 s %c C si | j d � } | j d � } | re | re t t | j | j f � } | j t | d | j �� n d S( Nt module_namet attr_namet prefix( t gett unicodeR t valueR R R$ ( R R R! t mod_nameR# R ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyt transform> s
(
t __name__t
__module__t Truet
BM_compatibleR R t PATTERNt orderR R) ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyR * s
N( t __doc__t R t
fixer_utilR R R R R
R t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_renames.pyt <module> s PK K/�\Н
�= = fix_imports.pynu �[��� """Fix incompatible imports and module references."""
# Authors: Collin Winter, Nick Edds
# Local imports
from .. import fixer_base
from ..fixer_util import Name, attr_chain
MAPPING = {'StringIO': 'io',
'cStringIO': 'io',
'cPickle': 'pickle',
'__builtin__' : 'builtins',
'copy_reg': 'copyreg',
'Queue': 'queue',
'SocketServer': 'socketserver',
'ConfigParser': 'configparser',
'repr': 'reprlib',
'FileDialog': 'tkinter.filedialog',
'tkFileDialog': 'tkinter.filedialog',
'SimpleDialog': 'tkinter.simpledialog',
'tkSimpleDialog': 'tkinter.simpledialog',
'tkColorChooser': 'tkinter.colorchooser',
'tkCommonDialog': 'tkinter.commondialog',
'Dialog': 'tkinter.dialog',
'Tkdnd': 'tkinter.dnd',
'tkFont': 'tkinter.font',
'tkMessageBox': 'tkinter.messagebox',
'ScrolledText': 'tkinter.scrolledtext',
'Tkconstants': 'tkinter.constants',
'Tix': 'tkinter.tix',
'ttk': 'tkinter.ttk',
'Tkinter': 'tkinter',
'markupbase': '_markupbase',
'_winreg': 'winreg',
'thread': '_thread',
'dummy_thread': '_dummy_thread',
# anydbm and whichdb are handled by fix_imports2
'dbhash': 'dbm.bsd',
'dumbdbm': 'dbm.dumb',
'dbm': 'dbm.ndbm',
'gdbm': 'dbm.gnu',
'xmlrpclib': 'xmlrpc.client',
'DocXMLRPCServer': 'xmlrpc.server',
'SimpleXMLRPCServer': 'xmlrpc.server',
'httplib': 'http.client',
'htmlentitydefs' : 'html.entities',
'HTMLParser' : 'html.parser',
'Cookie': 'http.cookies',
'cookielib': 'http.cookiejar',
'BaseHTTPServer': 'http.server',
'SimpleHTTPServer': 'http.server',
'CGIHTTPServer': 'http.server',
#'test.test_support': 'test.support',
'commands': 'subprocess',
'UserString' : 'collections',
'UserList' : 'collections',
'urlparse' : 'urllib.parse',
'robotparser' : 'urllib.robotparser',
}
def alternates(members):
return "(" + "|".join(map(repr, members)) + ")"
def build_pattern(mapping=MAPPING):
mod_list = ' | '.join(["module_name='%s'" % key for key in mapping])
bare_names = alternates(mapping.keys())
yield """name_import=import_name< 'import' ((%s) |
multiple_imports=dotted_as_names< any* (%s) any* >) >
""" % (mod_list, mod_list)
yield """import_from< 'from' (%s) 'import' ['(']
( any | import_as_name< any 'as' any > |
import_as_names< any* >) [')'] >
""" % mod_list
yield """import_name< 'import' (dotted_as_name< (%s) 'as' any > |
multiple_imports=dotted_as_names<
any* dotted_as_name< (%s) 'as' any > any* >) >
""" % (mod_list, mod_list)
# Find usages of module members in code e.g. thread.foo(bar)
yield "power< bare_with_attr=(%s) trailer<'.' any > any* >" % bare_names
class FixImports(fixer_base.BaseFix):
BM_compatible = True
keep_line_order = True
# This is overridden in fix_imports2.
mapping = MAPPING
# We want to run this fixer late, so fix_import doesn't try to make stdlib
# renames into relative imports.
run_order = 6
def build_pattern(self):
return "|".join(build_pattern(self.mapping))
def compile_pattern(self):
# We override this, so MAPPING can be pragmatically altered and the
# changes will be reflected in PATTERN.
self.PATTERN = self.build_pattern()
super(FixImports, self).compile_pattern()
# Don't match the node if it's within another match.
def match(self, node):
match = super(FixImports, self).match
results = match(node)
if results:
# Module usage could be in the trailer of an attribute lookup, so we
# might have nested matches when "bare_with_attr" is present.
if "bare_with_attr" not in results and \
any(match(obj) for obj in attr_chain(node, "parent")):
return False
return results
return False
def start_tree(self, tree, filename):
super(FixImports, self).start_tree(tree, filename)
self.replace = {}
def transform(self, node, results):
import_mod = results.get("module_name")
if import_mod:
mod_name = import_mod.value
new_name = unicode(self.mapping[mod_name])
import_mod.replace(Name(new_name, prefix=import_mod.prefix))
if "name_import" in results:
# If it's not a "from x import x, y" or "import x as y" import,
# marked its usage to be replaced.
self.replace[mod_name] = new_name
if "multiple_imports" in results:
# This is a nasty hack to fix multiple imports on a line (e.g.,
# "import StringIO, urlparse"). The problem is that I can't
# figure out an easy way to make a pattern recognize the keys of
# MAPPING randomly sprinkled in an import statement.
results = self.match(node)
if results:
self.transform(node, results)
else:
# Replace usage of the module.
bare_name = results["bare_with_attr"][0]
new_name = self.replace.get(bare_name.value)
if new_name:
bare_name.replace(Name(new_name, prefix=bare_name.prefix))
PK K/�\�c�^G G fix_ws_comma.pynu �[��� """Fixer that changes 'a ,b' into 'a, b'.
This also changes '{a :b}' into '{a: b}', but does not touch other
uses of colons. It does not touch other uses of whitespace.
"""
from .. import pytree
from ..pgen2 import token
from .. import fixer_base
class FixWsComma(fixer_base.BaseFix):
explicit = True # The user must ask for this fixers
PATTERN = """
any<(not(',') any)+ ',' ((not(',') any)+ ',')* [not(',') any]>
"""
COMMA = pytree.Leaf(token.COMMA, u",")
COLON = pytree.Leaf(token.COLON, u":")
SEPS = (COMMA, COLON)
def transform(self, node, results):
new = node.clone()
comma = False
for child in new.children:
if child in self.SEPS:
prefix = child.prefix
if prefix.isspace() and u"\n" not in prefix:
child.prefix = u""
comma = True
else:
if comma:
prefix = child.prefix
if not prefix:
child.prefix = u" "
comma = False
return new
PK K/�\}ׄ L L fix_nonzero.pycnu �[��� �
{ fc @ sI d Z d d l m Z d d l m Z m Z d e j f d � � YZ d S( s* Fixer for __nonzero__ -> __bool__ methods.i ( t
fixer_base( t Namet symst
FixNonzeroc B s e Z e Z d Z d � Z RS( s�
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def' name='__nonzero__'
parameters< '(' NAME ')' > any+ >
any* > >
c C s0 | d } t d d | j �} | j | � d S( Nt nameu __bool__t prefix( R R t replace( t selft nodet resultsR t new( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_nonzero.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_nonzero.pyR s N( t __doc__t R t
fixer_utilR R t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_nonzero.pyt <module> s PK K/�\�Y�1 1 fix_print.pynu �[��� # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer for print.
Change:
'print' into 'print()'
'print ...' into 'print(...)'
'print ... ,' into 'print(..., end=" ")'
'print >>x, ...' into 'print(..., file=x)'
No changes are applied if print_function is imported from __future__
"""
# Local imports
from .. import patcomp
from .. import pytree
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Name, Call, Comma, String, is_tuple
parend_expr = patcomp.compile_pattern(
"""atom< '(' [atom|STRING|NAME] ')' >"""
)
class FixPrint(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
simple_stmt< any* bare='print' any* > | print_stmt
"""
def transform(self, node, results):
assert results
bare_print = results.get("bare")
if bare_print:
# Special-case print all by itself
bare_print.replace(Call(Name(u"print"), [],
prefix=bare_print.prefix))
return
assert node.children[0] == Name(u"print")
args = node.children[1:]
if len(args) == 1 and parend_expr.match(args[0]):
# We don't want to keep sticking parens around an
# already-parenthesised expression.
return
sep = end = file = None
if args and args[-1] == Comma():
args = args[:-1]
end = " "
if args and args[0] == pytree.Leaf(token.RIGHTSHIFT, u">>"):
assert len(args) >= 2
file = args[1].clone()
args = args[3:] # Strip a possible comma after the file expression
# Now synthesize a print(args, sep=..., end=..., file=...) node.
l_args = [arg.clone() for arg in args]
if l_args:
l_args[0].prefix = u""
if sep is not None or end is not None or file is not None:
if sep is not None:
self.add_kwarg(l_args, u"sep", String(repr(sep)))
if end is not None:
self.add_kwarg(l_args, u"end", String(repr(end)))
if file is not None:
self.add_kwarg(l_args, u"file", file)
n_stmt = Call(Name(u"print"), l_args)
n_stmt.prefix = node.prefix
return n_stmt
def add_kwarg(self, l_nodes, s_kwd, n_expr):
# XXX All this prefix-setting may lose comments (though rarely)
n_expr.prefix = u""
n_argument = pytree.Node(self.syms.argument,
(Name(s_kwd),
pytree.Leaf(token.EQUAL, u"="),
n_expr))
if l_nodes:
l_nodes.append(Comma())
n_argument.prefix = u" "
l_nodes.append(n_argument)
PK K/�\g�M� � fix_xreadlines.pynu �[��� """Fix "for x in f.xreadlines()" -> "for x in f".
This fixer will also convert g(f.xreadlines) into g(f.__iter__)."""
# Author: Collin Winter
# Local imports
from .. import fixer_base
from ..fixer_util import Name
class FixXreadlines(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< call=any+ trailer< '.' 'xreadlines' > trailer< '(' ')' > >
|
power< any+ trailer< '.' no_call='xreadlines' > >
"""
def transform(self, node, results):
no_call = results.get("no_call")
if no_call:
no_call.replace(Name(u"__iter__", prefix=no_call.prefix))
else:
node.replace([x.clone() for x in results["call"]])
PK K/�\�,�b� �
fix_raise.pyonu �[��� �
{ fc @ s{ d Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m Z m
Z
m Z d e j f d � � YZ
d S( s[ Fixer for 'raise E, V, T'
raise -> raise
raise E -> raise E
raise E, V -> raise E(V)
raise E, V, T -> raise E(V).with_traceback(T)
raise E, None, T -> raise E.with_traceback(T)
raise (((E, E'), E''), E'''), V -> raise E(V)
raise "foo", V, T -> warns about string exceptions
CAVEATS:
1) "raise E, V" will be incorrectly translated if V is an exception
instance. The correct Python 3 idiom is
raise E from V
but since we can't detect instance-hood by syntax alone and since
any client code would have to be changed as well, we don't automate
this.
i ( t pytree( t token( t
fixer_base( t Namet Callt Attrt ArgListt is_tuplet FixRaisec B s e Z e Z d Z d � Z RS( sB
raise_stmt< 'raise' exc=any [',' val=any [',' tb=any]] >
c
C s | j } | d j � } | j t j k rE d } | j | | � d St | � r� x* t | � r} | j d j d j � } qT Wd | _ n d | k r� t j
| j t d � | g � } | j | _ | S| d j � } t | � rg | j d d !D] } | j � ^ q� } n d | _ | g } d
| k r�| d
j � }
d |
_ | } | j t j
k sm| j d k rt | | � } n t | t d � � t |
g � g } t j
| j t d � g | � } | j | _ | St j
| j t d � t | | � g d
| j �Sd S( Nt excs+ Python 3 does not support string exceptionsi i u t valu raisei����u t tbu Noneu with_tracebackt prefix( t symst clonet typeR t STRINGt cannot_convertR t childrenR R t Nodet
raise_stmtR t NAMEt valueR R R t simple_stmt(
t selft nodet resultsR
R t msgt newR
t ct argsR t et with_tb( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_raise.pyt transform& s@ ! , !%" ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR! ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_raise.pyR s N( t __doc__t R t pgen2R R t
fixer_utilR R R R R t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_raise.pyt <module> s
(PK K/�\t� fix_asserts.pyonu �[��� �
{ fc @ s� d Z d d l m Z d d l m Z e d d d d d d d
d d d
d d d d d d d d d d d d
d d d d d d � Z d e f d � � YZ d S( s5 Fixer that replaces deprecated unittest method names.i ( t BaseFix( t Namet assert_t
assertTruet assertEqualst assertEqualt assertNotEqualst assertNotEqualt assertAlmostEqualst assertAlmostEqualt assertNotAlmostEqualst assertNotAlmostEqualt assertRegexpMatchest assertRegext assertRaisesRegexpt assertRaisesRegext failUnlessEqualt failIfEqualt failUnlessAlmostEqualt failIfAlmostEqualt
failUnlesst failUnlessRaisest assertRaisest failIft assertFalset
FixAssertsc B s- e Z d d j e e e � � Z d � Z RS( sH
power< any+ trailer< '.' meth=(%s)> any* >
t |c C s8 | d d } | j t t t | � d | j �� d S( Nt methi t prefix( t replaceR t NAMESt strR ( t selft nodet resultst name( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_asserts.pyt transform s ( t __name__t
__module__t joint mapt reprR t PATTERNR$ ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_asserts.pyR s N( t __doc__t
fixer_baseR t
fixer_utilR t dictR R ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_asserts.pyt <module> s$ PK K/�\u���
�
fix_next.pycnu �[��� �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z d d l m Z m
Z
m Z d Z d e j
f d � � YZ d � Z d
� Z d � Z d S(
s. Fixer for it.next() -> next(it), per PEP 3114.i ( t token( t python_symbols( t
fixer_base( t Namet Callt find_bindings; Calls to builtin next() possibly shadowed by global bindingt FixNextc B s, e Z e Z d Z d Z d � Z d � Z RS( s�
power< base=any+ trailer< '.' attr='next' > trailer< '(' ')' > >
|
power< head=any+ trailer< '.' attr='next' > not trailer< '(' ')' > >
|
classdef< 'class' any+ ':'
suite< any*
funcdef< 'def'
name='next'
parameters< '(' NAME ')' > any+ >
any* > >
|
global=global_stmt< 'global' any* 'next' any* >
t prec C sW t t | � j | | � t d | � } | rJ | j | t � t | _ n t | _ d S( Nu next( t superR t
start_treeR t warningt bind_warningt Truet
shadowed_nextt False( t selft treet filenamet n( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyR $ s c C s� | s t � | j d � } | j d � } | j d � } | r� | j rg | j t d d | j �� q�g | D] } | j � ^ qn } d | d _ | j t t d d | j �| � � n� | r� t d d | j �} | j | � n� | rct | � rM| d } d
j g | D] } t
| � ^ q� j � d k rI| j | t
� n d S| j t d � � n( d | k r�| j | t
� t | _ n d S(
Nt baset attrt nameu __next__t prefixu i u nextt headt u __builtin__t global( t AssertionErrort getR
t replaceR R t cloneR t is_assign_targett joint strt stripR
R R ( R t nodet resultsR R R R R ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyt transform. s.
(
4 ( t __name__t
__module__R t
BM_compatiblet PATTERNt orderR R$ ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyR s
c C s] t | � } | d k r t Sx: | j D]/ } | j t j k rB t St | | � r& t Sq& Wt S( N( t find_assignt NoneR t childrent typeR t EQUALt
is_subtreeR ( R" t assignt child( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyR Q s c C sH | j t j k r | S| j t j k s7 | j d k r; d St | j � S( N( R- t symst expr_stmtt simple_stmtt parentR+ R* ( R" ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyR* ] s
!c s- | � k r t St � f d � | j D� � S( Nc 3 s | ] } t | � � Vq d S( N( R/ ( t .0t c( R" ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pys <genexpr>g s ( R t anyR, ( t rootR" ( ( R" s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyR/ d s N( t __doc__t pgen2R t pygramR R2 R R t
fixer_utilR R R R t BaseFixR R R* R/ ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_next.pyt <module> s @ PK K/�\RJ,�� � fix_raw_input.pynu �[��� """Fixer that changes raw_input(...) into input(...)."""
# Author: Andre Roberge
# Local imports
from .. import fixer_base
from ..fixer_util import Name
class FixRawInput(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< name='raw_input' trailer< '(' [any] ')' > any* >
"""
def transform(self, node, results):
name = results["name"]
name.replace(Name(u"input", prefix=name.prefix))
PK K/�\\g7�' ' fix_basestring.pyonu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( s Fixer for basestring -> str.i ( t
fixer_base( t Namet
FixBasestringc B s e Z e Z d Z d � Z RS( s 'basestring'c C s t d d | j �S( Nu strt prefix( R R ( t selft nodet results( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_basestring.pyt transform
s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_basestring.pyR s N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s4 /usr/lib64/python2.7/lib2to3/fixes/fix_basestring.pyt <module> s PK K/�\:^S� fix_sys_exc.pynu �[��� """Fixer for sys.exc_{type, value, traceback}
sys.exc_type -> sys.exc_info()[0]
sys.exc_value -> sys.exc_info()[1]
sys.exc_traceback -> sys.exc_info()[2]
"""
# By Jeff Balogh and Benjamin Peterson
# Local imports
from .. import fixer_base
from ..fixer_util import Attr, Call, Name, Number, Subscript, Node, syms
class FixSysExc(fixer_base.BaseFix):
# This order matches the ordering of sys.exc_info().
exc_info = [u"exc_type", u"exc_value", u"exc_traceback"]
BM_compatible = True
PATTERN = """
power< 'sys' trailer< dot='.' attribute=(%s) > >
""" % '|'.join("'%s'" % e for e in exc_info)
def transform(self, node, results):
sys_attr = results["attribute"][0]
index = Number(self.exc_info.index(sys_attr.value))
call = Call(Name(u"exc_info"), prefix=sys_attr.prefix)
attr = Attr(Name(u"sys"), call)
attr[1].children[0].prefix = results["dot"].prefix
attr.append(Subscript(index))
return Node(syms.power, attr, prefix=node.prefix)
PK K/�\i � � fix_idioms.pycnu �[��� �
{ fc @ sm d Z d d l m Z d d l m Z m Z m Z m Z m Z m Z d Z
d Z d e j f d � � YZ
d S( s� Adjust some old Python 2 idioms to their modern counterparts.
* Change some type comparisons to isinstance() calls:
type(x) == T -> isinstance(x, T)
type(x) is T -> isinstance(x, T)
type(x) != T -> not isinstance(x, T)
type(x) is not T -> not isinstance(x, T)
* Change "while 1:" into "while True:".
* Change both
v = list(EXPR)
v.sort()
foo(v)
and the more general
v = EXPR
v.sort()
foo(v)
into
v = sorted(EXPR)
foo(v)
i ( t
fixer_base( t Callt Commat Namet Nodet BlankLinet symss0 (n='!=' | '==' | 'is' | n=comp_op< 'is' 'not' >)s( power< 'type' trailer< '(' x=any ')' > >t FixIdiomsc B sQ e Z e Z d e e e e f Z d � Z d � Z d � Z d � Z
d � Z RS( s�
isinstance=comparison< %s %s T=any >
|
isinstance=comparison< T=any %s %s >
|
while_stmt< 'while' while='1' ':' any+ >
|
sorted=any<
any*
simple_stmt<
expr_stmt< id1=any '='
power< list='list' trailer< '(' (not arglist<any+>) any ')' > >
>
'\n'
>
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
|
sorted=any<
any*
simple_stmt< expr_stmt< id1=any '=' expr=any > '\n' >
sort=
simple_stmt<
power< id2=any
trailer< '.' 'sort' > trailer< '(' ')' >
>
'\n'
>
next=any*
>
c C sJ t t | � j | � } | rF d | k rF | d | d k rB | Sd S| S( Nt sortedt id1t id2( t superR t matcht None( t selft nodet r( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyR O s c C sd d | k r | j | | � Sd | k r8 | j | | � Sd | k rT | j | | � St d � � d S( Nt
isinstancet whileR s
Invalid match( t transform_isinstancet transform_whilet transform_sortt RuntimeError( R R t results( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyt transformZ s c C s� | d j � } | d j � } d | _ d | _ t t d � | t � | g � } d | k r� d | _ t t j t d � | g � } n | j | _ | S( Nt xt Tu u u
isinstancet nu not( t clonet prefixR R R R R t not_test( R R R R R t test( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyR d s ! ! c C s* | d } | j t d d | j �� d S( NR u TrueR ( t replaceR R ( R R R t one( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyR p s
c C sv | d } | d } | j d � } | j d � } | rW | j t d d | j �� nR | r� | j � } d | _ | j t t d � | g d | j �� n t d � � | j � | j } d | k rr| r| j d � d
| d
j f } d j | � | d
_ qr| j
st � | j d k s+t � t � }
| j
j |
� | j |
k sYt � | j d � d
|
_ n d S( Nt sortt nextt listt expru sortedR u s should not have reached hereu
i ( t getR R R R R R t removet
rpartitiont joint parentt AssertionErrort next_siblingR
R t append_child( R R R t sort_stmtt next_stmtt list_callt simple_exprt newt btwnt prefix_linest end_line( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyR t s0
( t __name__t
__module__t Truet explicitt TYPEt CMPt PATTERNR R R R R ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyR % s '
N( t __doc__t R t
fixer_utilR R R R R R R; R: t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_idioms.pyt <module> s
.PK K/�\��ˈ �
fix_zip.pynu �[��� """
Fixer that changes zip(seq0, seq1, ...) into list(zip(seq0, seq1, ...)
unless there exists a 'from future_builtins import zip' statement in the
top-level namespace.
We avoid the transformation if the zip() call is directly contained in
iter(<>), list(<>), tuple(<>), sorted(<>), ...join(<>), or for V in <>:.
"""
# Local imports
from .. import fixer_base
from ..fixer_util import Name, Call, in_special_context
class FixZip(fixer_base.ConditionalFix):
BM_compatible = True
PATTERN = """
power< 'zip' args=trailer< '(' [any] ')' >
>
"""
skip_on = "future_builtins.zip"
def transform(self, node, results):
if self.should_skip(node):
return
if in_special_context(node):
return None
new = node.clone()
new.prefix = u""
new = Call(Name(u"list"), [new])
new.prefix = node.prefix
return new
PK K/�\�xW fix_intern.pycnu �[��� �
{ fc @ s_ d Z d d l m Z d d l m Z d d l m Z m Z m Z d e j f d � � YZ d S( s/ Fixer for intern().
intern(s) -> sys.intern(s)i ( t pytree( t
fixer_base( t Namet Attrt touch_importt FixInternc B s# e Z e Z d Z d Z d � Z RS( t pres�
power< 'intern'
trailer< lpar='('
( not(arglist | argument<any '=' any>) obj=any
| obj=arglist<(not argument<any '=' any>) any ','> )
rpar=')' >
after=any*
>
c C so | rd | d } | rd | j | j j k r/ d S| j | j j k ra | j d j d k ra d Sqd n | j } | d j � } | j | j k r� | j � } n t j | j | j � g � } | d } | r� g | D] } | j � ^ q� } n t j | j
t t d � t d � � t j | j
| d j � | | d j � g � g | � } | j | _ t d d | � | S( Nt obji s **t afteru sysu internt lpart rpar( t typet symst star_exprt argumentt childrent valuet clonet arglistR t Nodet powerR R t trailert prefixR t None( t selft nodet resultsR R t
newarglistR t nt new( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_intern.pyt transform s*
" U ( t __name__t
__module__t Truet
BM_compatiblet ordert PATTERNR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_intern.pyR s
N(
t __doc__t R R t
fixer_utilR R R t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_intern.pyt <module> s PK K/�\�҇��
�
fix_print.pycnu �[��� �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z d d l m Z d d l m Z m Z m
Z
m Z m Z e j
d � Z d e j f d � � YZ d
S( s Fixer for print.
Change:
'print' into 'print()'
'print ...' into 'print(...)'
'print ... ,' into 'print(..., end=" ")'
'print >>x, ...' into 'print(..., file=x)'
No changes are applied if print_function is imported from __future__
i ( t patcomp( t pytree( t token( t
fixer_base( t Namet Callt Commat Stringt is_tuples" atom< '(' [atom|STRING|NAME] ')' >t FixPrintc B s& e Z e Z d Z d � Z d � Z RS( sP
simple_stmt< any* bare='print' any* > | print_stmt
c C s2 | s t � | j d � } | rJ | j t t d � g d | j �� d S| j d t d � k si t � | j d } t | � d k r� t j | d � r� d Sd } } } | r� | d t � k r� | d } d } n | r3| d t j
t j d � k r3t | � d k st � | d j � } | d
} n g | D] } | j � ^ q:} | rhd | d _ n | d k s�| d k s�| d k r
| d k r�| j | d t t | � � � n | d k r�| j | d
t t | � � � n | d k r
| j | d | � q
n t t d � | � }
| j |
_ |
S( Nt bareu printt prefixi i i����t u >>i i u u sepu endu file( t AssertionErrort gett replaceR R R t childrent lent parend_exprt matcht NoneR R t LeafR t
RIGHTSHIFTt clonet add_kwargR t repr( t selft nodet resultst
bare_printt argst sept endt filet argt l_argst n_stmt( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_print.pyt transform% s>
%
%
$ " " c C sr d | _ t j | j j t | � t j t j d � | f � } | ra | j t
� � d | _ n | j | � d S( Nu u =u ( R R t Nodet symst argumentR R R t EQUALt appendR ( R t l_nodest s_kwdt n_exprt
n_argument( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_print.pyR M s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR% R ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_print.pyR s (N( t __doc__t R R t pgen2R R t
fixer_utilR R R R R t compile_patternR t BaseFixR ( ( ( s/ /usr/lib64/python2.7/lib2to3/fixes/fix_print.pyt <module> s ( PK K/�\�ؒ� � __init__.pycnu �[��� �
{ fc @ s d S( N( ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/__init__.pyt <module> t PK K/�\��5��
�
fix_exitfunc.pycnu �[��� �
{ fc @ sg d Z d d l m Z m Z d d l m Z m Z m Z m Z m Z m
Z
d e j f d � � YZ d S( s7
Convert use of sys.exitfunc to use the atexit module.
i����( t pytreet
fixer_base( t Namet Attrt Callt Commat Newlinet symst FixExitfuncc B s5 e Z e Z e Z d Z d � Z d � Z d � Z RS( s�
(
sys_import=import_name<'import'
('sys'
|
dotted_as_names< (any ',')* 'sys' (',' any)* >
)
>
|
expr_stmt<
power< 'sys' trailer< '.' 'exitfunc' > >
'=' func=any >
)
c G s t t | � j | � d S( N( t superR t __init__( t selft args( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_exitfunc.pyR
s c C s& t t | � j | | � d | _ d S( N( R R t
start_treet Nonet
sys_import( R t treet filename( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_exitfunc.pyR
! s c C s� d | k r/ | j d k r+ | d | _ n d S| d j � } d | _ t j t j t t d � t d � � � } t
| | g | j � } | j | � | j d k r� | j | d � d S| j j
d } | j t j k r| j t � � | j t d d � � n� | j j } | j
j | j � } | j } t j t j t d � t d d � g � }
t j t j |
g � } | j | d t � � | j | d
| � d S( NR t funcu u atexitu registersK Can't find sys import; Please add an atexit import at the top of your file.i u u importi ( R R t clonet prefixR t NodeR t powerR R R t replacet warningt childrent typet dotted_as_namest append_childR t parentt indext import_namet simple_stmtt insert_childR ( R t nodet resultsR t registert callt namest containing_stmtt positiont stmt_containert
new_importt new( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_exitfunc.pyt transform% s2
( t __name__t
__module__t Truet keep_line_ordert
BM_compatiblet PATTERNR
R
R, ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_exitfunc.pyR s N(
t __doc__t lib2to3R R t lib2to3.fixer_utilR R R R R R t BaseFixR ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_exitfunc.pyt <module> s .PK K/�\�]��� � fix_metaclass.pycnu �[��� �
{ fc @ s� d Z d d l m Z d d l m Z d d l m Z m Z m Z m Z d � Z
d � Z d � Z d � Z
d � Z d
� Z d e j f d � � YZ d
S( s� Fixer for __metaclass__ = X -> (metaclass=X) methods.
The various forms of classef (inherits nothing, inherits once, inherints
many) don't parse the same in the CST so we look at ALL classes for
a __metaclass__ and if we find one normalize the inherits to all be
an arglist.
For one-liner classes ('class X: pass') there is no indent/dedent so
we normalize those into having a suite.
Moving the __metaclass__ into the classdef can also cause the class
body to be empty so there is some special casing for that as well.
This fixer also tries very hard to keep original indenting and spacing
in all those corner cases.
i ( t
fixer_base( t token( t Namet symst Nodet Leafc C s� x� | j D]� } | j t j k r, t | � S| j t j k r
| j r
| j d } | j t j k r� | j r� | j d } t | t � r� | j d k r� t
Sq� q
q
Wt S( s� we have to check the cls_node without changing it.
There are two possibilities:
1) clsdef => suite => simple_stmt => expr_stmt => Leaf('__meta')
2) clsdef => simple_stmt => expr_stmt => Leaf('__meta')
i t
__metaclass__( t childrent typeR t suitet
has_metaclasst simple_stmtt expr_stmtt
isinstanceR t valuet Truet False( t parentt nodet expr_nodet left_side( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyR
s
c C s� x' | j D] } | j t j k r
d Sq
Wx? t | j � D]" \ } } | j t j k r: Pq: q: Wt d � � t t j g � } xC | j | d r� | j | d } | j | j
� � | j � q� W| j | � | } d S( sf one-line classes don't get a suite in the parse tree so we add
one to normalize the tree
Ns No class suite and no ':'!i ( R R R R t enumerateR t COLONt
ValueErrorR t append_childt clonet remove( t cls_nodeR t iR t move_node( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt fixup_parse_tree- s
c
C s� x7 t | j � D]" \ } } | j t j k r Pq q Wd S| j � t t j g � } t t j | g � } x; | j | r� | j | } | j
| j � � | j � qn W| j | | � | j d j d } | j d j d } | j
| _
d S( s� if there is a semi-colon all the parts count as part of the same
simple_stmt. We just want the __metaclass__ part so we move
everything after the semi-colon into its own simple_stmt node
Ni ( R R R R t SEMIR R R R R R R t insert_childt prefix(
R R t stmt_nodet semi_indR t new_exprt new_stmtR t new_leaf1t old_leaf1( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt fixup_simple_stmtG s
c C s: | j r6 | j d j t j k r6 | j d j � n d S( Ni����( R R R t NEWLINER ( R ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt remove_trailing_newline_ s "c c s� x3 | j D] } | j t j k r
Pq
q
Wt d � � x� t t | j � � D]� \ } } | j t j k rL | j rL | j d } | j t j k r� | j r� | j d } t | t
� r� | j d k r� t | | | � t
| � | | | f Vq� q� qL qL Wd S( Ns No class suite!i u
__metaclass__( R R R R R t listR R R R
R R R( R* ( R R R t simple_nodeR t left_node( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt
find_metasd s "
c C s� | j d d d � } x, | rD | j � } | j t j k r Pq q Wxm | r� | j � } t | t � r� | j t j k r� | j r� d | _ n d S| j | j d d d � � qH Wd S( s� If an INDENT is followed by a thing with a prefix then nuke the prefix
Otherwise we get in trouble when removing __metaclass__ at suite start
Ni����u (
R t popR R t INDENTR
R t DEDENTR! t extend( R t kidsR ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt fixup_indent{ s ! t FixMetaclassc B s e Z e Z d Z d � Z RS( s
classdef<any*>
c C s' t | � s d St | � d } x- t | � D] \ } } } | } | j � q- W| j d j } t | j � d k r� | j d j t j k r� | j d } q�| j d j
� } t t j | g � } | j d | � n� t | j � d k rt t j g � } | j
d | � n~ t | j � d k r�t t j g � } | j
d t t j d � � | j
d | � | j
d t t j d � � n t d � � | j d j d }
d
|
_ |
j } | j r�| j t t j d � � d |
_ n d
|
_ | j d } | j t j k st � d
| j d _ d
| j d _ | j | � t | � | j s�| j � t | d � }
| |
_ | j |
� | j t t j d � � n� t | j � d k r#| j d j t j k r#| j d j t j k r#t | d � }
| j
d |
� | j
d t t j d � � n d S( Ni i i i i i u )u (s Unexpected class definitiont metaclassu ,u u i u passu
i����i����( R
R t NoneR. R R R t lenR t arglistR R t set_childR R R t RPARt LPARR R R! R t COMMAR t AssertionErrorR4 R) R0 R1 ( t selfR t resultst last_metaclassR R t stmtt text_typeR9 R t meta_txtt orig_meta_prefixR t pass_leaf( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt transform� s`
( t __name__t
__module__R t
BM_compatiblet PATTERNRG ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyR5 � s N( t __doc__t R t pygramR t
fixer_utilR R R R R
R R( R* R. R4 t BaseFixR5 ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_metaclass.pyt <module> s " PK K/�\_;�>� � fix_set_literal.pyonu �[��� �
{ fc @ sO d Z d d l m Z m Z d d l m Z m Z d e j f d � � YZ d S( s:
Optional fixer to transform set() calls to set literals.
i����( t
fixer_baset pytree( t tokent symst
FixSetLiteralc B s# e Z e Z e Z d Z d � Z RS( sj power< 'set' trailer< '('
(atom=atom< '[' (items=listmaker< any ((',' any)* [',']) >
|
single=any) ']' >
|
atom< '(' items=testlist_gexp< any ((',' any)* [',']) > ')' >
)
')' > >
c C s | j d � } | rI t j t j | j � g � } | j | � | } n
| d } t j t j d � g } | j
d � | j D� � | j t j t j
d � � | j j | d _ t j t j | � } | j | _ t | j � d k r| j d } | j � | j | j d _ n | S( Nt singlet itemsu {c s s | ] } | j � Vq d S( N( t clone( t .0t n( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_set_literal.pys <genexpr>' s u }i����i i ( t getR t NodeR t listmakerR t replacet LeafR t LBRACEt extendt childrent appendt RBRACEt next_siblingt prefixt dictsetmakert lent remove( t selft nodet resultsR t fakeR t literalt makerR ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_set_literal.pyt transform s"
( t __name__t
__module__t Truet
BM_compatiblet explicitt PATTERNR ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_set_literal.pyR s
N( t __doc__t lib2to3R R t lib2to3.fixer_utilR R t BaseFixR ( ( ( s5 /usr/lib64/python2.7/lib2to3/fixes/fix_set_literal.pyt <module> s PK K/�\�?�յ � fix_import.pycnu �[��� �
{ fc @ sz d Z d d l m Z d d l m Z m Z m Z m Z d d l m Z m
Z
m Z d � Z d e j
f d � � YZ d S(
s� Fixer for import statements.
If spam is being imported from the local directory, this import:
from spam import eggs
Becomes:
from .spam import eggs
And this import:
import spam
Becomes:
from . import spam
i ( t
fixer_basei����( t dirnamet joint existst sep( t
FromImportt symst tokenc c s� | g } x� | r� | j � } | j t j k r; | j Vq | j t j k rw d j g | j D] } | j ^ q] � Vq | j t j k r� | j
| j d � q | j t j k r� | j | j d d d � � q t
d � � q Wd S( sF
Walks over all the names imported in a dotted_as_names node.
t i Ni����s unknown node type( t popt typeR t NAMEt valueR t dotted_nameR t childrent dotted_as_namet appendt dotted_as_namest extendt AssertionError( t namest pendingt nodet ch( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyt traverse_imports s * t FixImportc B s/ e Z e Z d Z d � Z d � Z d � Z RS( sj
import_from< 'from' imp=any 'import' ['('] any [')'] >
|
import_name< 'import' imp=any >
c C s/ t t | � j | | � d | j k | _ d S( Nt absolute_import( t superR t
start_treet future_featurest skip( t selft treet name( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyR / s c C s | j r
d S| d } | j t j k r~ x t | d � sK | j d } q, W| j | j � rd | j | _ | j � qn� t } t } x2 t
| � D]$ } | j | � r� t } q� t } q� W| r� | r� | j | d � n d St
d | g � } | j | _ | Sd S( Nt impR i u .s# absolute and local imports together( R R
R t import_fromt hasattrR t probably_a_local_importR t changedt FalseR t Truet warningR t prefix( R R t resultsR" t
have_localt
have_absolutet mod_namet new( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyt transform3 s,
c C s� | j d � r t S| j d d � d } t | j � } t | | � } t t t | � d � � sf t Sx4 d t d d d d g D] } t | | � r t Sq Wt S(
Nu .i i s __init__.pys .pys .pycs .sos .sls .pyd( t
startswithR' t splitR t filenameR R R R( ( R t imp_namet base_patht ext( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyR% U s ( t __name__t
__module__R( t
BM_compatiblet PATTERNR R0 R% ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyR & s
"N( t __doc__R R t os.pathR R R R t
fixer_utilR R R R t BaseFixR ( ( ( s0 /usr/lib64/python2.7/lib2to3/fixes/fix_import.pyt <module> s
" PK K/�\Ҋ��< < fix_execfile.pycnu �[��� �
{ fc @ sy d Z d d l m Z d d l m Z m Z m Z m Z m Z m Z m
Z
m Z m Z m
Z
d e j f d � � YZ d S( so Fixer for execfile.
This converts usages of the execfile function into calls to the built-in
exec() function.
i ( t
fixer_base(
t Commat Namet Callt LParent RParent Dott Nodet ArgListt Stringt symst FixExecfilec B s e Z e Z d Z d � Z RS( s�
power< 'execfile' trailer< '(' arglist< filename=any [',' globals=any [',' locals=any ] ] > ')' > >
|
power< 'execfile' trailer< '(' filename=any ')' > >
c C s� | s t � | d } | j d � } | j d � } | j d j d j � } t | j � t � t d d � g d | �} t t j t
d � | g � } t t j t � t
d � g � t t j t
� t � g � g } | g | }
| j � } d
| _ t d d
� } |
t � | t � | g }
t t
d � |
d
� } | g } | d k rq| j t � | j � g � n | d k r�| j t � | j � g � n t t
d � | d | j �S( Nt filenamet globalst localsi����s "rb"t t rparenu openu readu u 'exec'u compileu u exect prefix( t AssertionErrort gett childrent cloneR R R R R
t powerR t trailerR R R R R t Nonet extend( t selft nodet resultsR R
R t execfile_parent open_argst open_callt readt open_exprt filename_argt exec_strt compile_argst compile_callt args( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_execfile.pyt transform s,
$ !
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR' ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_execfile.pyR s N( t __doc__t R t
fixer_utilR R R R R R R R R R
t BaseFixR ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_execfile.pyt <module> s FPK K/�\��\�� � fix_unicode.pyonu �[��� �
{ fc @ sW d Z d d l m Z d d l m Z i d d 6d d 6Z d e j f d � � YZ d
S( s� Fixer for unicode.
* Changes unicode to str and unichr to chr.
* If "...\u..." is not unicode literal change it into "...\\u...".
* Change u"..." into "...".
i ( t token( t
fixer_baseu chru unichru stru unicodet
FixUnicodec B s& e Z e Z d Z d � Z d � Z RS( s STRING | 'unicode' | 'unichr'c C s/ t t | � j | | � d | j k | _ d S( Nt unicode_literals( t superR t
start_treet future_featuresR ( t selft treet filename( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_unicode.pyR s c C s | j t j k r2 | j � } t | j | _ | S| j t j k r| j } | j r� | d d k r� d | k r� d j g | j d � D]$ } | j
d d � j
d d � ^ q� � } n | d d k r� | d
} n | | j k r� | S| j � } | | _ | Sd S( Ni u '"u \u \\u \uu \\uu \Uu \\Uu uUi ( t typeR t NAMEt clonet _mappingt valuet STRINGR t joint splitt replace( R t nodet resultst newt valt v( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_unicode.pyt transform s" &=
( t __name__t
__module__t Truet
BM_compatiblet PATTERNR R ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_unicode.pyR s N( t __doc__t pgen2R t R R
t BaseFixR ( ( ( s1 /usr/lib64/python2.7/lib2to3/fixes/fix_unicode.pyt <module> s PK K/�\ɣ�9g g fix_methodattrs.pynu �[��� """Fix bound method attributes (method.im_? -> method.__?__).
"""
# Author: Christian Heimes
# Local imports
from .. import fixer_base
from ..fixer_util import Name
MAP = {
"im_func" : "__func__",
"im_self" : "__self__",
"im_class" : "__self__.__class__"
}
class FixMethodattrs(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
power< any+ trailer< '.' attr=('im_func' | 'im_self' | 'im_class') > any* >
"""
def transform(self, node, results):
attr = results["attr"][0]
new = unicode(MAP[attr.value])
attr.replace(Name(new, prefix=attr.prefix))
PK K/�\G~�Z fix_repr.pyonu �[��� �
{ fc @ sO d Z d d l m Z d d l m Z m Z m Z d e j f d � � YZ d S( s/ Fixer that transforms `xyzzy` into repr(xyzzy).i ( t
fixer_base( t Callt Namet parenthesizet FixReprc B s e Z e Z d Z d � Z RS( s7
atom < '`' expr=any '`' >
c C sS | d j � } | j | j j k r4 t | � } n t t d � | g d | j �S( Nt expru reprt prefix( t clonet typet symst testlist1R R R R ( t selft nodet resultsR ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_repr.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_repr.pyR s N( t __doc__t R t
fixer_utilR R R t BaseFixR ( ( ( s. /usr/lib64/python2.7/lib2to3/fixes/fix_repr.pyt <module> s PK K/�\�=�� � fix_asserts.pynu �[��� """Fixer that replaces deprecated unittest method names."""
# Author: Ezio Melotti
from ..fixer_base import BaseFix
from ..fixer_util import Name
NAMES = dict(
assert_="assertTrue",
assertEquals="assertEqual",
assertNotEquals="assertNotEqual",
assertAlmostEquals="assertAlmostEqual",
assertNotAlmostEquals="assertNotAlmostEqual",
assertRegexpMatches="assertRegex",
assertRaisesRegexp="assertRaisesRegex",
failUnlessEqual="assertEqual",
failIfEqual="assertNotEqual",
failUnlessAlmostEqual="assertAlmostEqual",
failIfAlmostEqual="assertNotAlmostEqual",
failUnless="assertTrue",
failUnlessRaises="assertRaises",
failIf="assertFalse",
)
class FixAsserts(BaseFix):
PATTERN = """
power< any+ trailer< '.' meth=(%s)> any* >
""" % '|'.join(map(repr, NAMES))
def transform(self, node, results):
name = results["meth"][0]
name.replace(Name(NAMES[str(name)], prefix=name.prefix))
PK K/�\QA��f f fix_repr.pynu �[��� # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer that transforms `xyzzy` into repr(xyzzy)."""
# Local imports
from .. import fixer_base
from ..fixer_util import Call, Name, parenthesize
class FixRepr(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
atom < '`' expr=any '`' >
"""
def transform(self, node, results):
expr = results["expr"].clone()
if expr.type == self.syms.testlist1:
expr = parenthesize(expr)
return Call(Name(u"repr"), [expr], prefix=node.prefix)
PK K/�\�i(� � fix_exec.pynu �[��� # Copyright 2006 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.
"""Fixer for exec.
This converts usages of the exec statement into calls to a built-in
exec() function.
exec code in ns1, ns2 -> exec(code, ns1, ns2)
"""
# Local imports
from .. import pytree
from .. import fixer_base
from ..fixer_util import Comma, Name, Call
class FixExec(fixer_base.BaseFix):
BM_compatible = True
PATTERN = """
exec_stmt< 'exec' a=any 'in' b=any [',' c=any] >
|
exec_stmt< 'exec' (not atom<'(' [any] ')'>) a=any >
"""
def transform(self, node, results):
assert results
syms = self.syms
a = results["a"]
b = results.get("b")
c = results.get("c")
args = [a.clone()]
args[0].prefix = ""
if b is not None:
args.extend([Comma(), b.clone()])
if c is not None:
args.extend([Comma(), c.clone()])
return Call(Name(u"exec"), args, prefix=node.prefix)
PK K/�\�� � � fix_unicode.pynu �[��� r"""Fixer for unicode.
* Changes unicode to str and unichr to chr.
* If "...\u..." is not unicode literal change it into "...\\u...".
* Change u"..." into "...".
"""
from ..pgen2 import token
from .. import fixer_base
_mapping = {u"unichr" : u"chr", u"unicode" : u"str"}
class FixUnicode(fixer_base.BaseFix):
BM_compatible = True
PATTERN = "STRING | 'unicode' | 'unichr'"
def start_tree(self, tree, filename):
super(FixUnicode, self).start_tree(tree, filename)
self.unicode_literals = 'unicode_literals' in tree.future_features
def transform(self, node, results):
if node.type == token.NAME:
new = node.clone()
new.value = _mapping[node.value]
return new
elif node.type == token.STRING:
val = node.value
if not self.unicode_literals and val[0] in u'\'"' and u'\\' in val:
val = ur'\\'.join([
v.replace(u'\\u', ur'\\u').replace(u'\\U', ur'\\U')
for v in val.split(ur'\\')
])
if val[0] in u'uU':
val = val[1:]
if val == node.value:
return node
new = node.clone()
new.value = val
return new
PK K/�\�P�r
fix_itertools.pycnu �[��� �
{ fc @ sC d Z d d l m Z d d l m Z d e j f d � � YZ d S( sT Fixer for itertools.(imap|ifilter|izip) --> (map|filter|zip) and
itertools.ifilterfalse --> itertools.filterfalse (bugs 2360-2363)
imports from itertools are fixed in fix_itertools_import.py
If itertools is imported as something else (ie: import itertools as it;
it.izip(spam, eggs)) method calls will not get fixed.
i ( t
fixer_base( t Namet FixItertoolsc B s0 e Z e Z d Z d e � Z d Z d � Z RS( s7 ('imap'|'ifilter'|'izip'|'izip_longest'|'ifilterfalse')s�
power< it='itertools'
trailer<
dot='.' func=%(it_funcs)s > trailer< '(' [any] ')' > >
|
power< func=%(it_funcs)s trailer< '(' [any] ')' > >
i c C s� d } | d d } d | k rt | j d k rt | d | d } } | j } | j � | j � | j j | � n | p� | j } | j t | j d d | �� d S(
Nt funci t itu ifilterfalseu izip_longestt doti t prefix( u ifilterfalseu izip_longest( t Nonet valueR t removet parentt replaceR ( t selft nodet resultsR R R R ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_itertools.pyt transform s
( t __name__t
__module__t Truet
BM_compatiblet it_funcst localst PATTERNt run_orderR ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_itertools.pyR s
N( t __doc__t R t
fixer_utilR t BaseFixR ( ( ( s3 /usr/lib64/python2.7/lib2to3/fixes/fix_itertools.pyt <module> s PK K/�\{�� � fix_exitfunc.pynu �[��� """
Convert use of sys.exitfunc to use the atexit module.
"""
# Author: Benjamin Peterson
from lib2to3 import pytree, fixer_base
from lib2to3.fixer_util import Name, Attr, Call, Comma, Newline, syms
class FixExitfunc(fixer_base.BaseFix):
keep_line_order = True
BM_compatible = True
PATTERN = """
(
sys_import=import_name<'import'
('sys'
|
dotted_as_names< (any ',')* 'sys' (',' any)* >
)
>
|
expr_stmt<
power< 'sys' trailer< '.' 'exitfunc' > >
'=' func=any >
)
"""
def __init__(self, *args):
super(FixExitfunc, self).__init__(*args)
def start_tree(self, tree, filename):
super(FixExitfunc, self).start_tree(tree, filename)
self.sys_import = None
def transform(self, node, results):
# First, find the sys import. We'll just hope it's global scope.
if "sys_import" in results:
if self.sys_import is None:
self.sys_import = results["sys_import"]
return
func = results["func"].clone()
func.prefix = u""
register = pytree.Node(syms.power,
Attr(Name(u"atexit"), Name(u"register"))
)
call = Call(register, [func], node.prefix)
node.replace(call)
if self.sys_import is None:
# That's interesting.
self.warning(node, "Can't find sys import; Please add an atexit "
"import at the top of your file.")
return
# Now add an atexit import after the sys import.
names = self.sys_import.children[1]
if names.type == syms.dotted_as_names:
names.append_child(Comma())
names.append_child(Name(u"atexit", u" "))
else:
containing_stmt = self.sys_import.parent
position = containing_stmt.children.index(self.sys_import)
stmt_container = containing_stmt.parent
new_import = pytree.Node(syms.import_name,
[Name(u"import"), Name(u"atexit", u" ")]
)
new = pytree.Node(syms.simple_stmt, [new_import])
containing_stmt.insert_child(position + 1, Newline())
containing_stmt.insert_child(position + 2, new)
PK K/�\�6��� �
fix_ne.pyonu �[��� �
{ fc @ sS d Z d d l m Z d d l m Z d d l m Z d e j f d � � YZ d S( s Fixer that turns <> into !=.i ( t pytree( t token( t
fixer_baset FixNec B s# e Z e j Z d � Z d � Z RS( c C s
| j d k S( Nu <>( t value( t selft node( ( s, /usr/lib64/python2.7/lib2to3/fixes/fix_ne.pyt match s c C s" t j t j d d | j �} | S( Nu !=t prefix( R t LeafR t NOTEQUALR ( R R t resultst new( ( s, /usr/lib64/python2.7/lib2to3/fixes/fix_ne.pyt transform s ( t __name__t
__module__R R
t _accept_typeR R
( ( ( s, /usr/lib64/python2.7/lib2to3/fixes/fix_ne.pyR s N( t __doc__t R t pgen2R R t BaseFixR ( ( ( s, /usr/lib64/python2.7/lib2to3/fixes/fix_ne.pyt <module> s PK K/�\k(P�z z fix_imports2.pyonu �[��� �
{ fc @ sG d Z d d l m Z i d d 6d d 6Z d e j f d � � YZ d S( sT Fix incompatible imports and module references that must be fixed after
fix_imports.i ( t fix_importst dbmt whichdbt anydbmt FixImports2c B s e Z d Z e Z RS( i ( t __name__t
__module__t run_ordert MAPPINGt mapping( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_imports2.pyR s N( t __doc__t R R t
FixImportsR ( ( ( s2 /usr/lib64/python2.7/lib2to3/fixes/fix_imports2.pyt <module> s
PK K/�\!x �P P fix_zip.pyonu �[��� �
{ fc @ sO d Z d d l m Z d d l m Z m Z m Z d e j f d � � YZ d S( s7
Fixer that changes zip(seq0, seq1, ...) into list(zip(seq0, seq1, ...)
unless there exists a 'from future_builtins import zip' statement in the
top-level namespace.
We avoid the transformation if the zip() call is directly contained in
iter(<>), list(<>), tuple(<>), sorted(<>), ...join(<>), or for V in <>:.
i ( t
fixer_base( t Namet Callt in_special_contextt FixZipc B s# e Z e Z d Z d Z d � Z RS( s:
power< 'zip' args=trailer< '(' [any] ')' >
>
s future_builtins.zipc C s` | j | � r d St | � r# d S| j � } d | _ t t d � | g � } | j | _ | S( Nu u list( t should_skipR t Nonet clonet prefixR R ( t selft nodet resultst new( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_zip.pyt transform s ( t __name__t
__module__t Truet
BM_compatiblet PATTERNt skip_onR
( ( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_zip.pyR s N( t __doc__t R t
fixer_utilR R R t ConditionalFixR ( ( ( s- /usr/lib64/python2.7/lib2to3/fixes/fix_zip.pyt <module> s PK J/�\�R�� fix_imports.pyonu �[��� PK J/�\���� � C fix_future.pycnu �[��� PK J/�\ �6d� � & fix_tuple_params.pynu �[��� PK J/�\�@Zw
2/ fix_idioms.pynu �[��� PK J/�\���� �
�B fix_throw.pycnu �[��� PK J/�\�� �J fix_operator.pyonu �[��� PK J/�\��-�$ $
�^ fix_apply.pycnu �[��� PK J/�\���� �
^g fix_throw.pyonu �[��� PK J/�\�W�� � uo fix_getcwdu.pynu �[��� PK J/�\��I I wq fix_isinstance.pynu �[��� PK J/�\�ĸ&� � x fix_methodattrs.pycnu �[��� PK J/�\y� � �| fix_apply.pynu �[��� PK J/�\ P�T� � �� fix_set_literal.pynu �[��� PK J/�\��\�� �
f� fix_import.pynu �[��� PK J/�\�u��c c _� fix_standarderror.pyonu �[��� PK J/�\_;�>� � � fix_set_literal.pycnu �[��� PK J/�\�0�| |
� fix_input.pyonu �[��� PK J/�\�1Wl� � ת fix_sys_exc.pycnu �[��� PK J/�\�R�� ϱ fix_imports.pycnu �[��� PK J/�\�&�1 � fix_types.pynu �[��� PK J/�\��gpA A _� fix_basestring.pynu �[��� PK J/�\��J�� � �� fix_exec.pycnu �[��� PK J/�\4 ��
�� fix_apply.pyonu �[��� PK J/�\v�� � �� fix_map.pyonu �[��� PK J/�\8|�g � fix_execfile.pyonu �[��� PK J/�\k(P�z z y� fix_imports2.pycnu �[��� PK J/�\(%N
3� fix_except.pynu �[��� PK J/�\��s< < � fix_isinstance.pyonu �[��� PK J/�\c���� �
fix_filter.pycnu �[��� PK J/�\}ׄ L L " fix_nonzero.pyonu �[��� PK J/�\R�R�� � � fix_numliterals.pycnu �[��� PK J/�\B�o�� � � fix_dict.pynu �[��� PK J/�\�� �� � , fix_except.pyonu �[��� PK J/�\ `pw w 8 fix_exec.pyonu �[��� PK J/�\!x �P P �= fix_zip.pycnu �[��� PK J/�\~&�� � IC fix_urllib.pyonu �[��� PK J/�\c���� � _ fix_filter.pyonu �[��� PK J/�\ܬ'! ! �h fix_imports2.pynu �[��� PK J/�\n��� � �i fix_paren.pynu �[��� PK J/�\�E[/ / o __init__.pynu �[��� PK J/�\���W W mo fix_long.pycnu �[��� PK J/�\�tڢ� � s fix_buffer.pyonu �[��� PK J/�\p�V\�
�
w fix_operator.pynu �[��� PK J/�\ܾ�� � ф fix_xreadlines.pyonu �[��� PK J/�\�xA�
�
�� fix_next.pyonu �[��� PK J/�\R�R�� � �� fix_numliterals.pyonu �[��� PK J/�\��\�� � Ӝ fix_unicode.pycnu �[��� PK J/�\��J�� �
֣ fix_types.pyonu �[��� PK J/�\�P�r
�� fix_itertools.pyonu �[��� PK J/�\�tڢ� � � fix_buffer.pycnu �[��� PK J/�\�,�b� �
� fix_raise.pycnu �[��� PK J/�\}V�G G
� fix_reduce.pynu �[��� PK J/�\Tv˒R R �� fix_tuple_params.pycnu �[��� PK J/�\sGћ� � ,� fix_getcwdu.pycnu �[��� PK J/�\Tv˒R R � fix_tuple_params.pyonu �[��� PK J/�\�V%e~ ~ �� fix_has_key.pycnu �[��� PK J/�\��\� � j fix_standarderror.pynu �[��� PK J/�\�P��. . p fix_itertools_imports.pynu �[��� PK J/�\�
J J
� fix_intern.pynu �[��� PK J/�\ܾ�� � m fix_xreadlines.pycnu �[��� PK J/�\��5��
�
= fix_exitfunc.pyonu �[��� PK J/�\�d�{� � B# fix_raw_input.pyonu �[��� PK J/�\��cۛ � 9' fix_metaclass.pyonu �[��� PK J/�\�� A fix_operator.pycnu �[��� PK J/�\���W W sU fix_long.pyonu �[��� PK J/�\mU�
Y fix_paren.pycnu �[��� PK J/�\t� X_ fix_asserts.pycnu �[��� PK J/�\G~�Z �e fix_repr.pycnu �[��� PK K/�\ ��] ] �i fix_has_key.pyonu �[��� PK K/�\mU�
�v fix_paren.pyonu �[��� PK K/�\&�[� �| fix_xrange.pyonu �[��� PK K/�\_}�< < -� fix_dict.pyonu �[��� PK K/�\��H|�
�
�� fix_xrange.pynu �[��� PK K/�\D�Y� �
m� fix_map.pynu �[��� PK K/�\l�SO O
�� fix_buffer.pynu �[��� PK K/�\��� )� fix_itertools.pynu �[��� PK K/�\�@`�; ;
w� fix_filter.pynu �[��� PK K/�\�6��� �
� fix_ne.pycnu �[��� PK K/�\^ K�m m � fix_next.pynu �[��� PK K/�\\g7�' ' �� fix_basestring.pycnu �[��� PK K/�\�:?PV V #� fix_nonzero.pynu �[��� PK K/�\�ĸ&� � �� fix_methodattrs.pyonu �[��� PK K/�\6��zh h z� fix_funcattrs.pyonu �[��� PK K/�\�0�| |
#� fix_input.pycnu �[��� PK K/�\��锪 � �� fix_renames.pynu �[��� PK K/�\�{�F �� fix_numliterals.pynu �[��� PK K/�\�xW � fix_intern.pyonu �[��� PK K/�\6��zh h N� fix_funcattrs.pycnu �[��� PK K/�\�4�' �� fix_execfile.pynu �[��� PK K/�\�Yω� � > fix_has_key.pynu �[��� PK K/�\���� � fix_future.pyonu �[��� PK K/�\m)ĥ� � � fix_reduce.pyonu �[��� PK K/�\�?�յ � 4 fix_import.pyonu �[��� PK K/�\��J�� �
'( fix_types.pycnu �[��� PK K/�\�7h# #
1 fix_future.pynu �[��� PK K/�\�� �� � f3 fix_except.pycnu �[��� PK K/�\�:C
t t e? fix_ws_comma.pycnu �[��� PK K/�\�:C
t t E fix_ws_comma.pyonu �[��� PK K/�\��B� � �J fix_funcattrs.pynu �[��� PK K/�\���� �
�M fix_urllib.pynu �[��� PK K/�\o �^v v �n fix_raise.pynu �[��� PK K/�\�1Wl� � Bz fix_sys_exc.pyonu �[��� PK K/�\ݔ�N� � :� fix_long.pynu �[��� PK K/�\�u��c c R� fix_standarderror.pycnu �[��� PK K/�\e�˺� � �� fix_dict.pycnu �[��� PK K/�\,���V
V
� fix_print.pyonu �[��� PK K/�\�ؒ� � �� __init__.pyonu �[��� PK K/�\8r� = = C� fix_ne.pynu �[��� PK K/�\Hm� � �� fix_itertools_imports.pycnu �[��� PK K/�\+�E�2 2 � fix_throw.pynu �[��� PK K/�\I�4� ^� fix_metaclass.pynu �[��� PK K/�\�d�{� � �� fix_raw_input.pycnu �[��� PK K/�\~&�� � �� fix_urllib.pycnu �[��� PK K/�\sGћ� � �� fix_getcwdu.pyonu �[��� PK K/�\&�[� � fix_xrange.pycnu �[��� PK K/�\��s< < fix_isinstance.pycnu �[��� PK K/�\��Q Q �
fix_idioms.pyonu �[��� PK K/�\�s��� � ( fix_input.pynu �[��� PK K/�\v�� � * fix_map.pycnu �[��� PK K/�\CTw� � S+ fix_renames.pycnu �[��� PK K/�\m)ĥ� � 95 fix_reduce.pycnu �[��� PK K/�\���Z� � s: fix_itertools_imports.pyonu �[��� PK K/�\CTw� � }B fix_renames.pyonu �[��� PK K/�\Н
�= = cL fix_imports.pynu �[��� PK K/�\�c�^G G �b fix_ws_comma.pynu �[��� PK K/�\}ׄ L L dg fix_nonzero.pycnu �[��� PK K/�\�Y�1 1 �k fix_print.pynu �[��� PK K/�\g�M� � \w fix_xreadlines.pynu �[��� PK K/�\�,�b� �
Oz fix_raise.pyonu �[��� PK K/�\t� \� fix_asserts.pyonu �[��� PK K/�\u���
�
�� fix_next.pycnu �[��� PK K/�\RJ,�� � Ә fix_raw_input.pynu �[��� PK K/�\\g7�' ' ښ fix_basestring.pyonu �[��� PK K/�\:^S� C� fix_sys_exc.pynu �[��� PK K/�\i � � �� fix_idioms.pycnu �[��� PK K/�\��ˈ �
�� fix_zip.pynu �[��� PK K/�\�xW I� fix_intern.pycnu �[��� PK K/�\�҇��
�
�� fix_print.pycnu �[��� PK K/�\�ؒ� � �� __init__.pycnu �[��� PK K/�\��5��
�
A� fix_exitfunc.pycnu �[��� PK K/�\�]��� � F� fix_metaclass.pycnu �[��� PK K/�\_;�>� � T� fix_set_literal.pyonu �[��� PK K/�\�?�յ � k� fix_import.pycnu �[��� PK K/�\Ҋ��< < ^ fix_execfile.pycnu �[��� PK K/�\��\�� � �
fix_unicode.pyonu �[��� PK K/�\ɣ�9g g � fix_methodattrs.pynu �[��� PK K/�\G~�Z � fix_repr.pyonu �[��� PK K/�\�=�� � � fix_asserts.pynu �[��� PK K/�\QA��f f � fix_repr.pynu �[��� PK K/�\�i(� � " fix_exec.pynu �[��� PK K/�\�� � � �& fix_unicode.pynu �[��� PK K/�\�P�r
�+ fix_itertools.pycnu �[��� PK K/�\{�� � %3 fix_exitfunc.pynu �[��� PK K/�\�6��� �
+= fix_ne.pyonu �[��� PK K/�\k(P�z z NA fix_imports2.pyonu �[��� PK K/�\!x �P P D fix_zip.pyonu �[��� PK � � �/ �I
