File Manager

✏️ /

#
# 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
import sre_parse
from sre_constants import *

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

_LITERAL_CODES = {LITERAL, NOT_LITERAL}
_REPEATING_CODES = {REPEAT, MIN_REPEAT, MAX_REPEAT}
_SUCCESS_CODES = {SUCCESS, FAILURE}
_ASSERT_CODES = {ASSERT, ASSERT_NOT}

# Sets of lowercase characters which have the same uppercase.
_equivalences = (
    # LATIN SMALL LETTER I, LATIN SMALL LETTER DOTLESS I
    (0x69, 0x131), # iı
    # LATIN SMALL LETTER S, LATIN SMALL LETTER LONG S
    (0x73, 0x17f), # sſ
    # MICRO SIGN, GREEK SMALL LETTER MU
    (0xb5, 0x3bc), # µμ
    # COMBINING GREEK YPOGEGRAMMENI, GREEK SMALL LETTER IOTA, GREEK PROSGEGRAMMENI
    (0x345, 0x3b9, 0x1fbe), # \u0345ιι
    # GREEK SMALL LETTER IOTA WITH DIALYTIKA AND TONOS, GREEK SMALL LETTER IOTA WITH DIALYTIKA AND OXIA
    (0x390, 0x1fd3), # ΐΐ
    # GREEK SMALL LETTER UPSILON WITH DIALYTIKA AND TONOS, GREEK SMALL LETTER UPSILON WITH DIALYTIKA AND OXIA
    (0x3b0, 0x1fe3), # ΰΰ
    # GREEK SMALL LETTER BETA, GREEK BETA SYMBOL
    (0x3b2, 0x3d0), # βϐ
    # GREEK SMALL LETTER EPSILON, GREEK LUNATE EPSILON SYMBOL
    (0x3b5, 0x3f5), # εϵ
    # GREEK SMALL LETTER THETA, GREEK THETA SYMBOL
    (0x3b8, 0x3d1), # θϑ
    # GREEK SMALL LETTER KAPPA, GREEK KAPPA SYMBOL
    (0x3ba, 0x3f0), # κϰ
    # GREEK SMALL LETTER PI, GREEK PI SYMBOL
    (0x3c0, 0x3d6), # πϖ
    # GREEK SMALL LETTER RHO, GREEK RHO SYMBOL
    (0x3c1, 0x3f1), # ρϱ
    # GREEK SMALL LETTER FINAL SIGMA, GREEK SMALL LETTER SIGMA
    (0x3c2, 0x3c3), # ςσ
    # GREEK SMALL LETTER PHI, GREEK PHI SYMBOL
    (0x3c6, 0x3d5), # φϕ
    # LATIN SMALL LETTER S WITH DOT ABOVE, LATIN SMALL LETTER LONG S WITH DOT ABOVE
    (0x1e61, 0x1e9b), # ṡẛ
    # LATIN SMALL LIGATURE LONG S T, LATIN SMALL LIGATURE ST
    (0xfb05, 0xfb06), # ﬅﬆ
)

# Maps the lowercase code to lowercase codes which have the same uppercase.
_ignorecase_fixes = {i: tuple(j for j in t if i != j)
                     for t in _equivalences for i in t}

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
    if (flags & SRE_FLAG_IGNORECASE and
            not (flags & SRE_FLAG_LOCALE) and
            flags & SRE_FLAG_UNICODE and
            not (flags & SRE_FLAG_ASCII)):
        fixes = _ignorecase_fixes
    else:
        fixes = None
    for op, av in pattern:
        if op in LITERAL_CODES:
            if flags & SRE_FLAG_IGNORECASE:
                lo = _sre.getlower(av, flags)
                if fixes and lo in fixes:
                    emit(IN_IGNORE)
                    skip = _len(code); emit(0)
                    if op is NOT_LITERAL:
                        emit(NEGATE)
                    for k in (lo,) + fixes[lo]:
                        emit(LITERAL)
                        emit(k)
                    emit(FAILURE)
                    code[skip] = _len(code) - skip
                else:
                    emit(OP_IGNORE[op])
                    emit(lo)
            else:
                emit(op)
                emit(av)
        elif op is IN:
            if flags & SRE_FLAG_IGNORECASE:
                emit(OP_IGNORE[op])
                def fixup(literal, flags=flags):
                    return _sre.getlower(literal, flags)
            else:
                emit(op)
                fixup = None
            skip = _len(code); emit(0)
            _compile_charset(av, flags, code, fixup, fixes)
            code[skip] = _len(code) - skip
        elif op is ANY:
            if flags & SRE_FLAG_DOTALL:
                emit(ANY_ALL)
            else:
                emit(ANY)
        elif op in REPEATING_CODES:
            if flags & SRE_FLAG_TEMPLATE:
                raise error("internal: unsupported template operator %r" % (op,))
            elif _simple(av) and op is not REPEAT:
                if op is MAX_REPEAT:
                    emit(REPEAT_ONE)
                else:
                    emit(MIN_REPEAT_ONE)
                skip = _len(code); emit(0)
                emit(av[0])
                emit(av[1])
                _compile(code, av[2], flags)
                emit(SUCCESS)
                code[skip] = _len(code) - skip
            else:
                emit(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(MAX_UNTIL)
                else:
                    emit(MIN_UNTIL)
        elif op is SUBPATTERN:
            group, add_flags, del_flags, p = av
            if group:
                emit(MARK)
                emit((group-1)*2)
            # _compile_info(code, p, (flags | add_flags) & ~del_flags)
            _compile(code, p, (flags | add_flags) & ~del_flags)
            if group:
                emit(MARK)
                emit((group-1)*2+1)
        elif op in SUCCESS_CODES:
            emit(op)
        elif op in ASSERT_CODES:
            emit(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(SUCCESS)
            code[skip] = _len(code) - skip
        elif op is CALL:
            emit(op)
            skip = _len(code); emit(0)
            _compile(code, av, flags)
            emit(SUCCESS)
            code[skip] = _len(code) - skip
        elif op is AT:
            emit(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) and not (flags & SRE_FLAG_ASCII):
                av = AT_UNICODE.get(av, av)
            emit(av)
        elif op is BRANCH:
            emit(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(JUMP)
                tailappend(_len(code)); emit(0)
                code[skip] = _len(code) - skip
            emit(FAILURE) # end of branch
            for tail in tail:
                code[tail] = _len(code) - tail
        elif op is CATEGORY:
            emit(op)
            if flags & SRE_FLAG_LOCALE:
                av = CH_LOCALE[av]
            elif (flags & SRE_FLAG_UNICODE) and not (flags & SRE_FLAG_ASCII):
                av = CH_UNICODE[av]
            emit(av)
        elif op is GROUPREF:
            if flags & SRE_FLAG_IGNORECASE:
                emit(OP_IGNORE[op])
            else:
                emit(op)
            emit(av-1)
        elif op is GROUPREF_EXISTS:
            emit(op)
            emit(av[0]-1)
            skipyes = _len(code); emit(0)
            _compile(code, av[1], flags)
            if av[2]:
                emit(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 error("internal: unsupported operand type %r" % (op,))

def _compile_charset(charset, flags, code, fixup=None, fixes=None):
    # compile charset subprogram
    emit = code.append
    for op, av in _optimize_charset(charset, fixup, fixes):
        emit(op)
        if op is NEGATE:
            pass
        elif op is LITERAL:
            emit(av)
        elif op is RANGE or op is RANGE_IGNORE:
            emit(av[0])
            emit(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(CH_LOCALE[av])
            elif (flags & SRE_FLAG_UNICODE) and not (flags & SRE_FLAG_ASCII):
                emit(CH_UNICODE[av])
            else:
                emit(av)
        else:
            raise error("internal: unsupported set operator %r" % (op,))
    emit(FAILURE)

def _optimize_charset(charset, fixup, fixes):
    # internal: optimize character set
    out = []
    tail = []
    charmap = bytearray(256)
    for op, av in charset:
        while True:
            try:
                if op is LITERAL:
                    if fixup:
                        lo = fixup(av)
                        charmap[lo] = 1
                        if fixes and lo in fixes:
                            for k in fixes[lo]:
                                charmap[k] = 1
                    else:
                        charmap[av] = 1
                elif op is RANGE:
                    r = range(av[0], av[1]+1)
                    if fixup:
                        r = map(fixup, r)
                    if fixup and fixes:
                        for i in r:
                            charmap[i] = 1
                            if i in fixes:
                                for k in fixes[i]:
                                    charmap[k] = 1
                    else:
                        for i in r:
                            charmap[i] = 1
                elif op is NEGATE:
                    out.append((op, av))
                else:
                    tail.append((op, av))
            except IndexError:
                if len(charmap) == 256:
                    # character set contains non-UCS1 character codes
                    charmap += b'\0' * 0xff00
                    continue
                # Character set contains non-BMP character codes.
                # There are only two ranges of cased non-BMP characters:
                # 10400-1044F (Deseret) and 118A0-118DF (Warang Citi),
                # and for both ranges RANGE_IGNORE works.
                if fixup and op is RANGE:
                    op = RANGE_IGNORE
                tail.append((op, av))
            break

# compress character map
    runs = []
    q = 0
    while True:
        p = charmap.find(1, q)
        if p < 0:
            break
        if len(runs) >= 2:
            runs = None
            break
        q = charmap.find(0, p)
        if q < 0:
            runs.append((p, len(charmap)))
            break
        runs.append((p, q))
    if runs is not None:
        # use literal/range
        for p, q in runs:
            if q - p == 1:
                out.append((LITERAL, p))
            else:
                out.append((RANGE, (p, q - 1)))
        out += tail
        # if the case was changed or new representation is more compact
        if fixup or len(out) < len(charset):
            return out
        # else original character set is good enough
        return charset

# use bitmap
    if len(charmap) == 256:
        data = _mk_bitmap(charmap)
        out.append((CHARSET, data))
        out += tail
        return out

# 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).

charmap = bytes(charmap) # should be hashable
    comps = {}
    mapping = bytearray(256)
    block = 0
    data = bytearray()
    for i in range(0, 65536, 256):
        chunk = charmap[i: i + 256]
        if chunk in comps:
            mapping[i // 256] = comps[chunk]
        else:
            mapping[i // 256] = comps[chunk] = block
            block += 1
            data += chunk
    data = _mk_bitmap(data)
    data[0:0] = [block] + _bytes_to_codes(mapping)
    out.append((BIGCHARSET, data))
    out += tail
    return out

_CODEBITS = _sre.CODESIZE * 8
MAXCODE = (1 << _CODEBITS) - 1
_BITS_TRANS = b'0' + b'1' * 255
def _mk_bitmap(bits, _CODEBITS=_CODEBITS, _int=int):
    s = bits.translate(_BITS_TRANS)[::-1]
    return [_int(s[i - _CODEBITS: i], 2)
            for i in range(len(s), 0, -_CODEBITS)]

def _bytes_to_codes(b):
    # Convert block indices to word array
    a = memoryview(b).cast('I')
    assert a.itemsize == _sre.CODESIZE
    assert len(a) * a.itemsize == len(b)
    return a.tolist()

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 _generate_overlap_table(prefix):
    """
    Generate an overlap table for the following prefix.
    An overlap table is a table of the same size as the prefix which
    informs about the potential self-overlap for each index in the prefix:
    - if overlap[i] == 0, prefix[i:] can't overlap prefix[0:...]
    - if overlap[i] == k with 0 < k <= i, prefix[i-k+1:i+1] overlaps with
      prefix[0:k]
    """
    table = [0] * len(prefix)
    for i in range(1, len(prefix)):
        idx = table[i - 1]
        while prefix[i] != prefix[idx]:
            if idx == 0:
                table[i] = 0
                break
            idx = table[idx - 1]
        else:
            table[i] = idx + 1
    return table

def _get_literal_prefix(pattern):
    # look for literal prefix
    prefix = []
    prefixappend = prefix.append
    prefix_skip = None
    for op, av in pattern.data:
        if op is LITERAL:
            prefixappend(av)
        elif op is SUBPATTERN:
            group, add_flags, del_flags, p = av
            if add_flags & SRE_FLAG_IGNORECASE:
                break
            prefix1, prefix_skip1, got_all = _get_literal_prefix(p)
            if prefix_skip is None:
                if group is not None:
                    prefix_skip = len(prefix)
                elif prefix_skip1 is not None:
                    prefix_skip = len(prefix) + prefix_skip1
            prefix.extend(prefix1)
            if not got_all:
                break
        else:
            break
    else:
        return prefix, prefix_skip, True
    return prefix, prefix_skip, False

def _get_charset_prefix(pattern):
    charset = [] # not used
    charsetappend = charset.append
    if pattern.data:
        op, av = pattern.data[0]
        if op is SUBPATTERN:
            group, add_flags, del_flags, p = av
            if p and not (add_flags & SRE_FLAG_IGNORECASE):
                op, av = p[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
    return charset

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 hi > MAXCODE:
        hi = MAXCODE
    if lo == 0:
        code.extend([INFO, 4, 0, lo, hi])
        return
    # look for a literal prefix
    prefix = []
    prefix_skip = 0
    charset = [] # not used
    if not (flags & SRE_FLAG_IGNORECASE):
        # look for literal prefix
        prefix, prefix_skip, got_all = _get_literal_prefix(pattern)
        # if no prefix, look for charset prefix
        if not prefix:
            charset = _get_charset_prefix(pattern)
##     if prefix:
##         print("*** PREFIX", prefix, prefix_skip)
##     if charset:
##         print("*** CHARSET", charset)
    # add an info block
    emit = code.append
    emit(INFO)
    skip = len(code); emit(0)
    # literal flag
    mask = 0
    if prefix:
        mask = SRE_INFO_PREFIX
        if prefix_skip is None and got_all:
            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]
    emit(min(hi, MAXCODE))
    # add literal prefix
    if prefix:
        emit(len(prefix)) # length
        if prefix_skip is None:
            prefix_skip =  len(prefix)
        emit(prefix_skip) # skip
        code.extend(prefix)
        # generate overlap table
        code.extend(_generate_overlap_table(prefix))
    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(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)

# 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
        )

Batal

⬅ lib64 200 item

Nama	Tipe	Ukuran	Diubah	Aksi
📁__pycache__	dir	—	2026-08-19 22:43	📂 Buka
📁asyncio	dir	—	2026-08-19 22:43	📂 Buka
📁collections	dir	—	2026-08-19 22:43	📂 Buka
📁concurrent	dir	—	2026-08-19 22:43	📂 Buka
📁config-3.6m-x86_64-linux-gnu	dir	—	2026-08-19 22:43	📂 Buka
📁ctypes	dir	—	2026-08-19 22:43	📂 Buka
📁curses	dir	—	2026-08-19 22:43	📂 Buka
📁dbm	dir	—	2026-08-19 22:43	📂 Buka
📁distutils	dir	—	2026-08-19 22:43	📂 Buka
📁email	dir	—	2026-08-19 22:43	📂 Buka
📁encodings	dir	—	2026-08-19 22:43	📂 Buka
📁ensurepip	dir	—	2026-08-19 22:43	📂 Buka
📁html	dir	—	2026-08-19 22:43	📂 Buka
📁http	dir	—	2026-08-19 22:43	📂 Buka
📁importlib	dir	—	2026-08-19 22:43	📂 Buka
📁json	dir	—	2026-08-19 22:43	📂 Buka
📁lib-dynload	dir	—	2026-08-19 22:43	📂 Buka
📁lib2to3	dir	—	2026-08-19 22:43	📂 Buka
📁logging	dir	—	2026-08-19 22:43	📂 Buka
📁multiprocessing	dir	—	2026-08-19 22:43	📂 Buka
📁pydoc_data	dir	—	2026-08-19 22:43	📂 Buka
📁site-packages	dir	—	2026-09-08 15:02	📂 Buka
📁sqlite3	dir	—	2026-08-19 22:43	📂 Buka
📁test	dir	—	2026-08-19 22:43	📂 Buka
📁unittest	dir	—	2026-08-19 22:43	📂 Buka
📁urllib	dir	—	2026-08-19 22:43	📂 Buka
📁venv	dir	—	2026-08-19 22:43	📂 Buka
📁wsgiref	dir	—	2026-08-19 22:43	📂 Buka
📁xml	dir	—	2026-08-19 22:43	📂 Buka
📁xmlrpc	dir	—	2026-08-19 22:43	📂 Buka
🐍__future__.py	py	4.7 KB	2018-12-23 21:37	✏️ 👁️
🐍__phello__.foo.py	py	64 B	2018-12-23 21:37	✏️ 👁️
🐍_bootlocale.py	py	1.3 KB	2018-12-23 21:37	✏️ 👁️
🐍_collections_abc.py	py	25.8 KB	2018-12-23 21:37	✏️ 👁️
🐍_compat_pickle.py	py	8.5 KB	2018-12-23 21:37	✏️ 👁️
🐍_compression.py	py	5.2 KB	2018-12-23 21:37	✏️ 👁️
🐍_dummy_thread.py	py	5 KB	2018-12-23 21:37	✏️ 👁️
🐍_markupbase.py	py	14.3 KB	2018-12-23 21:37	✏️ 👁️
🐍_osx_support.py	py	18.7 KB	2018-12-23 21:37	✏️ 👁️
🐍_pydecimal.py	py	224.8 KB	2018-12-23 21:37	✏️ 👁️
🐍_pyio.py	py	86 KB	2018-12-23 21:37	✏️ 👁️
🐍_sitebuiltins.py	py	3 KB	2018-12-23 21:37	✏️ 👁️
🐍_strptime.py	py	24.2 KB	2018-12-23 21:37	✏️ 👁️
🐍_sysconfigdata_dm_linux_x86_64-linux-gnu.py	py	29.5 KB	2026-08-18 15:04	✏️ 👁️
🐍_sysconfigdata_m_linux_x86_64-linux-gnu.py	py	29.7 KB	2026-08-18 15:08	✏️ 👁️
🐍_threading_local.py	py	7 KB	2018-12-23 21:37	✏️ 👁️
🐍_weakrefset.py	py	5.6 KB	2018-12-23 21:37	✏️ 👁️
🐍abc.py	py	8.5 KB	2018-12-23 21:37	✏️ 👁️
🐍aifc.py	py	31.7 KB	2018-12-23 21:37	✏️ 👁️
🐍antigravity.py	py	477 B	2018-12-23 21:37	✏️ 👁️
🐍argparse.py	py	88.3 KB	2018-12-23 21:37	✏️ 👁️
🐍ast.py	py	11.9 KB	2018-12-23 21:37	✏️ 👁️
🐍asynchat.py	py	11.1 KB	2018-12-23 21:37	✏️ 👁️
🐍asyncore.py	py	19.7 KB	2018-12-23 21:37	✏️ 👁️
🐍base64.py	py	19.9 KB	2018-12-23 21:37	✏️ 👁️
🐍bdb.py	py	23 KB	2018-12-23 21:37	✏️ 👁️
🐍binhex.py	py	13.6 KB	2018-12-23 21:37	✏️ 👁️
🐍bisect.py	py	2.5 KB	2018-12-23 21:37	✏️ 👁️
🐍bz2.py	py	12.2 KB	2018-12-23 21:37	✏️ 👁️
🐍cProfile.py	py	5.3 KB	2018-12-23 21:37	✏️ 👁️
🐍calendar.py	py	22.7 KB	2018-12-23 21:37	✏️ 👁️
🐍cgi.py	py	36.3 KB	2026-08-18 15:04	✏️ 👁️
🐍cgitb.py	py	11.7 KB	2018-12-23 21:37	✏️ 👁️
🐍chunk.py	py	5.3 KB	2018-12-23 21:37	✏️ 👁️
🐍cmd.py	py	14.5 KB	2018-12-23 21:37	✏️ 👁️
🐍code.py	py	10.4 KB	2018-12-23 21:37	✏️ 👁️
🐍codecs.py	py	35.4 KB	2018-12-23 21:37	✏️ 👁️
🐍codeop.py	py	5.9 KB	2018-12-23 21:37	✏️ 👁️
🐍colorsys.py	py	4 KB	2018-12-23 21:37	✏️ 👁️
🐍compileall.py	py	11.8 KB	2018-12-23 21:37	✏️ 👁️
🐍configparser.py	py	52.3 KB	2018-12-23 21:37	✏️ 👁️
🐍contextlib.py	py	12.9 KB	2018-12-23 21:37	✏️ 👁️
🐍copy.py	py	8.6 KB	2018-12-23 21:37	✏️ 👁️
🐍copyreg.py	py	6.8 KB	2018-12-23 21:37	✏️ 👁️
🐍crypt.py	py	1.8 KB	2018-12-23 21:37	✏️ 👁️
🐍csv.py	py	15.8 KB	2018-12-23 21:37	✏️ 👁️
🐍datetime.py	py	80.1 KB	2018-12-23 21:37	✏️ 👁️
🐍decimal.py	py	320 B	2018-12-23 21:37	✏️ 👁️
🐍difflib.py	py	82.4 KB	2018-12-23 21:37	✏️ 👁️
🐍dis.py	py	17.7 KB	2018-12-23 21:37	✏️ 👁️
🐍doctest.py	py	101.9 KB	2018-12-23 21:37	✏️ 👁️
🐍dummy_threading.py	py	2.7 KB	2018-12-23 21:37	✏️ 👁️
🐍enum.py	py	32.8 KB	2018-12-23 21:37	✏️ 👁️
🐍filecmp.py	py	9.6 KB	2018-12-23 21:37	✏️ 👁️
🐍fileinput.py	py	14.1 KB	2018-12-23 21:37	✏️ 👁️
🐍fnmatch.py	py	3.1 KB	2018-12-23 21:37	✏️ 👁️
🐍formatter.py	py	14.8 KB	2018-12-23 21:37	✏️ 👁️
🐍fractions.py	py	23.1 KB	2018-12-23 21:37	✏️ 👁️
🐍ftplib.py	py	34.8 KB	2026-08-18 15:04	✏️ 👁️
🐍functools.py	py	30.6 KB	2018-12-23 21:37	✏️ 👁️
🐍genericpath.py	py	4.9 KB	2026-08-18 15:04	✏️ 👁️
🐍getopt.py	py	7.3 KB	2018-12-23 21:37	✏️ 👁️
🐍getpass.py	py	5.9 KB	2018-12-23 21:37	✏️ 👁️
🐍gettext.py	py	21 KB	2018-12-23 21:37	✏️ 👁️
🐍glob.py	py	5.5 KB	2018-12-23 21:37	✏️ 👁️
🐍gzip.py	py	19.9 KB	2018-12-23 21:37	✏️ 👁️
🐍hashlib.py	py	8.6 KB	2026-08-18 15:04	✏️ 👁️
🐍heapq.py	py	22.4 KB	2018-12-23 21:37	✏️ 👁️
🐍hmac.py	py	6.2 KB	2026-08-18 15:04	✏️ 👁️
🐍imaplib.py	py	52.2 KB	2026-08-18 15:04	✏️ 👁️
🐍imghdr.py	py	3.7 KB	2018-12-23 21:37	✏️ 👁️
🐍imp.py	py	10.4 KB	2018-12-23 21:37	✏️ 👁️
🐍inspect.py	py	114.2 KB	2018-12-23 21:37	✏️ 👁️
🐍io.py	py	3.4 KB	2018-12-23 21:37	✏️ 👁️
🐍ipaddress.py	py	76 KB	2026-08-18 15:04	✏️ 👁️
🐍keyword.py	py	2.2 KB	2018-12-23 21:37	✏️ 👁️
🐍linecache.py	py	5.2 KB	2018-12-23 21:37	✏️ 👁️
🐍locale.py	py	75.5 KB	2018-12-23 21:37	✏️ 👁️
🐍lzma.py	py	12.7 KB	2018-12-23 21:37	✏️ 👁️
🐍macpath.py	py	5.8 KB	2018-12-23 21:37	✏️ 👁️
🐍macurl2path.py	py	2.7 KB	2018-12-23 21:37	✏️ 👁️
🐍mailbox.py	py	76.8 KB	2018-12-23 21:37	✏️ 👁️
🐍mailcap.py	py	8.9 KB	2026-08-18 15:04	✏️ 👁️
🐍mimetypes.py	py	20.5 KB	2018-12-23 21:37	✏️ 👁️
🐍modulefinder.py	py	22.5 KB	2018-12-23 21:37	✏️ 👁️
🐍netrc.py	py	5.6 KB	2018-12-23 21:37	✏️ 👁️
🐍nntplib.py	py	42.1 KB	2018-12-23 21:37	✏️ 👁️
🐍ntpath.py	py	22.6 KB	2018-12-23 21:37	✏️ 👁️
🐍nturl2path.py	py	2.4 KB	2018-12-23 21:37	✏️ 👁️
🐍numbers.py	py	10 KB	2018-12-23 21:37	✏️ 👁️
🐍opcode.py	py	5.7 KB	2018-12-23 21:37	✏️ 👁️
🐍operator.py	py	10.6 KB	2018-12-23 21:37	✏️ 👁️
🐍optparse.py	py	59 KB	2018-12-23 21:37	✏️ 👁️
🐍os.py	py	36.6 KB	2018-12-23 21:37	✏️ 👁️
🐍pathlib.py	py	45.2 KB	2026-08-18 15:04	✏️ 👁️
🐍pdb.py	py	59.9 KB	2018-12-23 21:37	✏️ 👁️
🐍pickle.py	py	54.4 KB	2018-12-23 21:37	✏️ 👁️
🐍pickletools.py	py	89.6 KB	2018-12-23 21:37	✏️ 👁️
🐍pipes.py	py	8.7 KB	2018-12-23 21:37	✏️ 👁️
🐍pkgutil.py	py	20.8 KB	2018-12-23 21:37	✏️ 👁️
🐍platform.py	py	46.1 KB	2026-08-18 15:04	✏️ 👁️
🐍plistlib.py	py	31.5 KB	2026-08-18 15:04	✏️ 👁️
🐍poplib.py	py	14.7 KB	2026-08-18 15:04	✏️ 👁️
🐍posixpath.py	py	15.9 KB	2026-08-18 15:04	✏️ 👁️
🐍pprint.py	py	20.4 KB	2018-12-23 21:37	✏️ 👁️
🐍profile.py	py	21.5 KB	2018-12-23 21:37	✏️ 👁️
🐍pstats.py	py	25.9 KB	2018-12-23 21:37	✏️ 👁️
🐍pty.py	py	4.7 KB	2018-12-23 21:37	✏️ 👁️
🐍py_compile.py	py	7 KB	2018-12-23 21:37	✏️ 👁️
🐍pyclbr.py	py	13.2 KB	2018-12-23 21:37	✏️ 👁️
🐍pydoc.py	py	101.1 KB	2026-08-18 15:09	✏️ 👁️
🐍queue.py	py	8.6 KB	2018-12-23 21:37	✏️ 👁️
🐍quopri.py	py	7.1 KB	2018-12-23 21:37	✏️ 👁️
🐍random.py	py	26.8 KB	2018-12-23 21:37	✏️ 👁️
🐍re.py	py	15.2 KB	2018-12-23 21:37	✏️ 👁️
🐍reprlib.py	py	5.2 KB	2018-12-23 21:37	✏️ 👁️
🐍rlcompleter.py	py	6.9 KB	2018-12-23 21:37	✏️ 👁️
🐍runpy.py	py	11.7 KB	2018-12-23 21:37	✏️ 👁️
🐍sched.py	py	6.4 KB	2018-12-23 21:37	✏️ 👁️
🐍secrets.py	py	2 KB	2018-12-23 21:37	✏️ 👁️
🐍selectors.py	py	19 KB	2018-12-23 21:37	✏️ 👁️
🐍shelve.py	py	8.3 KB	2018-12-23 21:37	✏️ 👁️
🐍shlex.py	py	12.7 KB	2018-12-23 21:37	✏️ 👁️
🐍shutil.py	py	39.9 KB	2026-08-18 15:04	✏️ 👁️
🐍signal.py	py	2.1 KB	2018-12-23 21:37	✏️ 👁️
🐍site.py	py	20.8 KB	2026-08-18 15:04	✏️ 👁️
🐍smtpd.py	py	33.9 KB	2018-12-23 21:37	✏️ 👁️
🐍smtplib.py	py	43.2 KB	2018-12-23 21:37	✏️ 👁️
🐍sndhdr.py	py	6.9 KB	2018-12-23 21:37	✏️ 👁️
🐍socket.py	py	26.8 KB	2018-12-23 21:37	✏️ 👁️
🐍socketserver.py	py	26.4 KB	2018-12-23 21:37	✏️ 👁️
🐍sre_compile.py	py	18.9 KB	2018-12-23 21:37	✏️ 👁️
🐍sre_constants.py	py	6.7 KB	2018-12-23 21:37	✏️ 👁️
🐍sre_parse.py	py	35.7 KB	2018-12-23 21:37	✏️ 👁️
🐍ssl.py	py	43.5 KB	2026-08-18 15:04	✏️ 👁️
🐍stat.py	py	4.9 KB	2018-12-23 21:37	✏️ 👁️
🐍statistics.py	py	20.2 KB	2018-12-23 21:37	✏️ 👁️
🐍string.py	py	11.5 KB	2018-12-23 21:37	✏️ 👁️
🐍stringprep.py	py	12.6 KB	2018-12-23 21:37	✏️ 👁️
🐍struct.py	py	257 B	2018-12-23 21:37	✏️ 👁️
🐍subprocess.py	py	60.9 KB	2018-12-23 21:37	✏️ 👁️
🐍sunau.py	py	17.7 KB	2018-12-23 21:37	✏️ 👁️
🐍symbol.py	py	2.1 KB	2018-12-23 21:37	✏️ 👁️
🐍symtable.py	py	7.1 KB	2018-12-23 21:37	✏️ 👁️
🐍sysconfig.py	py	24.3 KB	2026-08-18 15:09	✏️ 👁️
🐍tabnanny.py	py	11.1 KB	2018-12-23 21:37	✏️ 👁️
🐍tarfile.py	py	109.2 KB	2026-08-18 15:04	✏️ 👁️
🐍telnetlib.py	py	22.6 KB	2018-12-23 21:37	✏️ 👁️
🐍tempfile.py	py	27.4 KB	2026-08-18 15:04	✏️ 👁️
🐍textwrap.py	py	19.1 KB	2018-12-23 21:37	✏️ 👁️
🐍this.py	py	1003 B	2018-12-23 21:37	✏️ 👁️
🐍threading.py	py	49 KB	2026-08-18 15:04	✏️ 👁️
🐍timeit.py	py	13 KB	2018-12-23 21:37	✏️ 👁️
🐍token.py	py	3 KB	2018-12-23 21:37	✏️ 👁️
🐍tokenize.py	py	28.8 KB	2018-12-23 21:37	✏️ 👁️
🐍trace.py	py	28.1 KB	2018-12-23 21:37	✏️ 👁️
🐍traceback.py	py	22.9 KB	2018-12-23 21:37	✏️ 👁️
🐍tracemalloc.py	py	16.3 KB	2018-12-23 21:37	✏️ 👁️
🐍tty.py	py	879 B	2018-12-23 21:37	✏️ 👁️
🐍types.py	py	8.7 KB	2018-12-23 21:37	✏️ 👁️
🐍typing.py	py	78.4 KB	2018-12-23 21:37	✏️ 👁️
🐍uu.py	py	6.6 KB	2018-12-23 21:37	✏️ 👁️
🐍uuid.py	py	23.5 KB	2026-08-18 15:04	✏️ 👁️
🐍warnings.py	py	18.1 KB	2018-12-23 21:37	✏️ 👁️
🐍wave.py	py	17.3 KB	2018-12-23 21:37	✏️ 👁️
🐍weakref.py	py	20 KB	2018-12-23 21:37	✏️ 👁️
🐍webbrowser.py	py	21.7 KB	2026-08-18 15:04	✏️ 👁️
🐍xdrlib.py	py	5.8 KB	2018-12-23 21:37	✏️ 👁️
🐍zipapp.py	py	7 KB	2018-12-23 21:37	✏️ 👁️
🐍zipfile.py	py	78.1 KB	2026-08-18 15:04	✏️ 👁️

✏️ Rename