Gecko [ renovalkoronred.com.tr ]

Name	Size	Permission
__pycache__	[ DIR ]	drwxr-xr-x
__init__.py	5.11 KB	-rw-r--r--
fix_UserDict.py	3.75 KB	-rw-r--r--
fix_absolute_import.py	3.07 KB	-rw-r--r--
fix_add__future__imports_excep...	662 B	-rw-r--r--
fix_basestring.py	394 B	-rw-r--r--
fix_bytes.py	685 B	-rw-r--r--
fix_cmp.py	701 B	-rw-r--r--
fix_division.py	228 B	-rw-r--r--
fix_division_safe.py	3.55 KB	-rw-r--r--
fix_execfile.py	921 B	-rw-r--r--
fix_future_builtins.py	1.98 KB	-rw-r--r--
fix_future_standard_library.py	733 B	-rw-r--r--
fix_future_standard_library_ur...	1001 B	-rw-r--r--
fix_input.py	687 B	-rw-r--r--
fix_metaclass.py	9.34 KB	-rw-r--r--
fix_next_call.py	3.08 KB	-rw-r--r--
fix_object.py	407 B	-rw-r--r--
fix_oldstr_wrap.py	1.19 KB	-rw-r--r--
fix_order___future__imports.py	829 B	-rw-r--r--
fix_print.py	3.79 KB	-rw-r--r--
fix_print_with_import.py	735 B	-rw-r--r--
fix_raise.py	3.81 KB	-rw-r--r--
fix_remove_old__future__import...	851 B	-rw-r--r--
fix_unicode_keep_u.py	779 B	-rw-r--r--
fix_unicode_literals_import.py	367 B	-rw-r--r--
fix_xrange_with_import.py	479 B	-rw-r--r--

Code Editor : fix_next_call.py

"""
Based on fix_next.py by Collin Winter.

Replaces it.next() -> next(it), per PEP 3114.

Unlike fix_next.py, this fixer doesn't replace the name of a next method with __next__,
which would break Python 2 compatibility without further help from fixers in
stage 2.
"""

# Local imports
from lib2to3.pgen2 import token
from lib2to3.pygram import python_symbols as syms
from lib2to3 import fixer_base
from lib2to3.fixer_util import Name, Call, find_binding

bind_warning = "Calls to builtin next() possibly shadowed by global binding"

class FixNextCall(fixer_base.BaseFix):
    BM_compatible = True
    PATTERN = """
    power< base=any+ trailer< '.' attr='next' > trailer< '(' ')' > >
    |
    power< head=any+ trailer< '.' attr='next' > not trailer< '(' ')' > >
    |
    global=global_stmt< 'global' any* 'next' any* >
    """

order = "pre" # Pre-order tree traversal

def start_tree(self, tree, filename):
        super(FixNextCall, self).start_tree(tree, filename)

n = find_binding('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:
                # Omit this:
                # attr.replace(Name("__next__", prefix=attr.prefix))
                pass
            else:
                base = [n.clone() for n in base]
                base[0].prefix = ""
                node.replace(Call(Name("next", prefix=node.prefix), base))
        elif name:
            # Omit this:
            # n = Name("__next__", prefix=name.prefix)
            # name.replace(n)
            pass
        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() == '__builtin__':
                    self.warning(node, bind_warning)
                return
            # Omit this:
            # attr.replace(Name("__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)

${this.title}

Code Editor : fix_next_call.py