/snap/core18/2999/usr/lib/python3.6/lib2to3/fixes
NameSizeModeActions
__pycache__/-0755rm
fix_apply.py24300644editdlrm
fix_asserts.py9840644editdlrm
fix_basestring.py3200644editdlrm
fix_buffer.py5900644editdlrm
fix_dict.py37600644editdlrm
fix_except.py33440644editdlrm
fix_exec.py9790644editdlrm
fix_execfile.py20480644editdlrm
fix_exitfunc.py24950644editdlrm
fix_filter.py26510644editdlrm
fix_funcattrs.py6440644editdlrm
fix_future.py5470644editdlrm
fix_getcwdu.py4510644editdlrm
fix_has_key.py31960644editdlrm
fix_idioms.py48760644editdlrm
fix_import.py32560644editdlrm
fix_imports.py56840644editdlrm
fix_imports2.py2890644editdlrm
fix_input.py7080644editdlrm
fix_intern.py12350644editdlrm
fix_isinstance.py16080644editdlrm
fix_itertools.py15480644editdlrm
fix_itertools_imports.py20860644editdlrm
fix_long.py4760644editdlrm
fix_map.py36400644editdlrm
fix_metaclass.py81970644editdlrm
fix_methodattrs.py6060644editdlrm
fix_ne.py5710644editdlrm
fix_next.py31740644editdlrm
fix_nonzero.py5910644editdlrm
fix_numliterals.py7680644editdlrm
fix_operator.py34710644editdlrm
fix_paren.py12270644editdlrm
fix_print.py28440644editdlrm
fix_raise.py29260644editdlrm
fix_raw_input.py4540644editdlrm
fix_reduce.py8370644editdlrm
fix_reload.py11540644editdlrm
fix_renames.py22210644editdlrm
fix_repr.py6130644editdlrm
fix_set_literal.py16970644editdlrm
fix_standarderror.py4490644editdlrm
fix_sys_exc.py10340644editdlrm
fix_throw.py15820644editdlrm
fix_tuple_params.py55650644editdlrm
fix_types.py17740644editdlrm
fix_unicode.py12560644editdlrm
fix_urllib.py83530644editdlrm
fix_ws_comma.py10900644editdlrm
fix_xrange.py26940644editdlrm
fix_xreadlines.py6890644editdlrm
fix_zip.py12890644editdlrm
__init__.py470644editdlrm
Edit: /snap/core18/2999/usr/lib/python3.6/lib2to3/fixes/fix_has_key.py (3196B)
# 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) arg=any ','> ) ')' > after=any* > | negation=not_test< 'not' anchor=power< before=any+ trailer< '.' 'has_key' > trailer< '(' ( not(arglist | argument) 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