0UT1S's

usr/lib64/python2.7/lib2to3/fixes/

By Order of Mr.0UT1S

N/A

47 bytes

133 bytes

133 bytes

2.38 KB

2.04 KB

2.00 KB

984 bytes

fix_asserts.pyc

1.52 KB

fix_asserts.pyo

1.52 KB

fix_basestring.py

321 bytes

fix_basestring.pyc

807 bytes

fix_basestring.pyo

807 bytes

591 bytes

964 bytes

964 bytes

3.73 KB

3.68 KB

3.56 KB

3.27 KB

2.94 KB

2.94 KB

1002 bytes

1.40 KB

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

2.06 KB

2.22 KB

2.22 KB

fix_funcattrs.py

645 bytes

fix_funcattrs.pyc

1.10 KB

fix_funcattrs.pyo

1.10 KB

547 bytes

933 bytes

933 bytes

452 bytes

fix_getcwdu.pyc

940 bytes

fix_getcwdu.pyo

940 bytes

3.15 KB

fix_has_key.pyc

3.12 KB

fix_has_key.pyo

3.09 KB

4.77 KB

4.43 KB

4.33 KB

3.18 KB

3.18 KB

3.18 KB

5.56 KB

fix_imports.pyc

5.25 KB

fix_imports.pyo

5.25 KB

fix_imports2.py

289 bytes

fix_imports2.pyc

634 bytes

fix_imports2.pyo

634 bytes

710 bytes

1.12 KB

1.12 KB

1.82 KB

1.75 KB

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

477 bytes

855 bytes

855 bytes

2.99 KB

2.98 KB

2.98 KB

fix_metaclass.py

8.02 KB

fix_metaclass.pyc

6.45 KB

fix_metaclass.pyo

6.40 KB

fix_methodattrs.py

615 bytes

fix_methodattrs.pyc

1.13 KB

fix_methodattrs.pyo

1.13 KB

573 bytes

1001 bytes

1001 bytes

3.11 KB

3.47 KB

3.44 KB

598 bytes

fix_nonzero.pyc

1.07 KB

fix_nonzero.pyo

1.07 KB

fix_numliterals.py

773 bytes

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

1.20 KB

1.52 KB

1.52 KB

2.80 KB

2.68 KB

2.58 KB

2.87 KB

2.45 KB

2.45 KB

fix_raw_input.py

455 bytes

fix_raw_input.pyc

950 bytes

fix_raw_input.pyo

950 bytes

839 bytes

1.25 KB

1.25 KB

2.17 KB

fix_renames.pyc

2.41 KB

fix_renames.pyo

2.41 KB

614 bytes

1.01 KB

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 bytes

fix_standarderror.pyc

867 bytes

fix_standarderror.pyo

867 bytes

1.01 KB

fix_sys_exc.pyc

1.68 KB

fix_sys_exc.pyo

1.68 KB

1.55 KB

1.96 KB

1.96 KB

fix_tuple_params.py

5.45 KB

fix_tuple_params.pyc

5.33 KB

fix_tuple_params.pyo

5.33 KB

1.77 KB

2.16 KB

2.16 KB

1.24 KB

fix_unicode.pyc

1.69 KB

fix_unicode.pyo

1.69 KB

8.19 KB

6.99 KB

6.99 KB

fix_ws_comma.py

1.07 KB

fix_ws_comma.pyc

1.36 KB

fix_ws_comma.pyo

1.36 KB

2.64 KB

3.01 KB

3.01 KB

fix_xreadlines.py

690 bytes

fix_xreadlines.pyc

1.14 KB

fix_xreadlines.pyo

1.14 KB

904 bytes

1.33 KB

1.33 KB

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