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/sre_compile.py (16345B)

#
# Secret Labs' Regular Expression Engine
#
# convert template to internal format
#
# Copyright (c) 1997-2001 by Secret Labs AB.  All rights reserved.
#
# See the sre.py file for information on usage and redistribution.
#

"""Internal support module for sre"""

import _sre, sys
import sre_parse
from sre_constants import *

assert _sre.MAGIC == MAGIC, "SRE module mismatch"

if _sre.CODESIZE == 2:
    MAXCODE = 65535
else:
    MAXCODE = 0xFFFFFFFF

def _identityfunction(x):
    return x

_LITERAL_CODES = set([LITERAL, NOT_LITERAL])
_REPEATING_CODES = set([REPEAT, MIN_REPEAT, MAX_REPEAT])
_SUCCESS_CODES = set([SUCCESS, FAILURE])
_ASSERT_CODES = set([ASSERT, ASSERT_NOT])

def _compile(code, pattern, flags):
    # internal: compile a (sub)pattern
    emit = code.append
    _len = len
    LITERAL_CODES = _LITERAL_CODES
    REPEATING_CODES = _REPEATING_CODES
    SUCCESS_CODES = _SUCCESS_CODES
    ASSERT_CODES = _ASSERT_CODES
    for op, av in pattern:
        if op in LITERAL_CODES:
            if flags & SRE_FLAG_IGNORECASE:
                emit(OPCODES[OP_IGNORE[op]])
                emit(_sre.getlower(av, flags))
            else:
                emit(OPCODES[op])
                emit(av)
        elif op is IN:
            if flags & SRE_FLAG_IGNORECASE:
                emit(OPCODES[OP_IGNORE[op]])
                def fixup(literal, flags=flags):
                    return _sre.getlower(literal, flags)
            else:
                emit(OPCODES[op])
                fixup = _identityfunction
            skip = _len(code); emit(0)
            _compile_charset(av, flags, code, fixup)
            code[skip] = _len(code) - skip
        elif op is ANY:
            if flags & SRE_FLAG_DOTALL:
                emit(OPCODES[ANY_ALL])
            else:
                emit(OPCODES[ANY])
        elif op in REPEATING_CODES:
            if flags & SRE_FLAG_TEMPLATE:
                raise error("internal: unsupported template operator")
                emit(OPCODES[REPEAT])
                skip = _len(code); emit(0)
                emit(av[0])
                emit(av[1])
                _compile(code, av[2], flags)
                emit(OPCODES[SUCCESS])
                code[skip] = _len(code) - skip
            elif _simple(av) and op is not REPEAT:
                if op is MAX_REPEAT:
                    emit(OPCODES[REPEAT_ONE])
                else:
                    emit(OPCODES[MIN_REPEAT_ONE])
                skip = _len(code); emit(0)
                emit(av[0])
                emit(av[1])
                _compile(code, av[2], flags)
                emit(OPCODES[SUCCESS])
                code[skip] = _len(code) - skip
            else:
                emit(OPCODES[REPEAT])
                skip = _len(code); emit(0)
                emit(av[0])
                emit(av[1])
                _compile(code, av[2], flags)
                code[skip] = _len(code) - skip
                if op is MAX_REPEAT:
                    emit(OPCODES[MAX_UNTIL])
                else:
                    emit(OPCODES[MIN_UNTIL])
        elif op is SUBPATTERN:
            if av[0]:
                emit(OPCODES[MARK])
                emit((av[0]-1)*2)
            # _compile_info(code, av[1], flags)
            _compile(code, av[1], flags)
            if av[0]:
                emit(OPCODES[MARK])
                emit((av[0]-1)*2+1)
        elif op in SUCCESS_CODES:
            emit(OPCODES[op])
        elif op in ASSERT_CODES:
            emit(OPCODES[op])
            skip = _len(code); emit(0)
            if av[0] >= 0:
                emit(0) # look ahead
            else:
                lo, hi = av[1].getwidth()
                if lo != hi:
                    raise error("look-behind requires fixed-width pattern")
                emit(lo) # look behind
            _compile(code, av[1], flags)
            emit(OPCODES[SUCCESS])
            code[skip] = _len(code) - skip
        elif op is CALL:
            emit(OPCODES[op])
            skip = _len(code); emit(0)
            _compile(code, av, flags)
            emit(OPCODES[SUCCESS])
            code[skip] = _len(code) - skip
        elif op is AT:
            emit(OPCODES[op])
            if flags & SRE_FLAG_MULTILINE:
                av = AT_MULTILINE.get(av, av)
            if flags & SRE_FLAG_LOCALE:
                av = AT_LOCALE.get(av, av)
            elif flags & SRE_FLAG_UNICODE:
                av = AT_UNICODE.get(av, av)
            emit(ATCODES[av])
        elif op is BRANCH:
            emit(OPCODES[op])
            tail = []
            tailappend = tail.append
            for av in av[1]:
                skip = _len(code); emit(0)
                # _compile_info(code, av, flags)
                _compile(code, av, flags)
                emit(OPCODES[JUMP])
                tailappend(_len(code)); emit(0)
                code[skip] = _len(code) - skip
            emit(0) # end of branch
            for tail in tail:
                code[tail] = _len(code) - tail
        elif op is CATEGORY:
            emit(OPCODES[op])
            if flags & SRE_FLAG_LOCALE:
                av = CH_LOCALE[av]
            elif flags & SRE_FLAG_UNICODE:
                av = CH_UNICODE[av]
            emit(CHCODES[av])
        elif op is GROUPREF:
            if flags & SRE_FLAG_IGNORECASE:
                emit(OPCODES[OP_IGNORE[op]])
            else:
                emit(OPCODES[op])
            emit(av-1)
        elif op is GROUPREF_EXISTS:
            emit(OPCODES[op])
            emit(av[0]-1)
            skipyes = _len(code); emit(0)
            _compile(code, av[1], flags)
            if av[2]:
                emit(OPCODES[JUMP])
                skipno = _len(code); emit(0)
                code[skipyes] = _len(code) - skipyes + 1
                _compile(code, av[2], flags)
                code[skipno] = _len(code) - skipno
            else:
                code[skipyes] = _len(code) - skipyes + 1
        else:
            raise ValueError("unsupported operand type", op)

def _compile_charset(charset, flags, code, fixup=None):
    # compile charset subprogram
    emit = code.append
    if fixup is None:
        fixup = _identityfunction
    for op, av in _optimize_charset(charset, fixup):
        emit(OPCODES[op])
        if op is NEGATE:
            pass
        elif op is LITERAL:
            emit(fixup(av))
        elif op is RANGE:
            emit(fixup(av[0]))
            emit(fixup(av[1]))
        elif op is CHARSET:
            code.extend(av)
        elif op is BIGCHARSET:
            code.extend(av)
        elif op is CATEGORY:
            if flags & SRE_FLAG_LOCALE:
                emit(CHCODES[CH_LOCALE[av]])
            elif flags & SRE_FLAG_UNICODE:
                emit(CHCODES[CH_UNICODE[av]])
            else:
                emit(CHCODES[av])
        else:
            raise error("internal: unsupported set operator")
    emit(OPCODES[FAILURE])

def _optimize_charset(charset, fixup):
    # internal: optimize character set
    out = []
    outappend = out.append
    charmap = [0]*256
    try:
        for op, av in charset:
            if op is NEGATE:
                outappend((op, av))
            elif op is LITERAL:
                charmap[fixup(av)] = 1
            elif op is RANGE:
                for i in range(fixup(av[0]), fixup(av[1])+1):
                    charmap[i] = 1
            elif op is CATEGORY:
                # XXX: could append to charmap tail
                return charset # cannot compress
    except IndexError:
        # character set contains unicode characters
        return _optimize_unicode(charset, fixup)
    # compress character map
    i = p = n = 0
    runs = []
    runsappend = runs.append
    for c in charmap:
        if c:
            if n == 0:
                p = i
            n = n + 1
        elif n:
            runsappend((p, n))
            n = 0
        i = i + 1
    if n:
        runsappend((p, n))
    if len(runs) <= 2:
        # use literal/range
        for p, n in runs:
            if n == 1:
                outappend((LITERAL, p))
            else:
                outappend((RANGE, (p, p+n-1)))
        if len(out) < len(charset):
            return out
    else:
        # use bitmap
        data = _mk_bitmap(charmap)
        outappend((CHARSET, data))
        return out
    return charset

def _mk_bitmap(bits):
    data = []
    dataappend = data.append
    if _sre.CODESIZE == 2:
        start = (1, 0)
    else:
        start = (1, 0)
    m, v = start
    for c in bits:
        if c:
            v = v + m
        m = m + m
        if m > MAXCODE:
            dataappend(v)
            m, v = start
    return data

# To represent a big charset, first a bitmap of all characters in the
# set is constructed. Then, this bitmap is sliced into chunks of 256
# characters, duplicate chunks are eliminated, and each chunk is
# given a number. In the compiled expression, the charset is
# represented by a 32-bit word sequence, consisting of one word for
# the number of different chunks, a sequence of 256 bytes (64 words)
# of chunk numbers indexed by their original chunk position, and a
# sequence of 256-bit chunks (8 words each).

# Compression is normally good: in a typical charset, large ranges of
# Unicode will be either completely excluded (e.g. if only cyrillic
# letters are to be matched), or completely included (e.g. if large
# subranges of Kanji match). These ranges will be represented by
# chunks of all one-bits or all zero-bits.

# Matching can be also done efficiently: the more significant byte of
# the Unicode character is an index into the chunk number, and the
# less significant byte is a bit index in the chunk (just like the
# CHARSET matching).

# The BIGCHARSET opcode still supports only subsets
# of the basic multilingual plane; an efficient representation
# for all of Unicode has not yet been developed. This means,
# in particular, that negated charsets cannot be represented as
# bigcharsets.

def _optimize_unicode(charset, fixup):
    try:
        import array
    except ImportError:
        return charset
    charmap = [0]*65536
    negate = 0
    try:
        for op, av in charset:
            if op is NEGATE:
                negate = 1
            elif op is LITERAL:
                charmap[fixup(av)] = 1
            elif op is RANGE:
                for i in range(fixup(av[0]), fixup(av[1])+1):
                    charmap[i] = 1
            elif op is CATEGORY:
                # XXX: could expand category
                return charset # cannot compress
    except IndexError:
        # non-BMP characters; XXX now they should work
        return charset
    if negate:
        if sys.maxunicode != 65535:
            # XXX: negation does not work with big charsets
            # XXX2: now they should work, but removing this will make the
            # charmap 17 times bigger
            return charset
        for i in range(65536):
            charmap[i] = not charmap[i]
    comps = {}
    mapping = [0]*256
    block = 0
    data = []
    for i in range(256):
        chunk = tuple(charmap[i*256:(i+1)*256])
        new = comps.setdefault(chunk, block)
        mapping[i] = new
        if new == block:
            block = block + 1
            data = data + _mk_bitmap(chunk)
    header = [block]
    if _sre.CODESIZE == 2:
        code = 'H'
    else:
        code = 'I'
    # Convert block indices to byte array of 256 bytes
    mapping = array.array('B', mapping).tobytes()
    # Convert byte array to word array
    mapping = array.array(code, mapping)
    assert mapping.itemsize == _sre.CODESIZE
    assert len(mapping) * mapping.itemsize == 256
    header = header + mapping.tolist()
    data[0:0] = header
    return [(BIGCHARSET, data)]

def _simple(av):
    # check if av is a "simple" operator
    lo, hi = av[2].getwidth()
    return lo == hi == 1 and av[2][0][0] != SUBPATTERN

def _compile_info(code, pattern, flags):
    # internal: compile an info block.  in the current version,
    # this contains min/max pattern width, and an optional literal
    # prefix or a character map
    lo, hi = pattern.getwidth()
    if lo == 0:
        return # not worth it
    # look for a literal prefix
    prefix = []
    prefixappend = prefix.append
    prefix_skip = 0
    charset = [] # not used
    charsetappend = charset.append
    if not (flags & SRE_FLAG_IGNORECASE):
        # look for literal prefix
        for op, av in pattern.data:
            if op is LITERAL:
                if len(prefix) == prefix_skip:
                    prefix_skip = prefix_skip + 1
                prefixappend(av)
            elif op is SUBPATTERN and len(av[1]) == 1:
                op, av = av[1][0]
                if op is LITERAL:
                    prefixappend(av)
                else:
                    break
            else:
                break
        # if no prefix, look for charset prefix
        if not prefix and pattern.data:
            op, av = pattern.data[0]
            if op is SUBPATTERN and av[1]:
                op, av = av[1][0]
                if op is LITERAL:
                    charsetappend((op, av))
                elif op is BRANCH:
                    c = []
                    cappend = c.append
                    for p in av[1]:
                        if not p:
                            break
                        op, av = p[0]
                        if op is LITERAL:
                            cappend((op, av))
                        else:
                            break
                    else:
                        charset = c
            elif op is BRANCH:
                c = []
                cappend = c.append
                for p in av[1]:
                    if not p:
                        break
                    op, av = p[0]
                    if op is LITERAL:
                        cappend((op, av))
                    else:
                        break
                else:
                    charset = c
            elif op is IN:
                charset = av
##     if prefix:
##         print "*** PREFIX", prefix, prefix_skip
##     if charset:
##         print "*** CHARSET", charset
    # add an info block
    emit = code.append
    emit(OPCODES[INFO])
    skip = len(code); emit(0)
    # literal flag
    mask = 0
    if prefix:
        mask = SRE_INFO_PREFIX
        if len(prefix) == prefix_skip == len(pattern.data):
            mask = mask + SRE_INFO_LITERAL
    elif charset:
        mask = mask + SRE_INFO_CHARSET
    emit(mask)
    # pattern length
    if lo < MAXCODE:
        emit(lo)
    else:
        emit(MAXCODE)
        prefix = prefix[:MAXCODE]
    if hi < MAXCODE:
        emit(hi)
    else:
        emit(0)
    # add literal prefix
    if prefix:
        emit(len(prefix)) # length
        emit(prefix_skip) # skip
        code.extend(prefix)
        # generate overlap table
        table = [-1] + ([0]*len(prefix))
        for i in range(len(prefix)):
            table[i+1] = table[i]+1
            while table[i+1] > 0 and prefix[i] != prefix[table[i+1]-1]:
                table[i+1] = table[table[i+1]-1]+1
        code.extend(table[1:]) # don't store first entry
    elif charset:
        _compile_charset(charset, flags, code)
    code[skip] = len(code) - skip

def isstring(obj):
    return isinstance(obj, (str, bytes))

def _code(p, flags):

flags = p.pattern.flags | flags
    code = []

# compile info block
    _compile_info(code, p, flags)

# compile the pattern
    _compile(code, p.data, flags)

code.append(OPCODES[SUCCESS])

return code

def compile(p, flags=0):
    # internal: convert pattern list to internal format

if isstring(p):
        pattern = p
        p = sre_parse.parse(p, flags)
    else:
        pattern = None

code = _code(p, flags)

# print code

# XXX: <fl> get rid of this limitation!
    if p.pattern.groups > 100:
        raise AssertionError(
            "sorry, but this version only supports 100 named groups"
            )

# map in either direction
    groupindex = p.pattern.groupdict
    indexgroup = [None] * p.pattern.groups
    for k, i in groupindex.items():
        indexgroup[i] = k

return _sre.compile(
        pattern, flags | p.pattern.flags, code,
        p.pattern.groups-1,
        groupindex, indexgroup
        )

cmd: