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

# Copyright 2007 Google, Inc. All Rights Reserved.
# Licensed to PSF under a Contributor Agreement.

"""Fixer that changes map(F, ...) into list(map(F, ...)) unless there
exists a 'from future_builtins import map' statement in the top-level
namespace.

As a special case, map(None, X) is changed into list(X).  (This is
necessary because the semantics are changed in this case -- the new
map(None, X) is equivalent to [(x,) for x in X].)

We avoid the transformation (except for the special case mentioned
above) if the map() call is directly contained in iter(<>), list(<>),
tuple(<>), sorted(<>), ...join(<>), or for V in <>:.

NOTE: This is still not correct if the original code was depending on
map(F, X, Y, ...) to go on until the longest argument is exhausted,
substituting None for missing values -- like zip(), it now stops as
soon as the shortest argument is exhausted.
"""

# Local imports
from ..pgen2 import token
from .. import fixer_base
from ..fixer_util import Name, ArgList, Call, ListComp, in_special_context
from ..pygram import python_symbols as syms
from ..pytree import Node

class FixMap(fixer_base.ConditionalFix):
    BM_compatible = True

PATTERN = """
    map_none=power<
        'map'
        trailer< '(' arglist< 'None' ',' arg=any [','] > ')' >
        [extra_trailers=trailer*]
    >
    |
    map_lambda=power<
        'map'
        trailer<
            '('
            arglist<
                lambdef< 'lambda'
                         (fp=NAME | vfpdef< '(' fp=NAME ')'> ) ':' xp=any
                >
                ','
                it=any
            >
            ')'
        >
        [extra_trailers=trailer*]
    >
    |
    power<
        'map' args=trailer< '(' [any] ')' >
        [extra_trailers=trailer*]
    >
    """

skip_on = 'future_builtins.map'

def transform(self, node, results):
        if self.should_skip(node):
            return

trailers = []
        if 'extra_trailers' in results:
            for t in results['extra_trailers']:
                trailers.append(t.clone())

if node.parent.type == syms.simple_stmt:
            self.warning(node, "You should use a for loop here")
            new = node.clone()
            new.prefix = ""
            new = Call(Name("list"), [new])
        elif "map_lambda" in results:
            new = ListComp(results["xp"].clone(),
                           results["fp"].clone(),
                           results["it"].clone())
            new = Node(syms.power, [new] + trailers, prefix="")

else:
            if "map_none" in results:
                new = results["arg"].clone()
                new.prefix = ""
            else:
                if "args" in results:
                    args = results["args"]
                    if args.type == syms.trailer and \
                       args.children[1].type == syms.arglist and \
                       args.children[1].children[0].type == token.NAME and \
                       args.children[1].children[0].value == "None":
                        self.warning(node, "cannot convert map(None, ...) "
                                     "with multiple arguments because map() "
                                     "now truncates to the shortest sequence")
                        return

new = Node(syms.power, [Name("map"), args.clone()])
                    new.prefix = ""

if in_special_context(node):
                    return None

new = Node(syms.power, [Name("list"), ArgList([new])] + trailers)
            new.prefix = ""

new.prefix = node.prefix
        return new