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_except.py

"""Fixer for except statements with named exceptions.

The following cases will be converted:

- "except E, T:" where T is a name:

except E as T:

- "except E, T:" where T is not a name, tuple or list:

except E as t:
            T = t

This is done because the target of an "except" clause must be a
    name.

- "except E, T:" where T is a tuple or list literal:

except E as t:
            T = t.args
"""
# Author: Collin Winter

# Local imports
from .. import pytree
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Assign, Attr, Name, is_tuple, is_list, syms

def find_excepts(nodes):
    for i, n in enumerate(nodes):
        if n.type == syms.except_clause:
            if n.children[0].value == 'except':
                yield (n, nodes[i+2])

class FixExcept(fixer_base.BaseFix):
    BM_compatible = True

PATTERN = """
    try_stmt< 'try' ':' (simple_stmt | suite)
                  cleanup=(except_clause ':' (simple_stmt | suite))+
                  tail=(['except' ':' (simple_stmt | suite)]
                        ['else' ':' (simple_stmt | suite)]
                        ['finally' ':' (simple_stmt | suite)]) >
    """

def transform(self, node, results):
        syms = self.syms

tail = [n.clone() for n in results["tail"]]

try_cleanup = [ch.clone() for ch in results["cleanup"]]
        for except_clause, e_suite in find_excepts(try_cleanup):
            if len(except_clause.children) == 4:
                (E, comma, N) = except_clause.children[1:4]
                comma.replace(Name("as", prefix=" "))

if N.type != token.NAME:
                    # Generate a new N for the except clause
                    new_N = Name(self.new_name(), prefix=" ")
                    target = N.clone()
                    target.prefix = ""
                    N.replace(new_N)
                    new_N = new_N.clone()

# Insert "old_N = new_N" as the first statement in
                    #  the except body. This loop skips leading whitespace
                    #  and indents
                    #TODO(cwinter) suite-cleanup
                    suite_stmts = e_suite.children
                    for i, stmt in enumerate(suite_stmts):
                        if isinstance(stmt, pytree.Node):
                            break

# The assignment is different if old_N is a tuple or list
                    # In that case, the assignment is old_N = new_N.args
                    if is_tuple(N) or is_list(N):
                        assign = Assign(target, Attr(new_N, Name('args')))
                    else:
                        assign = Assign(target, new_N)

#TODO(cwinter) stopgap until children becomes a smart list
                    for child in reversed(suite_stmts[:i]):
                        e_suite.insert_child(0, child)
                    e_suite.insert_child(i, assign)
                elif N.prefix == "":
                    # No space after a comma is legal; no space after "as",
                    # not so much.
                    N.prefix = " "

#TODO(cwinter) fix this when children becomes a smart list
        children = [c.clone() for c in node.children[:3]] + try_cleanup + tail
        return pytree.Node(node.type, children)