*j6. d S r SSKrSSKr SSKrSS jr\R " 5 R 5 r\R \l
\R \l \R \l S\R \R ' S rS rS rS rS rS
rS rS rS
rS rS rS r g! \ a Sr Nf = f)a 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. Nc [ 5 n[ 5 nU 1nU( a{ UR 5 n X; d X:: a M# UR U 5 U S- nUR U5 UR U5 U S- ( a UR US- 5 U( a M{ 0 nU( d U$ [ [ U5 5 n [ U 5 n
U( a [
SU
5 X- X' U H n U S-
U; a! U( a [
SU 5 XS-
U- X' M- U S- nX-
n Xx; d eU( a [
SU 5 X X - n
X:w a XS- :X d eU( a [
S5 X- n
XU ' M U$ )N zpow atz * base atz square atz and * base)setpopadditersortednextprint)wbase more_thanshowseenneedwsloditfirstthishisqs ./opt/alt/python313/lib64/python3.13/_pylong.pycompute_powersr 3 sQ 5D 5D
B
FFH 9
!V
r
q5 FF26N
" A
fTl B HE
h }AH !8q=k4(qkD(AGBB7N7k4( Bx!V|#|*+
dG' (
H r c ^^^^ SSK Jm SmUUUU4S jm[ R " [ 5 U R 5 n[ UT" S5 T5 mU S: a SnU * n OSnT" X5 nU( a U* nSSS5 U$ ! , ( d f W$ = f) z6Asymptotically fast conversion of an 'int' to Decimal.r )Decimal c | > UT:: a T" U 5 $ US- nX- nU SU- S-
- nT" XB5 T" X1U-
5 TU - - $ Nr ) nr w2r r BITLIMDinnerw2pows r r' int_to_decimal..innery sV ;Q4K
!V
W
17a-
R}uRR 059 <<>
B
c p ^^^ U R 5 nUS: a [ b [ [ U 5 5 $ SmUUU4S jm[ US- S- 5 n[ UST5 mTR
5 H u p#X2- TU' M U S: a U * n SnOS nT" X5 nUS S
:X a U ( a UR S
5 nXE- $ ) z?Asymptotically fast conversion of an 'int' to a decimal string.i i c > UT:: a [ U 5 $ US- n[ U TU 5 u p4T" X1U-
5 T" XB5 R U5 - $ r! )strdivmodzfill)r# r r$ r r DIGLIMr' pow10s r r' $int_to_decimal_string..inner sQ ;q6M
!V59%RR 5=#6#6r#:::r gyPD?r r - 0)r. _decimalr5 r2 intr itemslstrip) r# r kvsignsr8 r' r9 s @@@r int_to_decimal_stringrG s A7{x+ >!$%% F; A" "Q &'A 1a (E
6a 1u
B
a Ats{q
HHSM 8Or c p ^ ^^^ SmUUU U4S jm[ [ T 5 ST5 mT" S[ T 5 5 $ )z6Asymptotically fast conversion of a 'str' to an 'int'.i c ~ > X-
T:: a
[ TX 5 $ X- S- S- nT" X!5 T" X5 TX-
- X-
- - $ r! )r@ )abmidr8 r' rF w5pows r r' _str_to_int_inner..inner sW 5F?qv; uqyQ c
!ME!'N2!" #r r; r )r len)rF r8 r' rM s `@@@r _str_to_int_innerrP s9 F# #
3q61f -E CF r c X U R 5 R SS5 n [ U 5 $ )zkAsymptotically fast version of PyLong_FromString(), conversion
of a string of decimal digits into an 'int'._r= )rstripreplacerP )rF s r int_from_stringrU s'
3#A Q r c [ R " SU 5 nU( d [ S5 e[ UR S5 5 nUR S5 S:X a U* nU$ )zBAsymptotically fast version of decimal string to 'int' conversion.z\s*([+-]?)([0-9_]+)\s*z&invalid literal for int() with base 10r* r r< )rematch
ValueErrorrU group)rF mrD s r
str_to_intr\ sR *A.A ABB
#AwwqzS
B Hr i c ( U R 5 U-
[ :: a [ X5 $ US- nU( a U S- n US- nUS-
nUS- nSU- S-
nX- X- pv[ X- X- U- XXt5 u p[ XU- XXt5 u pU( a U S- n X- U
- U 4$ )a2 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.
r )r.
_DIV_LIMITr6 _div3n2n) rJ rK r# padhalf_nmaskb1b2q1rq2s r _div2n1nrh s ||~Z'a|
a%C
a a Q
!VF
K1 D
[!( QVakT 11" EEB QD! 4EB
a
<" a r c X- U:X a SU- S-
XU- -
U- pvO[ XU5 u pgXu- U- Xd- -
nUS: a US- nXr-
nUS: a M Xg4$ )zAHelper function for _div2n1n; not intended to be called directly.r r )rh )a12a3rK rc rd r# qrf s r r_ r_ sn
x2~Q!|S!G_r 11#
" A
a% Q a%
4Kr c ^^^ S/U R 5 T- S-
T- - mUUU4S jmU ( a T" U S[ T5 5 T$ )a2 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.
r r c z > US- U:X a U TU' g X- S- nX1-
T - nX- nXU- - nT" XaU5 T" XSU5 g r! r" )
xLRrL shiftupperlowera_digitsr' r# s
r r' _int2digits..inner. sW q5A:HQK ulA
e^$
e
e! r )r. rO )rJ r# ru r' s `@@r _int2digitsrw sE sq||~)A-!34H
aCM" Or c N ^ ^^ U UU4S jmT ( a T" S[ T 5 5 $ S$ )zxCombine base-2**n digits into an int. This function is the
inverse of `_int2digits`. For more details, see _int2digits.
c d > U S- U:X a TU $ X- S- nX -
T- nT" X!5 U- T" X5 - $ r! r" )rp rq rL rr digitsr' r# s r r' _digits2int..innerC sF q5A:!9 ulA
c
&%-77r r )rO )rz r# r' s ``@r _digits2intr| > s"
8 %+5CK 11r c UR 5 n[ X5 nSn/ n[ U5 H' n[ XB- U- X5 u ptUR U5 M) UR 5 [
XR5 nX4$ )zWDivide a non-negative integer a by a positive integer b, giving
quotient and remainder.r )r. rw reversedrh appendreverser| ) rJ rK r# ru rf q_digitsa_digitq_digitrl s r _divmod_posr M sr
A1 H AHH% qv 0!7
&
H A 4Kr c US:X a [ eUS: a [ U * U* 5 u p#X#* 4$ U S: a [ U ) U5 u p#U) X) - 4$ [ X5 $ )zyAsymptotically fast replacement for divmod, for 'int'.
Its time complexity is O(n**1.58), where n = #bits(a) + #bits(b).
r )ZeroDivisionError
int_divmodr )rJ rK rl rf s r r r ^ se Av
Q1"qb!"u
Q1"a r1r6z1 r )F) __doc__rW r+ r? ImportErrorr
getcontextcopyr- MAX_PRECprecMAX_EMAXEmaxMIN_EMINEmintrapsInexactr2 rG rP rU r\ r^ rh r_ rw r| r r r" r r r s >
B,
\ !++-224 % . . % . . % . . 01 W__ -%N+Z 6
"
<
> 2 "
!W
Hs B$ $B/.B/