FM / fixes

/usr/lib64/python3.9/lib2to3/fixes

Name	Size	Mode	Actions
__pycache__/	-	0755	rm
fix_apply.py	2346	0644	edit dl rm
fix_asserts.py	984	0644	edit dl rm
fix_basestring.py	320	0644	edit dl rm
fix_buffer.py	590	0644	edit dl rm
fix_dict.py	3760	0644	edit dl rm
fix_except.py	3344	0644	edit dl rm
fix_exec.py	979	0644	edit dl rm
fix_execfile.py	2048	0644	edit dl rm
fix_exitfunc.py	2495	0644	edit dl rm
fix_filter.py	2765	0644	edit dl rm
fix_funcattrs.py	644	0644	edit dl rm
fix_future.py	547	0644	edit dl rm
fix_getcwdu.py	451	0644	edit dl rm
fix_has_key.py	3196	0644	edit dl rm
fix_idioms.py	4876	0644	edit dl rm
fix_import.py	3256	0644	edit dl rm
fix_imports.py	5684	0644	edit dl rm
fix_imports2.py	289	0644	edit dl rm
fix_input.py	708	0644	edit dl rm
fix_intern.py	1144	0644	edit dl rm
fix_isinstance.py	1608	0644	edit dl rm
fix_itertools.py	1548	0644	edit dl rm
fix_itertools_imports.py	2086	0644	edit dl rm
fix_long.py	476	0644	edit dl rm
fix_map.py	3640	0644	edit dl rm
fix_metaclass.py	8197	0644	edit dl rm
fix_methodattrs.py	606	0644	edit dl rm
fix_ne.py	571	0644	edit dl rm
fix_next.py	3174	0644	edit dl rm
fix_nonzero.py	591	0644	edit dl rm
fix_numliterals.py	768	0644	edit dl rm
fix_operator.py	3426	0644	edit dl rm
fix_paren.py	1226	0644	edit dl rm
fix_print.py	2844	0644	edit dl rm
fix_raise.py	2926	0644	edit dl rm
fix_raw_input.py	454	0644	edit dl rm
fix_reduce.py	837	0644	edit dl rm
fix_reload.py	1081	0644	edit dl rm
fix_renames.py	2221	0644	edit dl rm
fix_repr.py	613	0644	edit dl rm
fix_set_literal.py	1697	0644	edit dl rm
fix_standarderror.py	449	0644	edit dl rm
fix_sys_exc.py	1034	0644	edit dl rm
fix_throw.py	1582	0644	edit dl rm
fix_tuple_params.py	5565	0644	edit dl rm
fix_types.py	1774	0644	edit dl rm
fix_unicode.py	1256	0644	edit dl rm
fix_urllib.py	8367	0644	edit dl rm
fix_ws_comma.py	1090	0644	edit dl rm
fix_xrange.py	2694	0644	edit dl rm
fix_xreadlines.py	689	0644	edit dl rm
fix_zip.py	1289	0644	edit dl rm
__init__.py	47	0644	edit dl rm

Edit: /usr/lib64/python3.9/lib2to3/fixes/fix_next.py (3174B)

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

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