FM / python3.12

/snap/core24/1643/usr/lib/python3.12

Name	Size	Mode	Actions
asyncio/	-	0755	rm
collections/	-	0755	rm
concurrent/	-	0755	rm
ctypes/	-	0755	rm
curses/	-	0755	rm
dbm/	-	0755	rm
email/	-	0755	rm
encodings/	-	0755	rm
html/	-	0755	rm
http/	-	0755	rm
importlib/	-	0755	rm
json/	-	0755	rm
lib-dynload/	-	0755	rm
logging/	-	0755	rm
multiprocessing/	-	0755	rm
pydoc_data/	-	0755	rm
re/	-	0755	rm
sqlite3/	-	0755	rm
test/	-	0755	rm
tomllib/	-	0755	rm
unittest/	-	0755	rm
urllib/	-	0755	rm
venv/	-	0755	rm
wsgiref/	-	0755	rm
xml/	-	0755	rm
xmlrpc/	-	0755	rm
zipfile/	-	0755	rm
zoneinfo/	-	0755	rm
__phello__/	-	0755	rm
__pycache__/	-	0755	rm
abc.py	6538	0644	edit dl rm
aifc.py	34211	0644	edit dl rm
antigravity.py	500	0644	edit dl rm
argparse.py	101750	0644	edit dl rm
ast.py	64260	0644	edit dl rm
base64.py	20602	0755	edit dl rm
bdb.py	32463	0644	edit dl rm
bisect.py	3423	0644	edit dl rm
bz2.py	11847	0644	edit dl rm
calendar.py	25418	0644	edit dl rm
cgi.py	34418	0755	edit dl rm
cgitb.py	12421	0644	edit dl rm
chunk.py	5500	0644	edit dl rm
cmd.py	14873	0644	edit dl rm
code.py	10695	0644	edit dl rm
codecs.py	36870	0644	edit dl rm
codeop.py	5908	0644	edit dl rm
colorsys.py	4062	0644	edit dl rm
compileall.py	20598	0644	edit dl rm
configparser.py	53789	0644	edit dl rm
contextlib.py	27637	0644	edit dl rm
contextvars.py	129	0644	edit dl rm
copy.py	8412	0644	edit dl rm
copyreg.py	7614	0644	edit dl rm
cProfile.py	6555	0755	edit dl rm
crypt.py	3913	0644	edit dl rm
csv.py	16386	0644	edit dl rm
dataclasses.py	61753	0644	edit dl rm
datetime.py	268	0644	edit dl rm
decimal.py	320	0644	edit dl rm
difflib.py	83308	0644	edit dl rm
dis.py	30209	0644	edit dl rm
doctest.py	106479	0644	edit dl rm
enum.py	81636	0644	edit dl rm
EXTERNALLY-MANAGED	645	0644	edit dl rm
filecmp.py	10187	0644	edit dl rm
fileinput.py	15714	0644	edit dl rm
fnmatch.py	5999	0644	edit dl rm
fractions.py	38067	0644	edit dl rm
ftplib.py	34735	0644	edit dl rm
functools.py	38126	0644	edit dl rm
genericpath.py	5572	0644	edit dl rm
getopt.py	7488	0644	edit dl rm
getpass.py	5990	0644	edit dl rm
gettext.py	21747	0644	edit dl rm
glob.py	8732	0644	edit dl rm
graphlib.py	9656	0644	edit dl rm
gzip.py	24859	0644	edit dl rm
hashlib.py	9349	0644	edit dl rm
heapq.py	23024	0644	edit dl rm
hmac.py	7716	0644	edit dl rm
imaplib.py	53688	0644	edit dl rm
imghdr.py	4398	0644	edit dl rm
inspect.py	125420	0644	edit dl rm
io.py	3582	0644	edit dl rm
ipaddress.py	78294	0644	edit dl rm
keyword.py	1073	0644	edit dl rm
LICENSE.txt	13936	0644	edit dl rm
linecache.py	5649	0644	edit dl rm
locale.py	78562	0644	edit dl rm
lzma.py	13277	0644	edit dl rm
mailbox.py	78911	0644	edit dl rm
mailcap.py	9333	0644	edit dl rm
mimetypes.py	22888	0644	edit dl rm
modulefinder.py	23699	0644	edit dl rm
netrc.py	6922	0644	edit dl rm
nntplib.py	41087	0644	edit dl rm
ntpath.py	30027	0644	edit dl rm
nturl2path.py	2887	0644	edit dl rm
numbers.py	11467	0644	edit dl rm
opcode.py	13174	0644	edit dl rm
operator.py	10965	0644	edit dl rm
optparse.py	60369	0644	edit dl rm
os.py	39786	0644	edit dl rm
pathlib.py	51153	0644	edit dl rm
pdb.py	69459	0755	edit dl rm
pickle.py	64901	0644	edit dl rm
pickletools.py	93861	0644	edit dl rm
pipes.py	8978	0644	edit dl rm
pkgutil.py	18281	0644	edit dl rm
platform.py	43331	0755	edit dl rm
plistlib.py	28582	0644	edit dl rm
poplib.py	14163	0644	edit dl rm
posixpath.py	17623	0644	edit dl rm
pprint.py	24158	0644	edit dl rm
profile.py	23092	0755	edit dl rm
pstats.py	29289	0644	edit dl rm
pty.py	6137	0644	edit dl rm
pyclbr.py	11396	0644	edit dl rm
pydoc.py	113090	0755	edit dl rm
py_compile.py	7878	0644	edit dl rm
queue.py	11496	0644	edit dl rm
quopri.py	7183	0755	edit dl rm
random.py	34683	0644	edit dl rm
reprlib.py	6569	0644	edit dl rm
rlcompleter.py	7827	0644	edit dl rm
runpy.py	12898	0644	edit dl rm
sched.py	6351	0644	edit dl rm
secrets.py	1984	0644	edit dl rm
selectors.py	19671	0644	edit dl rm
shelve.py	8560	0644	edit dl rm
shlex.py	13353	0644	edit dl rm
shutil.py	58120	0644	edit dl rm
signal.py	2495	0644	edit dl rm
site.py	23903	0644	edit dl rm
sitecustomize.py	-	0	edit dl rm
smtplib.py	43531	0755	edit dl rm
sndhdr.py	7448	0644	edit dl rm
socket.py	37411	0644	edit dl rm
socketserver.py	27851	0644	edit dl rm
sre_compile.py	231	0644	edit dl rm
sre_constants.py	232	0644	edit dl rm
sre_parse.py	229	0644	edit dl rm
ssl.py	50822	0644	edit dl rm
stat.py	5485	0644	edit dl rm
statistics.py	50227	0644	edit dl rm
string.py	11786	0644	edit dl rm
stringprep.py	12917	0644	edit dl rm
struct.py	257	0644	edit dl rm
subprocess.py	88725	0644	edit dl rm
sunau.py	18478	0644	edit dl rm
symtable.py	10753	0644	edit dl rm
sysconfig.py	32768	0644	edit dl rm
tabnanny.py	11530	0755	edit dl rm
tarfile.py	112555	0755	edit dl rm
telnetlib.py	23301	0644	edit dl rm
tempfile.py	37334	0644	edit dl rm
textwrap.py	19718	0644	edit dl rm
this.py	1003	0644	edit dl rm
threading.py	60123	0644	edit dl rm
timeit.py	13463	0755	edit dl rm
token.py	2479	0644	edit dl rm
tokenize.py	21214	0644	edit dl rm
trace.py	29182	0755	edit dl rm
traceback.py	46325	0644	edit dl rm
tracemalloc.py	18047	0644	edit dl rm
tty.py	2035	0644	edit dl rm
turtle.py	146361	0644	edit dl rm
types.py	10993	0644	edit dl rm
typing.py	117428	0644	edit dl rm
uu.py	7364	0755	edit dl rm
uuid.py	29656	0644	edit dl rm
warnings.py	21760	0644	edit dl rm
wave.py	22769	0644	edit dl rm
weakref.py	21513	0644	edit dl rm
webbrowser.py	23627	0755	edit dl rm
xdrlib.py	5942	0644	edit dl rm
zipapp.py	7543	0644	edit dl rm
zipimport.py	28132	0644	edit dl rm
_aix_support.py	4021	0644	edit dl rm
_collections_abc.py	32082	0644	edit dl rm
_compat_pickle.py	8761	0644	edit dl rm
_compression.py	5681	0644	edit dl rm
_distutils_system_mod.py	5716	0644	edit dl rm
_markupbase.py	14653	0644	edit dl rm
_osx_support.py	22023	0644	edit dl rm
_pydatetime.py	92097	0644	edit dl rm
_pydecimal.py	229220	0644	edit dl rm
_pyio.py	93593	0644	edit dl rm
_pylong.py	9047	0644	edit dl rm
_py_abc.py	6189	0644	edit dl rm
_sitebuiltins.py	3128	0644	edit dl rm
_strptime.py	24615	0644	edit dl rm
_sysconfigdata__linux_x86_64-linux-gnu.py	49505	0644	edit dl rm
_sysconfigdata__x86_64-linux-gnu.py	49505	0644	edit dl rm
_threading_local.py	7220	0644	edit dl rm
_weakrefset.py	5893	0644	edit dl rm
__future__.py	5218	0644	edit dl rm
__hello__.py	227	0644	edit dl rm

Edit: /snap/core24/1643/usr/lib/python3.12/_pylong.py (9047B)

"""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

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."""
    return str(int_to_decimal(n))

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)

cmd: