Gecko [ renovalkoronred.com.tr ]

Name	Size	Permission
__pycache__	[ DIR ]	drwxr-xr-x
__init__.py	47 B	-rw-r--r--
fix_apply.py	2.29 KB	-rw-r--r--
fix_asserts.py	984 B	-rw-r--r--
fix_basestring.py	320 B	-rw-r--r--
fix_buffer.py	590 B	-rw-r--r--
fix_dict.py	3.67 KB	-rw-r--r--
fix_except.py	3.27 KB	-rw-r--r--
fix_exec.py	979 B	-rw-r--r--
fix_execfile.py	2 KB	-rw-r--r--
fix_exitfunc.py	2.44 KB	-rw-r--r--
fix_filter.py	2.7 KB	-rw-r--r--
fix_funcattrs.py	644 B	-rw-r--r--
fix_future.py	547 B	-rw-r--r--
fix_getcwdu.py	451 B	-rw-r--r--
fix_has_key.py	3.12 KB	-rw-r--r--
fix_idioms.py	4.76 KB	-rw-r--r--
fix_import.py	3.18 KB	-rw-r--r--
fix_imports.py	5.55 KB	-rw-r--r--
fix_imports2.py	289 B	-rw-r--r--
fix_input.py	708 B	-rw-r--r--
fix_intern.py	1.12 KB	-rw-r--r--
fix_isinstance.py	1.57 KB	-rw-r--r--
fix_itertools.py	1.51 KB	-rw-r--r--
fix_itertools_imports.py	2.04 KB	-rw-r--r--
fix_long.py	476 B	-rw-r--r--
fix_map.py	3.55 KB	-rw-r--r--
fix_metaclass.py	8 KB	-rw-r--r--
fix_methodattrs.py	606 B	-rw-r--r--
fix_ne.py	571 B	-rw-r--r--
fix_next.py	3.1 KB	-rw-r--r--
fix_nonzero.py	591 B	-rw-r--r--
fix_numliterals.py	768 B	-rw-r--r--
fix_operator.py	3.35 KB	-rw-r--r--
fix_paren.py	1.2 KB	-rw-r--r--
fix_print.py	2.78 KB	-rw-r--r--
fix_raise.py	2.86 KB	-rw-r--r--
fix_raw_input.py	454 B	-rw-r--r--
fix_reduce.py	837 B	-rw-r--r--
fix_reload.py	1.06 KB	-rw-r--r--
fix_renames.py	2.17 KB	-rw-r--r--
fix_repr.py	613 B	-rw-r--r--
fix_set_literal.py	1.66 KB	-rw-r--r--
fix_standarderror.py	449 B	-rw-r--r--
fix_sys_exc.py	1.01 KB	-rw-r--r--
fix_throw.py	1.54 KB	-rw-r--r--
fix_tuple_params.py	5.43 KB	-rw-r--r--
fix_types.py	1.73 KB	-rw-r--r--
fix_unicode.py	1.23 KB	-rw-r--r--
fix_urllib.py	8.17 KB	-rw-r--r--
fix_ws_comma.py	1.06 KB	-rw-r--r--
fix_xrange.py	2.63 KB	-rw-r--r--
fix_xreadlines.py	689 B	-rw-r--r--
fix_zip.py	1.26 KB	-rw-r--r--

Code Editor : fix_dict.py

# 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 .. import fixer_base
from ..fixer_util import Name, Call, Dot
from .. import fixer_util

iter_exempt = fixer_util.consuming_calls | {"iter"}

class FixDict(fixer_base.BaseFix):
    BM_compatible = True

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("iter")
        isview = method_name.startswith("view")
        if isiter or isview:
            method_name = method_name[4:]
        assert method_name in ("keys", "items", "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 = ""
            new = Call(Name("iter" if isiter else "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

${this.title}

Code Editor : fix_dict.py