//usr/lib64/python3.9/lib2to3/fixes
54 items
NAME ↑ SIZE MODIFIED PERMS ACTIONS
.. / Parent Directory
__pycache__ — dir
2026-06-03 15:44 · rwxr-xr-x
— 2026-06-03 15:44 rwxr-xr-x
__init__.py — 47 B
2025-10-31 18:40 · rw-r--r--
47 B 2025-10-31 18:40 rw-r--r--
fix_apply.py — 2.29 KB
2025-10-31 18:40 · rw-r--r--
2.29 KB 2025-10-31 18:40 rw-r--r--
fix_asserts.py — 984 B
2025-10-31 18:40 · rw-r--r--
984 B 2025-10-31 18:40 rw-r--r--
fix_basestring.py — 320 B
2025-10-31 18:40 · rw-r--r--
320 B 2025-10-31 18:40 rw-r--r--
fix_buffer.py — 590 B
2025-10-31 18:40 · rw-r--r--
590 B 2025-10-31 18:40 rw-r--r--
fix_dict.py — 3.67 KB
2025-10-31 18:40 · rw-r--r--
3.67 KB 2025-10-31 18:40 rw-r--r--
fix_except.py — 3.27 KB
2025-10-31 18:40 · rw-r--r--
3.27 KB 2025-10-31 18:40 rw-r--r--
fix_exec.py — 979 B
2025-10-31 18:40 · rw-r--r--
979 B 2025-10-31 18:40 rw-r--r--
fix_execfile.py — 2 KB
2025-10-31 18:40 · rw-r--r--
2 KB 2025-10-31 18:40 rw-r--r--
fix_exitfunc.py — 2.44 KB
2025-10-31 18:40 · rw-r--r--
2.44 KB 2025-10-31 18:40 rw-r--r--
fix_filter.py — 2.7 KB
2025-10-31 18:40 · rw-r--r--
2.7 KB 2025-10-31 18:40 rw-r--r--
fix_funcattrs.py — 644 B
2025-10-31 18:40 · rw-r--r--
644 B 2025-10-31 18:40 rw-r--r--
fix_future.py — 547 B
2025-10-31 18:40 · rw-r--r--
547 B 2025-10-31 18:40 rw-r--r--
fix_getcwdu.py — 451 B
2025-10-31 18:40 · rw-r--r--
451 B 2025-10-31 18:40 rw-r--r--
fix_has_key.py — 3.12 KB
2025-10-31 18:40 · rw-r--r--
3.12 KB 2025-10-31 18:40 rw-r--r--
fix_idioms.py — 4.76 KB
2025-10-31 18:40 · rw-r--r--
4.76 KB 2025-10-31 18:40 rw-r--r--
fix_import.py — 3.18 KB
2025-10-31 18:40 · rw-r--r--
3.18 KB 2025-10-31 18:40 rw-r--r--
fix_imports.py — 5.55 KB
2025-10-31 18:40 · rw-r--r--
5.55 KB 2025-10-31 18:40 rw-r--r--
fix_imports2.py — 289 B
2025-10-31 18:40 · rw-r--r--
289 B 2025-10-31 18:40 rw-r--r--
fix_input.py — 708 B
2025-10-31 18:40 · rw-r--r--
708 B 2025-10-31 18:40 rw-r--r--
fix_intern.py — 1.12 KB
2025-10-31 18:40 · rw-r--r--
1.12 KB 2025-10-31 18:40 rw-r--r--
fix_isinstance.py — 1.57 KB
2025-10-31 18:40 · rw-r--r--
1.57 KB 2025-10-31 18:40 rw-r--r--
fix_itertools.py — 1.51 KB
2025-10-31 18:40 · rw-r--r--
1.51 KB 2025-10-31 18:40 rw-r--r--
fix_itertools_imports.py — 2.04 KB
2025-10-31 18:40 · rw-r--r--
2.04 KB 2025-10-31 18:40 rw-r--r--
fix_long.py — 476 B
2025-10-31 18:40 · rw-r--r--
476 B 2025-10-31 18:40 rw-r--r--
fix_map.py — 3.55 KB
2025-10-31 18:40 · rw-r--r--
3.55 KB 2025-10-31 18:40 rw-r--r--
fix_metaclass.py — 8 KB
2025-10-31 18:40 · rw-r--r--
8 KB 2025-10-31 18:40 rw-r--r--
fix_methodattrs.py — 606 B
2025-10-31 18:40 · rw-r--r--
606 B 2025-10-31 18:40 rw-r--r--
fix_ne.py — 571 B
2025-10-31 18:40 · rw-r--r--
571 B 2025-10-31 18:40 rw-r--r--
fix_next.py — 3.1 KB
2025-10-31 18:40 · rw-r--r--
3.1 KB 2025-10-31 18:40 rw-r--r--
fix_nonzero.py — 591 B
2025-10-31 18:40 · rw-r--r--
591 B 2025-10-31 18:40 rw-r--r--
fix_numliterals.py — 768 B
2025-10-31 18:40 · rw-r--r--
768 B 2025-10-31 18:40 rw-r--r--
fix_operator.py — 3.35 KB
2025-10-31 18:40 · rw-r--r--
3.35 KB 2025-10-31 18:40 rw-r--r--
fix_paren.py — 1.2 KB
2025-10-31 18:40 · rw-r--r--
1.2 KB 2025-10-31 18:40 rw-r--r--
fix_print.py — 2.78 KB
2025-10-31 18:40 · rw-r--r--
2.78 KB 2025-10-31 18:40 rw-r--r--
fix_raise.py — 2.86 KB
2025-10-31 18:40 · rw-r--r--
2.86 KB 2025-10-31 18:40 rw-r--r--
fix_raw_input.py — 454 B
2025-10-31 18:40 · rw-r--r--
454 B 2025-10-31 18:40 rw-r--r--
fix_reduce.py — 837 B
2025-10-31 18:40 · rw-r--r--
837 B 2025-10-31 18:40 rw-r--r--
fix_reload.py — 1.06 KB
2025-10-31 18:40 · rw-r--r--
1.06 KB 2025-10-31 18:40 rw-r--r--
fix_renames.py — 2.17 KB
2025-10-31 18:40 · rw-r--r--
2.17 KB 2025-10-31 18:40 rw-r--r--
fix_repr.py — 613 B
2025-10-31 18:40 · rw-r--r--
613 B 2025-10-31 18:40 rw-r--r--
fix_set_literal.py — 1.66 KB
2025-10-31 18:40 · rw-r--r--
1.66 KB 2025-10-31 18:40 rw-r--r--
fix_standarderror.py — 449 B
2025-10-31 18:40 · rw-r--r--
449 B 2025-10-31 18:40 rw-r--r--
fix_sys_exc.py — 1.01 KB
2025-10-31 18:40 · rw-r--r--
1.01 KB 2025-10-31 18:40 rw-r--r--
fix_throw.py — 1.54 KB
2025-10-31 18:40 · rw-r--r--
1.54 KB 2025-10-31 18:40 rw-r--r--
fix_tuple_params.py — 5.43 KB
2025-10-31 18:40 · rw-r--r--
5.43 KB 2025-10-31 18:40 rw-r--r--
fix_types.py — 1.73 KB
2025-10-31 18:40 · rw-r--r--
1.73 KB 2025-10-31 18:40 rw-r--r--
fix_unicode.py — 1.23 KB
2025-10-31 18:40 · rw-r--r--
1.23 KB 2025-10-31 18:40 rw-r--r--
fix_urllib.py — 8.17 KB
2025-10-31 18:40 · rw-r--r--
8.17 KB 2025-10-31 18:40 rw-r--r--
fix_ws_comma.py — 1.06 KB
2025-10-31 18:40 · rw-r--r--
1.06 KB 2025-10-31 18:40 rw-r--r--
fix_xrange.py — 2.63 KB
2025-10-31 18:40 · rw-r--r--
2.63 KB 2025-10-31 18:40 rw-r--r--
fix_xreadlines.py — 689 B
2025-10-31 18:40 · rw-r--r--
689 B 2025-10-31 18:40 rw-r--r--
fix_zip.py — 1.26 KB
2025-10-31 18:40 · rw-r--r--
1.26 KB 2025-10-31 18:40 rw-r--r--
ONLINE
fixes
54 items
04:19:27
TERMINAL FM
NAVIGATION
ACTIONS
SELECTION
Edit
Preview
Download
Rename
Copy
Chmod
Delete
# 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