File Manager

X7ROOT File Manager

Current Path: /lib64/python2.7/lib2to3/fixes

ðŸ“ ..
ðŸ“„ __init__.py(47 B)
ðŸ“„ __init__.pyc(133 B)
ðŸ“„ __init__.pyo(133 B)
ðŸ“„ fix_apply.py(2.38 KB)
ðŸ“„ fix_apply.pyc(2.04 KB)
ðŸ“„ fix_apply.pyo(2 KB)
ðŸ“„ fix_asserts.py(984 B)
ðŸ“„ fix_asserts.pyc(1.52 KB)
ðŸ“„ fix_asserts.pyo(1.52 KB)
ðŸ“„ fix_basestring.py(321 B)
ðŸ“„ fix_basestring.pyc(807 B)
ðŸ“„ fix_basestring.pyo(807 B)
ðŸ“„ fix_buffer.py(591 B)
ðŸ“„ fix_buffer.pyc(964 B)
ðŸ“„ fix_buffer.pyo(964 B)
ðŸ“„ fix_dict.py(3.73 KB)
ðŸ“„ fix_dict.pyc(3.68 KB)
ðŸ“„ fix_dict.pyo(3.56 KB)
ðŸ“„ fix_except.py(3.27 KB)
ðŸ“„ fix_except.pyc(2.94 KB)
ðŸ“„ fix_except.pyo(2.94 KB)
ðŸ“„ fix_exec.py(1002 B)
ðŸ“„ fix_exec.pyc(1.4 KB)
ðŸ“„ fix_exec.pyo(1.37 KB)
ðŸ“„ fix_execfile.py(2.01 KB)
ðŸ“„ fix_execfile.pyc(2.06 KB)
ðŸ“„ fix_execfile.pyo(2.03 KB)
ðŸ“„ fix_exitfunc.py(2.44 KB)
ðŸ“„ fix_exitfunc.pyc(2.69 KB)
ðŸ“„ fix_exitfunc.pyo(2.69 KB)
ðŸ“„ fix_filter.py(2.06 KB)
ðŸ“„ fix_filter.pyc(2.22 KB)
ðŸ“„ fix_filter.pyo(2.22 KB)
ðŸ“„ fix_funcattrs.py(645 B)
ðŸ“„ fix_funcattrs.pyc(1.1 KB)
ðŸ“„ fix_funcattrs.pyo(1.1 KB)
ðŸ“„ fix_future.py(547 B)
ðŸ“„ fix_future.pyc(933 B)
ðŸ“„ fix_future.pyo(933 B)
ðŸ“„ fix_getcwdu.py(452 B)
ðŸ“„ fix_getcwdu.pyc(940 B)
ðŸ“„ fix_getcwdu.pyo(940 B)
ðŸ“„ fix_has_key.py(3.15 KB)
ðŸ“„ fix_has_key.pyc(3.12 KB)
ðŸ“„ fix_has_key.pyo(3.09 KB)
ðŸ“„ fix_idioms.py(4.77 KB)
ðŸ“„ fix_idioms.pyc(4.43 KB)
ðŸ“„ fix_idioms.pyo(4.33 KB)
ðŸ“„ fix_import.py(3.18 KB)
ðŸ“„ fix_import.pyc(3.18 KB)
ðŸ“„ fix_import.pyo(3.18 KB)
ðŸ“„ fix_imports.py(5.56 KB)
ðŸ“„ fix_imports.pyc(5.25 KB)
ðŸ“„ fix_imports.pyo(5.25 KB)
ðŸ“„ fix_imports2.py(289 B)
ðŸ“„ fix_imports2.pyc(634 B)
ðŸ“„ fix_imports2.pyo(634 B)
ðŸ“„ fix_input.py(710 B)
ðŸ“„ fix_input.pyc(1.12 KB)
ðŸ“„ fix_input.pyo(1.12 KB)
ðŸ“„ fix_intern.py(1.82 KB)
ðŸ“„ fix_intern.pyc(1.75 KB)
ðŸ“„ fix_intern.pyo(1.75 KB)
ðŸ“„ fix_isinstance.py(1.57 KB)
ðŸ“„ fix_isinstance.pyc(1.81 KB)
ðŸ“„ fix_isinstance.pyo(1.81 KB)
ðŸ“„ fix_itertools.py(1.51 KB)
ðŸ“„ fix_itertools.pyc(1.76 KB)
ðŸ“„ fix_itertools.pyo(1.76 KB)
ðŸ“„ fix_itertools_imports.py(2.04 KB)
ðŸ“„ fix_itertools_imports.pyc(1.98 KB)
ðŸ“„ fix_itertools_imports.pyo(1.94 KB)
ðŸ“„ fix_long.py(477 B)
ðŸ“„ fix_long.pyc(855 B)
ðŸ“„ fix_long.pyo(855 B)
ðŸ“„ fix_map.py(2.99 KB)
ðŸ“„ fix_map.pyc(2.98 KB)
ðŸ“„ fix_map.pyo(2.98 KB)
ðŸ“„ fix_metaclass.py(8.02 KB)
ðŸ“„ fix_metaclass.pyc(6.45 KB)
ðŸ“„ fix_metaclass.pyo(6.4 KB)
ðŸ“„ fix_methodattrs.py(615 B)
ðŸ“„ fix_methodattrs.pyc(1.13 KB)
ðŸ“„ fix_methodattrs.pyo(1.13 KB)
ðŸ“„ fix_ne.py(573 B)
ðŸ“„ fix_ne.pyc(1001 B)
ðŸ“„ fix_ne.pyo(1001 B)
ðŸ“„ fix_next.py(3.11 KB)
ðŸ“„ fix_next.pyc(3.47 KB)
ðŸ“„ fix_next.pyo(3.44 KB)
ðŸ“„ fix_nonzero.py(598 B)
ðŸ“„ fix_nonzero.pyc(1.07 KB)
ðŸ“„ fix_nonzero.pyo(1.07 KB)
ðŸ“„ fix_numliterals.py(773 B)
ðŸ“„ fix_numliterals.pyc(1.24 KB)
ðŸ“„ fix_numliterals.pyo(1.24 KB)
ðŸ“„ fix_operator.py(3.39 KB)
ðŸ“„ fix_operator.pyc(5.03 KB)
ðŸ“„ fix_operator.pyo(5.03 KB)
ðŸ“„ fix_paren.py(1.2 KB)
ðŸ“„ fix_paren.pyc(1.52 KB)
ðŸ“„ fix_paren.pyo(1.52 KB)
ðŸ“„ fix_print.py(2.8 KB)
ðŸ“„ fix_print.pyc(2.68 KB)
ðŸ“„ fix_print.pyo(2.58 KB)
ðŸ“„ fix_raise.py(2.87 KB)
ðŸ“„ fix_raise.pyc(2.45 KB)
ðŸ“„ fix_raise.pyo(2.45 KB)
ðŸ“„ fix_raw_input.py(455 B)
ðŸ“„ fix_raw_input.pyc(950 B)
ðŸ“„ fix_raw_input.pyo(950 B)
ðŸ“„ fix_reduce.py(839 B)
ðŸ“„ fix_reduce.pyc(1.25 KB)
ðŸ“„ fix_reduce.pyo(1.25 KB)
ðŸ“„ fix_renames.py(2.17 KB)
ðŸ“„ fix_renames.pyc(2.41 KB)
ðŸ“„ fix_renames.pyo(2.41 KB)
ðŸ“„ fix_repr.py(614 B)
ðŸ“„ fix_repr.pyc(1.01 KB)
ðŸ“„ fix_repr.pyo(1.01 KB)
ðŸ“„ fix_set_literal.py(1.66 KB)
ðŸ“„ fix_set_literal.pyc(1.96 KB)
ðŸ“„ fix_set_literal.pyo(1.96 KB)
ðŸ“„ fix_standarderror.py(450 B)
ðŸ“„ fix_standarderror.pyc(867 B)
ðŸ“„ fix_standarderror.pyo(867 B)
ðŸ“„ fix_sys_exc.py(1.01 KB)
ðŸ“„ fix_sys_exc.pyc(1.68 KB)
ðŸ“„ fix_sys_exc.pyo(1.68 KB)
ðŸ“„ fix_throw.py(1.55 KB)
ðŸ“„ fix_throw.pyc(1.96 KB)
ðŸ“„ fix_throw.pyo(1.96 KB)
ðŸ“„ fix_tuple_params.py(5.45 KB)
ðŸ“„ fix_tuple_params.pyc(5.33 KB)
ðŸ“„ fix_tuple_params.pyo(5.33 KB)
ðŸ“„ fix_types.py(1.77 KB)
ðŸ“„ fix_types.pyc(2.16 KB)
ðŸ“„ fix_types.pyo(2.16 KB)
ðŸ“„ fix_unicode.py(1.24 KB)
ðŸ“„ fix_unicode.pyc(1.69 KB)
ðŸ“„ fix_unicode.pyo(1.69 KB)
ðŸ“„ fix_urllib.py(8.19 KB)
ðŸ“„ fix_urllib.pyc(6.99 KB)
ðŸ“„ fix_urllib.pyo(6.99 KB)
ðŸ“„ fix_ws_comma.py(1.07 KB)
ðŸ“„ fix_ws_comma.pyc(1.36 KB)
ðŸ“„ fix_ws_comma.pyo(1.36 KB)
ðŸ“„ fix_xrange.py(2.64 KB)
ðŸ“„ fix_xrange.pyc(3.01 KB)
ðŸ“„ fix_xrange.pyo(3.01 KB)
ðŸ“„ fix_xreadlines.py(690 B)
ðŸ“„ fix_xreadlines.pyc(1.14 KB)
ðŸ“„ fix_xreadlines.pyo(1.14 KB)
ðŸ“„ fix_zip.py(904 B)
ðŸ“„ fix_zip.pyc(1.33 KB)
ðŸ“„ fix_zip.pyo(1.33 KB)

Editing: fix_idioms.py

"""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]

X7ROOT File Manager

Editing: fix_idioms.py

Upload File

Create Folder