Geforce File Manager

NAME	SIZE	ACTIONS
📁 __pycache__		[ DEL ]
📄 __init__.py	47 B	[ EDIT ] \| [ DEL ]
📄 fix_apply.py	2,430 B	[ EDIT ] \| [ DEL ]
📄 fix_asserts.py	984 B	[ EDIT ] \| [ DEL ]
📄 fix_basestring.py	320 B	[ EDIT ] \| [ DEL ]
📄 fix_buffer.py	590 B	[ EDIT ] \| [ DEL ]
📄 fix_dict.py	3,760 B	[ EDIT ] \| [ DEL ]
📄 fix_except.py	3,344 B	[ EDIT ] \| [ DEL ]
📄 fix_exec.py	979 B	[ EDIT ] \| [ DEL ]
📄 fix_execfile.py	2,048 B	[ EDIT ] \| [ DEL ]
📄 fix_exitfunc.py	2,495 B	[ EDIT ] \| [ DEL ]
📄 fix_filter.py	2,651 B	[ EDIT ] \| [ DEL ]
📄 fix_funcattrs.py	644 B	[ EDIT ] \| [ DEL ]
📄 fix_future.py	547 B	[ EDIT ] \| [ DEL ]
📄 fix_getcwdu.py	451 B	[ EDIT ] \| [ DEL ]
📄 fix_has_key.py	3,196 B	[ EDIT ] \| [ DEL ]
📄 fix_idioms.py	4,876 B	[ EDIT ] \| [ DEL ]
📄 fix_import.py	3,256 B	[ EDIT ] \| [ DEL ]
📄 fix_imports.py	5,684 B	[ EDIT ] \| [ DEL ]
📄 fix_imports2.py	289 B	[ EDIT ] \| [ DEL ]
📄 fix_input.py	708 B	[ EDIT ] \| [ DEL ]
📄 fix_intern.py	1,235 B	[ EDIT ] \| [ DEL ]
📄 fix_isinstance.py	1,608 B	[ EDIT ] \| [ DEL ]
📄 fix_itertools.py	1,548 B	[ EDIT ] \| [ DEL ]
📄 fix_itertools_imports.py	2,086 B	[ EDIT ] \| [ DEL ]
📄 fix_long.py	476 B	[ EDIT ] \| [ DEL ]
📄 fix_map.py	3,640 B	[ EDIT ] \| [ DEL ]
📄 fix_metaclass.py	8,197 B	[ EDIT ] \| [ DEL ]
📄 fix_methodattrs.py	606 B	[ EDIT ] \| [ DEL ]
📄 fix_ne.py	571 B	[ EDIT ] \| [ DEL ]
📄 fix_next.py	3,174 B	[ EDIT ] \| [ DEL ]
📄 fix_nonzero.py	591 B	[ EDIT ] \| [ DEL ]
📄 fix_numliterals.py	768 B	[ EDIT ] \| [ DEL ]
📄 fix_operator.py	3,471 B	[ EDIT ] \| [ DEL ]
📄 fix_paren.py	1,227 B	[ EDIT ] \| [ DEL ]
📄 fix_print.py	2,844 B	[ EDIT ] \| [ DEL ]
📄 fix_raise.py	2,926 B	[ EDIT ] \| [ DEL ]
📄 fix_raw_input.py	454 B	[ EDIT ] \| [ DEL ]
📄 fix_reduce.py	837 B	[ EDIT ] \| [ DEL ]
📄 fix_reload.py	1,154 B	[ EDIT ] \| [ DEL ]
📄 fix_renames.py	2,221 B	[ EDIT ] \| [ DEL ]
📄 fix_repr.py	613 B	[ EDIT ] \| [ DEL ]
📄 fix_set_literal.py	1,697 B	[ EDIT ] \| [ DEL ]
📄 fix_standarderror.py	449 B	[ EDIT ] \| [ DEL ]
📄 fix_sys_exc.py	1,034 B	[ EDIT ] \| [ DEL ]
📄 fix_throw.py	1,582 B	[ EDIT ] \| [ DEL ]
📄 fix_tuple_params.py	5,565 B	[ EDIT ] \| [ DEL ]
📄 fix_types.py	1,774 B	[ EDIT ] \| [ DEL ]
📄 fix_unicode.py	1,256 B	[ EDIT ] \| [ DEL ]
📄 fix_urllib.py	8,353 B	[ EDIT ] \| [ DEL ]
📄 fix_ws_comma.py	1,090 B	[ EDIT ] \| [ DEL ]
📄 fix_xrange.py	2,694 B	[ EDIT ] \| [ DEL ]
📄 fix_xreadlines.py	689 B	[ EDIT ] \| [ DEL ]
📄 fix_zip.py	1,289 B	[ EDIT ] \| [ DEL ]

[ CLOSE ]

EDIT: fix_tuple_params.py

"""Fixer for function definitions with tuple parameters.

def func(((a, b), c), d):
    ...

def func(x, d):
    ((a, b), c) = x
    ...

It will also support lambdas:

lambda (x, y): x + y -> lambda t: t[0] + t[1]

# The parens are a syntax error in Python 3
    lambda (x): x + y -> lambda x: x + y
"""
# Author: Collin Winter

# Local imports
from .. import pytree
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Assign, Name, Newline, Number, Subscript, syms

def is_docstring(stmt):
    return isinstance(stmt, pytree.Node) and \
           stmt.children[0].type == token.STRING

class FixTupleParams(fixer_base.BaseFix):
    run_order = 4 #use a lower order since lambda is part of other
                  #patterns
    BM_compatible = True

PATTERN = """
              funcdef< 'def' any parameters< '(' args=any ')' >
                       ['->' any] ':' suite=any+ >
              |
              lambda=
              lambdef< 'lambda' args=vfpdef< '(' inner=any ')' >
                       ':' body=any
              >
              """

def transform(self, node, results):
        if "lambda" in results:
            return self.transform_lambda(node, results)

new_lines = []
        suite = results["suite"]
        args = results["args"]
        # This crap is so "def foo(...): x = 5; y = 7" is handled correctly.
        # TODO(cwinter): suite-cleanup
        if suite[0].children[1].type == token.INDENT:
            start = 2
            indent = suite[0].children[1].value
            end = Newline()
        else:
            start = 0
            indent = "; "
            end = pytree.Leaf(token.INDENT, "")

# We need access to self for new_name(), and making this a method
        #  doesn't feel right. Closing over self and new_lines makes the
        #  code below cleaner.
        def handle_tuple(tuple_arg, add_prefix=False):
            n = Name(self.new_name())
            arg = tuple_arg.clone()
            arg.prefix = ""
            stmt = Assign(arg, n.clone())
            if add_prefix:
                n.prefix = " "
            tuple_arg.replace(n)
            new_lines.append(pytree.Node(syms.simple_stmt,
                                         [stmt, end.clone()]))

if args.type == syms.tfpdef:
            handle_tuple(args)
        elif args.type == syms.typedargslist:
            for i, arg in enumerate(args.children):
                if arg.type == syms.tfpdef:
                    # Without add_prefix, the emitted code is correct,
                    #  just ugly.
                    handle_tuple(arg, add_prefix=(i > 0))

if not new_lines:
            return

# This isn't strictly necessary, but it plays nicely with other fixers.
        # TODO(cwinter) get rid of this when children becomes a smart list
        for line in new_lines:
            line.parent = suite[0]

# TODO(cwinter) suite-cleanup
        after = start
        if start == 0:
            new_lines[0].prefix = " "
        elif is_docstring(suite[0].children[start]):
            new_lines[0].prefix = indent
            after = start + 1

for line in new_lines:
            line.parent = suite[0]
        suite[0].children[after:after] = new_lines
        for i in range(after+1, after+len(new_lines)+1):
            suite[0].children[i].prefix = indent
        suite[0].changed()

def transform_lambda(self, node, results):
        args = results["args"]
        body = results["body"]
        inner = simplify_args(results["inner"])

# Replace lambda ((((x)))): x  with lambda x: x
        if inner.type == token.NAME:
            inner = inner.clone()
            inner.prefix = " "
            args.replace(inner)
            return

params = find_params(args)
        to_index = map_to_index(params)
        tup_name = self.new_name(tuple_name(params))

new_param = Name(tup_name, prefix=" ")
        args.replace(new_param.clone())
        for n in body.post_order():
            if n.type == token.NAME and n.value in to_index:
                subscripts = [c.clone() for c in to_index[n.value]]
                new = pytree.Node(syms.power,
                                  [new_param.clone()] + subscripts)
                new.prefix = n.prefix
                n.replace(new)

### Helper functions for transform_lambda()

def simplify_args(node):
    if node.type in (syms.vfplist, token.NAME):
        return node
    elif node.type == syms.vfpdef:
        # These look like vfpdef< '(' x ')' > where x is NAME
        # or another vfpdef instance (leading to recursion).
        while node.type == syms.vfpdef:
            node = node.children[1]
        return node
    raise RuntimeError("Received unexpected node %s" % node)

def find_params(node):
    if node.type == syms.vfpdef:
        return find_params(node.children[1])
    elif node.type == token.NAME:
        return node.value
    return [find_params(c) for c in node.children if c.type != token.COMMA]

def map_to_index(param_list, prefix=[], d=None):
    if d is None:
        d = {}
    for i, obj in enumerate(param_list):
        trailer = [Subscript(Number(str(i)))]
        if isinstance(obj, list):
            map_to_index(obj, trailer, d=d)
        else:
            d[obj] = prefix + trailer
    return d

def tuple_name(param_list):
    l = []
    for obj in param_list:
        if isinstance(obj, list):
            l.append(tuple_name(obj))
        else:
            l.append(obj)
    return "_".join(l)