Karma Syndicate

Linux server.ecdscs.com 3.10.0-962.3.2.lve1.5.88.el7.x86_64 #1 SMP Fri Sep 26 14:06:42 UTC 2025 x86_64

Apache

162.55.4.141

File Name : _pylong.py

"""Python implementations of some algorithms for use by longobject.c.
The goal is to provide asymptotically faster algorithms that can be
used for operations on integers with many digits.  In those cases, the
performance overhead of the Python implementation is not significant
since the asymptotic behavior is what dominates runtime. Functions
provided by this module should be considered private and not part of any
public API.

Note: for ease of maintainability, please prefer clear code and avoid
"micro-optimizations".  This module will only be imported and used for
integers with a huge number of digits.  Saving a few microseconds with
tricky or non-obvious code is not worth it.  For people looking for
maximum performance, they should use something like gmpy2."""

import re
import decimal
try:
    import _decimal
except ImportError:
    _decimal = None

def int_to_decimal(n):
    """Asymptotically fast conversion of an 'int' to Decimal."""

# Function due to Tim Peters.  See GH issue #90716 for details.
    # https://github.com/python/cpython/issues/90716
    #
    # The implementation in longobject.c of base conversion algorithms
    # between power-of-2 and non-power-of-2 bases are quadratic time.
    # This function implements a divide-and-conquer algorithm that is
    # faster for large numbers.  Builds an equal decimal.Decimal in a
    # "clever" recursive way.  If we want a string representation, we
    # apply str to _that_.

D = decimal.Decimal
    D2 = D(2)

BITLIM = 128

mem = {}

def w2pow(w):
        """Return D(2)**w and store the result. Also possibly save some
        intermediate results. In context, these are likely to be reused
        across various levels of the conversion to Decimal."""
        if (result := mem.get(w)) is None:
            if w <= BITLIM:
                result = D2**w
            elif w - 1 in mem:
                result = (t := mem[w - 1]) + t
            else:
                w2 = w >> 1
                # If w happens to be odd, w-w2 is one larger then w2
                # now. Recurse on the smaller first (w2), so that it's
                # in the cache and the larger (w-w2) can be handled by
                # the cheaper `w-1 in mem` branch instead.
                result = w2pow(w2) * w2pow(w - w2)
            mem[w] = result
        return result

def inner(n, w):
        if w <= BITLIM:
            return D(n)
        w2 = w >> 1
        hi = n >> w2
        lo = n - (hi << w2)
        return inner(lo, w2) + inner(hi, w - w2) * w2pow(w2)

with decimal.localcontext() as ctx:
        ctx.prec = decimal.MAX_PREC
        ctx.Emax = decimal.MAX_EMAX
        ctx.Emin = decimal.MIN_EMIN
        ctx.traps[decimal.Inexact] = 1

if n < 0:
            negate = True
            n = -n
        else:
            negate = False
        result = inner(n, n.bit_length())
        if negate:
            result = -result
    return result

def int_to_decimal_string(n):
    """Asymptotically fast conversion of an 'int' to a decimal string."""
    w = n.bit_length()
    if w > 450_000 and _decimal is not None:
        # It is only usable with the C decimal implementation.
        # _pydecimal.py calls str() on very large integers, which in its
        # turn calls int_to_decimal_string(), causing very deep recursion.
        return str(int_to_decimal(n))

# Fallback algorithm for the case when the C decimal module isn't
    # available.  This algorithm is asymptotically worse than the algorithm
    # using the decimal module, but better than the quadratic time
    # implementation in longobject.c.
    def inner(n, w):
        if w <= 1000:
            return str(n)
        w2 = w >> 1
        d = pow10_cache.get(w2)
        if d is None:
            d = pow10_cache[w2] = 5**w2 << w2 # 10**i = (5*2)**i = 5**i * 2**i
        hi, lo = divmod(n, d)
        return inner(hi, w - w2) + inner(lo, w2).zfill(w2)

# The estimation of the number of decimal digits.
    # There is no harm in small error.  If we guess too large, there may
    # be leading 0's that need to be stripped.  If we guess too small, we
    # may need to call str() recursively for the remaining highest digits,
    # which can still potentially be a large integer. This is manifested
    # only if the number has way more than 10**15 digits, that exceeds
    # the 52-bit physical address limit in both Intel64 and AMD64.
    w = int(w * 0.3010299956639812 + 1)  # log10(2)
    pow10_cache = {}
    if n < 0:
        n = -n
        sign = '-'
    else:
        sign = ''
    s = inner(n, w)
    if s[0] == '0' and n:
        # If our guess of w is too large, there may be leading 0's that
        # need to be stripped.
        s = s.lstrip('0')
    return sign + s

def _str_to_int_inner(s):
    """Asymptotically fast conversion of a 'str' to an 'int'."""

# Function due to Bjorn Martinsson.  See GH issue #90716 for details.
    # https://github.com/python/cpython/issues/90716
    #
    # The implementation in longobject.c of base conversion algorithms
    # between power-of-2 and non-power-of-2 bases are quadratic time.
    # This function implements a divide-and-conquer algorithm making use
    # of Python's built in big int multiplication. Since Python uses the
    # Karatsuba algorithm for multiplication, the time complexity
    # of this function is O(len(s)**1.58).

DIGLIM = 2048

mem = {}

def w5pow(w):
        """Return 5**w and store the result.
        Also possibly save some intermediate results. In context, these
        are likely to be reused across various levels of the conversion
        to 'int'.
        """
        if (result := mem.get(w)) is None:
            if w <= DIGLIM:
                result = 5**w
            elif w - 1 in mem:
                result = mem[w - 1] * 5
            else:
                w2 = w >> 1
                # If w happens to be odd, w-w2 is one larger then w2
                # now. Recurse on the smaller first (w2), so that it's
                # in the cache and the larger (w-w2) can be handled by
                # the cheaper `w-1 in mem` branch instead.
                result = w5pow(w2) * w5pow(w - w2)
            mem[w] = result
        return result

def inner(a, b):
        if b - a <= DIGLIM:
            return int(s[a:b])
        mid = (a + b + 1) >> 1
        return inner(mid, b) + ((inner(a, mid) * w5pow(b - mid)) << (b - mid))

return inner(0, len(s))

def int_from_string(s):
    """Asymptotically fast version of PyLong_FromString(), conversion
    of a string of decimal digits into an 'int'."""
    # PyLong_FromString() has already removed leading +/-, checked for invalid
    # use of underscore characters, checked that string consists of only digits
    # and underscores, and stripped leading whitespace.  The input can still
    # contain underscores and have trailing whitespace.
    s = s.rstrip().replace('_', '')
    return _str_to_int_inner(s)

def str_to_int(s):
    """Asymptotically fast version of decimal string to 'int' conversion."""
    # FIXME: this doesn't support the full syntax that int() supports.
    m = re.match(r'\s*([+-]?)([0-9_]+)\s*', s)
    if not m:
        raise ValueError('invalid literal for int() with base 10')
    v = int_from_string(m.group(2))
    if m.group(1) == '-':
        v = -v
    return v

# Fast integer division, based on code from Mark Dickinson, fast_div.py
# GH-47701. Additional refinements and optimizations by Bjorn Martinsson.  The
# algorithm is due to Burnikel and Ziegler, in their paper "Fast Recursive
# Division".

_DIV_LIMIT = 4000

def _div2n1n(a, b, n):
    """Divide a 2n-bit nonnegative integer a by an n-bit positive integer
    b, using a recursive divide-and-conquer algorithm.

Inputs:
      n is a positive integer
      b is a positive integer with exactly n bits
      a is a nonnegative integer such that a < 2**n * b

Output:
      (q, r) such that a = b*q+r and 0 <= r < b.

"""
    if a.bit_length() - n <= _DIV_LIMIT:
        return divmod(a, b)
    pad = n & 1
    if pad:
        a <<= 1
        b <<= 1
        n += 1
    half_n = n >> 1
    mask = (1 << half_n) - 1
    b1, b2 = b >> half_n, b & mask
    q1, r = _div3n2n(a >> n, (a >> half_n) & mask, b, b1, b2, half_n)
    q2, r = _div3n2n(r, a & mask, b, b1, b2, half_n)
    if pad:
        r >>= 1
    return q1 << half_n | q2, r

def _div3n2n(a12, a3, b, b1, b2, n):
    """Helper function for _div2n1n; not intended to be called directly."""
    if a12 >> n == b1:
        q, r = (1 << n) - 1, a12 - (b1 << n) + b1
    else:
        q, r = _div2n1n(a12, b1, n)
    r = (r << n | a3) - q * b2
    while r < 0:
        q -= 1
        r += b
    return q, r

def _int2digits(a, n):
    """Decompose non-negative int a into base 2**n

Input:
      a is a non-negative integer

Output:
      List of the digits of a in base 2**n in little-endian order,
      meaning the most significant digit is last. The most
      significant digit is guaranteed to be non-zero.
      If a is 0 then the output is an empty list.

"""
    a_digits = [0] * ((a.bit_length() + n - 1) // n)

def inner(x, L, R):
        if L + 1 == R:
            a_digits[L] = x
            return
        mid = (L + R) >> 1
        shift = (mid - L) * n
        upper = x >> shift
        lower = x ^ (upper << shift)
        inner(lower, L, mid)
        inner(upper, mid, R)

if a:
        inner(a, 0, len(a_digits))
    return a_digits

def _digits2int(digits, n):
    """Combine base-2**n digits into an int. This function is the
    inverse of `_int2digits`. For more details, see _int2digits.
    """

def inner(L, R):
        if L + 1 == R:
            return digits[L]
        mid = (L + R) >> 1
        shift = (mid - L) * n
        return (inner(mid, R) << shift) + inner(L, mid)

return inner(0, len(digits)) if digits else 0

def _divmod_pos(a, b):
    """Divide a non-negative integer a by a positive integer b, giving
    quotient and remainder."""
    # Use grade-school algorithm in base 2**n, n = nbits(b)
    n = b.bit_length()
    a_digits = _int2digits(a, n)

r = 0
    q_digits = []
    for a_digit in reversed(a_digits):
        q_digit, r = _div2n1n((r << n) + a_digit, b, n)
        q_digits.append(q_digit)
    q_digits.reverse()
    q = _digits2int(q_digits, n)
    return q, r

def int_divmod(a, b):
    """Asymptotically fast replacement for divmod, for 'int'.
    Its time complexity is O(n**1.58), where n = #bits(a) + #bits(b).
    """
    if b == 0:
        raise ZeroDivisionError
    elif b < 0:
        q, r = int_divmod(-a, -b)
        return q, -r
    elif a < 0:
        q, r = int_divmod(~a, b)
        return ~q, b + ~r
    else:
        return _divmod_pos(a, b)

System Information
*ReClick For Close
File : KarmaSyndicate /syndicate.php

Name	Type	Size	Owner/Group	Permission	Last Modified	Actions
.	dir	-	root/linksafe	0755	2025-07-22 08:14:18
..	dir	-	root/root	0755	2025-07-22 08:14:16
__pycache__	dir	-	root/linksafe	0755	2025-07-22 08:14:17
asyncio	dir	-	root/linksafe	0755	2025-07-22 08:14:17
collections	dir	-	root/linksafe	0755	2025-07-22 08:14:17
concurrent	dir	-	root/linksafe	0755	2025-07-22 08:14:17
config-3.12-x86_64-linux-gnu	dir	-	root/linksafe	0755	2025-07-22 08:14:17
ctypes	dir	-	root/linksafe	0755	2025-07-22 08:14:17
curses	dir	-	root/linksafe	0755	2025-07-22 08:14:17
dbm	dir	-	root/linksafe	0755	2025-07-22 08:14:17
email	dir	-	root/linksafe	0755	2025-07-22 08:14:17
encodings	dir	-	root/linksafe	0755	2025-07-22 08:14:17
ensurepip	dir	-	root/linksafe	0755	2025-07-22 08:14:17
html	dir	-	root/linksafe	0755	2025-07-22 08:14:17
http	dir	-	root/linksafe	0755	2025-07-22 08:14:17
importlib	dir	-	root/linksafe	0755	2025-07-22 08:14:17
json	dir	-	root/linksafe	0755	2025-07-22 08:14:17
lib-dynload	dir	-	root/linksafe	0755	2025-07-22 08:14:17
lib2to3	dir	-	root/linksafe	0755	2025-07-22 08:15:41
logging	dir	-	root/linksafe	0755	2025-07-22 08:14:17
multiprocessing	dir	-	root/linksafe	0755	2025-07-22 08:14:17
pydoc_data	dir	-	root/linksafe	0755	2025-07-22 08:14:17
re	dir	-	root/linksafe	0755	2025-07-22 08:14:17
site-packages	dir	-	root/linksafe	0755	2025-07-22 08:14:18
sqlite3	dir	-	root/linksafe	0755	2025-07-22 08:14:18
tomllib	dir	-	root/linksafe	0755	2025-07-22 08:14:18
unittest	dir	-	root/linksafe	0755	2025-07-22 08:14:18
urllib	dir	-	root/linksafe	0755	2025-07-22 08:14:18
venv	dir	-	root/linksafe	0755	2025-07-22 08:14:18
wsgiref	dir	-	root/linksafe	0755	2025-07-22 08:14:18
xml	dir	-	root/linksafe	0755	2025-07-22 08:14:18
xmlrpc	dir	-	root/linksafe	0755	2025-07-22 08:14:18
zipfile	dir	-	root/linksafe	0755	2025-07-22 08:14:18
zoneinfo	dir	-	root/linksafe	0755	2025-07-22 08:14:18
LICENSE.txt	text/plain	13.61 KB	root/linksafe	0644	2025-06-03 03:41:47
__future__.py	text/plain	5.1 KB	root/linksafe	0644	2025-06-23 01:12:10
__hello__.py	text/plain	227 B	root/linksafe	0644	2025-06-23 01:12:10
_aix_support.py	text/plain	3.93 KB	root/linksafe	0644	2025-06-23 01:12:06
_collections_abc.py	text/x-python	31.34 KB	root/linksafe	0644	2025-06-23 01:12:02
_compat_pickle.py	text/plain	8.56 KB	root/linksafe	0644	2025-06-23 01:12:05
_compression.py	text/plain	5.55 KB	root/linksafe	0644	2025-06-23 01:12:02
_markupbase.py	text/plain	14.31 KB	root/linksafe	0644	2025-06-23 01:12:02
_osx_support.py	text/plain	21.51 KB	root/linksafe	0644	2025-06-23 01:12:06
_py_abc.py	text/x-python	6.04 KB	root/linksafe	0644	2025-06-23 01:12:09
_pydatetime.py	text/plain	89.93 KB	root/linksafe	0644	2025-06-23 01:12:09
_pydecimal.py	text/x-python	221.96 KB	root/linksafe	0644	2025-06-23 01:12:00
_pyio.py	text/plain	91.4 KB	root/linksafe	0644	2025-06-23 01:12:02
_pylong.py	text/plain	10.54 KB	root/linksafe	0644	2025-06-23 01:12:02
_sitebuiltins.py	text/plain	3.05 KB	root/linksafe	0644	2025-06-23 01:12:02
_strptime.py	text/plain	27.73 KB	root/linksafe	0644	2025-06-23 01:12:09
_sysconfigdata__linux_x86_64-linux-gnu.py	text/plain	72.94 KB	root/linksafe	0644	2025-06-23 01:20:27
_sysconfigdata_d_linux_x86_64-linux-gnu.py	text/plain	72.9 KB	root/linksafe	0644	2025-06-23 01:13:19
_threading_local.py	text/plain	7.05 KB	root/linksafe	0644	2025-06-23 01:12:02
_weakrefset.py	text/x-python	5.75 KB	root/linksafe	0644	2025-06-23 01:12:00
abc.py	text/x-python	6.38 KB	root/linksafe	0644	2025-06-23 01:12:02
aifc.py	text/plain	33.41 KB	root/linksafe	0644	2025-06-23 01:12:09
antigravity.py	text/x-python	500 B	root/linksafe	0644	2025-06-23 01:12:02
argparse.py	text/x-python	98.78 KB	root/linksafe	0644	2025-06-23 01:12:06
ast.py	text/plain	62.94 KB	root/linksafe	0644	2025-06-23 01:12:06
base64.py	text/plain	20.16 KB	root/linksafe	0755	2025-06-23 01:12:02
bdb.py	text/plain	32.79 KB	root/linksafe	0644	2025-06-23 01:12:05
bisect.py	text/plain	3.34 KB	root/linksafe	0644	2025-06-23 01:12:00
bz2.py	text/plain	11.57 KB	root/linksafe	0644	2025-06-23 01:12:06
cProfile.py	text/plain	6.42 KB	root/linksafe	0755	2025-06-23 01:12:00
calendar.py	text/plain	25.26 KB	root/linksafe	0644	2025-06-23 01:12:06
cgi.py	text/plain	33.63 KB	root/linksafe	0755	2025-06-23 01:12:06
cgitb.py	text/plain	12.13 KB	root/linksafe	0644	2025-06-23 01:12:10
chunk.py	text/plain	5.37 KB	root/linksafe	0644	2025-06-23 01:12:02
cmd.py	text/plain	14.52 KB	root/linksafe	0644	2025-06-23 01:12:00
code.py	text/plain	10.71 KB	root/linksafe	0644	2025-06-23 01:12:02
codecs.py	text/plain	36.01 KB	root/linksafe	0644	2025-06-23 01:12:02
codeop.py	text/x-python	5.77 KB	root/linksafe	0644	2025-06-23 01:12:01
colorsys.py	text/plain	3.97 KB	root/linksafe	0644	2025-06-23 01:12:02
compileall.py	text/plain	20.03 KB	root/linksafe	0644	2025-06-23 01:12:00
configparser.py	text/plain	52.53 KB	root/linksafe	0644	2025-06-23 01:12:02
contextlib.py	text/plain	26.99 KB	root/linksafe	0644	2025-06-23 01:12:01
contextvars.py	text/x-python	129 B	root/linksafe	0644	2025-06-23 01:12:06
copy.py	text/plain	8.21 KB	root/linksafe	0644	2025-06-23 01:12:02
copyreg.py	text/plain	7.44 KB	root/linksafe	0644	2025-06-23 01:12:06
crypt.py	text/plain	3.82 KB	root/linksafe	0644	2025-06-23 01:12:02
csv.py	text/x-python	16 KB	root/linksafe	0644	2025-06-23 01:12:02
dataclasses.py	text/x-python	60.63 KB	root/linksafe	0644	2025-06-23 01:12:06
datetime.py	text/x-python	268 B	root/linksafe	0644	2025-06-23 01:12:10
decimal.py	text/plain	2.74 KB	root/linksafe	0644	2025-06-23 01:12:06
difflib.py	text/plain	81.41 KB	root/linksafe	0644	2025-06-23 01:12:02
dis.py	text/plain	29.52 KB	root/linksafe	0644	2025-06-23 01:12:02
doctest.py	text/x-python	104.25 KB	root/linksafe	0644	2025-06-23 01:12:02
enum.py	text/x-python	79.63 KB	root/linksafe	0644	2025-06-23 01:12:02
filecmp.py	text/plain	10.14 KB	root/linksafe	0644	2025-06-23 01:12:02
fileinput.py	text/plain	15.35 KB	root/linksafe	0644	2025-06-23 01:12:02
fnmatch.py	text/plain	5.86 KB	root/linksafe	0644	2025-06-23 01:12:02
fractions.py	text/x-python	37.25 KB	root/linksafe	0644	2025-06-23 01:12:00
ftplib.py	text/plain	33.92 KB	root/linksafe	0644	2025-06-23 01:12:02
functools.py	text/plain	37.05 KB	root/linksafe	0644	2025-06-23 01:12:10
genericpath.py	text/plain	5.44 KB	root/linksafe	0644	2025-06-23 01:12:10
getopt.py	text/plain	7.31 KB	root/linksafe	0644	2025-06-23 01:12:06
getpass.py	text/plain	5.85 KB	root/linksafe	0644	2025-06-23 01:12:00
gettext.py	text/plain	20.82 KB	root/linksafe	0644	2025-06-23 01:12:06
glob.py	text/plain	8.53 KB	root/linksafe	0644	2025-06-23 01:12:01
graphlib.py	text/x-python	9.42 KB	root/linksafe	0644	2025-06-23 01:12:00
gzip.py	text/plain	24.81 KB	root/linksafe	0644	2025-06-23 01:12:06
hashlib.py	text/x-python	9.13 KB	root/linksafe	0644	2025-06-23 01:12:10
heapq.py	text/plain	22.48 KB	root/linksafe	0644	2025-06-23 01:12:00
hmac.py	text/plain	7.54 KB	root/linksafe	0644	2025-06-23 01:12:02
imaplib.py	text/plain	52.77 KB	root/linksafe	0644	2025-06-23 01:12:06
imghdr.py	text/plain	4.29 KB	root/linksafe	0644	2025-06-23 01:12:06
inspect.py	text/plain	124.15 KB	root/linksafe	0644	2025-06-23 01:12:05
io.py	text/plain	3.5 KB	root/linksafe	0644	2025-06-23 01:12:02
ipaddress.py	text/x-python	79.51 KB	root/linksafe	0644	2025-06-23 01:12:06
keyword.py	text/plain	1.05 KB	root/linksafe	0644	2025-06-23 01:12:06
linecache.py	text/plain	5.66 KB	root/linksafe	0644	2025-06-23 01:12:02
locale.py	text/plain	76.76 KB	root/linksafe	0644	2025-06-23 01:12:06
lzma.py	text/plain	12.97 KB	root/linksafe	0644	2025-06-23 01:12:09
mailbox.py	text/plain	77.06 KB	root/linksafe	0644	2025-06-23 01:12:05
mailcap.py	text/plain	9.11 KB	root/linksafe	0644	2025-06-23 01:12:00
mimetypes.py	text/plain	22.5 KB	root/linksafe	0644	2025-06-23 01:12:06
modulefinder.py	text/plain	23.14 KB	root/linksafe	0644	2025-06-23 01:12:02
netrc.py	text/plain	6.76 KB	root/linksafe	0644	2025-06-23 01:12:02
nntplib.py	text/plain	40.12 KB	root/linksafe	0644	2025-06-23 01:12:00
ntpath.py	text/x-python	31.57 KB	root/linksafe	0644	2025-06-23 01:12:00
nturl2path.py	text/plain	2.32 KB	root/linksafe	0644	2025-06-23 01:12:06
numbers.py	text/x-python	11.2 KB	root/linksafe	0644	2025-06-23 01:12:09
opcode.py	text/x-python	12.87 KB	root/linksafe	0644	2025-06-23 01:12:10
operator.py	text/plain	10.71 KB	root/linksafe	0644	2025-06-23 01:12:06
optparse.py	text/plain	58.95 KB	root/linksafe	0644	2025-06-23 01:12:06
os.py	text/x-python	39.86 KB	root/linksafe	0644	2025-06-23 01:12:01
pathlib.py	text/plain	49.86 KB	root/linksafe	0644	2025-06-23 01:12:06
pdb.py	text/plain	68.66 KB	root/linksafe	0755	2025-06-23 01:12:02
pickle.py	text/plain	65.34 KB	root/linksafe	0644	2025-06-23 01:12:02
pickletools.py	text/troff	91.85 KB	root/linksafe	0644	2025-06-23 01:12:02
pipes.py	text/plain	8.77 KB	root/linksafe	0644	2025-06-23 01:12:06
pkgutil.py	text/plain	17.85 KB	root/linksafe	0644	2025-06-23 01:12:02
platform.py	text/plain	42.38 KB	root/linksafe	0755	2025-06-23 01:12:02
plistlib.py	text/x-python	27.68 KB	root/linksafe	0644	2025-06-23 01:12:00
poplib.py	text/plain	14.28 KB	root/linksafe	0644	2025-06-23 01:12:00
posixpath.py	text/plain	17.07 KB	root/linksafe	0644	2025-06-23 01:12:02
pprint.py	text/x-python	23.59 KB	root/linksafe	0644	2025-06-23 01:12:02
profile.py	text/plain	22.56 KB	root/linksafe	0755	2025-06-23 01:12:02
pstats.py	text/plain	28.6 KB	root/linksafe	0644	2025-06-23 01:12:01
pty.py	text/plain	5.99 KB	root/linksafe	0644	2025-06-23 01:12:00
py_compile.py	text/plain	7.65 KB	root/linksafe	0644	2025-06-23 01:12:06
pyclbr.py	text/plain	11.13 KB	root/linksafe	0644	2025-06-23 01:12:00
pydoc.py	text/plain	110.86 KB	root/linksafe	0755	2025-06-23 01:12:02
queue.py	text/x-python	11.23 KB	root/linksafe	0644	2025-06-23 01:12:06
quopri.py	text/plain	7.03 KB	root/linksafe	0755	2025-06-23 01:12:06
random.py	text/plain	33.88 KB	root/linksafe	0644	2025-06-23 01:12:00
reprlib.py	text/plain	6.98 KB	root/linksafe	0644	2025-06-23 01:12:02
rlcompleter.py	text/plain	7.64 KB	root/linksafe	0644	2025-06-23 01:12:10
runpy.py	text/plain	12.58 KB	root/linksafe	0644	2025-06-23 01:12:00
sched.py	text/plain	6.2 KB	root/linksafe	0644	2025-06-23 01:12:06
secrets.py	text/plain	1.94 KB	root/linksafe	0644	2025-06-23 01:12:02
selectors.py	text/plain	19.21 KB	root/linksafe	0644	2025-06-23 01:12:02
shelve.py	text/plain	8.36 KB	root/linksafe	0644	2025-06-23 01:12:06
shlex.py	text/plain	13.04 KB	root/linksafe	0644	2025-06-23 01:12:10
shutil.py	text/plain	55.43 KB	root/linksafe	0644	2025-06-23 01:12:06
signal.py	text/x-python	2.44 KB	root/linksafe	0644	2025-06-23 01:12:06
site.py	text/plain	22.65 KB	root/linksafe	0644	2025-06-23 01:12:05
smtplib.py	text/plain	42.52 KB	root/linksafe	0755	2025-06-23 01:12:02
sndhdr.py	text/plain	7.27 KB	root/linksafe	0644	2025-06-23 01:12:06
socket.py	text/x-python	36.93 KB	root/linksafe	0644	2025-06-23 01:12:09
socketserver.py	text/plain	27.41 KB	root/linksafe	0644	2025-06-23 01:12:10
sre_compile.py	text/x-python	231 B	root/linksafe	0644	2025-06-23 01:12:02
sre_constants.py	text/x-python	232 B	root/linksafe	0644	2025-06-23 01:12:01
sre_parse.py	text/x-python	229 B	root/linksafe	0644	2025-06-23 01:12:02
ssl.py	text/x-python	49.71 KB	root/linksafe	0644	2025-06-23 01:12:06
stat.py	text/plain	5.36 KB	root/linksafe	0644	2025-06-23 01:12:06
statistics.py	text/plain	49.05 KB	root/linksafe	0644	2025-06-23 01:12:02
string.py	text/plain	11.51 KB	root/linksafe	0644	2025-06-23 01:12:06
stringprep.py	text/x-python	12.61 KB	root/linksafe	0644	2025-06-23 01:12:02
struct.py	text/x-python	257 B	root/linksafe	0644	2025-06-23 01:12:02
subprocess.py	text/x-python	86.67 KB	root/linksafe	0644	2025-06-23 01:12:00
sunau.py	text/plain	18.04 KB	root/linksafe	0644	2025-06-23 01:12:02
symtable.py	text/plain	12.18 KB	root/linksafe	0644	2025-06-23 01:12:06
sysconfig.py	text/plain	31.1 KB	root/linksafe	0644	2025-06-23 01:12:06
tabnanny.py	text/plain	11.27 KB	root/linksafe	0755	2025-06-23 01:12:06
tarfile.py	text/plain	109.82 KB	root/linksafe	0755	2025-06-23 01:12:02
telnetlib.py	text/x-python	22.79 KB	root/linksafe	0644	2025-06-23 01:12:02
tempfile.py	text/plain	31.63 KB	root/linksafe	0644	2025-06-23 01:12:00
textwrap.py	text/plain	19.26 KB	root/linksafe	0644	2025-06-23 01:12:00
this.py	text/plain	1003 B	root/linksafe	0644	2025-06-23 01:12:02
threading.py	text/plain	58.79 KB	root/linksafe	0644	2025-06-23 01:12:06
timeit.py	text/plain	13.16 KB	root/linksafe	0755	2025-06-23 01:12:02
token.py	text/plain	2.45 KB	root/linksafe	0644	2025-06-23 01:12:01
tokenize.py	text/plain	21.06 KB	root/linksafe	0644	2025-06-23 01:12:06
trace.py	text/plain	28.68 KB	root/linksafe	0755	2025-06-23 01:12:00
traceback.py	text/plain	45.31 KB	root/linksafe	0644	2025-06-23 01:12:06
tracemalloc.py	text/x-python	17.62 KB	root/linksafe	0644	2025-06-23 01:12:06
tty.py	text/plain	1.99 KB	root/linksafe	0644	2025-06-23 01:12:00
types.py	text/plain	10.74 KB	root/linksafe	0644	2025-06-23 01:12:00
typing.py	text/plain	116.05 KB	root/linksafe	0644	2025-06-23 01:12:06
uu.py	text/x-python	7.17 KB	root/linksafe	0644	2025-06-23 01:21:20
uuid.py	text/x-python	28.96 KB	root/linksafe	0644	2025-06-23 01:12:02
warnings.py	text/plain	21.4 KB	root/linksafe	0644	2025-06-23 01:12:02
wave.py	text/plain	22.24 KB	root/linksafe	0644	2025-06-23 01:12:02
weakref.py	text/plain	21.01 KB	root/linksafe	0644	2025-06-23 01:12:06
webbrowser.py	text/plain	23.19 KB	root/linksafe	0755	2025-06-23 01:12:06
xdrlib.py	text/plain	5.8 KB	root/linksafe	0644	2025-06-23 01:12:10
zipapp.py	text/x-python	7.37 KB	root/linksafe	0644	2025-06-23 01:12:02
zipimport.py	text/plain	27.19 KB	root/linksafe	0644	2025-06-23 01:12:06

Karma Syndicate Ultimate Bypass Filemanager