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

# 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