NG4R3P

Linux 4gvps.4gvps.com 3.10.0-1127.18.2.vz7.163.46 #1 SMP Fri Nov 20 21:47:55 MSK 2020 x86_64
SOFT : Apache PHP : 7.4.33
/proc/self/root/opt/alt/python38/lib64/python3.8/

38.135.39.45

[ NAME ]	[ SIZE ]	[ PERM ]	[ DATE ]	[ ACT ]
+FILE +DIR
__pycache__	dir	drwxr-xr-x	2022-06-03 01:15	R D
asyncio	dir	drwxr-xr-x	2022-06-03 01:15	R D
collections	dir	drwxr-xr-x	2022-06-03 01:15	R D
concurrent	dir	drwxr-xr-x	2022-06-03 01:15	R D
config-3.8-x86_64-linux-gnu	dir	drwxr-xr-x	2022-06-03 01:15	R D
ctypes	dir	drwxr-xr-x	2022-06-03 01:15	R D
curses	dir	drwxr-xr-x	2022-06-03 01:15	R D
dbm	dir	drwxr-xr-x	2022-06-03 01:15	R D
distutils	dir	drwxr-xr-x	2022-06-03 01:15	R D
email	dir	drwxr-xr-x	2022-06-03 01:15	R D
encodings	dir	drwxr-xr-x	2022-06-03 01:15	R D
ensurepip	dir	drwxr-xr-x	2022-06-03 01:15	R D
html	dir	drwxr-xr-x	2022-06-03 01:15	R D
http	dir	drwxr-xr-x	2022-06-03 01:15	R D
importlib	dir	drwxr-xr-x	2022-06-03 01:15	R D
json	dir	drwxr-xr-x	2022-06-03 01:15	R D
lib-dynload	dir	drwxr-xr-x	2022-06-03 01:15	R D
lib2to3	dir	drwxr-xr-x	2022-08-08 06:03	R D
logging	dir	drwxr-xr-x	2022-06-03 01:15	R D
multiprocessing	dir	drwxr-xr-x	2022-06-03 01:15	R D
pydoc_data	dir	drwxr-xr-x	2022-06-03 01:15	R D
site-packages	dir	drwxr-xr-x	2022-08-08 06:03	R D
sqlite3	dir	drwxr-xr-x	2022-08-08 06:03	R D
unittest	dir	drwxr-xr-x	2022-06-03 01:15	R D
urllib	dir	drwxr-xr-x	2022-06-03 01:15	R D
venv	dir	drwxr-xr-x	2022-06-03 01:15	R D
wsgiref	dir	drwxr-xr-x	2022-06-03 01:15	R D
xml	dir	drwxr-xr-x	2022-06-03 01:15	R D
xmlrpc	dir	drwxr-xr-x	2025-06-26 06:15	R D
LICENSE.txt	13.599 KB	-rw-r--r--	2021-08-30 14:26	R E G D
__future__.py	5.026 KB	-rw-r--r--	2021-08-30 14:26	R E G D
__phello__.foo.py	0.063 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_bootlocale.py	1.759 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_collections_abc.py	25.488 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_compat_pickle.py	8.544 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_compression.py	5.215 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_dummy_thread.py	5.886 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_markupbase.py	14.256 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_osx_support.py	21.264 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_py_abc.py	6.044 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_pydecimal.py	223.307 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_pyio.py	90.993 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_sitebuiltins.py	3.042 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_strptime.py	24.676 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_sysconfigdata__linux_x86_64-linux-gnu.py	37.549 KB	-rw-r--r--	2022-04-22 10:23	R E G D
_sysconfigdata_d_linux_x86_64-linux-gnu.py	37.289 KB	-rw-r--r--	2022-04-22 10:13	R E G D
_threading_local.py	7.051 KB	-rw-r--r--	2021-08-30 14:26	R E G D
_weakrefset.py	5.601 KB	-rw-r--r--	2021-08-30 14:26	R E G D
abc.py	4.384 KB	-rw-r--r--	2021-08-30 14:26	R E G D
aifc.py	32.045 KB	-rw-r--r--	2021-08-30 14:26	R E G D
antigravity.py	0.466 KB	-rw-r--r--	2021-08-30 14:26	R E G D
argparse.py	93.765 KB	-rw-r--r--	2021-08-30 14:26	R E G D
ast.py	18.783 KB	-rw-r--r--	2021-08-30 14:26	R E G D
asynchat.py	11.063 KB	-rw-r--r--	2021-08-30 14:26	R E G D
asyncore.py	19.623 KB	-rw-r--r--	2021-08-30 14:26	R E G D
base64.py	19.917 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
bdb.py	31.305 KB	-rw-r--r--	2021-08-30 14:26	R E G D
binhex.py	13.627 KB	-rw-r--r--	2021-08-30 14:26	R E G D
bisect.py	2.162 KB	-rw-r--r--	2021-08-30 14:26	R E G D
bz2.py	12.264 KB	-rw-r--r--	2021-08-30 14:26	R E G D
cProfile.py	6.847 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
calendar.py	24.25 KB	-rw-r--r--	2021-08-30 14:26	R E G D
cgi.py	33.149 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
cgitb.py	11.813 KB	-rw-r--r--	2021-08-30 14:26	R E G D
chunk.py	5.308 KB	-rw-r--r--	2021-08-30 14:26	R E G D
cmd.py	14.512 KB	-rw-r--r--	2021-08-30 14:26	R E G D
code.py	10.373 KB	-rw-r--r--	2021-08-30 14:26	R E G D
codecs.py	35.808 KB	-rw-r--r--	2021-08-30 14:26	R E G D
codeop.py	6.182 KB	-rw-r--r--	2021-08-30 14:26	R E G D
colorsys.py	3.969 KB	-rw-r--r--	2021-08-30 14:26	R E G D
compileall.py	13.357 KB	-rw-r--r--	2021-08-30 14:26	R E G D
configparser.py	53.1 KB	-rw-r--r--	2021-08-30 14:26	R E G D
contextlib.py	24.409 KB	-rw-r--r--	2021-08-30 14:26	R E G D
contextvars.py	0.126 KB	-rw-r--r--	2021-08-30 14:26	R E G D
copy.py	8.458 KB	-rw-r--r--	2021-08-30 14:26	R E G D
copyreg.py	6.968 KB	-rw-r--r--	2021-08-30 14:26	R E G D
crypt.py	3.525 KB	-rw-r--r--	2021-08-30 14:26	R E G D
csv.py	15.766 KB	-rw-r--r--	2021-08-30 14:26	R E G D
dataclasses.py	48.802 KB	-rw-r--r--	2021-08-30 14:26	R E G D
datetime.py	86.218 KB	-rw-r--r--	2021-08-30 14:26	R E G D
decimal.py	0.313 KB	-rw-r--r--	2021-08-30 14:26	R E G D
difflib.py	82.088 KB	-rw-r--r--	2021-08-30 14:26	R E G D
dis.py	20.088 KB	-rw-r--r--	2021-08-30 14:26	R E G D
doctest.py	102.093 KB	-rw-r--r--	2021-08-30 14:26	R E G D
dummy_threading.py	2.749 KB	-rw-r--r--	2021-08-30 14:26	R E G D
enum.py	37.242 KB	-rw-r--r--	2021-08-30 14:26	R E G D
filecmp.py	9.6 KB	-rw-r--r--	2021-08-30 14:26	R E G D
fileinput.py	14.364 KB	-rw-r--r--	2021-08-30 14:26	R E G D
fnmatch.py	3.983 KB	-rw-r--r--	2021-08-30 14:26	R E G D
formatter.py	14.788 KB	-rw-r--r--	2021-08-30 14:26	R E G D
fractions.py	23.759 KB	-rw-r--r--	2021-08-30 14:26	R E G D
ftplib.py	34.306 KB	-rw-r--r--	2021-08-30 14:26	R E G D
functools.py	36.529 KB	-rw-r--r--	2021-08-30 14:26	R E G D
genericpath.py	4.858 KB	-rw-r--r--	2021-08-30 14:26	R E G D
getopt.py	7.313 KB	-rw-r--r--	2021-08-30 14:26	R E G D
getpass.py	5.854 KB	-rw-r--r--	2021-08-30 14:26	R E G D
gettext.py	26.502 KB	-rw-r--r--	2021-08-30 14:26	R E G D
glob.py	5.563 KB	-rw-r--r--	2021-08-30 14:26	R E G D
gzip.py	20.911 KB	-rw-r--r--	2021-08-30 14:26	R E G D
hashlib.py	9.502 KB	-rw-r--r--	2021-08-30 14:26	R E G D
heapq.py	22.341 KB	-rw-r--r--	2021-08-30 14:26	R E G D
hmac.py	6.474 KB	-rw-r--r--	2021-08-30 14:26	R E G D
imaplib.py	52.35 KB	-rw-r--r--	2021-08-30 14:26	R E G D
imghdr.py	3.719 KB	-rw-r--r--	2021-08-30 14:26	R E G D
imp.py	10.289 KB	-rw-r--r--	2021-08-30 14:26	R E G D
inspect.py	115.771 KB	-rw-r--r--	2021-08-30 14:26	R E G D
io.py	3.458 KB	-rw-r--r--	2021-08-30 14:26	R E G D
ipaddress.py	69.965 KB	-rw-r--r--	2021-08-30 14:26	R E G D
keyword.py	0.923 KB	-rw-r--r--	2021-08-30 14:26	R E G D
linecache.py	5.205 KB	-rw-r--r--	2021-08-30 14:26	R E G D
locale.py	76.358 KB	-rw-r--r--	2021-08-30 14:26	R E G D
lzma.py	12.679 KB	-rw-r--r--	2021-08-30 14:26	R E G D
mailbox.py	76.817 KB	-rw-r--r--	2021-08-30 14:26	R E G D
mailcap.py	7.914 KB	-rw-r--r--	2021-08-30 14:26	R E G D
mimetypes.py	21.156 KB	-rw-r--r--	2021-08-30 14:26	R E G D
modulefinder.py	23.857 KB	-rw-r--r--	2021-08-30 14:26	R E G D
netrc.py	5.436 KB	-rw-r--r--	2021-08-30 14:26	R E G D
nntplib.py	42.247 KB	-rw-r--r--	2021-08-30 14:26	R E G D
ntpath.py	27.084 KB	-rw-r--r--	2021-08-30 14:26	R E G D
nturl2path.py	2.819 KB	-rw-r--r--	2021-08-30 14:26	R E G D
numbers.py	10.004 KB	-rw-r--r--	2021-08-30 14:26	R E G D
opcode.py	5.672 KB	-rw-r--r--	2021-08-30 14:26	R E G D
operator.py	10.46 KB	-rw-r--r--	2021-08-30 14:26	R E G D
optparse.py	58.954 KB	-rw-r--r--	2021-08-30 14:26	R E G D
os.py	38.081 KB	-rw-r--r--	2021-08-30 14:26	R E G D
pathlib.py	51.377 KB	-rw-r--r--	2021-08-30 14:26	R E G D
pdb.py	61.28 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
pickle.py	62.956 KB	-rw-r--r--	2021-08-30 14:26	R E G D
pickletools.py	91.295 KB	-rw-r--r--	2021-08-30 14:26	R E G D
pipes.py	8.707 KB	-rw-r--r--	2021-08-30 14:26	R E G D
pkgutil.py	20.996 KB	-rw-r--r--	2021-08-30 14:26	R E G D
platform.py	39.49 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
plistlib.py	31.465 KB	-rw-r--r--	2021-08-30 14:26	R E G D
poplib.py	14.724 KB	-rw-r--r--	2021-08-30 14:26	R E G D
posixpath.py	15.261 KB	-rw-r--r--	2021-08-30 14:26	R E G D
pprint.py	20.98 KB	-rw-r--r--	2021-08-30 14:26	R E G D
profile.py	22.995 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
pstats.py	26.704 KB	-rw-r--r--	2021-08-30 14:26	R E G D
pty.py	4.694 KB	-rw-r--r--	2021-08-30 14:26	R E G D
py_compile.py	8.011 KB	-rw-r--r--	2022-04-22 10:10	R E G D
pyclbr.py	14.897 KB	-rw-r--r--	2021-08-30 14:26	R E G D
pydoc.py	104.199 KB	-rw-r--r--	2022-04-22 10:25	R E G D
queue.py	11.09 KB	-rw-r--r--	2021-08-30 14:26	R E G D
quopri.py	7.095 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
random.py	28.127 KB	-rw-r--r--	2021-08-30 14:26	R E G D
re.py	15.489 KB	-rw-r--r--	2021-08-30 14:26	R E G D
reprlib.py	5.144 KB	-rw-r--r--	2021-08-30 14:26	R E G D
rlcompleter.py	6.931 KB	-rw-r--r--	2021-08-30 14:26	R E G D
runpy.py	11.77 KB	-rw-r--r--	2021-08-30 14:26	R E G D
sched.py	6.291 KB	-rw-r--r--	2021-08-30 14:26	R E G D
secrets.py	1.99 KB	-rw-r--r--	2021-08-30 14:26	R E G D
selectors.py	18.126 KB	-rw-r--r--	2021-08-30 14:26	R E G D
shelve.py	8.327 KB	-rw-r--r--	2021-08-30 14:26	R E G D
shlex.py	13.013 KB	-rw-r--r--	2021-08-30 14:26	R E G D
shutil.py	50.268 KB	-rw-r--r--	2021-08-30 14:26	R E G D
signal.py	2.22 KB	-rw-r--r--	2021-08-30 14:26	R E G D
site.py	21.091 KB	-rw-r--r--	2022-04-22 10:10	R E G D
smtpd.py	33.908 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
smtplib.py	43.959 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
sndhdr.py	6.933 KB	-rw-r--r--	2021-08-30 14:26	R E G D
socket.py	34.417 KB	-rw-r--r--	2021-08-30 14:26	R E G D
socketserver.py	26.656 KB	-rw-r--r--	2021-08-30 14:26	R E G D
sre_compile.py	26.069 KB	-rw-r--r--	2021-08-30 14:26	R E G D
sre_constants.py	6.986 KB	-rw-r--r--	2021-08-30 14:26	R E G D
sre_parse.py	39.287 KB	-rw-r--r--	2021-08-30 14:26	R E G D
ssl.py	49.57 KB	-rw-r--r--	2021-08-30 14:26	R E G D
stat.py	5.356 KB	-rw-r--r--	2021-08-30 14:26	R E G D
statistics.py	38.76 KB	-rw-r--r--	2021-08-30 14:26	R E G D
string.py	10.288 KB	-rw-r--r--	2021-08-30 14:26	R E G D
stringprep.py	12.614 KB	-rw-r--r--	2021-08-30 14:26	R E G D
struct.py	0.251 KB	-rw-r--r--	2021-08-30 14:26	R E G D
subprocess.py	75.518 KB	-rw-r--r--	2021-08-30 14:26	R E G D
sunau.py	17.944 KB	-rw-r--r--	2021-08-30 14:26	R E G D
symbol.py	2.06 KB	-rw-r--r--	2022-04-22 10:13	R E G D
symtable.py	7.833 KB	-rw-r--r--	2021-08-30 14:26	R E G D
sysconfig.py	24.313 KB	-rw-r--r--	2022-04-22 10:24	R E G D
tabnanny.py	11.151 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
tarfile.py	91.739 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
telnetlib.py	22.709 KB	-rw-r--r--	2021-08-30 14:26	R E G D
tempfile.py	26.892 KB	-rw-r--r--	2021-08-30 14:26	R E G D
textwrap.py	18.952 KB	-rw-r--r--	2021-08-30 14:26	R E G D
this.py	0.979 KB	-rw-r--r--	2021-08-30 14:26	R E G D
threading.py	49.629 KB	-rw-r--r--	2021-08-30 14:26	R E G D
timeit.py	13.177 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
token.py	2.313 KB	-rw-r--r--	2021-08-30 14:26	R E G D
tokenize.py	25.235 KB	-rw-r--r--	2021-08-30 14:26	R E G D
trace.py	29.171 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
traceback.py	23.058 KB	-rw-r--r--	2021-08-30 14:26	R E G D
tracemalloc.py	16.676 KB	-rw-r--r--	2021-08-30 14:26	R E G D
tty.py	0.858 KB	-rw-r--r--	2021-08-30 14:26	R E G D
types.py	9.485 KB	-rw-r--r--	2021-08-30 14:26	R E G D
typing.py	67.346 KB	-rw-r--r--	2021-08-30 14:26	R E G D
uu.py	6.807 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
uuid.py	29.752 KB	-rw-r--r--	2021-08-30 14:26	R E G D
warnings.py	19.227 KB	-rw-r--r--	2021-08-30 14:26	R E G D
wave.py	17.803 KB	-rw-r--r--	2021-08-30 14:26	R E G D
weakref.py	20.886 KB	-rw-r--r--	2021-08-30 14:26	R E G D
webbrowser.py	23.531 KB	-rwxr-xr-x	2021-08-30 14:26	R E G D
xdrlib.py	5.774 KB	-rw-r--r--	2021-08-30 14:26	R E G D
zipapp.py	7.358 KB	-rw-r--r--	2021-08-30 14:26	R E G D
zipfile.py	85.672 KB	-rw-r--r--	2021-08-30 14:26	R E G D
zipimport.py	30.044 KB	-rw-r--r--	2021-08-30 14:26	R E G D
REQUEST EXIT

""" ast ~~~ The `ast` module helps Python applications to process trees of the Python abstract syntax grammar. The abstract syntax itself might change with each Python release; this module helps to find out programmatically what the current grammar looks like and allows modifications of it. An abstract syntax tree can be generated by passing `ast.PyCF_ONLY_AST` as a flag to the `compile()` builtin function or by using the `parse()` function from this module. The result will be a tree of objects whose classes all inherit from `ast.AST`. A modified abstract syntax tree can be compiled into a Python code object using the built-in `compile()` function. Additionally various helper functions are provided that make working with the trees simpler. The main intention of the helper functions and this module in general is to provide an easy to use interface for libraries that work tightly with the python syntax (template engines for example). :copyright: Copyright 2008 by Armin Ronacher. :license: Python License. """ from _ast import * def parse(source, filename='', mode='exec', *, type_comments=False, feature_version=None): """ Parse the source into an AST node. Equivalent to compile(source, filename, mode, PyCF_ONLY_AST). Pass type_comments=True to get back type comments where the syntax allows. """ flags = PyCF_ONLY_AST if type_comments: flags |= PyCF_TYPE_COMMENTS if isinstance(feature_version, tuple): major, minor = feature_version # Should be a 2-tuple. assert major == 3 feature_version = minor elif feature_version is None: feature_version = -1 # Else it should be an int giving the minor version for 3.x. return compile(source, filename, mode, flags, _feature_version=feature_version) def literal_eval(node_or_string): """ Safely evaluate an expression node or a string containing a Python expression. The string or node provided may only consist of the following Python literal structures: strings, bytes, numbers, tuples, lists, dicts, sets, booleans, and None. """ if isinstance(node_or_string, str): node_or_string = parse(node_or_string, mode='eval') if isinstance(node_or_string, Expression): node_or_string = node_or_string.body def _raise_malformed_node(node): raise ValueError(f'malformed node or string: {node!r}') def _convert_num(node): if not isinstance(node, Constant) or type(node.value) not in (int, float, complex): _raise_malformed_node(node) return node.value def _convert_signed_num(node): if isinstance(node, UnaryOp) and isinstance(node.op, (UAdd, USub)): operand = _convert_num(node.operand) if isinstance(node.op, UAdd): return + operand else: return - operand return _convert_num(node) def _convert(node): if isinstance(node, Constant): return node.value elif isinstance(node, Tuple): return tuple(map(_convert, node.elts)) elif isinstance(node, List): return list(map(_convert, node.elts)) elif isinstance(node, Set): return set(map(_convert, node.elts)) elif isinstance(node, Dict): if len(node.keys) != len(node.values): _raise_malformed_node(node) return dict(zip(map(_convert, node.keys), map(_convert, node.values))) elif isinstance(node, BinOp) and isinstance(node.op, (Add, Sub)): left = _convert_signed_num(node.left) right = _convert_num(node.right) if isinstance(left, (int, float)) and isinstance(right, complex): if isinstance(node.op, Add): return left + right else: return left - right return _convert_signed_num(node) return _convert(node_or_string) def dump(node, annotate_fields=True, include_attributes=False): """ Return a formatted dump of the tree in node. This is mainly useful for debugging purposes. If annotate_fields is true (by default), the returned string will show the names and the values for fields. If annotate_fields is false, the result string will be more compact by omitting unambiguous field names. Attributes such as line numbers and column offsets are not dumped by default. If this is wanted, include_attributes can be set to true. """ def _format(node): if isinstance(node, AST): args = [] keywords = annotate_fields for field in node._fields: try: value = getattr(node, field) except AttributeError: keywords = True else: if keywords: args.append('%s=%s' % (field, _format(value))) else: args.append(_format(value)) if include_attributes and node._attributes: for a in node._attributes: try: args.append('%s=%s' % (a, _format(getattr(node, a)))) except AttributeError: pass return '%s(%s)' % (node.__class__.__name__, ', '.join(args)) elif isinstance(node, list): return '[%s]' % ', '.join(_format(x) for x in node) return repr(node) if not isinstance(node, AST): raise TypeError('expected AST, got %r' % node.__class__.__name__) return _format(node) def copy_location(new_node, old_node): """ Copy source location (`lineno`, `col_offset`, `end_lineno`, and `end_col_offset` attributes) from *old_node* to *new_node* if possible, and return *new_node*. """ for attr in 'lineno', 'col_offset', 'end_lineno', 'end_col_offset': if attr in old_node._attributes and attr in new_node._attributes: value = getattr(old_node, attr, None) # end_lineno and end_col_offset are optional attributes, and they # should be copied whether the value is None or not. if value is not None or ( hasattr(old_node, attr) and attr.startswith("end_") ): setattr(new_node, attr, value) return new_node def fix_missing_locations(node): """ When you compile a node tree with compile(), the compiler expects lineno and col_offset attributes for every node that supports them. This is rather tedious to fill in for generated nodes, so this helper adds these attributes recursively where not already set, by setting them to the values of the parent node. It works recursively starting at *node*. """ def _fix(node, lineno, col_offset, end_lineno, end_col_offset): if 'lineno' in node._attributes: if not hasattr(node, 'lineno'): node.lineno = lineno else: lineno = node.lineno if 'end_lineno' in node._attributes: if not hasattr(node, 'end_lineno'): node.end_lineno = end_lineno else: end_lineno = node.end_lineno if 'col_offset' in node._attributes: if not hasattr(node, 'col_offset'): node.col_offset = col_offset else: col_offset = node.col_offset if 'end_col_offset' in node._attributes: if not hasattr(node, 'end_col_offset'): node.end_col_offset = end_col_offset else: end_col_offset = node.end_col_offset for child in iter_child_nodes(node): _fix(child, lineno, col_offset, end_lineno, end_col_offset) _fix(node, 1, 0, 1, 0) return node def increment_lineno(node, n=1): """ Increment the line number and end line number of each node in the tree starting at *node* by *n*. This is useful to "move code" to a different location in a file. """ for child in walk(node): if 'lineno' in child._attributes: child.lineno = getattr(child, 'lineno', 0) + n if ( "end_lineno" in child._attributes and (end_lineno := getattr(child, "end_lineno", 0)) is not None ): child.end_lineno = end_lineno + n return node def iter_fields(node): """ Yield a tuple of ``(fieldname, value)`` for each field in ``node._fields`` that is present on *node*. """ for field in node._fields: try: yield field, getattr(node, field) except AttributeError: pass def iter_child_nodes(node): """ Yield all direct child nodes of *node*, that is, all fields that are nodes and all items of fields that are lists of nodes. """ for name, field in iter_fields(node): if isinstance(field, AST): yield field elif isinstance(field, list): for item in field: if isinstance(item, AST): yield item def get_docstring(node, clean=True): """ Return the docstring for the given node or None if no docstring can be found. If the node provided does not have docstrings a TypeError will be raised. If *clean* is `True`, all tabs are expanded to spaces and any whitespace that can be uniformly removed from the second line onwards is removed. """ if not isinstance(node, (AsyncFunctionDef, FunctionDef, ClassDef, Module)): raise TypeError("%r can't have docstrings" % node.__class__.__name__) if not(node.body and isinstance(node.body[0], Expr)): return None node = node.body[0].value if isinstance(node, Str): text = node.s elif isinstance(node, Constant) and isinstance(node.value, str): text = node.value else: return None if clean: import inspect text = inspect.cleandoc(text) return text def _splitlines_no_ff(source): """Split a string into lines ignoring form feed and other chars. This mimics how the Python parser splits source code. """ idx = 0 lines = [] next_line = '' while idx < len(source): c = source[idx] next_line += c idx += 1 # Keep \r\n together if c == '\r' and idx < len(source) and source[idx] == '\n': next_line += '\n' idx += 1 if c in '\r\n': lines.append(next_line) next_line = '' if next_line: lines.append(next_line) return lines def _pad_whitespace(source): r"""Replace all chars except '\f\t' in a line with spaces.""" result = '' for c in source: if c in '\f\t': result += c else: result += ' ' return result def get_source_segment(source, node, *, padded=False): """Get source code segment of the *source* that generated *node*. If some location information (`lineno`, `end_lineno`, `col_offset`, or `end_col_offset`) is missing, return None. If *padded* is `True`, the first line of a multi-line statement will be padded with spaces to match its original position. """ try: lineno = node.lineno - 1 end_lineno = node.end_lineno - 1 col_offset = node.col_offset end_col_offset = node.end_col_offset except AttributeError: return None lines = _splitlines_no_ff(source) if end_lineno == lineno: return lines[lineno].encode()[col_offset:end_col_offset].decode() if padded: padding = _pad_whitespace(lines[lineno].encode()[:col_offset].decode()) else: padding = '' first = padding + lines[lineno].encode()[col_offset:].decode() last = lines[end_lineno].encode()[:end_col_offset].decode() lines = lines[lineno+1:end_lineno] lines.insert(0, first) lines.append(last) return ''.join(lines) def walk(node): """ Recursively yield all descendant nodes in the tree starting at *node* (including *node* itself), in no specified order. This is useful if you only want to modify nodes in place and don't care about the context. """ from collections import deque todo = deque([node]) while todo: node = todo.popleft() todo.extend(iter_child_nodes(node)) yield node class NodeVisitor(object): """ A node visitor base class that walks the abstract syntax tree and calls a visitor function for every node found. This function may return a value which is forwarded by the `visit` method. This class is meant to be subclassed, with the subclass adding visitor methods. Per default the visitor functions for the nodes are ``'visit_'`` + class name of the node. So a `TryFinally` node visit function would be `visit_TryFinally`. This behavior can be changed by overriding the `visit` method. If no visitor function exists for a node (return value `None`) the `generic_visit` visitor is used instead. Don't use the `NodeVisitor` if you want to apply changes to nodes during traversing. For this a special visitor exists (`NodeTransformer`) that allows modifications. """ def visit(self, node): """Visit a node.""" method = 'visit_' + node.__class__.__name__ visitor = getattr(self, method, self.generic_visit) return visitor(node) def generic_visit(self, node): """Called if no explicit visitor function exists for a node.""" for field, value in iter_fields(node): if isinstance(value, list): for item in value: if isinstance(item, AST): self.visit(item) elif isinstance(value, AST): self.visit(value) def visit_Constant(self, node): value = node.value type_name = _const_node_type_names.get(type(value)) if type_name is None: for cls, name in _const_node_type_names.items(): if isinstance(value, cls): type_name = name break if type_name is not None: method = 'visit_' + type_name try: visitor = getattr(self, method) except AttributeError: pass else: import warnings warnings.warn(f"{method} is deprecated; add visit_Constant", PendingDeprecationWarning, 2) return visitor(node) return self.generic_visit(node) class NodeTransformer(NodeVisitor): """ A :class:`NodeVisitor` subclass that walks the abstract syntax tree and allows modification of nodes. The `NodeTransformer` will walk the AST and use the return value of the visitor methods to replace or remove the old node. If the return value of the visitor method is ``None``, the node will be removed from its location, otherwise it is replaced with the return value. The return value may be the original node in which case no replacement takes place. Here is an example transformer that rewrites all occurrences of name lookups (``foo``) to ``data['foo']``:: class RewriteName(NodeTransformer): def visit_Name(self, node): return Subscript( value=Name(id='data', ctx=Load()), slice=Index(value=Str(s=node.id)), ctx=node.ctx ) Keep in mind that if the node you're operating on has child nodes you must either transform the child nodes yourself or call the :meth:`generic_visit` method for the node first. For nodes that were part of a collection of statements (that applies to all statement nodes), the visitor may also return a list of nodes rather than just a single node. Usually you use the transformer like this:: node = YourTransformer().visit(node) """ def generic_visit(self, node): for field, old_value in iter_fields(node): if isinstance(old_value, list): new_values = [] for value in old_value: if isinstance(value, AST): value = self.visit(value) if value is None: continue elif not isinstance(value, AST): new_values.extend(value) continue new_values.append(value) old_value[:] = new_values elif isinstance(old_value, AST): new_node = self.visit(old_value) if new_node is None: delattr(node, field) else: setattr(node, field, new_node) return node # The following code is for backward compatibility. # It will be removed in future. def _getter(self): return self.value def _setter(self, value): self.value = value Constant.n = property(_getter, _setter) Constant.s = property(_getter, _setter) class _ABC(type): def __instancecheck__(cls, inst): if not isinstance(inst, Constant): return False if cls in _const_types: try: value = inst.value except AttributeError: return False else: return ( isinstance(value, _const_types[cls]) and not isinstance(value, _const_types_not.get(cls, ())) ) return type.__instancecheck__(cls, inst) def _new(cls, *args, **kwargs): for key in kwargs: if key not in cls._fields: # arbitrary keyword arguments are accepted continue pos = cls._fields.index(key) if pos < len(args): raise TypeError(f"{cls.__name__} got multiple values for argument {key!r}") if cls in _const_types: return Constant(*args, **kwargs) return Constant.__new__(cls, *args, **kwargs) class Num(Constant, metaclass=_ABC): _fields = ('n',) __new__ = _new class Str(Constant, metaclass=_ABC): _fields = ('s',) __new__ = _new class Bytes(Constant, metaclass=_ABC): _fields = ('s',) __new__ = _new class NameConstant(Constant, metaclass=_ABC): __new__ = _new class Ellipsis(Constant, metaclass=_ABC): _fields = () def __new__(cls, *args, **kwargs): if cls is Ellipsis: return Constant(..., *args, **kwargs) return Constant.__new__(cls, *args, **kwargs) _const_types = { Num: (int, float, complex), Str: (str,), Bytes: (bytes,), NameConstant: (type(None), bool), Ellipsis: (type(...),), } _const_types_not = { Num: (bool,), } _const_node_type_names = { bool: 'NameConstant', # should be before int type(None): 'NameConstant', int: 'Num', float: 'Num', complex: 'Num', str: 'Str', bytes: 'Bytes', type(...): 'Ellipsis', }