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/functools.py (13596B)

"""functools.py - Tools for working with functions and callable objects
"""
# Python module wrapper for _functools C module
# to allow utilities written in Python to be added
# to the functools module.
# Written by Nick Coghlan <ncoghlan at gmail.com>
# and Raymond Hettinger <python at rcn.com>
#   Copyright (C) 2006-2010 Python Software Foundation.
# See C source code for _functools credits/copyright

__all__ = ['update_wrapper', 'wraps', 'WRAPPER_ASSIGNMENTS', 'WRAPPER_UPDATES',
           'total_ordering', 'cmp_to_key', 'lru_cache', 'reduce', 'partial']

from _functools import partial, reduce
from collections import namedtuple
try:
    from _thread import RLock
except:
    class RLock:
        'Dummy reentrant lock for builds without threads'
        def __enter__(self): pass
        def __exit__(self, exctype, excinst, exctb): pass

################################################################################
### update_wrapper() and wraps() decorator
################################################################################

# update_wrapper() and wraps() are tools to help write
# wrapper functions that can handle naive introspection

WRAPPER_ASSIGNMENTS = ('__module__', '__name__', '__qualname__', '__doc__',
                       '__annotations__')
WRAPPER_UPDATES = ('__dict__',)
def update_wrapper(wrapper,
                   wrapped,
                   assigned = WRAPPER_ASSIGNMENTS,
                   updated = WRAPPER_UPDATES):
    """Update a wrapper function to look like the wrapped function

wrapper is the function to be updated
       wrapped is the original function
       assigned is a tuple naming the attributes assigned directly
       from the wrapped function to the wrapper function (defaults to
       functools.WRAPPER_ASSIGNMENTS)
       updated is a tuple naming the attributes of the wrapper that
       are updated with the corresponding attribute from the wrapped
       function (defaults to functools.WRAPPER_UPDATES)
    """
    wrapper.__wrapped__ = wrapped
    for attr in assigned:
        try:
            value = getattr(wrapped, attr)
        except AttributeError:
            pass
        else:
            setattr(wrapper, attr, value)
    for attr in updated:
        getattr(wrapper, attr).update(getattr(wrapped, attr, {}))
    # Return the wrapper so this can be used as a decorator via partial()
    return wrapper

def wraps(wrapped,
          assigned = WRAPPER_ASSIGNMENTS,
          updated = WRAPPER_UPDATES):
    """Decorator factory to apply update_wrapper() to a wrapper function

Returns a decorator that invokes update_wrapper() with the decorated
       function as the wrapper argument and the arguments to wraps() as the
       remaining arguments. Default arguments are as for update_wrapper().
       This is a convenience function to simplify applying partial() to
       update_wrapper().
    """
    return partial(update_wrapper, wrapped=wrapped,
                   assigned=assigned, updated=updated)

################################################################################
### total_ordering class decorator
################################################################################

def total_ordering(cls):
    """Class decorator that fills in missing ordering methods"""
    convert = {
        '__lt__': [('__gt__', lambda self, other: not (self < other or self == other)),
                   ('__le__', lambda self, other: self < other or self == other),
                   ('__ge__', lambda self, other: not self < other)],
        '__le__': [('__ge__', lambda self, other: not self <= other or self == other),
                   ('__lt__', lambda self, other: self <= other and not self == other),
                   ('__gt__', lambda self, other: not self <= other)],
        '__gt__': [('__lt__', lambda self, other: not (self > other or self == other)),
                   ('__ge__', lambda self, other: self > other or self == other),
                   ('__le__', lambda self, other: not self > other)],
        '__ge__': [('__le__', lambda self, other: (not self >= other) or self == other),
                   ('__gt__', lambda self, other: self >= other and not self == other),
                   ('__lt__', lambda self, other: not self >= other)]
    }
    # Find user-defined comparisons (not those inherited from object).
    roots = [op for op in convert if getattr(cls, op, None) is not getattr(object, op, None)]
    if not roots:
        raise ValueError('must define at least one ordering operation: < > <= >=')
    root = max(roots)       # prefer __lt__ to __le__ to __gt__ to __ge__
    for opname, opfunc in convert[root]:
        if opname not in roots:
            opfunc.__name__ = opname
            opfunc.__doc__ = getattr(int, opname).__doc__
            setattr(cls, opname, opfunc)
    return cls

################################################################################
### cmp_to_key() function converter
################################################################################

def cmp_to_key(mycmp):
    """Convert a cmp= function into a key= function"""
    class K(object):
        __slots__ = ['obj']
        def __init__(self, obj):
            self.obj = obj
        def __lt__(self, other):
            return mycmp(self.obj, other.obj) < 0
        def __gt__(self, other):
            return mycmp(self.obj, other.obj) > 0
        def __eq__(self, other):
            return mycmp(self.obj, other.obj) == 0
        def __le__(self, other):
            return mycmp(self.obj, other.obj) <= 0
        def __ge__(self, other):
            return mycmp(self.obj, other.obj) >= 0
        def __ne__(self, other):
            return mycmp(self.obj, other.obj) != 0
        __hash__ = None
    return K

try:
    from _functools import cmp_to_key
except ImportError:
    pass

################################################################################
### LRU Cache function decorator
################################################################################

_CacheInfo = namedtuple("CacheInfo", ["hits", "misses", "maxsize", "currsize"])

class _HashedSeq(list):
    """ This class guarantees that hash() will be called no more than once
        per element.  This is important because the lru_cache() will hash
        the key multiple times on a cache miss.

"""

__slots__ = 'hashvalue'

def __init__(self, tup, hash=hash):
        self[:] = tup
        self.hashvalue = hash(tup)

def __hash__(self):
        return self.hashvalue

def _make_key(args, kwds, typed,
             kwd_mark = (object(),),
             fasttypes = {int, str, frozenset, type(None)},
             sorted=sorted, tuple=tuple, type=type, len=len):
    """Make a cache key from optionally typed positional and keyword arguments

The key is constructed in a way that is flat as possible rather than
    as a nested structure that would take more memory.

If there is only a single argument and its data type is known to cache
    its hash value, then that argument is returned without a wrapper.  This
    saves space and improves lookup speed.

"""
    key = args
    if kwds:
        sorted_items = sorted(kwds.items())
        key += kwd_mark
        for item in sorted_items:
            key += item
    if typed:
        key += tuple(type(v) for v in args)
        if kwds:
            key += tuple(type(v) for k, v in sorted_items)
    elif len(key) == 1 and type(key[0]) in fasttypes:
        return key[0]
    return _HashedSeq(key)

def lru_cache(maxsize=128, typed=False):
    """Least-recently-used cache decorator.

If *maxsize* is set to None, the LRU features are disabled and the cache
    can grow without bound.

If *typed* is True, arguments of different types will be cached separately.
    For example, f(3.0) and f(3) will be treated as distinct calls with
    distinct results.

Arguments to the cached function must be hashable.

View the cache statistics named tuple (hits, misses, maxsize, currsize)
    with f.cache_info().  Clear the cache and statistics with f.cache_clear().
    Access the underlying function with f.__wrapped__.

See:  http://en.wikipedia.org/wiki/Cache_algorithms#Least_Recently_Used

"""

# Users should only access the lru_cache through its public API:
    #       cache_info, cache_clear, and f.__wrapped__
    # The internals of the lru_cache are encapsulated for thread safety and
    # to allow the implementation to change (including a possible C version).

# Constants shared by all lru cache instances:
    sentinel = object()          # unique object used to signal cache misses
    make_key = _make_key         # build a key from the function arguments
    PREV, NEXT, KEY, RESULT = 0, 1, 2, 3   # names for the link fields

def decorating_function(user_function):

cache = {}
        hits = misses = 0
        full = False
        cache_get = cache.get    # bound method to lookup a key or return None
        lock = RLock()           # because linkedlist updates aren't threadsafe
        root = []                # root of the circular doubly linked list
        root[:] = [root, root, None, None]     # initialize by pointing to self

if maxsize == 0:

def wrapper(*args, **kwds):
                # No caching -- just a statistics update after a successful call
                nonlocal misses
                result = user_function(*args, **kwds)
                misses += 1
                return result

elif maxsize is None:

def wrapper(*args, **kwds):
                # Simple caching without ordering or size limit
                nonlocal hits, misses
                key = make_key(args, kwds, typed)
                result = cache_get(key, sentinel)
                if result is not sentinel:
                    hits += 1
                    return result
                result = user_function(*args, **kwds)
                cache[key] = result
                misses += 1
                return result

else:

def wrapper(*args, **kwds):
                # Size limited caching that tracks accesses by recency
                nonlocal root, hits, misses, full
                key = make_key(args, kwds, typed)
                with lock:
                    link = cache_get(key)
                    if link is not None:
                        # Move the link to the front of the circular queue
                        link_prev, link_next, _key, result = link
                        link_prev[NEXT] = link_next
                        link_next[PREV] = link_prev
                        last = root[PREV]
                        last[NEXT] = root[PREV] = link
                        link[PREV] = last
                        link[NEXT] = root
                        hits += 1
                        return result
                result = user_function(*args, **kwds)
                with lock:
                    if key in cache:
                        # Getting here means that this same key was added to the
                        # cache while the lock was released.  Since the link
                        # update is already done, we need only return the
                        # computed result and update the count of misses.
                        pass
                    elif full:
                        # Use the old root to store the new key and result.
                        oldroot = root
                        oldroot[KEY] = key
                        oldroot[RESULT] = result
                        # Empty the oldest link and make it the new root.
                        # Keep a reference to the old key and old result to
                        # prevent their ref counts from going to zero during the
                        # update. That will prevent potentially arbitrary object
                        # clean-up code (i.e. __del__) from running while we're
                        # still adjusting the links.
                        root = oldroot[NEXT]
                        oldkey = root[KEY]
                        oldresult = root[RESULT]
                        root[KEY] = root[RESULT] = None
                        # Now update the cache dictionary.
                        del cache[oldkey]
                        # Save the potentially reentrant cache[key] assignment
                        # for last, after the root and links have been put in
                        # a consistent state.
                        cache[key] = oldroot
                    else:
                        # Put result in a new link at the front of the queue.
                        last = root[PREV]
                        link = [last, root, key, result]
                        last[NEXT] = root[PREV] = cache[key] = link
                        full = (len(cache) >= maxsize)
                    misses += 1
                return result

def cache_info():
            """Report cache statistics"""
            with lock:
                return _CacheInfo(hits, misses, maxsize, len(cache))

def cache_clear():
            """Clear the cache and cache statistics"""
            nonlocal hits, misses, full
            with lock:
                cache.clear()
                root[:] = [root, root, None, None]
                hits = misses = 0
                full = False

wrapper.cache_info = cache_info
        wrapper.cache_clear = cache_clear
        return update_wrapper(wrapper, user_function)

return decorating_function

cmd: