FM / python3.3

/opt/alt/python33/lib64/python3.3

Name	Size	Mode	Actions
collections/	-	0755	rm
concurrent/	-	0755	rm
config-3.3m/	-	0755	rm
ctypes/	-	0755	rm
curses/	-	0755	rm
dbm/	-	0755	rm
distutils/	-	0755	rm
email/	-	0755	rm
encodings/	-	0755	rm
html/	-	0755	rm
http/	-	0755	rm
idlelib/	-	0755	rm
importlib/	-	0755	rm
json/	-	0755	rm
lib-dynload/	-	0755	rm
lib2to3/	-	0755	rm
logging/	-	0755	rm
multiprocessing/	-	0755	rm
plat-linux/	-	0755	rm
pydoc_data/	-	0755	rm
site-packages/	-	0755	rm
sqlite3/	-	0755	rm
test/	-	0755	rm
unittest/	-	0755	rm
urllib/	-	0755	rm
venv/	-	0755	rm
wsgiref/	-	0755	rm
xml/	-	0755	rm
xmlrpc/	-	0755	rm
__pycache__/	-	0755	rm
abc.py	8057	0644	edit dl rm
aifc.py	31054	0644	edit dl rm
antigravity.py	475	0644	edit dl rm
argparse.py	89069	0644	edit dl rm
ast.py	12142	0644	edit dl rm
asynchat.py	11588	0644	edit dl rm
asyncore.py	20753	0644	edit dl rm
base64.py	13986	0755	edit dl rm
bdb.py	21894	0644	edit dl rm
binhex.py	13708	0644	edit dl rm
bisect.py	2595	0644	edit dl rm
bz2.py	18473	0644	edit dl rm
calendar.py	22940	0644	edit dl rm
cgi.py	35554	0755	edit dl rm
cgitb.py	12041	0644	edit dl rm
chunk.py	5377	0644	edit dl rm
cmd.py	14860	0644	edit dl rm
code.py	10030	0644	edit dl rm
codecs.py	35956	0644	edit dl rm
codeop.py	5994	0644	edit dl rm
colorsys.py	3691	0644	edit dl rm
compileall.py	9743	0644	edit dl rm
configparser.py	49437	0644	edit dl rm
contextlib.py	9125	0644	edit dl rm
copy.py	8991	0644	edit dl rm
copyreg.py	6611	0644	edit dl rm
cProfile.py	6361	0755	edit dl rm
crypt.py	1879	0644	edit dl rm
csv.py	16185	0644	edit dl rm
datetime.py	74954	0644	edit dl rm
decimal.py	228558	0644	edit dl rm
difflib.py	82519	0644	edit dl rm
dis.py	10134	0644	edit dl rm
doctest.py	102933	0644	edit dl rm
dummy_threading.py	2815	0644	edit dl rm
filecmp.py	9597	0644	edit dl rm
fileinput.py	14256	0644	edit dl rm
fnmatch.py	3163	0644	edit dl rm
formatter.py	14930	0644	edit dl rm
fractions.py	23033	0644	edit dl rm
ftplib.py	40253	0644	edit dl rm
functools.py	13596	0644	edit dl rm
genericpath.py	3093	0644	edit dl rm
getopt.py	7488	0644	edit dl rm
getpass.py	5793	0644	edit dl rm
gettext.py	20637	0644	edit dl rm
glob.py	2838	0644	edit dl rm
gzip.py	24403	0644	edit dl rm
hashlib.py	6193	0644	edit dl rm
heapq.py	17997	0644	edit dl rm
hmac.py	4440	0644	edit dl rm
imaplib.py	50111	0644	edit dl rm
imghdr.py	3528	0644	edit dl rm
imp.py	9727	0644	edit dl rm
inspect.py	78960	0644	edit dl rm
io.py	3280	0644	edit dl rm
ipaddress.py	70303	0644	edit dl rm
keyword.py	2060	0755	edit dl rm
linecache.py	3864	0644	edit dl rm
locale.py	93215	0644	edit dl rm
lzma.py	17454	0644	edit dl rm
macpath.py	5617	0644	edit dl rm
macurl2path.py	2732	0644	edit dl rm
mailbox.py	79093	0644	edit dl rm
mailcap.py	7437	0644	edit dl rm
mimetypes.py	20735	0644	edit dl rm
modulefinder.py	23198	0644	edit dl rm
netrc.py	5747	0644	edit dl rm
nntplib.py	42786	0644	edit dl rm
ntpath.py	20437	0644	edit dl rm
nturl2path.py	2396	0644	edit dl rm
numbers.py	10398	0644	edit dl rm
opcode.py	5098	0644	edit dl rm
optparse.py	60346	0644	edit dl rm
os.py	34779	0644	edit dl rm
os2emxpath.py	4659	0644	edit dl rm
pdb.py	60653	0755	edit dl rm
pickle.py	47858	0644	edit dl rm
pickletools.py	81349	0644	edit dl rm
pipes.py	8916	0644	edit dl rm
pkgutil.py	21539	0644	edit dl rm
platform.py	50742	0755	edit dl rm
plistlib.py	14777	0644	edit dl rm
poplib.py	11372	0644	edit dl rm
posixpath.py	14254	0644	edit dl rm
pprint.py	12700	0644	edit dl rm
profile.py	21448	0755	edit dl rm
pstats.py	26372	0644	edit dl rm
pty.py	5055	0644	edit dl rm
pyclbr.py	13438	0644	edit dl rm
pydoc.py	101644	0755	edit dl rm
py_compile.py	6717	0644	edit dl rm
queue.py	8835	0644	edit dl rm
quopri.py	7315	0755	edit dl rm
random.py	25660	0644	edit dl rm
re.py	14973	0644	edit dl rm
reprlib.py	5110	0644	edit dl rm
rlcompleter.py	5526	0644	edit dl rm
runpy.py	10413	0644	edit dl rm
sched.py	6399	0644	edit dl rm
shelve.py	8243	0644	edit dl rm
shlex.py	11502	0644	edit dl rm
shutil.py	39147	0644	edit dl rm
site.py	21971	0644	edit dl rm
smtpd.py	30207	0755	edit dl rm
smtplib.py	38021	0755	edit dl rm
sndhdr.py	6219	0644	edit dl rm
socket.py	14913	0644	edit dl rm
socketserver.py	24196	0644	edit dl rm
sre_compile.py	16345	0644	edit dl rm
sre_constants.py	7231	0644	edit dl rm
sre_parse.py	30212	0644	edit dl rm
ssl.py	24478	0644	edit dl rm
stat.py	4304	0644	edit dl rm
string.py	9410	0644	edit dl rm
stringprep.py	12917	0644	edit dl rm
struct.py	238	0644	edit dl rm
subprocess.py	67578	0644	edit dl rm
sunau.py	17523	0644	edit dl rm
symbol.py	2051	0755	edit dl rm
symtable.py	7383	0644	edit dl rm
sysconfig.py	25174	0644	edit dl rm
tabnanny.py	11410	0755	edit dl rm
tarfile.py	88864	0755	edit dl rm
telnetlib.py	27349	0644	edit dl rm
tempfile.py	23013	0644	edit dl rm
textwrap.py	16488	0644	edit dl rm
this.py	1003	0644	edit dl rm
threading.py	45641	0644	edit dl rm
timeit.py	12395	0755	edit dl rm
token.py	3034	0644	edit dl rm
tokenize.py	24876	0644	edit dl rm
trace.py	31487	0755	edit dl rm
traceback.py	11982	0644	edit dl rm
tty.py	879	0644	edit dl rm
types.py	3167	0644	edit dl rm
uu.py	6766	0755	edit dl rm
uuid.py	22349	0644	edit dl rm
warnings.py	13825	0644	edit dl rm
wave.py	18579	0644	edit dl rm
weakref.py	11495	0644	edit dl rm
webbrowser.py	22913	0755	edit dl rm
xdrlib.py	5381	0644	edit dl rm
zipfile.py	66424	0644	edit dl rm
_compat_pickle.py	4338	0644	edit dl rm
_dummy_thread.py	4769	0644	edit dl rm
_markupbase.py	14598	0644	edit dl rm
_osx_support.py	18855	0644	edit dl rm
_pyio.py	72905	0644	edit dl rm
_strptime.py	21674	0644	edit dl rm
_sysconfigdata.py	21056	0644	edit dl rm
_threading_local.py	7410	0644	edit dl rm
_weakrefset.py	5705	0644	edit dl rm
__future__.py	4584	0644	edit dl rm
__phello__.foo.py	64	0644	edit dl rm

Edit: /opt/alt/python33/lib64/python3.3/ast.py (12142B)

"""
    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.
    """
    _safe_names = {'None': None, 'True': True, 'False': False}
    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(node):
        if 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((_convert(k), _convert(v)) for k, v
                        in zip(node.keys, node.values))
        elif isinstance(node, Name):
            if node.id in _safe_names:
                return _safe_names[node.id]
        elif isinstance(node, UnaryOp) and \
             isinstance(node.op, (UAdd, USub)) and \
             isinstance(node.operand, (Num, UnaryOp, BinOp)):
            operand = _convert(node.operand)
            if isinstance(node.op, UAdd):
                return + operand
            else:
                return - operand
        elif isinstance(node, BinOp) and \
             isinstance(node.op, (Add, Sub)) and \
             isinstance(node.right, (Num, UnaryOp, BinOp)) and \
             isinstance(node.left, (Num, UnaryOp, BinOp)):
            left = _convert(node.left)
            right = _convert(node.right)
            if isinstance(node.op, Add):
                return left + right
            else:
                return left - right
        raise ValueError('malformed node or string: ' + repr(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.  The returned string will show the names and the values
    for fields.  This makes the code impossible to evaluate, so if evaluation is
    wanted *annotate_fields* must be set to False.  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):
            fields = [(a, _format(b)) for a, b in iter_fields(node)]
            rv = '%s(%s' % (node.__class__.__name__, ', '.join(
                ('%s=%s' % field for field in fields)
                if annotate_fields else
                (b for a, b in fields)
            ))
            if include_attributes and node._attributes:
                rv += fields and ', ' or ' '
                rv += ', '.join('%s=%s' % (a, _format(getattr(node, a)))
                                for a in node._attributes)
            return rv + ')'
        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 not isinstance(node, (FunctionDef, ClassDef, Module)):
        raise TypeError("%r can't have docstrings" % node.__class__.__name__)
    if node.body and isinstance(node.body[0], Expr) and \
       isinstance(node.body[0].value, Str):
        if clean:
            import inspect
            return inspect.cleandoc(node.body[0].value.s)
        return node.body[0].value.s

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 copy_location(Subscript(
                   value=Name(id='data', ctx=Load()),
                   slice=Index(value=Str(s=node.id)),
                   ctx=node.ctx
               ), node)

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):
            old_value = getattr(node, field, None)
            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

cmd: