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

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

"""Fixer for has_key().

Calls to .has_key() methods are expressed in terms of the 'in'
operator:

d.has_key(k) -> k in d

CAVEATS:
1) While the primary target of this fixer is dict.has_key(), the
   fixer will change any has_key() method call, regardless of its
   class.

2) Cases like this will not be converted:

m = d.has_key
    if m(k):
        ...

Only *calls* to has_key() are converted. While it is possible to
   convert the above to something like

m = d.__contains__
    if m(k):
        ...

this is currently not done.
"""

# Local imports
from .. import pytree
from .. import fixer_base
from ..fixer_util import Name, parenthesize

class FixHasKey(fixer_base.BaseFix):
    BM_compatible = True

PATTERN = """
    anchor=power<
        before=any+
        trailer< '.' 'has_key' >
        trailer<
            '('
            ( not(arglist | argument<any '=' any>) arg=any
            | arglist<(not argument<any '=' any>) arg=any ','>
            )
            ')'
        >
        after=any*
    >
    |
    negation=not_test<
        'not'
        anchor=power<
            before=any+
            trailer< '.' 'has_key' >
            trailer<
                '('
                ( not(arglist | argument<any '=' any>) arg=any
                | arglist<(not argument<any '=' any>) arg=any ','>
                )
                ')'
            >
        >
    >
    """

def transform(self, node, results):
        assert results
        syms = self.syms
        if (node.parent.type == syms.not_test and
            self.pattern.match(node.parent)):
            # Don't transform a node matching the first alternative of the
            # pattern when its parent matches the second alternative
            return None
        negation = results.get("negation")
        anchor = results["anchor"]
        prefix = node.prefix
        before = [n.clone() for n in results["before"]]
        arg = results["arg"].clone()
        after = results.get("after")
        if after:
            after = [n.clone() for n in after]
        if arg.type in (syms.comparison, syms.not_test, syms.and_test,
                        syms.or_test, syms.test, syms.lambdef, syms.argument):
            arg = parenthesize(arg)
        if len(before) == 1:
            before = before[0]
        else:
            before = pytree.Node(syms.power, before)
        before.prefix = " "
        n_op = Name("in", prefix=" ")
        if negation:
            n_not = Name("not", prefix=" ")
            n_op = pytree.Node(syms.comp_op, (n_not, n_op))
        new = pytree.Node(syms.comparison, (arg, n_op, before))
        if after:
            new = parenthesize(new)
            new = pytree.Node(syms.power, (new,) + tuple(after))
        if node.parent.type in (syms.comparison, syms.expr, syms.xor_expr,
                                syms.and_expr, syms.shift_expr,
                                syms.arith_expr, syms.term,
                                syms.factor, syms.power):
            new = parenthesize(new)
        new.prefix = prefix
        return new