golden hour

/usr/lib/python3.8/lib2to3/fixes

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

Edit: fix_next.py

"""Fixer for it.next() -> next(it), per PEP 3114."""
# Author: Collin Winter

# Things that currently aren't covered:
#   - listcomp "next" names aren't warned
#   - "with" statement targets aren't checked

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

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

class FixNext(fixer_base.BaseFix):
    BM_compatible = True
    PATTERN = """
    power< base=any+ trailer< '.' attr='next' > trailer< '(' ')' > >
    |
    power< head=any+ trailer< '.' attr='next' > not trailer< '(' ')' > >
    |
    classdef< 'class' any+ ':'
              suite< any*
                     funcdef< 'def'
                              name='next'
                              parameters< '(' NAME ')' > any+ >
                     any* > >
    |
    global=global_stmt< 'global' any* 'next' any* >
    """

order = "pre" # Pre-order tree traversal

def start_tree(self, tree, filename):
        super(FixNext, 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:
                attr.replace(Name("__next__", prefix=attr.prefix))
            else:
                base = [n.clone() for n in base]
                base[0].prefix = ""
                node.replace(Call(Name("next", prefix=node.prefix), base))
        elif name:
            n = Name("__next__", prefix=name.prefix)
            name.replace(n)
        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
            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)