ACIL FM

Nama	Ukuran	Aksi
asyncio	-	Open
collections	-	Open
concurrent	-	Open
config-3.7m	-	Open
ctypes	-	Open
curses	-	Open
dbm	-	Open
distutils	-	Open
email	-	Open
encodings	-	Open
ensurepip	-	Open
html	-	Open
http	-	Open
idlelib	-	Open
importlib	-	Open
json	-	Open
lib-dynload	-	Open
lib2to3	-	Open
logging	-	Open
multiprocessing	-	Open
pydoc_data	-	Open
site-packages	-	Open
sqlite3	-	Open
test	-	Open
unittest	-	Open
urllib	-	Open
venv	-	Open
wsgiref	-	Open
xml	-	Open
xmlrpc	-	Open
__pycache__	-	Open
abc.py	5.45 MB	View DL Edit
aifc.py	32.04 MB	View DL Edit
antigravity.py	477 B	View DL Edit
argparse.py	93.14 MB	View DL Edit
ast.py	12.54 MB	View DL Edit
asynchat.py	11.06 MB	View DL Edit
asyncore.py	19.65 MB	View DL Edit
base64.py	19.92 MB	View DL Edit
bdb.py	30.99 MB	View DL Edit
binhex.py	13.63 MB	View DL Edit
bisect.py	2.5 MB	View DL Edit
bz2.py	12.12 MB	View DL Edit
calendar.py	24.24 MB	View DL Edit
cgi.py	34.23 MB	View DL Edit
cgitb.py	11.74 MB	View DL Edit
chunk.py	5.31 MB	View DL Edit
cmd.py	14.51 MB	View DL Edit
code.py	10.37 MB	View DL Edit
codecs.py	35.76 MB	View DL Edit
codeop.py	6.13 MB	View DL Edit
colorsys.py	3.97 MB	View DL Edit
compileall.py	13.46 MB	View DL Edit
configparser.py	53.01 MB	View DL Edit
contextlib.py	24.18 MB	View DL Edit
contextvars.py	129 B	View DL Edit
copy.py	8.65 MB	View DL Edit
copyreg.py	6.85 MB	View DL Edit
cProfile.py	6.11 MB	View DL Edit
crypt.py	3.27 MB	View DL Edit
csv.py	15.8 MB	View DL Edit
dataclasses.py	48.36 MB	View DL Edit
datetime.py	84.52 MB	View DL Edit
decimal.py	320 B	View DL Edit
difflib.py	82.42 MB	View DL Edit
dis.py	19.42 MB	View DL Edit
doctest.py	102.11 MB	View DL Edit
dummy_threading.py	2.75 MB	View DL Edit
enum.py	34.22 MB	View DL Edit
filecmp.py	9.6 MB	View DL Edit
fileinput.py	14.28 MB	View DL Edit
fnmatch.py	3.96 MB	View DL Edit
formatter.py	14.79 MB	View DL Edit
fractions.py	23.2 MB	View DL Edit
ftplib.py	34.78 MB	View DL Edit
functools.py	32.16 MB	View DL Edit
genericpath.py	4.8 MB	View DL Edit
getopt.py	7.31 MB	View DL Edit
getpass.py	5.85 MB	View DL Edit
gettext.py	21.45 MB	View DL Edit
glob.py	5.51 MB	View DL Edit
gzip.py	20.15 MB	View DL Edit
hashlib.py	9.31 MB	View DL Edit
heapq.py	22.48 MB	View DL Edit
hmac.py	6.36 MB	View DL Edit
imaplib.py	52.04 MB	View DL Edit
imghdr.py	3.71 MB	View DL Edit
imp.py	10.29 MB	View DL Edit
inspect.py	114.88 MB	View DL Edit
io.py	3.43 MB	View DL Edit
ipaddress.py	71.85 MB	View DL Edit
keyword.py	2.2 MB	View DL Edit
linecache.py	5.21 MB	View DL Edit
locale.py	76.36 MB	View DL Edit
lzma.py	12.68 MB	View DL Edit
macpath.py	5.98 MB	View DL Edit
mailbox.py	76.81 MB	View DL Edit
mailcap.py	8.85 MB	View DL Edit
mimetypes.py	20.99 MB	View DL Edit
modulefinder.py	22.5 MB	View DL Edit
netrc.py	5.44 MB	View DL Edit
nntplib.py	42.08 MB	View DL Edit
ntpath.py	21.82 MB	View DL Edit
nturl2path.py	2.52 MB	View DL Edit
numbers.py	10 MB	View DL Edit
opcode.py	5.69 MB	View DL Edit
operator.py	10.61 MB	View DL Edit
optparse.py	58.96 MB	View DL Edit
os.py	37.01 MB	View DL Edit
pathlib.py	49.15 MB	View DL Edit
pdb.py	61.04 MB	View DL Edit
pickle.py	56.63 MB	View DL Edit
pickletools.py	89.08 MB	View DL Edit
pipes.py	8.71 MB	View DL Edit
pkgutil.py	20.96 MB	View DL Edit
platform.py	45.89 MB	View DL Edit
plistlib.py	29.99 MB	View DL Edit
poplib.py	14.61 MB	View DL Edit
posixpath.py	15.4 MB	View DL Edit
pprint.py	20.39 MB	View DL Edit
profile.py	21.97 MB	View DL Edit
pstats.py	26.67 MB	View DL Edit
pty.py	4.65 MB	View DL Edit
pyclbr.py	14.78 MB	View DL Edit
pydoc.py	103.39 MB	View DL Edit
py_compile.py	7.81 MB	View DL Edit
queue.py	11.09 MB	View DL Edit
quopri.py	7.09 MB	View DL Edit
random.py	26.91 MB	View DL Edit
re.py	14.95 MB	View DL Edit
reprlib.py	5.14 MB	View DL Edit
rlcompleter.py	6.93 MB	View DL Edit
runpy.py	11.68 MB	View DL Edit
sched.py	6.29 MB	View DL Edit
secrets.py	1.99 MB	View DL Edit
selectors.py	18.13 MB	View DL Edit
shelve.py	8.33 MB	View DL Edit
shlex.py	12.79 MB	View DL Edit
shutil.py	40.97 MB	View DL Edit
signal.py	2.07 MB	View DL Edit
site.py	21.07 MB	View DL Edit
smtpd.py	33.91 MB	View DL Edit
smtplib.py	43.4 MB	View DL Edit
sndhdr.py	6.92 MB	View DL Edit
socket.py	26.83 MB	View DL Edit
socketserver.py	26.29 MB	View DL Edit
sre_compile.py	26.24 MB	View DL Edit
sre_constants.py	7.01 MB	View DL Edit
sre_parse.py	38.24 MB	View DL Edit
ssl.py	44.43 MB	View DL Edit
stat.py	5.26 MB	View DL Edit
statistics.py	20.17 MB	View DL Edit
string.py	11.29 MB	View DL Edit
stringprep.py	12.61 MB	View DL Edit
struct.py	257 B	View DL Edit
subprocess.py	70.95 MB	View DL Edit
sunau.py	17.94 MB	View DL Edit
symbol.py	2.09 MB	View DL Edit
symtable.py	7.11 MB	View DL Edit
sysconfig.py	23.87 MB	View DL Edit
tabnanny.py	11.15 MB	View DL Edit
tarfile.py	90.5 MB	View DL Edit
telnetlib.py	22.59 MB	View DL Edit
tempfile.py	26.1 MB	View DL Edit
textwrap.py	18.95 MB	View DL Edit
this.py	1003 B	View DL Edit
threading.py	48.13 MB	View DL Edit
timeit.py	13.18 MB	View DL Edit
token.py	3.67 MB	View DL Edit
tokenize.py	26.4 MB	View DL Edit
trace.py	28.23 MB	View DL Edit
traceback.py	22.89 MB	View DL Edit
tracemalloc.py	16.68 MB	View DL Edit
tty.py	879 B	View DL Edit
types.py	9.67 MB	View DL Edit
typing.py	55.12 MB	View DL Edit
uu.py	7.11 MB	View DL Edit
uuid.py	28.83 MB	View DL Edit
warnings.py	19.61 MB	View DL Edit
wave.py	17.8 MB	View DL Edit
weakref.py	21 MB	View DL Edit
webbrowser.py	23.16 MB	View DL Edit
xdrlib.py	5.77 MB	View DL Edit
zipapp.py	7.36 MB	View DL Edit
zipfile.py	79.19 MB	View DL Edit
_bootlocale.py	1.76 MB	View DL Edit
_collections_abc.py	25.8 MB	View DL Edit
_compat_pickle.py	8.54 MB	View DL Edit
_compression.py	5.21 MB	View DL Edit
_dummy_thread.py	5.89 MB	View DL Edit
_markupbase.py	14.26 MB	View DL Edit
_osx_support.py	19.14 MB	View DL Edit
_pydecimal.py	223.33 MB	View DL Edit
_pyio.py	89.47 MB	View DL Edit
_py_abc.py	6.04 MB	View DL Edit
_sitebuiltins.py	3.04 MB	View DL Edit
_strptime.py	24.91 MB	View DL Edit
_sysconfigdata_dm_linux_x86_64-linux-gnu.py	32.09 MB	View DL Edit
_sysconfigdata_m_linux_x86_64-linux-gnu.py	29 MB	View DL Edit
_threading_local.py	7.04 MB	View DL Edit
_weakrefset.py	5.55 MB	View DL Edit
__future__.py	4.98 MB	View DL Edit
__phello__.foo.py	64 B	View DL Edit

Edit file: /opt/alt/python37/lib64/python3.7/ast.py

"""
    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='<unknown>', mode='exec'):
    """
    Parse the source into an AST node.
    Equivalent to compile(source, filename, mode, PyCF_ONLY_AST).
    """
    return compile(source, filename, mode, PyCF_ONLY_AST)

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 _convert_num(node):
        if isinstance(node, Constant):
            if isinstance(node.value, (int, float, complex)):
                return node.value
        elif isinstance(node, Num):
            return node.n
        raise ValueError('malformed node or string: ' + repr(node))
    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, (Str, Bytes)):
            return node.s
        elif isinstance(node, Num):
            return node.n
        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):
            return dict(zip(map(_convert, node.keys),
                            map(_convert, node.values)))
        elif isinstance(node, NameConstant):
            return node.value
        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` and `col_offset` attributes) from
    *old_node* to *new_node* if possible, and return *new_node*.
    """
    for attr in 'lineno', 'col_offset':
        if attr in old_node._attributes and attr in new_node._attributes \
           and hasattr(old_node, attr):
            setattr(new_node, attr, getattr(old_node, attr))
    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):
        if 'lineno' in node._attributes:
            if not hasattr(node, 'lineno'):
                node.lineno = lineno
            else:
                lineno = node.lineno
        if 'col_offset' in node._attributes:
            if not hasattr(node, 'col_offset'):
                node.col_offset = col_offset
            else:
                col_offset = node.col_offset
        for child in iter_child_nodes(node):
            _fix(child, lineno, col_offset)
    _fix(node, 1, 0)
    return node

def increment_lineno(node, n=1):
    """
    Increment the 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
    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 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)

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

Batal