GRAYBYTE

a XC?h:}� @spdZgd�ZeZdZdZdZddlZddlZ ddl Z zddlmZ e dd �ZWneyhd d�ZYn0dZd ZdZdZdZdZdZdZdZdZe jdkr�dZdZdZndZdZdZeedZGdd�de�Z Gdd�de �Z!Gdd �d e �Z"Gd!d"�d"e"�Z#Gd#d$�d$e e$�Z%Gd%d&�d&e"�Z&Gd'd(�d(e"e$�Z'Gd)d*�d*e �Z(Gd+d,�d,e"�Z)Gd-d.�d.e �Z*Gd/d0�d0e �Z+Gd1d2�d2e(e*�Z,Gd3d4�d4e(e*e+�Z-Gd5d6�d6e e.�Z/e!e%e(e,e*e-e"e+e/g Z0e#e"e&e"e'e"e)e"iZ1eeeeeeeefZ2ddl3Z3e3�4d7�Z5d8d9�Z6d:d;�Z7[3d�d<d=�Z8Gd>d?�d?e9�Z:d�dAdB�Z;e j<�=e:�GdCdD�dDe9�Z>GdEdF�dFe9�Z?GdGdH�dHe9�Z@d�dIdJ�ZAeBjCZDdKdL�ZEdMdN�ZFdOdP�ZGdQdR�ZHd�dTdU�ZIdVdW�ZJdXdY�ZKGdZd[�d[e9�ZLeL�jMZNd�d\d]�ZOd^d_�ZPd`da�ZQdbdcdddedfdgdhdidjdk� fdldm�ZRd�dndo�ZSd�dpdq�ZTe?dree%e,e"ggdsdtdddu�ZUe?dvee%e,e"e!e-ggdw�ZVe?dveggdw�ZWddlXZXeX�YdxeXjZeXj[B�j\Z]eX�Ydy�j\Z^eX�Ydz�j\Z_eX�Yd{eXjZeXj`B�Za[XzddlbZcWne�y�Yn0d�d|d}�Zdd~d�Zed�d��Zfd�d�d��Zgd�d��Zhd�d��Zie:d��Zje:d��Zke:d��Zle:d�Zme:d�Zne:d��ZoejekfZpe jqjrZse jqjtZue jqjvZwexdiesd�es�Zy[ dS)�a� This is an implementation of decimal floating point arithmetic based on the General Decimal Arithmetic Specification: http://speleotrove.com/decimal/decarith.html and IEEE standard 854-1987: http://en.wikipedia.org/wiki/IEEE_854-1987 Decimal floating point has finite precision with arbitrarily large bounds. The purpose of this module is to support arithmetic using familiar "schoolhouse" rules and to avoid some of the tricky representation issues associated with binary floating point. The package is especially useful for financial applications or for contexts where users have expectations that are at odds with binary floating point (for instance, in binary floating point, 1.00 % 0.1 gives 0.09999999999999995 instead of 0.0; Decimal('1.00') % Decimal('0.1') returns the expected Decimal('0.00')). Here are some examples of using the decimal module: >>> from decimal import * >>> setcontext(ExtendedContext) >>> Decimal(0) Decimal('0') >>> Decimal('1') Decimal('1') >>> Decimal('-.0123') Decimal('-0.0123') >>> Decimal(123456) Decimal('123456') >>> Decimal('123.45e12345678') Decimal('1.2345E+12345680') >>> Decimal('1.33') + Decimal('1.27') Decimal('2.60') >>> Decimal('12.34') + Decimal('3.87') - Decimal('18.41') Decimal('-2.20') >>> dig = Decimal(1) >>> print(dig / Decimal(3)) 0.333333333 >>> getcontext().prec = 18 >>> print(dig / Decimal(3)) 0.333333333333333333 >>> print(dig.sqrt()) 1 >>> print(Decimal(3).sqrt()) 1.73205080756887729 >>> print(Decimal(3) ** 123) 4.85192780976896427E+58 >>> inf = Decimal(1) / Decimal(0) >>> print(inf) Infinity >>> neginf = Decimal(-1) / Decimal(0) >>> print(neginf) -Infinity >>> print(neginf + inf) NaN >>> print(neginf * inf) -Infinity >>> print(dig / 0) Infinity >>> getcontext().traps[DivisionByZero] = 1 >>> print(dig / 0) Traceback (most recent call last): ... ... ... decimal.DivisionByZero: x / 0 >>> c = Context() >>> c.traps[InvalidOperation] = 0 >>> print(c.flags[InvalidOperation]) 0 >>> c.divide(Decimal(0), Decimal(0)) Decimal('NaN') >>> c.traps[InvalidOperation] = 1 >>> print(c.flags[InvalidOperation]) 1 >>> c.flags[InvalidOperation] = 0 >>> print(c.flags[InvalidOperation]) 0 >>> print(c.divide(Decimal(0), Decimal(0))) Traceback (most recent call last): ... ... ... decimal.InvalidOperation: 0 / 0 >>> print(c.flags[InvalidOperation]) 1 >>> c.flags[InvalidOperation] = 0 >>> c.traps[InvalidOperation] = 0 >>> print(c.divide(Decimal(0), Decimal(0))) NaN >>> print(c.flags[InvalidOperation]) 1 >>> )%�Decimal�Context�DecimalTuple�DefaultContext�BasicContext�ExtendedContext�DecimalException�Clamped�InvalidOperation�DivisionByZero�Inexact�Rounded� Subnormal�Overflow� Underflow�FloatOperation�DivisionImpossible�InvalidContext�ConversionSyntax�DivisionUndefined� ROUND_DOWN� ROUND_HALF_UP�ROUND_HALF_EVEN� ROUND_CEILING�ROUND_FLOOR�ROUND_UP�ROUND_HALF_DOWN� ROUND_05UP� setcontext� getcontext�localcontext�MAX_PREC�MAX_EMAX�MIN_EMIN� MIN_ETINY�HAVE_THREADS�HAVE_CONTEXTVAR�decimalz1.70z2.4.2�N)� namedtuplerzsign digits exponentcGs|S�N�)�argsr*r*�//opt/alt/python39/lib64/python3.9/_pydecimal.py�<lambda>��r-rrrrrrrrTl��l��N�Zol��N�Zoi@�Ti��c@seZdZdZdd�ZdS)ra1Base exception class. Used exceptions derive from this. If an exception derives from another exception besides this (such as Underflow (Inexact, Rounded, Subnormal) that indicates that it is only called if the others are present. This isn't actually used for anything, though. handle -- Called when context._raise_error is called and the trap_enabler is not set. First argument is self, second is the context. More arguments can be given, those being after the explanation in _raise_error (For example, context._raise_error(NewError, '(-x)!', self._sign) would call NewError().handle(context, self._sign).) To define a new exception, it should be sufficient to have it derive from DecimalException. cGsdSr)r*��self�contextr+r*r*r,�handle�szDecimalException.handleN��__name__� __module__�__qualname__�__doc__r3r*r*r*r,r�src@seZdZdZdS)ra)Exponent of a 0 changed to fit bounds. This occurs and signals clamped if the exponent of a result has been altered in order to fit the constraints of a specific concrete representation. This may occur when the exponent of a zero result would be outside the bounds of a representation, or when a large normal number would have an encoded exponent that cannot be represented. In this latter case, the exponent is reduced to fit and the corresponding number of zero digits are appended to the coefficient ("fold-down"). N�r5r6r7r8r*r*r*r,r�src@seZdZdZdd�ZdS)r a0An invalid operation was performed. Various bad things cause this: Something creates a signaling NaN -INF + INF 0 * (+-)INF (+-)INF / (+-)INF x % 0 (+-)INF % x x._rescale( non-integer ) sqrt(-x) , x > 0 0 ** 0 x ** (non-integer) x ** (+-)INF An operand is invalid The result of the operation after these is a quiet positive NaN, except when the cause is a signaling NaN, in which case the result is also a quiet NaN, but with the original sign, and an optional diagnostic information. cGs,|r(t|dj|djdd�}|�|�StS)Nr'�nT)�_dec_from_triple�_sign�_int�_fix_nan�_NaN)r1r2r+�ansr*r*r,r3�s zInvalidOperation.handleNr4r*r*r*r,r �sr c@seZdZdZdd�ZdS)rz�Trying to convert badly formed string. This occurs and signals invalid-operation if a string is being converted to a number and it does not conform to the numeric string syntax. The result is [0,qNaN]. cGstSr)�r?r0r*r*r,r3szConversionSyntax.handleNr4r*r*r*r,rsrc@seZdZdZdd�ZdS)r a�Division by 0. This occurs and signals division-by-zero if division of a finite number by zero was attempted (during a divide-integer or divide operation, or a power operation with negative right-hand operand), and the dividend was not zero. The result of the operation is [sign,inf], where sign is the exclusive or of the signs of the operands for divide, or is 1 for an odd power of -0, for power. cGst|Sr))�_SignedInfinity�r1r2�signr+r*r*r,r3szDivisionByZero.handleNr4r*r*r*r,r sr c@seZdZdZdd�ZdS)rz�Cannot perform the division adequately. This occurs and signals invalid-operation if the integer result of a divide-integer or remainder operation had too many digits (would be longer than precision). The result is [0,qNaN]. cGstSr)rAr0r*r*r,r3"szDivisionImpossible.handleNr4r*r*r*r,rsrc@seZdZdZdd�ZdS)rz�Undefined result of division. This occurs and signals invalid-operation if division by zero was attempted (during a divide-integer, divide, or remainder operation), and the dividend is also zero. The result is [0,qNaN]. cGstSr)rAr0r*r*r,r3-szDivisionUndefined.handleNr4r*r*r*r,r%src@seZdZdZdS)ra�Had to round, losing information. This occurs and signals inexact whenever the result of an operation is not exact (that is, it needed to be rounded and any discarded digits were non-zero), or if an overflow or underflow condition occurs. The result in all cases is unchanged. The inexact signal may be tested (or trapped) to determine if a given operation (or sequence of operations) was inexact. Nr9r*r*r*r,r0src@seZdZdZdd�ZdS)ra�Invalid context. Unknown rounding, for example. This occurs and signals invalid-operation if an invalid context was detected during an operation. This can occur if contexts are not checked on creation and either the precision exceeds the capability of the underlying concrete representation or an unknown or unsupported rounding was specified. These aspects of the context need only be checked when the values are required to be used. The result is [0,qNaN]. cGstSr)rAr0r*r*r,r3GszInvalidContext.handleNr4r*r*r*r,r<s rc@seZdZdZdS)ra�Number got rounded (not necessarily changed during rounding). This occurs and signals rounded whenever the result of an operation is rounded (that is, some zero or non-zero digits were discarded from the coefficient), or if an overflow or underflow condition occurs. The result in all cases is unchanged. The rounded signal may be tested (or trapped) to determine if a given operation (or sequence of operations) caused a loss of precision. Nr9r*r*r*r,rJsrc@seZdZdZdS)r a�Exponent < Emin before rounding. This occurs and signals subnormal whenever the result of a conversion or operation is subnormal (that is, its adjusted exponent is less than Emin, before any rounding). The result in all cases is unchanged. The subnormal signal may be tested (or trapped) to determine if a given or operation (or sequence of operations) yielded a subnormal result. Nr9r*r*r*r,r Vsr c@seZdZdZdd�ZdS)raNumerical overflow. This occurs and signals overflow if the adjusted exponent of a result (from a conversion or from an operation that is not an attempt to divide by zero), after rounding, would be greater than the largest value that can be handled by the implementation (the value Emax). The result depends on the rounding mode: For round-half-up and round-half-even (and for round-half-down and round-up, if implemented), the result of the operation is [sign,inf], where sign is the sign of the intermediate result. For round-down, the result is the largest finite number that can be represented in the current precision, with the sign of the intermediate result. For round-ceiling, the result is the same as for round-down if the sign of the intermediate result is 1, or is [0,inf] otherwise. For round-floor, the result is the same as for round-down if the sign of the intermediate result is 0, or is [1,inf] otherwise. In all cases, Inexact and Rounded will also be raised. cGs�|jttttfvrt|S|dkrR|jtkr4t|St|d|j|j |jd�S|dkr�|jt krlt|St|d|j|j |jd�SdS)Nr'�9r/)�roundingrrrrrBrr;�prec�EmaxrrCr*r*r,r3ws � � �zOverflow.handleNr4r*r*r*r,rasrc@seZdZdZdS)raxNumerical underflow with result rounded to 0. This occurs and signals underflow if a result is inexact and the adjusted exponent of the result would be smaller (more negative) than the smallest value that can be handled by the implementation (the value Emin). That is, the result is both inexact and subnormal. The result after an underflow will be a subnormal number rounded, if necessary, so that its exponent is not less than Etiny. This may result in 0 with the sign of the intermediate result and an exponent of Etiny. In all cases, Inexact, Rounded, and Subnormal will also be raised. Nr9r*r*r*r,r�src@seZdZdZdS)ra�Enable stricter semantics for mixing floats and Decimals. If the signal is not trapped (default), mixing floats and Decimals is permitted in the Decimal() constructor, context.create_decimal() and all comparison operators. Both conversion and comparisons are exact. Any occurrence of a mixed operation is silently recorded by setting FloatOperation in the context flags. Explicit conversions with Decimal.from_float() or context.create_decimal_from_float() do not set the flag. Otherwise (the signal is trapped), only equality comparisons and explicit conversions are silent. All other mixed operations raise FloatOperation. Nr9r*r*r*r,r�srZdecimal_contextcCs6z t��WSty0t�}t�|�|YS0dS)z�Returns this thread's context. If this thread does not yet have a context, returns a new context and sets this thread's context. New contexts are copies of DefaultContext. N)�_current_context_var�get�LookupErrorr�set�r2r*r*r,r�s rcCs,|tttfvr|��}|��t�|�dS)z%Set this thread's context to context.N)rrr�copy�clear_flagsrIrLrMr*r*r,r�srcCs|durt�}t|�S)abReturn a context manager for a copy of the supplied context Uses a copy of the current context if no context is specified The returned context manager creates a local decimal context in a with statement: def sin(x): with localcontext() as ctx: ctx.prec += 2 # Rest of sin calculation algorithm # uses a precision 2 greater than normal return +s # Convert result to normal precision def sin(x): with localcontext(ExtendedContext): # Rest of sin calculation algorithm # uses the Extended Context from the # General Decimal Arithmetic Specification return +s # Convert result to normal context >>> setcontext(DefaultContext) >>> print(getcontext().prec) 28 >>> with localcontext(): ... ctx = getcontext() ... ctx.prec += 2 ... print(ctx.prec) ... 30 >>> with localcontext(ExtendedContext): ... print(getcontext().prec) ... 9 >>> print(getcontext().prec) 28 N)r�_ContextManager)�ctxr*r*r,r�s$rc @s�eZdZdZdZd�dd�Zedd��Zd d �Zdd�Z d�d d�Z dd�Zdd�Zdd�Z d�dd�Zd�dd�Zd�dd�Zd�dd�Zd�dd�Zd�dd �Zd!d"�Zd#d$�Zd%d&�Zd'd(�Zd�d*d+�Zd�d,d-�Zd�d.d/�Zd�d0d1�Zd�d3d4�Zd�d5d6�ZeZ�dd7d8�Z�dd9d:�Z �dd;d<�Z!e!Z"�dd=d>�Z#d?d@�Z$�ddAdB�Z%�ddCdD�Z&�ddEdF�Z'�ddGdH�Z(�ddIdJ�Z)�d dKdL�Z*�d dMdN�Z+�ddOdP�Z,dQdR�Z-dSdT�Z.e.Z/e0dUdV��Z1e0dWdX��Z2dYdZ�Z3d[d\�Z4d]d^�Z5d_d`�Z6dadb�Z7dcdd�Z8dedf�Z9dgdh�Z:didj�Z;dkdl�Z<dmdn�Z=dodp�Z>e?e7e8e9e:e;e<e=e>dq�Z@�ddrds�ZAdtdu�ZBdvdw�ZC�d dxdy�ZD�ddzd{�ZEd|d}�ZF�dd~d�ZG�dd�d��ZH�dd�d��ZI�dd�d��ZJ�dd�d��ZKd�d��ZLd�d��ZM�dd�d��ZN�dd�d��ZOeOZP�dd�d��ZQ�dd�d��ZR�dd�d��ZSd�d��ZTd�d��ZUd�d��ZVd�d��ZW�dd�d��ZX�dd�d��ZY�dd�d��ZZd�d��Z[d�d��Z\�dd�d��Z]�dd�d��Z^d�d��Z_d�d��Z`d�d��Zad�d��Zb�dd�d��Zcd�d��Zdd�d��Zed�d��Zf�dd�d��Zgd�d��Zhd�d��Zi�d d�dÄZjd�dńZk�d!d�dǄZl�d"d�dɄZmd�d˄Znd�d̈́Zo�d#d�dτZp�d$d�dфZq�d%d�dӄZr�d&d�dՄZs�d'd�dׄZt�d(d�dلZu�d)d�dۄZv�d*d�d݄Zw�d+d�d߄Zx�d,d�d�Zyd�d�Zz�d-d�d�Z{�d.d�d�Z|�d/d�d�Z}d�d�Z~d�d�Zd�d�Z��d0d�d�Z�dS(1rz,Floating point class for decimal arithmetic.)�_expr=r<�_is_special�0NcCs�t�|�}t|t��r$t|��dd��}|durP|dur@t�}|�t d|�S|� d�dkrfd|_nd|_|� d �}|dur�|� d �p�d}t|� d�p�d�}tt||��|_ |t|�|_d |_nZ|� d�}|du�rtt|p�d��d�|_ |� d��rd|_nd|_nd|_ d|_d|_|St|t��rf|dk�rBd|_nd|_d|_tt|��|_ d |_|St|t��r�|j|_|j|_|j |_ |j|_|St|t��r�|j|_t|j�|_ t|j�|_d |_|St|ttf��r"t|�dk�r�td��t|dt��r|ddv�std��|d|_|ddk�rHd|_ |d|_d|_n�g} |dD]R} t| t��r�d| k�r|dk�r�nn| �s�| dk�r�| �| �ntd��qT|ddv�r�d�tt| ��|_ |d|_d|_nDt|dt��rd�tt| �p�dg��|_ |d|_d |_ntd��|St|t��rx|du�r>t�}|�td�t�|�}|j|_|j|_|j |_ |j|_|St d|��dS)a�Create a decimal point instance. >>> Decimal('3.14') # string input Decimal('3.14') >>> Decimal((0, (3, 1, 4), -2)) # tuple (sign, digit_tuple, exponent) Decimal('3.14') >>> Decimal(314) # int Decimal('314') >>> Decimal(Decimal(314)) # another decimal instance Decimal('314') >>> Decimal(' 3.14 \n') # leading and trailing whitespace okay Decimal('3.14') �_�NzInvalid literal for Decimal: %rrD�-r/r'�intZfrac�exprTF�diag�signal�Nr:�FT�ztInvalid tuple size in creation of Decimal from list or tuple. The list or tuple should have exactly three elements.�r'r/z|Invalid sign. The first value in the tuple should be an integer; either 0 for a positive number or 1 for a negative number.�� zTThe second value in the tuple must be composed of integers in the range 0 through 9.�r:r\zUThe third value in the tuple must be an integer, or one of the strings 'F', 'n', 'N'.�;strict semantics for mixing floats and Decimals are enabledzCannot convert %r to Decimal)!�object�__new__� isinstance�str�_parser�strip�replacer�_raise_errorr�groupr<rXr=�lenrRrS�lstrip�absr�_WorkReprDrY�list�tuple� ValueError�append�join�map�floatr� from_float� TypeError)�cls�valuer2r1�m�intpart�fracpartrYrZ�digits�digitr*r*r,re s� � ( � zDecimal.__new__cCs�t|t�r,|dkrdnd}d}tt|��}nzt|t�r�t�|�sJt�|�rV|t|��St� d|�dkrld}nd}t|�� \}}|��d}t|d|�}ntd��t |||�}|tur�|S||�SdS)a.Converts a float to a decimal number, exactly. Note that Decimal.from_float(0.1) is not the same as Decimal('0.1'). Since 0.1 is not exactly representable in binary floating point, the value is stored as the nearest representable value which is 0x1.999999999999ap-4. The exact equivalent of the value in decimal is 0.1000000000000000055511151231257827021181583404541015625. >>> Decimal.from_float(0.1) Decimal('0.1000000000000000055511151231257827021181583404541015625') >>> Decimal.from_float(float('nan')) Decimal('NaN') >>> Decimal.from_float(float('inf')) Decimal('Infinity') >>> Decimal.from_float(-float('inf')) Decimal('-Infinity') >>> Decimal.from_float(-0.0) Decimal('-0') r'r/g�?�zargument must be int or float.N)rfrXrgrorw�_mathZisinfZisnan�reprZcopysign�as_integer_ratio� bit_lengthryr;r)rz�frD�k�coeffr:�d�resultr*r*r,rx�s$ zDecimal.from_floatcCs(|jr$|j}|dkrdS|dkr$dSdS)zrReturns whether the number is not actually one. 0 if a number 1 if NaN 2 if sNaN r:r/r\r`r')rSrR)r1rYr*r*r,�_isnan�szDecimal._isnancCs|jdkr|jrdSdSdS)zyReturns whether the number is infinite 0 if finite or not a number 1 if +INF -1 if -INF r]��r/r')rRr<�r1r*r*r,�_isinfinity�s zDecimal._isinfinitycCs||��}|durd}n|��}|s&|rx|dur4t�}|dkrJ|�td|�S|dkr`|�td|�S|rn|�|�S|�|�SdS)z�Returns whether the number is not actually one. if self, other are sNaN, signal if self, other are NaN return nan return 0 Done before operations. NFr`�sNaNr')r�rrkr r>)r1�otherr2�self_is_nan�other_is_nanr*r*r,�_check_nans�s& �� zDecimal._check_nanscCsv|durt�}|js|jrr|��r0|�td|�S|��rF|�td|�S|��r\|�td|�S|��rr|�td|�SdS)aCVersion of _check_nans used for the signaling comparisons compare_signal, __le__, __lt__, __ge__, __gt__. Signal InvalidOperation if either self or other is a (quiet or signaling) NaN. Signaling NaNs take precedence over quiet NaNs. Return 0 if neither operand is a NaN. Nzcomparison involving sNaNzcomparison involving NaNr')rrS�is_snanrkr �is_qnan�r1r�r2r*r*r,�_compare_check_nans s0��zDecimal._compare_check_nanscCs|jp|jdkS)zuReturn True if self is nonzero; otherwise return False. NaNs and infinities are considered nonzero. rT�rSr=r�r*r*r,�__bool__*szDecimal.__bool__cCs|js|jr8|��}|��}||kr(dS||kr4dSdS|sP|sDdSd|jS|s^d|jS|j|jkrndS|j|jkr~dS|��}|��}||kr�|jd|j|j}|jd|j|j}||kr�dS||kr�d|jSd|jSn ||k�rd|jSd|jSdS)z�Compare the two non-NaN decimal instances self and other. Returns -1 if self < other, 0 if self == other and 1 if self > other. This routine is for internal use only.r'r�r/rTN)rSr�r<�adjustedr=rR)r1r�Zself_infZ other_inf� self_adjustedZother_adjusted�self_paddedZother_paddedr*r*r,�_cmp1s> zDecimal._cmpcCs<t||dd�\}}|tur|S|�||�r.dS|�|�dkS)NT)�equality_opFr')�_convert_for_comparison�NotImplementedr�r�r�r*r*r,�__eq__qszDecimal.__eq__cCs<t||�\}}|tur|S|�||�}|r.dS|�|�dkS�NFr'�r�r�r�r��r1r�r2r@r*r*r,�__lt__yszDecimal.__lt__cCs<t||�\}}|tur|S|�||�}|r.dS|�|�dkSr�r�r�r*r*r,�__le__�szDecimal.__le__cCs<t||�\}}|tur|S|�||�}|r.dS|�|�dkSr�r�r�r*r*r,�__gt__�szDecimal.__gt__cCs<t||�\}}|tur|S|�||�}|r.dS|�|�dkSr�r�r�r*r*r,�__ge__�szDecimal.__ge__cCs>t|dd�}|js|r0|jr0|�||�}|r0|St|�|��S)z�Compare self to other. Return a decimal value: a or b is a NaN ==> Decimal('NaN') a < b ==> Decimal('-1') a == b ==> Decimal('0') a > b ==> Decimal('1') T��raiseit)�_convert_otherrSr�rr�r�r*r*r,�compare�szDecimal.comparecCs�|jr4|��rtd��n|��r$tS|jr0tStS|jdkrNtd|jt �}ntt |jt �}t|j�|t }|dkr||n|}|dkr�dS|S)zx.__hash__() <==> hash(x)z"Cannot hash a signaling NaN value.r'� r��) rSr�ry�is_nan�_PyHASH_NANr<�_PyHASH_INFrR�pow�_PyHASH_MODULUS� _PyHASH_10INVrXr=)r1Zexp_hashZhash_r@r*r*r,�__hash__�s zDecimal.__hash__cCst|jttt|j��|j�S)zeRepresents the number as a triple tuple. To show the internals exactly as they are. )rr<rrrvrXr=rRr�r*r*r,�as_tuple�szDecimal.as_tuplecCs�|jr |��rtd��ntd��|s(dSt|j�}|jdkrR|d|jd}}nn|j}|dkr�|ddkr�|d}|d8}qZ|j}t||@��d|�}|r�||L}||8}d||>}|j r�|}||fS)a�Express a finite Decimal instance in the form n / d. Returns a pair (n, d) of integers. When called on an infinity or NaN, raises OverflowError or ValueError respectively. >>> Decimal('3.14').as_integer_ratio() (157, 50) >>> Decimal('-123e5').as_integer_ratio() (-12300000, 1) >>> Decimal('0.00').as_integer_ratio() (0, 1) z#cannot convert NaN to integer ratioz(cannot convert Infinity to integer ratior_r'r�r/r�) rSr�rs� OverflowErrorrXr=rR�minr�r<)r1r:r�Zd5Zd2Zshift2r*r*r,r��s, zDecimal.as_integer_ratiocCsdt|�S)z0Represents the number as an instance of Decimal.z Decimal('%s'))rgr�r*r*r,�__repr__szDecimal.__repr__Fc Csbddg|j}|jrL|jdkr&|dS|jdkr>|d|jS|d|jS|jt|j�}|jdkrt|d krt|}n6|s~d }n,|jdkr�|d dd }n|d dd }|dkr�d}d d||j}nL|t|j�kr�|jd|t|j�}d}n |jd|�}d |j|d�}||k�r(d}n*|du�r8t�}ddg|jd||}||||S)z�Return string representation of the number in scientific notation. Captures all of the information in the underlying representation. rVrWr]ZInfinityr:�NaNr�r'��r/rTr^�.N�e�Ez%+d)r<rSrRr=rmr�capitals) r1�engr2rD� leftdigits�dotplacer}r~rYr*r*r,�__str__s: zDecimal.__str__cCs|jd|d�S)a,Convert to a string, using engineering notation if an exponent is needed. Engineering notation has an exponent which is a multiple of 3. This can leave up to 3 digits to the left of the decimal place and may require the addition of either one or two trailing zeros. T)r�r2)r��r1r2r*r*r,� to_eng_string;szDecimal.to_eng_stringcCsR|jr|j|d�}|r|S|dur(t�}|s@|jtkr@|��}n|��}|�|�S)zRReturns a copy with the sign switched. Rounds, if it has reason. rMN)rSr�rrFr�copy_abs�copy_negate�_fix�r1r2r@r*r*r,�__neg__Ds zDecimal.__neg__cCsR|jr|j|d�}|r|S|dur(t�}|s@|jtkr@|��}nt|�}|�|�S)zhReturns a copy, unless it is a sNaN. Rounds the number (if more than precision digits) rMN)rSr�rrFrr�rr�r�r*r*r,�__pos__Zs zDecimal.__pos__TcCsJ|s|��S|jr&|j|d�}|r&|S|jr:|j|d�}n|j|d�}|S)z�Returns the absolute value of self. If the keyword argument 'round' is false, do not round. The expression self.__abs__(round=False) is equivalent to self.copy_abs(). rM)r�rSr�r<r�r�)r1�roundr2r@r*r*r,�__abs__oszDecimal.__abs__c Csht|�}|tur|S|dur"t�}|js.|jr�|�||�}|rB|S|��rr|j|jkrj|��rj|�td�St |�S|��r�t |�St |j|j�}d}|jt kr�|j|jkr�d}|s�|s�t |j|j�}|r�d}t|d|�}|�|�}|S|�st||j|jd�}|�||j�}|�|�}|S|�sVt||j|jd�}|�||j�}|�|�}|St|�}t|�}t|||j�\}}t�} |j|jk�r�|j|jk�r�t|d|�}|�|�}|S|j|jk�r�||}}|jdk�r�d| _|j|j|_|_nd| _n&|jdk�rd| _d\|_|_nd| _|jdk�r<|j|j| _n|j|j| _|j| _t | �}|�|�}|S)zbReturns self + other. -INF + INF (or the reverse) cause InvalidOperation errors. Nz -INF + INFr'r/rT)r'r')r�r�rrSr�r�r<rkr rr�rRrFrr;r��maxrG�_rescalerp� _normalizerDrXrY) r1r�r2r@rYZnegativezerorD�op1�op2r�r*r*r,�__add__�s| zDecimal.__add__cCsHt|�}|tur|S|js |jr6|j||d�}|r6|S|j|��|d�S)zReturn self - otherrM)r�r�rSr�r�r�r�r*r*r,�__sub__�szDecimal.__sub__cCs"t|�}|tur|S|j||d�S)zReturn other - selfrM)r�r�r�r�r*r*r,�__rsub__�szDecimal.__rsub__cCs@t|�}|tur|S|dur"t�}|j|jA}|js:|jr�|�||�}|rN|S|��rn|sf|�td�St |S|��r�|s�|�td�St |S|j |j }|r�|s�t|d|�}|�|�}|S|j dkr�t||j |�}|�|�}|S|j dk�r t||j |�}|�|�}|St|�}t|�}t|t|j|j�|�}|�|�}|S)z\Return self * other. (+-) INF * 0 (or its reverse) raise InvalidOperation. Nz(+-)INF * 0z0 * (+-)INFrT�1)r�r�rr<rSr�r�rkr rBrRr;r�r=rprgrX)r1r�r2Z resultsignr@Z resultexpr�r�r*r*r,�__mul__�sH zDecimal.__mul__cCs�t|�}|turtS|dur"t�}|j|jA}|js:|jr�|�||�}|rN|S|��rj|��rj|�td�S|��rzt |S|��r�|�t d�t|d|��S|s�|s�|�t d�S|�td|�S|s�|j|j}d}n�t|j�t|j�|jd}|j|j|}t|�}t|�} |dk�r:t|jd || j�\}} nt|j| jd |�\}} | �rt|d dk�r�|d7}n8|j|j}||k�r�|d dk�r�|d }|d7}�q�t|t|�|�}|�|�S)zReturn self / other.Nz(+-)INF/(+-)INFzDivision by infinityrTz0 / 0zx / 0r'r/r�r�)r�r�rr<rSr�r�rkr rBrr;�Etinyrr rRrmr=rGrp�divmodrXrgr�)r1r�r2rDr@rYr��shiftr�r�� remainder� ideal_expr*r*r,�__truediv__,sP zDecimal.__truediv__cCs|j|jA}|��r|j}nt|j|j�}|��|��}|rN|��sN|dkrht|dd�|�||j�fS||jk�r t |�}t |�}|j |j kr�|jd|j |j 9_n|jd|j |j 9_t|j|j�\}} |d|jk�r t|t |�d�t|jt | �|�fS|�td�} | | fS)z�Return (self // other, self % other), to context.prec precision. Assumes that neither self nor other is a NaN, that self is not infinite and that other is nonzero. r�rTr'r�z%quotient too large in //, % or divmod)r<r�rRr�r�r;r�rFrGrprYrXr�rgrkr)r1r�r2rDr��expdiffr�r��q�rr@r*r*r,�_dividegs0 ��zDecimal._dividecCs"t|�}|tur|S|j||d�S)z)Swaps self/other and returns __truediv__.rM)r�r�r�r�r*r*r,�__rtruediv__�szDecimal.__rtruediv__cCs�t|�}|tur|S|dur"t�}|�||�}|r:||fS|j|jA}|��r~|��rj|�td�}||fSt||�td�fS|s�|s�|�t d�}||fS|�t d|�|�td�fS|�||�\}}|�|�}||fS)z6 Return (self // other, self % other) Nzdivmod(INF, INF)�INF % xzdivmod(0, 0)�x // 0�x % 0) r�r�rr�r<r�rkr rBrr r�r�)r1r�r2r@rDZquotientr�r*r*r,� __divmod__�s4 � � zDecimal.__divmod__cCs"t|�}|tur|S|j||d�S)z(Swaps self/other and returns __divmod__.rM)r�r�r�r�r*r*r,�__rdivmod__�szDecimal.__rdivmod__cCs�t|�}|tur|S|dur"t�}|�||�}|r6|S|��rJ|�td�S|sj|r^|�td�S|�td�S|�||�d}|� |�}|S)z self % other Nr�r�z0 % 0r/) r�r�rr�r�rkr rr�r�)r1r�r2r@r�r*r*r,�__mod__�s" zDecimal.__mod__cCs"t|�}|tur|S|j||d�S)z%Swaps self/other and returns __mod__.rM)r�r�r�r�r*r*r,�__rmod__�szDecimal.__rmod__cCs�|durt�}t|dd�}|�||�}|r.|S|��rB|�td�S|sb|rV|�td�S|�td�S|��r|t|�}|�|�St |j |j �}|s�t|jd|�}|�|�S|� �|� �}||jdkr�|�t�S|d kr�|�||j�}|�|�St|�}t|�}|j|jk�r(|jd |j|j9_n|jd |j|j9_t|j|j�\}} d| |d@|jk�r~| |j8} |d7}|d |jk�r�|�t�S|j} | dk�r�d| } | } t| t| �|�}|�|�S) zI Remainder nearest to 0- abs(remainder-near) <= other/2 NTr�zremainder_near(infinity, x)zremainder_near(x, 0)zremainder_near(0, 0)rTr/r�r�r`r')rr�r�r�rkr rrr�r�rRr;r<r�rGrr�rFrprYrXr�rg)r1r�r2r@�ideal_exponentr�r�r�r�r�rDr*r*r,�remainder_near�s`�� zDecimal.remainder_nearcCs�t|�}|tur|S|dur"t�}|�||�}|r6|S|��rb|��rR|�td�St|j|jAS|s�|r�|�t d|j|jA�S|�t d�S|�||�dS)z self // otherNz INF // INFr�z0 // 0r')r�r�rr�r�rkr rBr<r rr�r�r*r*r,�__floordiv__'s& �zDecimal.__floordiv__cCs"t|�}|tur|S|j||d�S)z*Swaps self/other and returns __floordiv__.rM)r�r�r�r�r*r*r,� __rfloordiv__CszDecimal.__rfloordiv__cCs8|��r(|��rtd��|jr"dnd}nt|�}t|�S)zFloat representation.z%Cannot convert signaling NaN to floatz-nan�nan)r�r�rsr<rgrw�r1�sr*r*r,� __float__JszDecimal.__float__cCst|jr(|��rtd��n|��r(td��d|j}|jdkrT|t|j�d|jS|t|jd|j�pjd�SdS)z1Converts self to an int, truncating if necessary.zCannot convert NaN to integerz"Cannot convert infinity to integerr�r'r�NrT) rSr�rsr�r�r<rRrXr=r�r*r*r,�__int__Ts zDecimal.__int__cCs|Sr)r*r�r*r*r,�realcszDecimal.realcCstd�S)Nr'�rr�r*r*r,�imaggszDecimal.imagcCs|Sr)r*r�r*r*r,� conjugatekszDecimal.conjugatecCstt|��Sr))�complexrwr�r*r*r,�__complex__nszDecimal.__complex__cCsR|j}|j|j}t|�|krJ|t|�|d��d�}t|j||jd�St|�S)z2Decapitate the payload of a NaN to fit the contextNrTT) r=rG�clamprmrnr;r<rRr)r1r2ZpayloadZmax_payload_lenr*r*r,r>qszDecimal._fix_nancCsX|jr |��r|�|�St|�S|��}|��}|s�|j|g|j}tt |j |�|�}||j krx|�t�t |jd|�St|�St|j�|j |j}||kr�|�td|j�}|�t�|�t�|S||k}|r�|}|j |k�r�t|j�|j |} | dk�rt |jd|d�}d} |j|j} | || �}|jd| ��p>d}|dk�r~tt|�d�}t|�|jk�r~|dd�}|d7}||k�r�|�td|j�}nt |j||�}|�r�|�r�|�t�|�r�|�t�|�r�|�t�|�t�|�s�|�t�|S|�r|�t�|jdk�rP|j |k�rP|�t�|jd|j |} t |j| |�St|�S)z�Round if it is necessary to keep self within prec precision. Rounds and fixes the exponent. Does not raise on a sNaN. Arguments: self - Decimal instance context - context used. rT� above Emaxr'r�r/Nr�)rSr�r>rr��EtoprHr�r�r�rRrkrr;r<rmr=rGrrr�_pick_rounding_functionrFrgrXrr )r1r2r�r��exp_maxZnew_expZexp_minr@Zself_is_subnormalrZrounding_method�changedr�r�r*r*r,r�}sn zDecimal._fixcCst|j|�rdSdSdS)z(Also known as round-towards-0, truncate.r'r�N)� _all_zerosr=�r1rGr*r*r,�_round_down�szDecimal._round_downcCs|�|�S)zRounds away from 0.)rrr*r*r,� _round_up�szDecimal._round_upcCs*|j|dvrdSt|j|�r"dSdSdS)zRounds 5 up (away from 0)Z56789r/r'r�N)r=r�rr*r*r,�_round_half_up�s zDecimal._round_half_upcCst|j|�rdS|�|�SdS)zRound 5 downr�N��_exact_halfr=rrr*r*r,�_round_half_down�szDecimal._round_half_downcCs8t|j|�r*|dks&|j|ddvr*dS|�|�SdS)z!Round 5 to even, rest to nearest.r'r/�02468r�Nrrr*r*r,�_round_half_even�s��zDecimal._round_half_evencCs |jr|�|�S|�|�SdS)z(Rounds up (not away from 0 if negative.)N�r<rrr*r*r,�_round_ceilings zDecimal._round_ceilingcCs |js|�|�S|�|�SdS)z'Rounds down (not towards 0 if negative)Nr rr*r*r,�_round_floor s zDecimal._round_floorcCs0|r |j|ddvr |�|�S|�|�SdS)z)Round down unless digit prec-1 is 0 or 5.r/Z05N)r=rrr*r*r,�_round_05ups zDecimal._round_05up)rrrrrrrrcCsb|dur2t|t�std��tdd|�}|�|�S|jrR|��rJtd��ntd��t|� dt ��S)a�Round self to the nearest integer, or to a given precision. If only one argument is supplied, round a finite Decimal instance self to the nearest integer. If self is infinite or a NaN then a Python exception is raised. If self is finite and lies exactly halfway between two integers then it is rounded to the integer with even last digit. >>> round(Decimal('123.456')) 123 >>> round(Decimal('-456.789')) -457 >>> round(Decimal('-3.0')) -3 >>> round(Decimal('2.5')) 2 >>> round(Decimal('3.5')) 4 >>> round(Decimal('Inf')) Traceback (most recent call last): ... OverflowError: cannot round an infinity >>> round(Decimal('NaN')) Traceback (most recent call last): ... ValueError: cannot round a NaN If a second argument n is supplied, self is rounded to n decimal places using the rounding mode for the current context. For an integer n, round(self, -n) is exactly equivalent to self.quantize(Decimal('1En')). >>> round(Decimal('123.456'), 0) Decimal('123') >>> round(Decimal('123.456'), 2) Decimal('123.46') >>> round(Decimal('123.456'), -2) Decimal('1E+2') >>> round(Decimal('-Infinity'), 37) Decimal('NaN') >>> round(Decimal('sNaN123'), 0) Decimal('NaN123') Nz+Second argument to round should be integralr'r��cannot round a NaN�cannot round an infinity)rfrXryr;�quantizerSr�rsr�r�r)r1r:rYr*r*r,� __round__&s/ zDecimal.__round__cCs0|jr |��rtd��ntd��t|�dt��S)z�Return the floor of self, as an integer. For a finite Decimal instance self, return the greatest integer n such that n <= self. If self is infinite or a NaN then a Python exception is raised. r rr')rSr�rsr�rXr�rr�r*r*r,� __floor__ds zDecimal.__floor__cCs0|jr |��rtd��ntd��t|�dt��S)z�Return the ceiling of self, as an integer. For a finite Decimal instance self, return the least integer n such that n >= self. If self is infinite or a NaN then a Python exception is raised. r rr')rSr�rsr�rXr�rr�r*r*r,�__ceil__ss zDecimal.__ceil__cCst|dd�}t|dd�}|js$|jr�|dur2t�}|jdkrJ|�td|�S|jdkrb|�td|�S|jdkrr|}nf|jdkr�|}nV|jdkr�|s�|�td�St|j|jA}n*|jdkr�|s�|�td �St|j|jA}n0t|j|jAt t |j�t |j��|j|j�}|�||�S) a:Fused multiply-add. Returns self*other+third with no rounding of the intermediate product self*other. self and other are multiplied together, with no rounding of the result. The third operand is then added to the result, and a single final rounding is performed. Tr�Nr\r�r:r]zINF * 0 in fmaz0 * INF in fma) r�rSrrRrkr rBr<r;rgrXr=r�)r1r�Zthirdr2�productr*r*r,�fma�s< � � �zDecimal.fmacCs�t|�}|tur|St|�}|tur(|S|dur6t�}|��}|��}|��}|sZ|sZ|r�|dkrp|�td|�S|dkr�|�td|�S|dkr�|�td|�S|r�|�|�S|r�|�|�S|�|�S|��r�|��r�|��s�|�td�S|dkr�|�td�S|�s|�td�S|��|j k�r(|�td�S|�s@|�s@|�td �S|� ��rPd}n|j}tt |��}t|��}t|��} |j |td |j|�|}t| j�D]} t|d |�}�q�t|| j |�}t|t|�d�S)z!Three argument version of __pow__Nr`r�z@pow() 3rd argument not allowed unless all arguments are integersr'zApow() 2nd argument cannot be negative when 3rd argument specifiedzpow() 3rd argument cannot be 0zSinsufficient precision: pow() 3rd argument must not have more than precision digitszXat least one of pow() 1st argument and 2nd argument must be nonzero; 0**0 is not definedr�)r�r�rr�rkr r>� _isintegerr�rG�_isevenr<rorXrp�to_integral_valuer�rY�ranger;rg)r1r��modulor2r�r�Z modulo_is_nanrD�base�exponent�ir*r*r,� _power_modulo�s�� zDecimal._power_modulocCs�t|�}|j|j}}|ddkr4|d}|d7}qt|�}|j|j}}|ddkrh|d}|d7}qJ|dk�r||9}|ddkr�|d}|d7}qz|dkr�dS|d|} |jdkr�| } |��r�|jdkr�|jt|�} t| | |d�}nd}tddd|| |�S|jdk�r�|d}|dv�r�||@|k�rBdSt |�d} |dd }|t t|��k�rpdSt| ||�} t|||�}| du�s�|du�r�dS| |k�r�dSd | }n�|d k�r�t |�dd } t d | |�\}}|�r�dS|d dk�r|d }| d8} �q�|dd}|t t|��k�r6dSt| ||�} t|||�}| du�sf|du�rjdS| |k�rxdSd | }ndS|d|k�r�dS| |}tdt|�|�S|dk�r�|d|d}}n�|dk�r�t tt||��|k�r�dSt |�}|dk�r,t tt|�|��|k�r,dS|d|}}|d |d k�r\dk�rtnn|d }|d }�q<|d |d k�r�dk�r�nn|d }|d }�qt|dk�rX|dk�r�||k�r�dSt ||�\}}|dk�r�dSdt |�|>}t |||d�\}}||k�r$�q<n||d||}�q�||k�rP|dk�sTdS|}|dk�r|||dt|�k�r|dS||}||9}|d|k�r�dSt|�}|��r�|jdk�r�|jt|�} t|| |t |��}nd}td|d|||�S)ahAttempt to compute self**other exactly. Given Decimals self and other and an integer p, attempt to compute an exact result for the power self**other, with p digits of precision. Return None if self**other is not exactly representable in p digits. Assumes that elimination of special cases has already been performed: self and other must both be nonspecial; self must be positive and not numerically equal to 1; other must be nonzero. For efficiency, other._exp should not be too large, so that 10**abs(other._exp) is a feasible calculation.r�r'r/Nr�rT)r`��]�Ar��r^r`�d)rprXrYrDrr<rRr�r;�_nbitsrmrg�_decimal_lshift_exactr�ro� _log10_lb)r1r��p�x�xc�xe�y�yc�yerr�ZzerosZ last_digitr�Zemaxr�r|r:Zxc_bits�rem�ar�r�Zstr_xcr*r*r,�_power_exacts�: &&$$ zDecimal._power_exactcCs4|dur|�|||�St|�}|tur*|S|dur8t�}|�||�}|rL|S|sd|s`|�td�StSd}|jdkr�|� �r�|� �s�d}n|r�|�td�S|��}|s�|jdkr�t|dd�St |S|��r�|jdkr�t |St|dd�S|tk�r�|� ��rZ|jdk�rd}n||jk�r"|j}nt|�}|j|}|d|jk�rxd|j}|�t�n|�t�|�t�d|j}t|dd||�S|��}|��r�|jdk|dkk�r�t|dd�St |Sd}d} |��|��} |dk|jdkk�r| tt|j��k�rHt|d|jd�}n,|��}| tt|��k�rHt|d|d�}|du�r�|�||jd�}|du�r�|dk�r�td|j|j�}d } |du�r8|j}t|�} | j| j}}t|�}|j|j}}|jdk�r�|}d }t||||||�\}}|ddtt|��|d�r�q(|d 7}�q�t|t|�|�}| �r&|� ��s&t|j�|jk�r�|jdt|j�}t|j|jd||j|�}|� �}|�!�t"D]}d|j#|<�q�|�$|�}|�t�|j%t&�r�|�t'�|j%t(�r�|�t(d |j�t't&ttt)fD]}|j%|�r|�|��qn |�$|�}|S)aHReturn self ** other [ % modulo]. With two arguments, compute self**other. With three arguments, compute (self**other) % modulo. For the three argument form, the following restrictions on the arguments hold: - all three arguments must be integral - other must be nonnegative - either self or other (or both) must be nonzero - modulo must be nonzero and must have at most p digits, where p is the context precision. If any of these restrictions is violated the InvalidOperation flag is raised. The result of pow(self, other, modulo) is identical to the result that would be obtained by computing (self**other) % modulo with unbounded precision, but is computed more efficiently. It is always exact. Nz0 ** 0r'r/z+x ** y with x negative and y not an integerrTr�FTr^r�r�r�)*rr�r�rr�rkr �_Oner<rrr�r;rBr�rGrXrRrrr��_log10_exp_boundrmrgrHr�r1r=rprYrD�_dpowerrNrO�_signals�trapsr��flagsr rrr)r1r�rr2r@Zresult_signZ multiplierrYZself_adj�exact�boundr�r(r)r*r+r,r-r.�extrar�r�Z newcontextZ exceptionr*r*r,�__pow__�s� � "� zDecimal.__pow__cCs"t|�}|tur|S|j||d�S)z%Swaps self/other and returns __pow__.rM)r�r�r;r�r*r*r,�__rpow__� szDecimal.__rpow__cCs�|durt�}|jr(|j|d�}|r(|S|�|�}|��r>|S|sPt|jdd�S|j|��g|j }t |j�}|j}|j|ddkr�||kr�|d7}|d8}qtt|j|jd|�|�S)z?Normalize- strip trailing 0s, change anything equal to 0 to 0e0NrMrTr'r/) rrSr�r�r�r;r<rHr�r�rmr=rR)r1r2r@�dupr��endrYr*r*r,� normalize� s$ zDecimal.normalizecCs�t|dd�}|durt�}|dur(|j}|js4|jr||�||�}|rH|S|��sX|��r||��rp|��rpt|�S|�td�S|� �|j kr�|jks�n|�td�S|s�t|j d|j �}|�|�S|��}||jkr�|�td�S||j d|jk�r|�td �S|�|j |�}|��|jk�r.|�td�St|j�|jk�rL|�td �S|�rl|��|jk�rl|�t�|j |j k�r�||k�r�|�t�|�t�|�|�}|S) z�Quantize self so its exponent is the same as that of exp. Similar to self._rescale(exp._exp) but with error checking. Tr�Nzquantize with one INFz)target exponent out of bounds in quantizerTz9exponent of quantize result too large for current contextr/z7quantize result has too many digits for current context)r�rrFrSr�r�rrkr r�rRrHr;r<r�r�rGr�rmr=�Eminr rr)r1rYrFr2r@r�r*r*r,r� s`�� zDecimal.quantizecCsDt|dd�}|js|jr8|��r(|��p6|��o6|��S|j|jkS)a=Return True if self and other have the same exponent; otherwise return False. If either operand is a special value, the following rules are used: * return True if both operands are infinities * return True if both operands are NaNs * otherwise, return False. Tr�)r�rSr��is_infiniterRr�r*r*r,�same_quantum% s �zDecimal.same_quantumcCs�|jrt|�S|s t|jd|�S|j|krHt|j|jd|j||�St|j�|j|}|dkrzt|jd|d�}d}|j|}|||�}|jd|�p�d}|dkr�tt |�d�}t|j||�S)asRescale self so that the exponent is exp, either by padding with zeros or by truncating digits, using the given rounding mode. Specials are returned without change. This operation is quiet: it raises no flags, and uses no information from the context. exp = exp to scale to (an integer) rounding = rounding mode rTr'r�r/N) rSrr;r<rRr=rmr�rgrX)r1rYrFrZ this_functionr�r�r*r*r,r�4 s$ � zDecimal._rescalecCsf|dkrtd��|js|s"t|�S|�|��d||�}|��|��krb|�|��d||�}|S)a"Round a nonzero, nonspecial Decimal to a fixed number of significant figures, using the given rounding mode. Infinities, NaNs and zeros are returned unaltered. This operation is quiet: it raises no flags, and uses no information from the context. r'z'argument should be at least 1 in _roundr/)rsrSrr�r�)r1�placesrFr@r*r*r,�_roundV s zDecimal._roundcCs�|jr"|j|d�}|r|St|�S|jdkr4t|�S|sFt|jdd�S|durTt�}|durb|j}|�d|�}||kr�|� t �|� t�|S)aVRounds to a nearby integer. If no rounding mode is specified, take the rounding mode from the context. This method raises the Rounded and Inexact flags when appropriate. See also: to_integral_value, which does exactly the same as this method except that it doesn't raise Inexact or Rounded. rMr'rTN)rSr�rrRr;r<rrFr�rkrr�r1rFr2r@r*r*r,�to_integral_exactm s$ zDecimal.to_integral_exactcCs`|durt�}|dur|j}|jr>|j|d�}|r6|St|�S|jdkrPt|�S|�d|�SdS)z@Rounds to the nearest integer, without raising inexact, rounded.NrMr')rrFrSr�rrRr�rEr*r*r,r� s zDecimal.to_integral_valuecCs�|durt�}|jrB|j|d�}|r(|S|��rB|jdkrBt|�S|sdt|jd|jd�}|�|�S|jdkrz|� t d�S|jd}t|�}|j d?}|j d@r�|jd}t|j�d?d}n|j}t|j�dd?}||}|dkr�|d |9}d } nt|d |�\}} | } ||8}d|}||}||k�r:�qJn||d?}�q"| �oZ|||k} | �r�|dk�rz|d|}n|d|9}||7}n|ddk�r�|d7}tdt|�|�}|��}|�t�} |�|�}| |_|S)zReturn the square root of self.NrMr'rTr`r/zsqrt(-x), x > 0r�r$Tr�)rrSr�r�r<rr;rRr�rkr rGrprYrXrmr=r�rg� _shallow_copy� _set_roundingrrF)r1r2r@rG�opr��c�lr�r8r�r:r�rFr*r*r,�sqrt� s^ zDecimal.sqrtcCs�t|dd�}|durt�}|js&|jr~|��}|��}|s>|r~|dkrX|dkrX|�|�S|dkrr|dkrr|�|�S|�||�S|�|�}|dkr�|�|�}|dkr�|}n|}|�|�S)z�Returns the larger value. Like max(self, other) except if one is not a number, returns NaN (and signals if one is sNaN). Also rounds. Tr�Nr/r'r��r�rrSr�r�r�r�� compare_total�r1r�r2ZsnZonrJr@r*r*r,r�s& zDecimal.maxcCs�t|dd�}|durt�}|js&|jr~|��}|��}|s>|r~|dkrX|dkrX|�|�S|dkrr|dkrr|�|�S|�||�S|�|�}|dkr�|�|�}|dkr�|}n|}|�|�S)z�Returns the smaller value. Like min(self, other) except if one is not a number, returns NaN (and signals if one is sNaN). Also rounds. Tr�Nr/r'r�rMrOr*r*r,r�*s& zDecimal.mincCs8|jr dS|jdkrdS|j|jd�}|dt|�kS)z"Returns whether self is an integerFr'TNrT)rSrRr=rm)r1�restr*r*r,rLs zDecimal._isintegercCs&|r|jdkrdS|jd|jdvS)z:Returns True if self is even. Assumes self is an integer.r'Tr�r)rRr=r�r*r*r,rUszDecimal._isevencCs0z|jt|j�dWSty*YdS0dS)z$Return the adjusted exponent of selfr/r'N)rRrmr=ryr�r*r*r,r�[szDecimal.adjustedcCs|S)z�Returns the same Decimal object. As we do not have different encodings for the same number, the received object already is in its canonical form. r*r�r*r*r,� canonicalcszDecimal.canonicalcCs.t|dd�}|�||�}|r |S|j||d�S)z�Compares self to the other operand numerically. It's pretty much like compare(), but all NaNs signal, with signaling NaNs taking precedence over quiet NaNs. Tr�rM)r�r�r�r�r*r*r,�compare_signalks zDecimal.compare_signalcCs`t|dd�}|jr|jstS|js,|jr,tS|j}|��}|��}|sL|�r||kr�t|j�|jf}t|j�|jf}||kr�|r�tStS||kr�|r�tStStS|r�|dkr�tS|dkr�tS|dkr�tS|dkr�tSn2|dkr�tS|dkr�tS|dkr�tS|dk�rtS||k�rtS||k�r$tS|j|jk�r@|�r<tStS|j|jk�r\|�rXtStStS)z�Compares self to other using the abstract representations. This is not like the standard compare, which use their numerical value. Note that a total ordering is defined for all possible abstract representations. Tr�r/r`) r�r<�_NegativeOner2r�rmr=�_ZerorR)r1r�r2rDZself_nanZ other_nanZself_keyZ other_keyr*r*r,rNwsf zDecimal.compare_totalcCs&t|dd�}|��}|��}|�|�S)z�Compares self to other using abstract repr., ignoring sign. Like compare_total, but with operand's sign ignored and assumed to be 0. Tr�)r�r�rN)r1r�r2r��or*r*r,�compare_total_mag�szDecimal.compare_total_magcCstd|j|j|j�S)z'Returns a copy with the sign set to 0. r')r;r=rRrSr�r*r*r,r��szDecimal.copy_abscCs2|jrtd|j|j|j�Std|j|j|j�SdS)z&Returns a copy with the sign inverted.r'r/N)r<r;r=rRrSr�r*r*r,r��szDecimal.copy_negatecCs"t|dd�}t|j|j|j|j�S)z$Returns self with the sign of other.Tr�)r�r;r<r=rRrSr�r*r*r,� copy_sign�s �zDecimal.copy_signcCs�|durt�}|j|d�}|r"|S|��dkr2tS|s:tS|��dkrNt|�S|j}|��}|jdkr�|t t |jdd��kr�tdd|jd�}�n0|jdkr�|t t |� �dd��kr�tdd|� �d�}n�|jdk�r||k�rtddd|dd|�}n�|jdk�rD||dk�rDtdd |d|d�}n�t|�}|j|j}}|jdk�rl|}d}t||||�\} } | d dt t | ��|d�r��q�|d7}�qptdt | �| �}|��}|�t�}|�|�}||_|S)zReturns e ** self.NrMr�r/r'r^r�rTrEr�r�)rr�r�rTr2rrGr�r<rmrgrHr;r�rprXrYrD�_dexprGrHrr�rF)r1r2r@r(�adjrIrJr�r:r�rYrFr*r*r,rY�sH$( " zDecimal.expcCsdS)z�Return True if self is canonical; otherwise return False. Currently, the encoding of a Decimal instance is always canonical, so this method returns True for any Decimal. Tr*r�r*r*r,�is_canonical'szDecimal.is_canonicalcCs|jS)z�Return True if self is finite; otherwise return False. A Decimal instance is considered finite if it is neither infinite nor a NaN. )rSr�r*r*r,� is_finite/szDecimal.is_finitecCs |jdkS)z8Return True if self is infinite; otherwise return False.r]�rRr�r*r*r,rA7szDecimal.is_infinitecCs |jdvS)z>Return True if self is a qNaN or sNaN; otherwise return False.rbr\r�r*r*r,r�;szDecimal.is_nancCs*|js |sdS|durt�}|j|��kS)z?Return True if self is a normal number; otherwise return False.FN)rSrr@r�r�r*r*r,� is_normal?s zDecimal.is_normalcCs |jdkS)z;Return True if self is a quiet NaN; otherwise return False.r:r\r�r*r*r,r�GszDecimal.is_qnancCs |jdkS)z8Return True if self is negative; otherwise return False.r/)r<r�r*r*r,� is_signedKszDecimal.is_signedcCs |jdkS)z?Return True if self is a signaling NaN; otherwise return False.r\r\r�r*r*r,r�OszDecimal.is_snancCs*|js |sdS|durt�}|��|jkS)z9Return True if self is subnormal; otherwise return False.FN)rSrr�r@r�r*r*r,�is_subnormalSs zDecimal.is_subnormalcCs|jo|jdkS)z6Return True if self is a zero; otherwise return False.rTr�r�r*r*r,�is_zero[szDecimal.is_zerocCs�|jt|j�d}|dkr4tt|dd��dS|dkrXttd|dd��dSt|�}|j|j}}|dkr�t|d|�}t|�}t|�t|�||kS|ttd||��dS)z�Compute a lower bound for the adjusted exponent of self.ln(). In other words, compute r such that self.ln() >= 10**r. Assumes that self is finite and positive and that self != 1. r/�r�r�r�r'�rRrmr=rgrprXrY�r1rYrIrJr��numZdenr*r*r,� _ln_exp_bound_szDecimal._ln_exp_boundc Cs|durt�}|j|d�}|r"|S|s*tS|��dkr:tS|tkrFtS|jdkr\|�t d�St |�}|j|j}}|j }||��d}t|||�}|ddttt|��|dr�q�|d7}q�tt|d k�tt|��|�}|��}|�t�} |�|�}| |_|S) z/Returns the natural (base e) logarithm of self.NrMr/zln of a negative valuer`r�r�r^r')rr��_NegativeInfinityr�� _Infinityr2rTr<rkr rprXrYrGre�_dlogrmrgror;rGrHrr�rF� r1r2r@rIrJr�r(rCr�rFr*r*r,�lnxs: �$ z Decimal.lncCs�|jt|j�d}|dkr,tt|��dS|dkrHttd|��dSt|�}|j|j}}|dkr�t|d|�}td|�}t|�t|�||kdStd||�}t|�||dkdS) z�Compute a lower bound for the adjusted exponent of self.log10(). In other words, find r such that self.log10() >= 10**r. Assumes that self is finite and positive and that self != 1. r/r�r�r'r��r`Z231rbrcr*r*r,r3�szDecimal._log10_exp_boundc CsF|durt�}|j|d�}|r"|S|s*tS|��dkr:tS|jdkrP|�td�S|jddkr�|jdd�dt |j�dkr�t |jt |j�d�}n�t|�}|j |j}}|j}||��d}t|||�}|d d t tt|��|dr��q|d7}q�tt |dk�tt|��|�}|��}|�t�} |�|�}| |_|S)z&Returns the base 10 logarithm of self.NrMr/zlog10 of a negative valuer'r�rTr`r�r�r^)rr�rfr�rgr<rkr r=rmrrRrprXrYrGr3�_dlog10rgror;rGrHrr�rFrir*r*r,�log10�s: �.$ z Decimal.log10cCsV|j|d�}|r|S|dur"t�}|��r.tS|s@|�tdd�St|��}|�|�S)aM Returns the exponent of the magnitude of self's MSD. The result is the integer which is the exponent of the magnitude of the most significant digit of self (as though it were truncated to a single digit while maintaining the value of that digit and without limiting the resulting exponent). rMNzlogb(0)r/) r�rr�rgrkr rr�r�r�r*r*r,�logb�s zDecimal.logbcCs6|jdks|jdkrdS|jD]}|dvrdSqdS)z�Return True if self is a logical operand. For being logical, it must be a finite number with a sign of 0, an exponent of 0, and a coefficient whose digits must all be either 0 or 1. r'FZ01T)r<rRr=)r1�digr*r*r,� _islogical s zDecimal._islogicalcCs�|jt|�}|dkr$d||}n|dkr<||jd�}|jt|�}|dkr`d||}n|dkrx||jd�}||fS)Nr'rT)rGrm)r1r2�opa�opbZdifr*r*r,� _fill_logical' szDecimal._fill_logicalcCsz|durt�}t|dd�}|��r*|��s4|�t�S|�||j|j�\}}d�dd�t||�D��}t d|� d�ptdd�S) z;Applies an 'and' operation between self and other's digits.NTr�rVcSs$g|]\}}tt|�t|�@��qSr*�rgrX��.0r0�br*r*r,� <listcomp>B r.z'Decimal.logical_and.<locals>.<listcomp>r'rT�rr�rprkr rsr=ru�zipr;rn�r1r�r2rqrrr�r*r*r,�logical_and4 s zDecimal.logical_andcCs(|durt�}|�tdd|jd�|�S)zInvert all its digits.Nr'r�)r�logical_xorr;rGr�r*r*r,�logical_invertE s �zDecimal.logical_invertcCsz|durt�}t|dd�}|��r*|��s4|�t�S|�||j|j�\}}d�dd�t||�D��}t d|� d�ptdd�S) z:Applies an 'or' operation between self and other's digits.NTr�rVcSs$g|]\}}tt|�t|�B��qSr*rtrur*r*r,rxZ r.z&Decimal.logical_or.<locals>.<listcomp>r'rTryr{r*r*r,� logical_orL s zDecimal.logical_orcCsz|durt�}t|dd�}|��r*|��s4|�t�S|�||j|j�\}}d�dd�t||�D��}t d|� d�ptdd�S) z;Applies an 'xor' operation between self and other's digits.NTr�rVcSs$g|]\}}tt|�t|�A��qSr*rtrur*r*r,rxk r.z'Decimal.logical_xor.<locals>.<listcomp>r'rTryr{r*r*r,r}] s zDecimal.logical_xorcCs�t|dd�}|durt�}|js&|jr~|��}|��}|s>|r~|dkrX|dkrX|�|�S|dkrr|dkrr|�|�S|�||�S|��|��}|dkr�|�|�}|dkr�|}n|}|�|�S�z8Compares the values numerically with their sign ignored.Tr�Nr/r'r�� r�rrSr�r�r�r�r�rNrOr*r*r,�max_magn s& zDecimal.max_magcCs�t|dd�}|durt�}|js&|jr~|��}|��}|s>|r~|dkrX|dkrX|�|�S|dkrr|dkrr|�|�S|�||�S|��|��}|dkr�|�|�}|dkr�|}n|}|�|�Sr�r�rOr*r*r,�min_mag� s& zDecimal.min_magcCs�|durt�}|j|d�}|r"|S|��dkr2tS|��dkrTtdd|j|��S|��}|�t �|� �|�|�}||kr�|S|�tdd|� �d�|�S)z=Returns the largest representable number smaller than itself.NrMr�r/r'rEr�)rr�r�rfr;rGr�rNrHr�_ignore_all_flagsr�r�r��r1r2r@Znew_selfr*r*r,� next_minus� s$ �zDecimal.next_minuscCs�|durt�}|j|d�}|r"|S|��dkr2tS|��dkrTtdd|j|��S|��}|�t �|� �|�|�}||kr�|S|�tdd|� �d�|�S)z=Returns the smallest representable number larger than itself.NrMr/r�rEr'r�)rr�r�rgr;rGr�rNrHrr�r�r�r�r�r*r*r,� next_plus� s$ �zDecimal.next_pluscCs�t|dd�}|durt�}|�||�}|r.|S|�|�}|dkrJ|�|�S|dkr^|�|�}n |�|�}|��r�|�t d|j �|�t�|�t�nD|� �|jkr�|�t�|�t�|�t�|�t�|s�|�t�|S)a�Returns the number closest to self, in the direction towards other. The result is the closest representable number to self (excluding self) that is in the direction towards other, unless both have the same value. If the two operands are numerically equal, then the result is a copy of self with the sign set to be the same as the sign of other. Tr�Nr'r�z Infinite result from next_toward)r�rr�r�rWr�r�r�rkrr<rrr�r@rr r)r1r�r2r@Z comparisonr*r*r,�next_toward� s6 � zDecimal.next_towardcCs�|��rdS|��rdS|��}|dkr,dS|dkr8dS|��rN|jrJdSdS|d ur\t�}|j|d �rv|jrrdSdS|jr�d SdSd S)aReturns an indication of the class of self. The class is one of the following strings: sNaN NaN -Infinity -Normal -Subnormal -Zero +Zero +Subnormal +Normal +Infinity r�r�r/z +Infinityr�z -Infinityz-Zeroz+ZeroNrMz -Subnormalz +Subnormalz-Normalz+Normal)r�r�r�r`r<rr_)r1r2�infr*r*r,�number_classs,zDecimal.number_classcCstd�S)z'Just returns 10, as this is Decimal, :)r�r�r�r*r*r,�radix0sz Decimal.radixcCs�|durt�}t|dd�}|�||�}|r.|S|jdkrB|�t�S|jt|�kr`|jksln|�t�S|��r|t |�St|�}|j }|jt|�}|dkr�d||}n|dkr�||d�}||d�|d|�}t|j |�d�p�d|j�S)z5Returns a rotated copy of self, value-of-other times.NTr�r'rT�rr�r�rRrkr rGrXr�rr=rmr;r<rn)r1r�r2r@�torot�rotdig�topadZrotatedr*r*r,�rotate4s. �zDecimal.rotatecCs�|durt�}t|dd�}|�||�}|r.|S|jdkrB|�t�Sd|j|j}d|j|j}|t|�krz|ks�n|�t�S|� �r�t |�St|j|j |jt|��}|�|�}|S)z>Returns self operand after adding the second value to its exp.NTr�r'r�r`)rr�r�rRrkr rHrGrXr�rr;r<r=r�)r1r�r2r@ZliminfZlimsupr�r*r*r,�scalebUs" zDecimal.scalebcCs|durt�}t|dd�}|�||�}|r.|S|jdkrB|�t�S|jt|�kr`|jksln|�t�S|��r|t |�St|�}|j }|jt|�}|dkr�d||}n|dkr�||d�}|dkr�|d|�}n|d|}||jd�}t|j |�d��p d|j�S)z5Returns a shifted copy of self, value-of-other times.NTr�r'rTr�)r1r�r2r@r�r�r�Zshiftedr*r*r,r�ns4 �z Decimal.shiftcCs|jt|�ffSr))� __class__rgr�r*r*r,� __reduce__�szDecimal.__reduce__cCst|�tur|S|�t|��Sr)��typerr�rgr�r*r*r,�__copy__�szDecimal.__copy__cCst|�tur|S|�t|��Sr)r�)r1�memor*r*r,�__deepcopy__�szDecimal.__deepcopy__cCsJ|durt�}t||d�}|jrXt|j|�}t|��}|ddkrL|d7}t|||�S|ddurvddg|j|d<|ddkr�t |j|j |jd�}|j}|d}|du�r|dd vr�|� |d |�}nF|ddvr�|�||�}n*|ddv�rt|j �|k�r|� ||�}|�s@|jd k�r@|ddv�r@|�d |�}|jt|j �} |dd v�r~|�sx|du�rxd |} nd } nB|ddv�r�| } n.|ddv�r�|jd k�r�| dk�r�| } nd } | d k�r�d}d| |j }nP| t|j �k�r|j d| t|j �}d}n"|j d| ��p d}|j | d�}| | } t|j||| |�S)a|Format a Decimal instance according to the given specifier. The specifier should be a standard format specifier, with the form described in PEP 3101. Formatting types 'e', 'E', 'f', 'F', 'g', 'G', 'n' and '%' are supported. If the formatting type is omitted it defaults to 'g' or 'G', depending on the value of context.capitals. N)�_localeconvr��%�g�Gr`� precision�eEr/zfF%ZgGr'r�rTrV)r�_parse_format_specifierrS�_format_signr<rgr�� _format_alignr�r;r=rRrFrDr�rm�_format_number)r1Z specifierr2r��specrD�bodyrFr�r�r�r}r~rYr*r*r,� __format__�sZ zDecimal.__format__)rTN)NN)N)N)N)N)N)N)FN)N)N)N)TN)N)N)N)N)N)N)N)N)N)N)N)N)N)N)N)N)NN)N)N)NN)N)NN)NN)N)N)N)N)N)N)N)N)N)N)N)N)N)N)N)N)N)N)N)N)N)N)N)N)N)N)NN)�r5r6r7r8� __slots__re�classmethodrxr�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r��__radd__r�r�r��__rmul__r�r�r�r�r�r�r�r�r�r�r�r�� __trunc__�propertyr�r�r�r�r>r�rrrrrr rr�dictr�rrrrrr1r;r<r?rrBr�rDrFr�to_integralrLr�r�rrr�rQrRrNrVr�r�rWrYrZr[rAr�r]r�r^r�r_r`rerjr3rmrnrprsr|r~rr}r�r�r�r�r�r�r�r�r�r�r�r�r�r�r*r*r*r,rs , !@ 2 4 V7;!$K f �>,UnY="c*" IK23 .*!'rFcCs&t�t�}||_||_||_||_|S)z�Create a decimal instance directly, without any validation, normalization (e.g. removal of leading zeros) or argument conversion. This function is for *internal use only*. )rdrerr<r=rRrS)rDZcoefficientrZspecialr1r*r*r,r;�s r;c@s(eZdZdZdd�Zdd�Zdd�ZdS) rPz�Context manager class to support localcontext(). Sets a copy of the supplied context in __enter__() and restores the previous decimal context in __exit__() cCs|��|_dSr))rN�new_context)r1r�r*r*r,�__init__sz_ContextManager.__init__cCst�|_t|j�|jSr))r� saved_contextrr�r�r*r*r,� __enter__s z_ContextManager.__enter__cCst|j�dSr))rr�)r1�t�v�tbr*r*r,�__exit__sz_ContextManager.__exit__N)r5r6r7r8r�r�r�r*r*r*r,rPsrPc @s�eZdZdZd�dd�Zdd�Zdd�Zd d �Zdd�Zd d�Z dd�Z dd�Zdd�Zdd�Z dd�ZeZd�dd�Zdd�Zdd�Zdd �ZdZd!d"�Zd#d$�Zd%d&�Zd�d(d)�Zd*d+�Zd,d-�Zd.d/�Zd0d1�Zd2d3�Zd4d5�Zd6d7�Zd8d9�Z d:d;�Z!d<d=�Z"d>d?�Z#d@dA�Z$dBdC�Z%dDdE�Z&dFdG�Z'dHdI�Z(dJdK�Z)dLdM�Z*dNdO�Z+dPdQ�Z,dRdS�Z-dTdU�Z.dVdW�Z/dXdY�Z0dZd[�Z1d\d]�Z2d^d_�Z3d`da�Z4dbdc�Z5ddde�Z6dfdg�Z7dhdi�Z8djdk�Z9dldm�Z:dndo�Z;dpdq�Z<drds�Z=dtdu�Z>dvdw�Z?dxdy�Z@dzd{�ZAd|d}�ZBd~d�ZCd�d��ZDd�d��ZEd�d��ZFd�d��ZGd�d�d��ZHd�d��ZId�d��ZJd�d��ZKd�d��ZLd�d��ZMd�d��ZNd�d��ZOd�d��ZPd�d��ZQd�d��ZRd�d��ZSd�d��ZTd�d��ZUd�d��ZVeVZWdS)�ra�Contains the context for a Decimal instance. Contains: prec - precision (for use in rounding, division, square roots..) rounding - rounding type (how you round) traps - If traps[exception] = 1, then the exception is raised when it is caused. Otherwise, a value is substituted in. flags - When an exception is caused, flags[exception] is set. (Whether or not the trap_enabler is set) Should be reset by user of Decimal instance. Emin - Minimum exponent Emax - Maximum exponent capitals - If 1, 1*10^1 is printed as 1E+1. If 0, printed as 1e1 clamp - If 1, change exponents if too high (Default 0) Nc s<zt} WntyYn0|dur(|n| j|_|dur<|n| j|_|durP|n| j|_|durd|n| j|_|durx|n| j|_|dur�|n| j|_| dur�g|_n| |_�dur�| j � �|_ n.t�t�s�t�fdd�t �D��|_ n�|_ �du�rt�t d�|_n0t�t��s2t�fdd�t �D��|_n�|_dS)Nc3s|]}|t|�v�fVqdSr)�rX�rvr��r6r*r,� <genexpr>Ir.z#Context.__init__.<locals>.<genexpr>r'c3s|]}|t|�v�fVqdSr)r�r��r7r*r,r�Pr.)r� NameErrorrGrFr@rHr�r��_ignored_flagsr6rNrfr�r5�fromkeysr7)r1rGrFr@rHr�r�r7r6r�Zdcr*)r7r6r,r�0s. zContext.__init__cCs�t|t�std|��|dkr<||kr�td||||f��nJ|dkrb||kr�td||||f��n$||ksr||kr�td||||f��t�|||�S)Nz%s must be an integer�-infz%s must be in [%s, %d]. got: %sr�z%s must be in [%d, %s]. got: %sz%s must be in [%d, %d]. got %s)rfrXryrsrd�__setattr__)r1�namer{ZvminZvmaxr*r*r,�_set_integer_checkTs zContext._set_integer_checkcCs`t|t�std|��|D]}|tvrtd|��qtD]}||vr8td|��q8t�|||�S)Nz%s must be a signal dictz%s is not a valid signal dict)rfr�ryr5�KeyErrorrdr�)r1r�r��keyr*r*r,�_set_signal_dictbs zContext._set_signal_dictcCs�|dkr|�||dd�S|dkr0|�||dd�S|dkrH|�||dd�S|dkr`|�||dd�S|d krx|�||dd�S|d kr�|tvr�td|��t�|||�S|dks�|d kr�|�||�S|dkr�t�|||�Std|��dS)NrGr/r�r@r�r'rHr�r�rFz%s: invalid rounding moder7r6r�z.'decimal.Context' object has no attribute '%s')r��_rounding_modesryrdr�r��AttributeError)r1r�r{r*r*r,r�ms*�zContext.__setattr__cCstd|��dS)Nz%s cannot be deleted)r�)r1r�r*r*r,�__delattr__�szContext.__delattr__c CsNdd�|j��D�}dd�|j��D�}|j|j|j|j|j|j|j ||ffS)NcSsg|]\}}|r|�qSr*r*�rvZsigr�r*r*r,rx�r.z&Context.__reduce__.<locals>.<listcomp>cSsg|]\}}|r|�qSr*r*r�r*r*r,rx�r.) r7�itemsr6r�rGrFr@rHr�r�)r1r7r6r*r*r,r��s��zContext.__reduce__cCs|g}|�dt|��dd�|j��D�}|�dd�|�d�dd�|j��D�}|�dd�|�d�d�|�d S) zShow the current context.zrContext(prec=%(prec)d, rounding=%(rounding)s, Emin=%(Emin)d, Emax=%(Emax)d, capitals=%(capitals)d, clamp=%(clamp)dcSsg|]\}}|r|j�qSr*�r5)rvr�r�r*r*r,rx�r.z$Context.__repr__.<locals>.<listcomp>zflags=[z, �]cSsg|]\}}|r|j�qSr*r�)rvr�r�r*r*r,rx�r.ztraps=[�))rt�varsr7r�rur6)r1r��namesr*r*r,r��s�zContext.__repr__cCs|jD]}d|j|<qdS)zReset all flags to zeror'Nr��r1�flagr*r*r,rO�s zContext.clear_flagscCs|jD]}d|j|<qdS)zReset all traps to zeror'Nr�r�r*r*r,�clear_traps�s zContext.clear_trapsc Cs.t|j|j|j|j|j|j|j|j|j � }|S)z!Returns a shallow copy from self.) rrGrFr@rHr�r�r7r6r��r1Zncr*r*r,rG�s �zContext._shallow_copyc Cs6t|j|j|j|j|j|j|j��|j ��|j � }|S)zReturns a deep copy from self.)rrGrFr@rHr�r�r7rNr6r�r�r*r*r,rN�s�zContext.copycGs^t�||�}||jvr*|�j|g|�R�Sd|j|<|j|sR|�j|g|�R�S||��dS)a#Handles an error If the flag is in _ignored_flags, returns the default response. Otherwise, it sets the flag, then, if the corresponding trap_enabler is set, it reraises the exception. Otherwise, it returns the default value after setting the flag. r/N)�_condition_maprJr�r3r7r6)r1Z conditionZexplanationr+�errorr*r*r,rk�s zContext._raise_errorcCs |jt�S)z$Ignore all flags, if they are raised)� _ignore_flagsr5r�r*r*r,r��szContext._ignore_all_flagscGs|jt|�|_t|�S)z$Ignore the flags, if they are raised)r�rq)r1r7r*r*r,r��szContext._ignore_flagscGs8|rt|dttf�r|d}|D]}|j�|�q"dS)z+Stop ignoring the flags, if they are raisedr'N)rfrrrqr��remove)r1r7r�r*r*r,� _regard_flags�szContext._regard_flagscCst|j|jd�S)z!Returns Etiny (= Emin - prec + 1)r/)rXr@rGr�r*r*r,r��sz Context.EtinycCst|j|jd�S)z,Returns maximum exponent (= Emax - prec + 1)r/)rXrHrGr�r*r*r,r��szContext.EtopcCs|j}||_|S)a�Sets the rounding type. Sets the rounding type, and returns the current (previous) rounding type. Often used like: context = context.copy() # so you don't change the calling context # if an error occurs in the middle. rounding = context._set_rounding(ROUND_UP) val = self.__sub__(other, context=context) context._set_rounding(rounding) This will make it round up for that operation. )rF)r1r�rFr*r*r,rH�szContext._set_roundingrTcCsjt|t�r*||��ksd|vr*|�td�St||d�}|��r`t|j�|j |j kr`|�td�S|�|�S)z�Creates a new Decimal instance but using self as context. This method implements the to-number operation of the IBM Decimal specification.rUzAtrailing or leading whitespace and underscores are not permitted.rMzdiagnostic info too long in NaN)rfrgrirkrrr�rmr=rGr�r�)r1rdr�r*r*r,�create_decimal�s��zContext.create_decimalcCst�|�}|�|�S)a�Creates a new Decimal instance from a float but rounding using self as the context. >>> context = Context(prec=5, rounding=ROUND_DOWN) >>> context.create_decimal_from_float(3.1415926535897932) Decimal('3.1415') >>> context = Context(prec=5, traps=[Inexact]) >>> context.create_decimal_from_float(3.1415926535897932) Traceback (most recent call last): ... decimal.Inexact: None )rrxr�)r1r�r�r*r*r,�create_decimal_from_floats z!Context.create_decimal_from_floatcCst|dd�}|j|d�S)a[Returns the absolute value of the operand. If the operand is negative, the result is the same as using the minus operation on the operand. Otherwise, the result is the same as using the plus operation on the operand. >>> ExtendedContext.abs(Decimal('2.1')) Decimal('2.1') >>> ExtendedContext.abs(Decimal('-100')) Decimal('100') >>> ExtendedContext.abs(Decimal('101.5')) Decimal('101.5') >>> ExtendedContext.abs(Decimal('-101.5')) Decimal('101.5') >>> ExtendedContext.abs(-1) Decimal('1') Tr�rM)r�r��r1r0r*r*r,ro!szContext.abscCs8t|dd�}|j||d�}|tur0td|��n|SdS)a�Return the sum of the two operands. >>> ExtendedContext.add(Decimal('12'), Decimal('7.00')) Decimal('19.00') >>> ExtendedContext.add(Decimal('1E+2'), Decimal('1.01E+4')) Decimal('1.02E+4') >>> ExtendedContext.add(1, Decimal(2)) Decimal('3') >>> ExtendedContext.add(Decimal(8), 5) Decimal('13') >>> ExtendedContext.add(5, 5) Decimal('10') Tr�rM�Unable to convert %s to DecimalN)r�r�r�ry�r1r0rwr�r*r*r,�add6s zContext.addcCst|�|��Sr))rgr�r�r*r*r,�_applyKszContext._applycCst|t�std��|��S)z�Returns the same Decimal object. As we do not have different encodings for the same number, the received object already is in its canonical form. >>> ExtendedContext.canonical(Decimal('2.50')) Decimal('2.50') z,canonical requires a Decimal as an argument.)rfrryrQr�r*r*r,rQNs zContext.canonicalcCst|dd�}|j||d�S)a�Compares values numerically. If the signs of the operands differ, a value representing each operand ('-1' if the operand is less than zero, '0' if the operand is zero or negative zero, or '1' if the operand is greater than zero) is used in place of that operand for the comparison instead of the actual operand. The comparison is then effected by subtracting the second operand from the first and then returning a value according to the result of the subtraction: '-1' if the result is less than zero, '0' if the result is zero or negative zero, or '1' if the result is greater than zero. >>> ExtendedContext.compare(Decimal('2.1'), Decimal('3')) Decimal('-1') >>> ExtendedContext.compare(Decimal('2.1'), Decimal('2.1')) Decimal('0') >>> ExtendedContext.compare(Decimal('2.1'), Decimal('2.10')) Decimal('0') >>> ExtendedContext.compare(Decimal('3'), Decimal('2.1')) Decimal('1') >>> ExtendedContext.compare(Decimal('2.1'), Decimal('-3')) Decimal('1') >>> ExtendedContext.compare(Decimal('-3'), Decimal('2.1')) Decimal('-1') >>> ExtendedContext.compare(1, 2) Decimal('-1') >>> ExtendedContext.compare(Decimal(1), 2) Decimal('-1') >>> ExtendedContext.compare(1, Decimal(2)) Decimal('-1') Tr�rM)r�r��r1r0rwr*r*r,r�[s!zContext.comparecCst|dd�}|j||d�S)aCompares the values of the two operands numerically. It's pretty much like compare(), but all NaNs signal, with signaling NaNs taking precedence over quiet NaNs. >>> c = ExtendedContext >>> c.compare_signal(Decimal('2.1'), Decimal('3')) Decimal('-1') >>> c.compare_signal(Decimal('2.1'), Decimal('2.1')) Decimal('0') >>> c.flags[InvalidOperation] = 0 >>> print(c.flags[InvalidOperation]) 0 >>> c.compare_signal(Decimal('NaN'), Decimal('2.1')) Decimal('NaN') >>> print(c.flags[InvalidOperation]) 1 >>> c.flags[InvalidOperation] = 0 >>> print(c.flags[InvalidOperation]) 0 >>> c.compare_signal(Decimal('sNaN'), Decimal('2.1')) Decimal('NaN') >>> print(c.flags[InvalidOperation]) 1 >>> c.compare_signal(-1, 2) Decimal('-1') >>> c.compare_signal(Decimal(-1), 2) Decimal('-1') >>> c.compare_signal(-1, Decimal(2)) Decimal('-1') Tr�rM)r�rRr�r*r*r,rRs zContext.compare_signalcCst|dd�}|�|�S)a+Compares two operands using their abstract representation. This is not like the standard compare, which use their numerical value. Note that a total ordering is defined for all possible abstract representations. >>> ExtendedContext.compare_total(Decimal('12.73'), Decimal('127.9')) Decimal('-1') >>> ExtendedContext.compare_total(Decimal('-127'), Decimal('12')) Decimal('-1') >>> ExtendedContext.compare_total(Decimal('12.30'), Decimal('12.3')) Decimal('-1') >>> ExtendedContext.compare_total(Decimal('12.30'), Decimal('12.30')) Decimal('0') >>> ExtendedContext.compare_total(Decimal('12.3'), Decimal('12.300')) Decimal('1') >>> ExtendedContext.compare_total(Decimal('12.3'), Decimal('NaN')) Decimal('-1') >>> ExtendedContext.compare_total(1, 2) Decimal('-1') >>> ExtendedContext.compare_total(Decimal(1), 2) Decimal('-1') >>> ExtendedContext.compare_total(1, Decimal(2)) Decimal('-1') Tr�)r�rNr�r*r*r,rN�szContext.compare_totalcCst|dd�}|�|�S)z�Compares two operands using their abstract representation ignoring sign. Like compare_total, but with operand's sign ignored and assumed to be 0. Tr�)r�rVr�r*r*r,rV�szContext.compare_total_magcCst|dd�}|��S)aReturns a copy of the operand with the sign set to 0. >>> ExtendedContext.copy_abs(Decimal('2.1')) Decimal('2.1') >>> ExtendedContext.copy_abs(Decimal('-100')) Decimal('100') >>> ExtendedContext.copy_abs(-1) Decimal('1') Tr�)r�r�r�r*r*r,r��s zContext.copy_abscCst|dd�}t|�S)aReturns a copy of the decimal object. >>> ExtendedContext.copy_decimal(Decimal('2.1')) Decimal('2.1') >>> ExtendedContext.copy_decimal(Decimal('-1.00')) Decimal('-1.00') >>> ExtendedContext.copy_decimal(1) Decimal('1') Tr�)r�rr�r*r*r,�copy_decimal�s zContext.copy_decimalcCst|dd�}|��S)a(Returns a copy of the operand with the sign inverted. >>> ExtendedContext.copy_negate(Decimal('101.5')) Decimal('-101.5') >>> ExtendedContext.copy_negate(Decimal('-101.5')) Decimal('101.5') >>> ExtendedContext.copy_negate(1) Decimal('-1') Tr�)r�r�r�r*r*r,r��s zContext.copy_negatecCst|dd�}|�|�S)aCopies the second operand's sign to the first one. In detail, it returns a copy of the first operand with the sign equal to the sign of the second operand. >>> ExtendedContext.copy_sign(Decimal( '1.50'), Decimal('7.33')) Decimal('1.50') >>> ExtendedContext.copy_sign(Decimal('-1.50'), Decimal('7.33')) Decimal('1.50') >>> ExtendedContext.copy_sign(Decimal( '1.50'), Decimal('-7.33')) Decimal('-1.50') >>> ExtendedContext.copy_sign(Decimal('-1.50'), Decimal('-7.33')) Decimal('-1.50') >>> ExtendedContext.copy_sign(1, -2) Decimal('-1') >>> ExtendedContext.copy_sign(Decimal(1), -2) Decimal('-1') >>> ExtendedContext.copy_sign(1, Decimal(-2)) Decimal('-1') Tr�)r�rWr�r*r*r,rW�szContext.copy_signcCs8t|dd�}|j||d�}|tur0td|��n|SdS)a�Decimal division in a specified context. >>> ExtendedContext.divide(Decimal('1'), Decimal('3')) Decimal('0.333333333') >>> ExtendedContext.divide(Decimal('2'), Decimal('3')) Decimal('0.666666667') >>> ExtendedContext.divide(Decimal('5'), Decimal('2')) Decimal('2.5') >>> ExtendedContext.divide(Decimal('1'), Decimal('10')) Decimal('0.1') >>> ExtendedContext.divide(Decimal('12'), Decimal('12')) Decimal('1') >>> ExtendedContext.divide(Decimal('8.00'), Decimal('2')) Decimal('4.00') >>> ExtendedContext.divide(Decimal('2.400'), Decimal('2.0')) Decimal('1.20') >>> ExtendedContext.divide(Decimal('1000'), Decimal('100')) Decimal('10') >>> ExtendedContext.divide(Decimal('1000'), Decimal('1')) Decimal('1000') >>> ExtendedContext.divide(Decimal('2.40E+6'), Decimal('2')) Decimal('1.20E+6') >>> ExtendedContext.divide(5, 5) Decimal('1') >>> ExtendedContext.divide(Decimal(5), 5) Decimal('1') >>> ExtendedContext.divide(5, Decimal(5)) Decimal('1') Tr�rMr�N)r�r�r�ryr�r*r*r,�divides zContext.dividecCs8t|dd�}|j||d�}|tur0td|��n|SdS)a/Divides two numbers and returns the integer part of the result. >>> ExtendedContext.divide_int(Decimal('2'), Decimal('3')) Decimal('0') >>> ExtendedContext.divide_int(Decimal('10'), Decimal('3')) Decimal('3') >>> ExtendedContext.divide_int(Decimal('1'), Decimal('0.3')) Decimal('3') >>> ExtendedContext.divide_int(10, 3) Decimal('3') >>> ExtendedContext.divide_int(Decimal(10), 3) Decimal('3') >>> ExtendedContext.divide_int(10, Decimal(3)) Decimal('3') Tr�rMr�N)r�r�r�ryr�r*r*r,� divide_int+s zContext.divide_intcCs8t|dd�}|j||d�}|tur0td|��n|SdS)a�Return (a // b, a % b). >>> ExtendedContext.divmod(Decimal(8), Decimal(3)) (Decimal('2'), Decimal('2')) >>> ExtendedContext.divmod(Decimal(8), Decimal(4)) (Decimal('2'), Decimal('0')) >>> ExtendedContext.divmod(8, 4) (Decimal('2'), Decimal('0')) >>> ExtendedContext.divmod(Decimal(8), 4) (Decimal('2'), Decimal('0')) >>> ExtendedContext.divmod(8, Decimal(4)) (Decimal('2'), Decimal('0')) Tr�rMr�N)r�r�r�ryr�r*r*r,r�Bs zContext.divmodcCst|dd�}|j|d�S)a#Returns e ** a. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.exp(Decimal('-Infinity')) Decimal('0') >>> c.exp(Decimal('-1')) Decimal('0.367879441') >>> c.exp(Decimal('0')) Decimal('1') >>> c.exp(Decimal('1')) Decimal('2.71828183') >>> c.exp(Decimal('0.693147181')) Decimal('2.00000000') >>> c.exp(Decimal('+Infinity')) Decimal('Infinity') >>> c.exp(10) Decimal('22026.4658') Tr�rM)r�rYr�r*r*r,rYWszContext.expcCst|dd�}|j|||d�S)aReturns a multiplied by b, plus c. The first two operands are multiplied together, using multiply, the third operand is then added to the result of that multiplication, using add, all with only one final rounding. >>> ExtendedContext.fma(Decimal('3'), Decimal('5'), Decimal('7')) Decimal('22') >>> ExtendedContext.fma(Decimal('3'), Decimal('-5'), Decimal('7')) Decimal('-8') >>> ExtendedContext.fma(Decimal('888565290'), Decimal('1557.96930'), Decimal('-86087.7578')) Decimal('1.38435736E+12') >>> ExtendedContext.fma(1, 3, 4) Decimal('7') >>> ExtendedContext.fma(1, Decimal(3), 4) Decimal('7') >>> ExtendedContext.fma(1, 3, Decimal(4)) Decimal('7') Tr�rM)r�r)r1r0rwrJr*r*r,roszContext.fmacCst|t�std��|��S)aReturn True if the operand is canonical; otherwise return False. Currently, the encoding of a Decimal instance is always canonical, so this method returns True for any Decimal. >>> ExtendedContext.is_canonical(Decimal('2.50')) True z/is_canonical requires a Decimal as an argument.)rfrryrZr�r*r*r,rZ�s zContext.is_canonicalcCst|dd�}|��S)a,Return True if the operand is finite; otherwise return False. A Decimal instance is considered finite if it is neither infinite nor a NaN. >>> ExtendedContext.is_finite(Decimal('2.50')) True >>> ExtendedContext.is_finite(Decimal('-0.3')) True >>> ExtendedContext.is_finite(Decimal('0')) True >>> ExtendedContext.is_finite(Decimal('Inf')) False >>> ExtendedContext.is_finite(Decimal('NaN')) False >>> ExtendedContext.is_finite(1) True Tr�)r�r[r�r*r*r,r[�szContext.is_finitecCst|dd�}|��S)aUReturn True if the operand is infinite; otherwise return False. >>> ExtendedContext.is_infinite(Decimal('2.50')) False >>> ExtendedContext.is_infinite(Decimal('-Inf')) True >>> ExtendedContext.is_infinite(Decimal('NaN')) False >>> ExtendedContext.is_infinite(1) False Tr�)r�rAr�r*r*r,rA�szContext.is_infinitecCst|dd�}|��S)aOReturn True if the operand is a qNaN or sNaN; otherwise return False. >>> ExtendedContext.is_nan(Decimal('2.50')) False >>> ExtendedContext.is_nan(Decimal('NaN')) True >>> ExtendedContext.is_nan(Decimal('-sNaN')) True >>> ExtendedContext.is_nan(1) False Tr�)r�r�r�r*r*r,r��s zContext.is_nancCst|dd�}|j|d�S)a�Return True if the operand is a normal number; otherwise return False. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.is_normal(Decimal('2.50')) True >>> c.is_normal(Decimal('0.1E-999')) False >>> c.is_normal(Decimal('0.00')) False >>> c.is_normal(Decimal('-Inf')) False >>> c.is_normal(Decimal('NaN')) False >>> c.is_normal(1) True Tr�rM)r�r]r�r*r*r,r]�szContext.is_normalcCst|dd�}|��S)aHReturn True if the operand is a quiet NaN; otherwise return False. >>> ExtendedContext.is_qnan(Decimal('2.50')) False >>> ExtendedContext.is_qnan(Decimal('NaN')) True >>> ExtendedContext.is_qnan(Decimal('sNaN')) False >>> ExtendedContext.is_qnan(1) False Tr�)r�r�r�r*r*r,r��szContext.is_qnancCst|dd�}|��S)a�Return True if the operand is negative; otherwise return False. >>> ExtendedContext.is_signed(Decimal('2.50')) False >>> ExtendedContext.is_signed(Decimal('-12')) True >>> ExtendedContext.is_signed(Decimal('-0')) True >>> ExtendedContext.is_signed(8) False >>> ExtendedContext.is_signed(-8) True Tr�)r�r^r�r*r*r,r^�szContext.is_signedcCst|dd�}|��S)aTReturn True if the operand is a signaling NaN; otherwise return False. >>> ExtendedContext.is_snan(Decimal('2.50')) False >>> ExtendedContext.is_snan(Decimal('NaN')) False >>> ExtendedContext.is_snan(Decimal('sNaN')) True >>> ExtendedContext.is_snan(1) False Tr�)r�r�r�r*r*r,r��s zContext.is_snancCst|dd�}|j|d�S)a�Return True if the operand is subnormal; otherwise return False. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.is_subnormal(Decimal('2.50')) False >>> c.is_subnormal(Decimal('0.1E-999')) True >>> c.is_subnormal(Decimal('0.00')) False >>> c.is_subnormal(Decimal('-Inf')) False >>> c.is_subnormal(Decimal('NaN')) False >>> c.is_subnormal(1) False Tr�rM)r�r_r�r*r*r,r_szContext.is_subnormalcCst|dd�}|��S)auReturn True if the operand is a zero; otherwise return False. >>> ExtendedContext.is_zero(Decimal('0')) True >>> ExtendedContext.is_zero(Decimal('2.50')) False >>> ExtendedContext.is_zero(Decimal('-0E+2')) True >>> ExtendedContext.is_zero(1) False >>> ExtendedContext.is_zero(0) True Tr�)r�r`r�r*r*r,r`%szContext.is_zerocCst|dd�}|j|d�S)a�Returns the natural (base e) logarithm of the operand. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.ln(Decimal('0')) Decimal('-Infinity') >>> c.ln(Decimal('1.000')) Decimal('0') >>> c.ln(Decimal('2.71828183')) Decimal('1.00000000') >>> c.ln(Decimal('10')) Decimal('2.30258509') >>> c.ln(Decimal('+Infinity')) Decimal('Infinity') >>> c.ln(1) Decimal('0') Tr�rM)r�rjr�r*r*r,rj6sz Context.lncCst|dd�}|j|d�S)a�Returns the base 10 logarithm of the operand. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.log10(Decimal('0')) Decimal('-Infinity') >>> c.log10(Decimal('0.001')) Decimal('-3') >>> c.log10(Decimal('1.000')) Decimal('0') >>> c.log10(Decimal('2')) Decimal('0.301029996') >>> c.log10(Decimal('10')) Decimal('1') >>> c.log10(Decimal('70')) Decimal('1.84509804') >>> c.log10(Decimal('+Infinity')) Decimal('Infinity') >>> c.log10(0) Decimal('-Infinity') >>> c.log10(1) Decimal('0') Tr�rM)r�rmr�r*r*r,rmLsz Context.log10cCst|dd�}|j|d�S)a4 Returns the exponent of the magnitude of the operand's MSD. The result is the integer which is the exponent of the magnitude of the most significant digit of the operand (as though the operand were truncated to a single digit while maintaining the value of that digit and without limiting the resulting exponent). >>> ExtendedContext.logb(Decimal('250')) Decimal('2') >>> ExtendedContext.logb(Decimal('2.50')) Decimal('0') >>> ExtendedContext.logb(Decimal('0.03')) Decimal('-2') >>> ExtendedContext.logb(Decimal('0')) Decimal('-Infinity') >>> ExtendedContext.logb(1) Decimal('0') >>> ExtendedContext.logb(10) Decimal('1') >>> ExtendedContext.logb(100) Decimal('2') Tr�rM)r�rnr�r*r*r,rnhszContext.logbcCst|dd�}|j||d�S)a�Applies the logical operation 'and' between each operand's digits. The operands must be both logical numbers. >>> ExtendedContext.logical_and(Decimal('0'), Decimal('0')) Decimal('0') >>> ExtendedContext.logical_and(Decimal('0'), Decimal('1')) Decimal('0') >>> ExtendedContext.logical_and(Decimal('1'), Decimal('0')) Decimal('0') >>> ExtendedContext.logical_and(Decimal('1'), Decimal('1')) Decimal('1') >>> ExtendedContext.logical_and(Decimal('1100'), Decimal('1010')) Decimal('1000') >>> ExtendedContext.logical_and(Decimal('1111'), Decimal('10')) Decimal('10') >>> ExtendedContext.logical_and(110, 1101) Decimal('100') >>> ExtendedContext.logical_and(Decimal(110), 1101) Decimal('100') >>> ExtendedContext.logical_and(110, Decimal(1101)) Decimal('100') Tr�rM)r�r|r�r*r*r,r|�szContext.logical_andcCst|dd�}|j|d�S)aInvert all the digits in the operand. The operand must be a logical number. >>> ExtendedContext.logical_invert(Decimal('0')) Decimal('111111111') >>> ExtendedContext.logical_invert(Decimal('1')) Decimal('111111110') >>> ExtendedContext.logical_invert(Decimal('111111111')) Decimal('0') >>> ExtendedContext.logical_invert(Decimal('101010101')) Decimal('10101010') >>> ExtendedContext.logical_invert(1101) Decimal('111110010') Tr�rM)r�r~r�r*r*r,r~�szContext.logical_invertcCst|dd�}|j||d�S)a�Applies the logical operation 'or' between each operand's digits. The operands must be both logical numbers. >>> ExtendedContext.logical_or(Decimal('0'), Decimal('0')) Decimal('0') >>> ExtendedContext.logical_or(Decimal('0'), Decimal('1')) Decimal('1') >>> ExtendedContext.logical_or(Decimal('1'), Decimal('0')) Decimal('1') >>> ExtendedContext.logical_or(Decimal('1'), Decimal('1')) Decimal('1') >>> ExtendedContext.logical_or(Decimal('1100'), Decimal('1010')) Decimal('1110') >>> ExtendedContext.logical_or(Decimal('1110'), Decimal('10')) Decimal('1110') >>> ExtendedContext.logical_or(110, 1101) Decimal('1111') >>> ExtendedContext.logical_or(Decimal(110), 1101) Decimal('1111') >>> ExtendedContext.logical_or(110, Decimal(1101)) Decimal('1111') Tr�rM)r�rr�r*r*r,r�szContext.logical_orcCst|dd�}|j||d�S)a�Applies the logical operation 'xor' between each operand's digits. The operands must be both logical numbers. >>> ExtendedContext.logical_xor(Decimal('0'), Decimal('0')) Decimal('0') >>> ExtendedContext.logical_xor(Decimal('0'), Decimal('1')) Decimal('1') >>> ExtendedContext.logical_xor(Decimal('1'), Decimal('0')) Decimal('1') >>> ExtendedContext.logical_xor(Decimal('1'), Decimal('1')) Decimal('0') >>> ExtendedContext.logical_xor(Decimal('1100'), Decimal('1010')) Decimal('110') >>> ExtendedContext.logical_xor(Decimal('1111'), Decimal('10')) Decimal('1101') >>> ExtendedContext.logical_xor(110, 1101) Decimal('1011') >>> ExtendedContext.logical_xor(Decimal(110), 1101) Decimal('1011') >>> ExtendedContext.logical_xor(110, Decimal(1101)) Decimal('1011') Tr�rM)r�r}r�r*r*r,r}�szContext.logical_xorcCst|dd�}|j||d�S)a�max compares two values numerically and returns the maximum. If either operand is a NaN then the general rules apply. Otherwise, the operands are compared as though by the compare operation. If they are numerically equal then the left-hand operand is chosen as the result. Otherwise the maximum (closer to positive infinity) of the two operands is chosen as the result. >>> ExtendedContext.max(Decimal('3'), Decimal('2')) Decimal('3') >>> ExtendedContext.max(Decimal('-10'), Decimal('3')) Decimal('3') >>> ExtendedContext.max(Decimal('1.0'), Decimal('1')) Decimal('1') >>> ExtendedContext.max(Decimal('7'), Decimal('NaN')) Decimal('7') >>> ExtendedContext.max(1, 2) Decimal('2') >>> ExtendedContext.max(Decimal(1), 2) Decimal('2') >>> ExtendedContext.max(1, Decimal(2)) Decimal('2') Tr�rM)r�r�r�r*r*r,r��szContext.maxcCst|dd�}|j||d�S)a�Compares the values numerically with their sign ignored. >>> ExtendedContext.max_mag(Decimal('7'), Decimal('NaN')) Decimal('7') >>> ExtendedContext.max_mag(Decimal('7'), Decimal('-10')) Decimal('-10') >>> ExtendedContext.max_mag(1, -2) Decimal('-2') >>> ExtendedContext.max_mag(Decimal(1), -2) Decimal('-2') >>> ExtendedContext.max_mag(1, Decimal(-2)) Decimal('-2') Tr�rM)r�r�r�r*r*r,r�szContext.max_magcCst|dd�}|j||d�S)a�min compares two values numerically and returns the minimum. If either operand is a NaN then the general rules apply. Otherwise, the operands are compared as though by the compare operation. If they are numerically equal then the left-hand operand is chosen as the result. Otherwise the minimum (closer to negative infinity) of the two operands is chosen as the result. >>> ExtendedContext.min(Decimal('3'), Decimal('2')) Decimal('2') >>> ExtendedContext.min(Decimal('-10'), Decimal('3')) Decimal('-10') >>> ExtendedContext.min(Decimal('1.0'), Decimal('1')) Decimal('1.0') >>> ExtendedContext.min(Decimal('7'), Decimal('NaN')) Decimal('7') >>> ExtendedContext.min(1, 2) Decimal('1') >>> ExtendedContext.min(Decimal(1), 2) Decimal('1') >>> ExtendedContext.min(1, Decimal(29)) Decimal('1') Tr�rM)r�r�r�r*r*r,r�szContext.mincCst|dd�}|j||d�S)a�Compares the values numerically with their sign ignored. >>> ExtendedContext.min_mag(Decimal('3'), Decimal('-2')) Decimal('-2') >>> ExtendedContext.min_mag(Decimal('-3'), Decimal('NaN')) Decimal('-3') >>> ExtendedContext.min_mag(1, -2) Decimal('1') >>> ExtendedContext.min_mag(Decimal(1), -2) Decimal('1') >>> ExtendedContext.min_mag(1, Decimal(-2)) Decimal('1') Tr�rM)r�r�r�r*r*r,r�-szContext.min_magcCst|dd�}|j|d�S)a�Minus corresponds to unary prefix minus in Python. The operation is evaluated using the same rules as subtract; the operation minus(a) is calculated as subtract('0', a) where the '0' has the same exponent as the operand. >>> ExtendedContext.minus(Decimal('1.3')) Decimal('-1.3') >>> ExtendedContext.minus(Decimal('-1.3')) Decimal('1.3') >>> ExtendedContext.minus(1) Decimal('-1') Tr�rM)r�r�r�r*r*r,�minus>sz Context.minuscCs8t|dd�}|j||d�}|tur0td|��n|SdS)a�multiply multiplies two operands. If either operand is a special value then the general rules apply. Otherwise, the operands are multiplied together ('long multiplication'), resulting in a number which may be as long as the sum of the lengths of the two operands. >>> ExtendedContext.multiply(Decimal('1.20'), Decimal('3')) Decimal('3.60') >>> ExtendedContext.multiply(Decimal('7'), Decimal('3')) Decimal('21') >>> ExtendedContext.multiply(Decimal('0.9'), Decimal('0.8')) Decimal('0.72') >>> ExtendedContext.multiply(Decimal('0.9'), Decimal('-0')) Decimal('-0.0') >>> ExtendedContext.multiply(Decimal('654321'), Decimal('654321')) Decimal('4.28135971E+11') >>> ExtendedContext.multiply(7, 7) Decimal('49') >>> ExtendedContext.multiply(Decimal(7), 7) Decimal('49') >>> ExtendedContext.multiply(7, Decimal(7)) Decimal('49') Tr�rMr�N)r�r�r�ryr�r*r*r,�multiplyOs zContext.multiplycCst|dd�}|j|d�S)a"Returns the largest representable number smaller than a. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> ExtendedContext.next_minus(Decimal('1')) Decimal('0.999999999') >>> c.next_minus(Decimal('1E-1007')) Decimal('0E-1007') >>> ExtendedContext.next_minus(Decimal('-1.00000003')) Decimal('-1.00000004') >>> c.next_minus(Decimal('Infinity')) Decimal('9.99999999E+999') >>> c.next_minus(1) Decimal('0.999999999') Tr�rM)r�r�r�r*r*r,r�oszContext.next_minuscCst|dd�}|j|d�S)aReturns the smallest representable number larger than a. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> ExtendedContext.next_plus(Decimal('1')) Decimal('1.00000001') >>> c.next_plus(Decimal('-1E-1007')) Decimal('-0E-1007') >>> ExtendedContext.next_plus(Decimal('-1.00000003')) Decimal('-1.00000002') >>> c.next_plus(Decimal('-Infinity')) Decimal('-9.99999999E+999') >>> c.next_plus(1) Decimal('1.00000001') Tr�rM)r�r�r�r*r*r,r��szContext.next_pluscCst|dd�}|j||d�S)a�Returns the number closest to a, in direction towards b. The result is the closest representable number from the first operand (but not the first operand) that is in the direction towards the second operand, unless the operands have the same value. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.next_toward(Decimal('1'), Decimal('2')) Decimal('1.00000001') >>> c.next_toward(Decimal('-1E-1007'), Decimal('1')) Decimal('-0E-1007') >>> c.next_toward(Decimal('-1.00000003'), Decimal('0')) Decimal('-1.00000002') >>> c.next_toward(Decimal('1'), Decimal('0')) Decimal('0.999999999') >>> c.next_toward(Decimal('1E-1007'), Decimal('-100')) Decimal('0E-1007') >>> c.next_toward(Decimal('-1.00000003'), Decimal('-10')) Decimal('-1.00000004') >>> c.next_toward(Decimal('0.00'), Decimal('-0.0000')) Decimal('-0.00') >>> c.next_toward(0, 1) Decimal('1E-1007') >>> c.next_toward(Decimal(0), 1) Decimal('1E-1007') >>> c.next_toward(0, Decimal(1)) Decimal('1E-1007') Tr�rM)r�r�r�r*r*r,r��s zContext.next_towardcCst|dd�}|j|d�S)a�normalize reduces an operand to its simplest form. Essentially a plus operation with all trailing zeros removed from the result. >>> ExtendedContext.normalize(Decimal('2.1')) Decimal('2.1') >>> ExtendedContext.normalize(Decimal('-2.0')) Decimal('-2') >>> ExtendedContext.normalize(Decimal('1.200')) Decimal('1.2') >>> ExtendedContext.normalize(Decimal('-120')) Decimal('-1.2E+2') >>> ExtendedContext.normalize(Decimal('120.00')) Decimal('1.2E+2') >>> ExtendedContext.normalize(Decimal('0.00')) Decimal('0') >>> ExtendedContext.normalize(6) Decimal('6') Tr�rM)r�r?r�r*r*r,r?�szContext.normalizecCst|dd�}|j|d�S)a�Returns an indication of the class of the operand. The class is one of the following strings: -sNaN -NaN -Infinity -Normal -Subnormal -Zero +Zero +Subnormal +Normal +Infinity >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.number_class(Decimal('Infinity')) '+Infinity' >>> c.number_class(Decimal('1E-10')) '+Normal' >>> c.number_class(Decimal('2.50')) '+Normal' >>> c.number_class(Decimal('0.1E-999')) '+Subnormal' >>> c.number_class(Decimal('0')) '+Zero' >>> c.number_class(Decimal('-0')) '-Zero' >>> c.number_class(Decimal('-0.1E-999')) '-Subnormal' >>> c.number_class(Decimal('-1E-10')) '-Normal' >>> c.number_class(Decimal('-2.50')) '-Normal' >>> c.number_class(Decimal('-Infinity')) '-Infinity' >>> c.number_class(Decimal('NaN')) 'NaN' >>> c.number_class(Decimal('-NaN')) 'NaN' >>> c.number_class(Decimal('sNaN')) 'sNaN' >>> c.number_class(123) '+Normal' Tr�rM)r�r�r�r*r*r,r��s/zContext.number_classcCst|dd�}|j|d�S)a�Plus corresponds to unary prefix plus in Python. The operation is evaluated using the same rules as add; the operation plus(a) is calculated as add('0', a) where the '0' has the same exponent as the operand. >>> ExtendedContext.plus(Decimal('1.3')) Decimal('1.3') >>> ExtendedContext.plus(Decimal('-1.3')) Decimal('-1.3') >>> ExtendedContext.plus(-1) Decimal('-1') Tr�rM)r�r�r�r*r*r,�plusszContext.pluscCs:t|dd�}|j|||d�}|tur2td|��n|SdS)aRaises a to the power of b, to modulo if given. With two arguments, compute a**b. If a is negative then b must be integral. The result will be inexact unless b is integral and the result is finite and can be expressed exactly in 'precision' digits. With three arguments, compute (a**b) % modulo. For the three argument form, the following restrictions on the arguments hold: - all three arguments must be integral - b must be nonnegative - at least one of a or b must be nonzero - modulo must be nonzero and have at most 'precision' digits The result of pow(a, b, modulo) is identical to the result that would be obtained by computing (a**b) % modulo with unbounded precision, but is computed more efficiently. It is always exact. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.power(Decimal('2'), Decimal('3')) Decimal('8') >>> c.power(Decimal('-2'), Decimal('3')) Decimal('-8') >>> c.power(Decimal('2'), Decimal('-3')) Decimal('0.125') >>> c.power(Decimal('1.7'), Decimal('8')) Decimal('69.7575744') >>> c.power(Decimal('10'), Decimal('0.301029996')) Decimal('2.00000000') >>> c.power(Decimal('Infinity'), Decimal('-1')) Decimal('0') >>> c.power(Decimal('Infinity'), Decimal('0')) Decimal('1') >>> c.power(Decimal('Infinity'), Decimal('1')) Decimal('Infinity') >>> c.power(Decimal('-Infinity'), Decimal('-1')) Decimal('-0') >>> c.power(Decimal('-Infinity'), Decimal('0')) Decimal('1') >>> c.power(Decimal('-Infinity'), Decimal('1')) Decimal('-Infinity') >>> c.power(Decimal('-Infinity'), Decimal('2')) Decimal('Infinity') >>> c.power(Decimal('0'), Decimal('0')) Decimal('NaN') >>> c.power(Decimal('3'), Decimal('7'), Decimal('16')) Decimal('11') >>> c.power(Decimal('-3'), Decimal('7'), Decimal('16')) Decimal('-11') >>> c.power(Decimal('-3'), Decimal('8'), Decimal('16')) Decimal('1') >>> c.power(Decimal('3'), Decimal('7'), Decimal('-16')) Decimal('11') >>> c.power(Decimal('23E12345'), Decimal('67E189'), Decimal('123456789')) Decimal('11729830') >>> c.power(Decimal('-0'), Decimal('17'), Decimal('1729')) Decimal('-0') >>> c.power(Decimal('-23'), Decimal('0'), Decimal('65537')) Decimal('1') >>> ExtendedContext.power(7, 7) Decimal('823543') >>> ExtendedContext.power(Decimal(7), 7) Decimal('823543') >>> ExtendedContext.power(7, Decimal(7), 2) Decimal('1') Tr�rMr�N)r�r;r�ry)r1r0rwrr�r*r*r,�powers Iz Context.powercCst|dd�}|j||d�S)a Returns a value equal to 'a' (rounded), having the exponent of 'b'. The coefficient of the result is derived from that of the left-hand operand. It may be rounded using the current rounding setting (if the exponent is being increased), multiplied by a positive power of ten (if the exponent is being decreased), or is unchanged (if the exponent is already equal to that of the right-hand operand). Unlike other operations, if the length of the coefficient after the quantize operation would be greater than precision then an Invalid operation condition is raised. This guarantees that, unless there is an error condition, the exponent of the result of a quantize is always equal to that of the right-hand operand. Also unlike other operations, quantize will never raise Underflow, even if the result is subnormal and inexact. >>> ExtendedContext.quantize(Decimal('2.17'), Decimal('0.001')) Decimal('2.170') >>> ExtendedContext.quantize(Decimal('2.17'), Decimal('0.01')) Decimal('2.17') >>> ExtendedContext.quantize(Decimal('2.17'), Decimal('0.1')) Decimal('2.2') >>> ExtendedContext.quantize(Decimal('2.17'), Decimal('1e+0')) Decimal('2') >>> ExtendedContext.quantize(Decimal('2.17'), Decimal('1e+1')) Decimal('0E+1') >>> ExtendedContext.quantize(Decimal('-Inf'), Decimal('Infinity')) Decimal('-Infinity') >>> ExtendedContext.quantize(Decimal('2'), Decimal('Infinity')) Decimal('NaN') >>> ExtendedContext.quantize(Decimal('-0.1'), Decimal('1')) Decimal('-0') >>> ExtendedContext.quantize(Decimal('-0'), Decimal('1e+5')) Decimal('-0E+5') >>> ExtendedContext.quantize(Decimal('+35236450.6'), Decimal('1e-2')) Decimal('NaN') >>> ExtendedContext.quantize(Decimal('-35236450.6'), Decimal('1e-2')) Decimal('NaN') >>> ExtendedContext.quantize(Decimal('217'), Decimal('1e-1')) Decimal('217.0') >>> ExtendedContext.quantize(Decimal('217'), Decimal('1e-0')) Decimal('217') >>> ExtendedContext.quantize(Decimal('217'), Decimal('1e+1')) Decimal('2.2E+2') >>> ExtendedContext.quantize(Decimal('217'), Decimal('1e+2')) Decimal('2E+2') >>> ExtendedContext.quantize(1, 2) Decimal('1') >>> ExtendedContext.quantize(Decimal(1), 2) Decimal('1') >>> ExtendedContext.quantize(1, Decimal(2)) Decimal('1') Tr�rM)r�rr�r*r*r,res7zContext.quantizecCstd�S)zkJust returns 10, as this is Decimal, :) >>> ExtendedContext.radix() Decimal('10') r�r�r�r*r*r,r��sz Context.radixcCs8t|dd�}|j||d�}|tur0td|��n|SdS)aReturns the remainder from integer division. The result is the residue of the dividend after the operation of calculating integer division as described for divide-integer, rounded to precision digits if necessary. The sign of the result, if non-zero, is the same as that of the original dividend. This operation will fail under the same conditions as integer division (that is, if integer division on the same two operands would fail, the remainder cannot be calculated). >>> ExtendedContext.remainder(Decimal('2.1'), Decimal('3')) Decimal('2.1') >>> ExtendedContext.remainder(Decimal('10'), Decimal('3')) Decimal('1') >>> ExtendedContext.remainder(Decimal('-10'), Decimal('3')) Decimal('-1') >>> ExtendedContext.remainder(Decimal('10.2'), Decimal('1')) Decimal('0.2') >>> ExtendedContext.remainder(Decimal('10'), Decimal('0.3')) Decimal('0.1') >>> ExtendedContext.remainder(Decimal('3.6'), Decimal('1.3')) Decimal('1.0') >>> ExtendedContext.remainder(22, 6) Decimal('4') >>> ExtendedContext.remainder(Decimal(22), 6) Decimal('4') >>> ExtendedContext.remainder(22, Decimal(6)) Decimal('4') Tr�rMr�N)r�r�r�ryr�r*r*r,r��s zContext.remaindercCst|dd�}|j||d�S)aGReturns to be "a - b * n", where n is the integer nearest the exact value of "x / b" (if two integers are equally near then the even one is chosen). If the result is equal to 0 then its sign will be the sign of a. This operation will fail under the same conditions as integer division (that is, if integer division on the same two operands would fail, the remainder cannot be calculated). >>> ExtendedContext.remainder_near(Decimal('2.1'), Decimal('3')) Decimal('-0.9') >>> ExtendedContext.remainder_near(Decimal('10'), Decimal('6')) Decimal('-2') >>> ExtendedContext.remainder_near(Decimal('10'), Decimal('3')) Decimal('1') >>> ExtendedContext.remainder_near(Decimal('-10'), Decimal('3')) Decimal('-1') >>> ExtendedContext.remainder_near(Decimal('10.2'), Decimal('1')) Decimal('0.2') >>> ExtendedContext.remainder_near(Decimal('10'), Decimal('0.3')) Decimal('0.1') >>> ExtendedContext.remainder_near(Decimal('3.6'), Decimal('1.3')) Decimal('-0.3') >>> ExtendedContext.remainder_near(3, 11) Decimal('3') >>> ExtendedContext.remainder_near(Decimal(3), 11) Decimal('3') >>> ExtendedContext.remainder_near(3, Decimal(11)) Decimal('3') Tr�rM)r�r�r�r*r*r,r��szContext.remainder_nearcCst|dd�}|j||d�S)aNReturns a rotated copy of a, b times. The coefficient of the result is a rotated copy of the digits in the coefficient of the first operand. The number of places of rotation is taken from the absolute value of the second operand, with the rotation being to the left if the second operand is positive or to the right otherwise. >>> ExtendedContext.rotate(Decimal('34'), Decimal('8')) Decimal('400000003') >>> ExtendedContext.rotate(Decimal('12'), Decimal('9')) Decimal('12') >>> ExtendedContext.rotate(Decimal('123456789'), Decimal('-2')) Decimal('891234567') >>> ExtendedContext.rotate(Decimal('123456789'), Decimal('0')) Decimal('123456789') >>> ExtendedContext.rotate(Decimal('123456789'), Decimal('+2')) Decimal('345678912') >>> ExtendedContext.rotate(1333333, 1) Decimal('13333330') >>> ExtendedContext.rotate(Decimal(1333333), 1) Decimal('13333330') >>> ExtendedContext.rotate(1333333, Decimal(1)) Decimal('13333330') Tr�rM)r�r�r�r*r*r,r��szContext.rotatecCst|dd�}|�|�S)a�Returns True if the two operands have the same exponent. The result is never affected by either the sign or the coefficient of either operand. >>> ExtendedContext.same_quantum(Decimal('2.17'), Decimal('0.001')) False >>> ExtendedContext.same_quantum(Decimal('2.17'), Decimal('0.01')) True >>> ExtendedContext.same_quantum(Decimal('2.17'), Decimal('1')) False >>> ExtendedContext.same_quantum(Decimal('Inf'), Decimal('-Inf')) True >>> ExtendedContext.same_quantum(10000, -1) True >>> ExtendedContext.same_quantum(Decimal(10000), -1) True >>> ExtendedContext.same_quantum(10000, Decimal(-1)) True Tr�)r�rBr�r*r*r,rBszContext.same_quantumcCst|dd�}|j||d�S)a3Returns the first operand after adding the second value its exp. >>> ExtendedContext.scaleb(Decimal('7.50'), Decimal('-2')) Decimal('0.0750') >>> ExtendedContext.scaleb(Decimal('7.50'), Decimal('0')) Decimal('7.50') >>> ExtendedContext.scaleb(Decimal('7.50'), Decimal('3')) Decimal('7.50E+3') >>> ExtendedContext.scaleb(1, 4) Decimal('1E+4') >>> ExtendedContext.scaleb(Decimal(1), 4) Decimal('1E+4') >>> ExtendedContext.scaleb(1, Decimal(4)) Decimal('1E+4') Tr�rM)r�r�r�r*r*r,r�$szContext.scalebcCst|dd�}|j||d�S)a{Returns a shifted copy of a, b times. The coefficient of the result is a shifted copy of the digits in the coefficient of the first operand. The number of places to shift is taken from the absolute value of the second operand, with the shift being to the left if the second operand is positive or to the right otherwise. Digits shifted into the coefficient are zeros. >>> ExtendedContext.shift(Decimal('34'), Decimal('8')) Decimal('400000000') >>> ExtendedContext.shift(Decimal('12'), Decimal('9')) Decimal('0') >>> ExtendedContext.shift(Decimal('123456789'), Decimal('-2')) Decimal('1234567') >>> ExtendedContext.shift(Decimal('123456789'), Decimal('0')) Decimal('123456789') >>> ExtendedContext.shift(Decimal('123456789'), Decimal('+2')) Decimal('345678900') >>> ExtendedContext.shift(88888888, 2) Decimal('888888800') >>> ExtendedContext.shift(Decimal(88888888), 2) Decimal('888888800') >>> ExtendedContext.shift(88888888, Decimal(2)) Decimal('888888800') Tr�rM)r�r�r�r*r*r,r�7sz Context.shiftcCst|dd�}|j|d�S)a�Square root of a non-negative number to context precision. If the result must be inexact, it is rounded using the round-half-even algorithm. >>> ExtendedContext.sqrt(Decimal('0')) Decimal('0') >>> ExtendedContext.sqrt(Decimal('-0')) Decimal('-0') >>> ExtendedContext.sqrt(Decimal('0.39')) Decimal('0.624499800') >>> ExtendedContext.sqrt(Decimal('100')) Decimal('10') >>> ExtendedContext.sqrt(Decimal('1')) Decimal('1') >>> ExtendedContext.sqrt(Decimal('1.0')) Decimal('1.0') >>> ExtendedContext.sqrt(Decimal('1.00')) Decimal('1.0') >>> ExtendedContext.sqrt(Decimal('7')) Decimal('2.64575131') >>> ExtendedContext.sqrt(Decimal('10')) Decimal('3.16227766') >>> ExtendedContext.sqrt(2) Decimal('1.41421356') >>> ExtendedContext.prec 9 Tr�rM)r�rLr�r*r*r,rLUszContext.sqrtcCs8t|dd�}|j||d�}|tur0td|��n|SdS)a&Return the difference between the two operands. >>> ExtendedContext.subtract(Decimal('1.3'), Decimal('1.07')) Decimal('0.23') >>> ExtendedContext.subtract(Decimal('1.3'), Decimal('1.30')) Decimal('0.00') >>> ExtendedContext.subtract(Decimal('1.3'), Decimal('2.07')) Decimal('-0.77') >>> ExtendedContext.subtract(8, 5) Decimal('3') >>> ExtendedContext.subtract(Decimal(8), 5) Decimal('3') >>> ExtendedContext.subtract(8, Decimal(5)) Decimal('3') Tr�rMr�N)r�r�r�ryr�r*r*r,�subtractus zContext.subtractcCst|dd�}|j|d�S)a�Convert to a string, using engineering notation if an exponent is needed. Engineering notation has an exponent which is a multiple of 3. This can leave up to 3 digits to the left of the decimal place and may require the addition of either one or two trailing zeros. The operation is not affected by the context. >>> ExtendedContext.to_eng_string(Decimal('123E+1')) '1.23E+3' >>> ExtendedContext.to_eng_string(Decimal('123E+3')) '123E+3' >>> ExtendedContext.to_eng_string(Decimal('123E-10')) '12.3E-9' >>> ExtendedContext.to_eng_string(Decimal('-123E-12')) '-123E-12' >>> ExtendedContext.to_eng_string(Decimal('7E-7')) '700E-9' >>> ExtendedContext.to_eng_string(Decimal('7E+1')) '70' >>> ExtendedContext.to_eng_string(Decimal('0E+1')) '0.00E+3' Tr�rM)r�r�r�r*r*r,r��szContext.to_eng_stringcCst|dd�}|j|d�S)zyConverts a number to a string, using scientific notation. The operation is not affected by the context. Tr�rM)r�r�r�r*r*r,� to_sci_string�szContext.to_sci_stringcCst|dd�}|j|d�S)akRounds to an integer. When the operand has a negative exponent, the result is the same as using the quantize() operation using the given operand as the left-hand-operand, 1E+0 as the right-hand-operand, and the precision of the operand as the precision setting; Inexact and Rounded flags are allowed in this operation. The rounding mode is taken from the context. >>> ExtendedContext.to_integral_exact(Decimal('2.1')) Decimal('2') >>> ExtendedContext.to_integral_exact(Decimal('100')) Decimal('100') >>> ExtendedContext.to_integral_exact(Decimal('100.0')) Decimal('100') >>> ExtendedContext.to_integral_exact(Decimal('101.5')) Decimal('102') >>> ExtendedContext.to_integral_exact(Decimal('-101.5')) Decimal('-102') >>> ExtendedContext.to_integral_exact(Decimal('10E+5')) Decimal('1.0E+6') >>> ExtendedContext.to_integral_exact(Decimal('7.89E+77')) Decimal('7.89E+77') >>> ExtendedContext.to_integral_exact(Decimal('-Inf')) Decimal('-Infinity') Tr�rM)r�rFr�r*r*r,rF�szContext.to_integral_exactcCst|dd�}|j|d�S)aLRounds to an integer. When the operand has a negative exponent, the result is the same as using the quantize() operation using the given operand as the left-hand-operand, 1E+0 as the right-hand-operand, and the precision of the operand as the precision setting, except that no flags will be set. The rounding mode is taken from the context. >>> ExtendedContext.to_integral_value(Decimal('2.1')) Decimal('2') >>> ExtendedContext.to_integral_value(Decimal('100')) Decimal('100') >>> ExtendedContext.to_integral_value(Decimal('100.0')) Decimal('100') >>> ExtendedContext.to_integral_value(Decimal('101.5')) Decimal('102') >>> ExtendedContext.to_integral_value(Decimal('-101.5')) Decimal('-102') >>> ExtendedContext.to_integral_value(Decimal('10E+5')) Decimal('1.0E+6') >>> ExtendedContext.to_integral_value(Decimal('7.89E+77')) Decimal('7.89E+77') >>> ExtendedContext.to_integral_value(Decimal('-Inf')) Decimal('-Infinity') Tr�rM)r�rr�r*r*r,r�szContext.to_integral_value) NNNNNNNNN)N)rT)N)Xr5r6r7r8r�r�r�r�r�r�r�rOr�rGrNr�rkr�r�r�r�r�r�rHr�r�ror�r�rQr�rRrNrVr�r�r�rWr�r�r�rYrrZr[rAr�r]r�r^r�r_r`rjrmrnr|r~rr}r�r�r�r�r�r�r�r�r�r?r�r�r�rr�r�r�r�rBr�r�rLr�r�r�rFrr�r*r*r*r,rs�� $ $# % #2 P:&" rc@s"eZdZdZddd�Zdd�ZdS)rp�rDrXrYNcCsf|durd|_d|_d|_nFt|t�rD|j|_t|j�|_|j|_n|d|_|d|_|d|_dS)Nr'r/r`)rDrXrYrfrr<r=rR)r1r{r*r*r,r��s z_WorkRep.__init__cCsd|j|j|jfS)Nz(%r, %r, %r)r�r�r*r*r,r�sz_WorkRep.__repr__)N)r5r6r7r�r�r�r*r*r*r,rp�s rpcCs�|j|jkr|}|}n|}|}tt|j��}tt|j��}|jtd||d�}||jd|krpd|_||_|jd|j|j9_|j|_||fS)zcNormalizes op1, op2 to have the same exp and length of coefficient. Done during addition. r�r`r/r�)rYrmrgrXr�)r�r�rG�tmpr�Ztmp_lenZ other_lenrYr*r*r,r�sr�cCsb|dkrdS|dkr |d|Stt|��}t|�t|�d��}||krPdS|d|SdS)a Given integers n and e, return n * 10**e if it's an integer, else None. The computation is designed to avoid computing large powers of 10 unnecessarily. >>> _decimal_lshift_exact(3, 4) 30000 >>> _decimal_lshift_exact(300, -999999999) # returns None r'r�rTN)rgrorm�rstrip)r:r�Zstr_nZval_nr*r*r,r&(sr&cCsB|dks|dkrtd��d}||kr>||||d?}}q|S)z�Closest integer to the square root of the positive integer n. a is an initial approximation to the square root. Any positive integer will do for a, but the closer a is to the square root of n the faster convergence will be. r'z3Both arguments to _sqrt_nearest should be positive.r/)rs)r:r0rwr*r*r,� _sqrt_nearest=sr�cCs2d|>||?}}|d||d@|d@|kS)z�Given an integer x and a nonnegative integer shift, return closest integer to x / 2**shift; use round-to-even in case of a tie. r/r`r*)r)r�rwr�r*r*r,�_rshift_nearestLsr�cCs&t||�\}}|d||d@|kS)zaClosest integer to a/b, a and b positive integers; rounds to even in the case of a tie. r`r/)r�)r0rwr�r�r*r*r,�_div_nearestTsr�r c Cs�||}d}||kr(t|�||>|ksD||krxt|�||?|krxt||d>|t||t||�|��}|d7}qtdtt|��d|�}t||�}t||�}t|ddd�D]}t||�t|||�}q�t|||�S)a�Integer approximation to M*log(x/M), with absolute error boundable in terms only of x/M. Given positive integers x and M, return an integer approximation to M * log(x/M). For L = 8 and 0.1 <= x/M <= 10 the difference between the approximation and the exact result is at most 22. For L = 8 and 1.0 <= x/M <= 10.0 the difference is at most 15. In both cases these are upper bounds on the error; it will usually be much smaller.r'r/��r^r�)ror�r�r�rXrmrgr) r)�M�Lr,�R�TZyshift�wr�r*r*r,�_ilog\s"�� r�c Cs�|d7}tt|��}||||dk}|dkr�d|}|||}|dkrZ|d|9}nt|d|�}t||�}t|�}t|||�}||} nd}t|d|�} t| |d�S)z�Given integers c, e and p with c > 0, p >= 0, compute an integer approximation to 10**p * log10(c*10**e), with an absolute error of at most 1. Assumes that c*10**e is not exactly 1.r`r/r'r�r$)rmrgr�r�� _log10_digits) rJr�r(rKr�r�r��log_dZlog_10Zlog_tenpowerr*r*r,rl�s rlc Cs�|d7}tt|��}||||dk}|dkrr|||}|dkrR|d|9}nt|d|�}t|d|�}nd}|r�ttt|��d}||dkr�t|t||�d|�}q�d}nd}t||d�S)z�Given integers c, e and p with c > 0, compute an integer approximation to 10**p * log(c*10**e), with an absolute error of at most 1. Assumes that c*10**e is not exactly 1.r`r/r'r�r$)rmrgr�r�ror�) rJr�r(rKr�r�r�r:Z f_log_tenr*r*r,rh�s"rhc@s eZdZdZdd�Zdd�ZdS)� _Log10Memoizez�Class to compute, store, and allow retrieval of, digits of the constant log(10) = 2.302585.... This constant is needed by Decimal.ln, Decimal.log10, Decimal.exp and Decimal.__pow__.cCs d|_dS)NZ/23025850929940456840179914546843642076011014886)rr�r*r*r,r��sz_Log10Memoize.__init__cCs�|dkrtd��|t|j�kr�d}d||d}tttd||�d��}||d�d|krbql|d7}q"|�d�dd �|_t|jd|d ��S)ztGiven an integer p >= 0, return floor(10**p)*log(10). For example, self.getdigits(3) returns 2302. r'zp should be nonnegativer^r�r`r$NrTr�r/)rsrmrrgr�r�r�rX)r1r(r:r�rr*r*r,� getdigits�s z_Log10Memoize.getdigitsN)r5r6r7r8r�r�r*r*r*r,r��sr�c Cs�t||>|�}tdtt|��d|�}t||�}||>}t|ddd�D]}t|||||�}qPt|ddd�D]"}||d>}t||||�}q|||S)z�Given integers x and M, M > 0, such that x/M is small in absolute value, compute an integer approximation to M*exp(x/M). For 0 <= x/M <= 2.4, the absolute error in the result is bounded by 60 (and is usually much smaller).r�r^r/r'r�r`)r%rXrmrgr�r) r)r�r�r�r�r,ZMshiftrr�r*r*r,�_iexp�s r�c Cs�|d7}td|tt|��d�}||}||}|dkrH|d|}n|d|}t|t|��\}}t|d|�}tt|d|�d�||dfS)a�Compute an approximation to exp(c*10**e), with p decimal places of precision. Returns integers d, f such that: 10**(p-1) <= d <= 10**p, and (d-1)*10**f < exp(c*10**e) < (d+1)*10**f In other words, d*10**f is an approximation to exp(c*10**e) with p digits of precision, and with an error in d of at most 1. This is almost, but not quite, the same as the error being < 1ulp: when d = 10**(p-1) the error could be up to 10 ulp.r`r'r/r�i�r^)r�rmrgr�r�r�r�) rJr�r(r:r�r�ZcshiftZquotr/r*r*r,rX$srXcCs�ttt|��|}t||||d�}||}|dkrJ||d|}nt||d|�}|dkr�tt|��|dk|dkkr�d|ddd|} } q�d|d|} } n,t||d|d�\} } t| d�} | d7} | | fS)a5Given integers xc, xe, yc and ye representing Decimals x = xc*10**xe and y = yc*10**ye, compute x**y. Returns a pair of integers (c, e) such that: 10**(p-1) <= c <= 10**p, and (c-1)*10**e < x**y < (c+1)*10**e in other words, c*10**e is an approximation to x**y with p digits of precision, and with an error in c of at most 1. (This is almost, but not quite, the same as the error being < 1ulp: when c == 10**(p-1) we can only guarantee error < 10ulp.) We assume that: x is positive and not equal to 1, and y is nonzero. r/r'r�)rmrgrorhr�rX)r*r+r-r.r(rwZlxcr�Zpcr�rYr*r*r,r4Hs r4r$�F�5�(�ra�r�r�) r��2�3�4�5�6�7�8rEcCs0|dkrtd��t|�}dt|�||dS)z@Compute a lower bound for 100*log10(c) for a positive integer c.r'z0The argument to _log10_lb should be nonnegative.r$)rsrgrm)rJZ correctionZstr_cr*r*r,r'rsr'cCsLt|t�r|St|t�r t|�S|r8t|t�r8t�|�S|rHtd|��tS)z�Convert other to Decimal. Verifies that it's ok to use in an implicit construction. If allow_float is true, allow conversion from float; this is used in the comparison methods (__eq__ and friends). r�)rfrrXrwrxryr�)r�r�Zallow_floatr*r*r,r�}s r�cCs�t|t�r||fSt|tj�rR|jsDt|jtt|j �|j �|j�}|t|j�fS|rrt|tj �rr|jdkrr|j}t|t�r�t�}|r�d|jt<n|�td�|t�|�fSttfS)z�Given a Decimal instance self and a Python object other, return a pair (s, o) of Decimal instances such that "s op o" is equivalent to "self op other" for any of the 6 comparison operators "op". r'r/rc)rfr�_numbersZRationalrSr;r<rgrXr=�denominatorrR� numeratorZComplexr�r�rwrr7rrkrxr�)r1r�r�r2r*r*r,r��s( � �r�r#i?Bi��)rGrFr6r7rHr@r�r�ra)rGrFr6r7a� # A numeric string consists of: # \s* (?P<sign>[-+])? # an optional sign, followed by either... ( (?=\d|\.\d) # ...a number (with at least one digit) (?P<int>\d*) # having a (possibly empty) integer part (\.(?P<frac>\d*))? # followed by an optional fractional part (E(?P<exp>[-+]?\d+))? # followed by an optional exponent, or... | Inf(inity)? # ...an infinity, or... | (?P<signal>s)? # ...an (optionally signaling) NaN # NaN (?P<diag>\d*) # with (possibly empty) diagnostic info. ) # \s* \Z z0*$z50*$z�\A (?: (?P<fill>.)? (?P<align>[<>=^]) )? (?P<sign>[-+ ])? (?P<alt>\#)? (?P<zeropad>0)? (?P<minimumwidth>(?!0)\d+)? (?P<thousands_sep>,)? (?:\.(?P<precision>0|(?!0)\d+))? (?P<type>[eEfFgGn%])? \Z cCs�t�|�}|durtd|��|��}|d}|d}|ddu|d<|drv|durbtd|��|durvtd|��|p|d|d<|p�d |d<|d dur�d|d <t|dp�d �|d<|ddur�t|d�|d<|ddkr�|ddus�|ddvr�d|d<|ddk�rfd|d<|du�r&t��}|ddu�r@td|��|d|d<|d|d<|d|d<n*|ddu�r|d|d<ddg|d<d|d<|S)a�Parse and validate a format specifier. Turns a standard numeric format specifier into a dict, with the following entries: fill: fill character to pad field to minimum width align: alignment type, either '<', '>', '=' or '^' sign: either '+', '-' or ' ' minimumwidth: nonnegative integer giving minimum width zeropad: boolean, indicating whether to pad with zeros thousands_sep: string to use as thousands separator, or '' grouping: grouping for thousands separators, in format used by localeconv decimal_point: string to use for decimal point precision: nonnegative integer giving precision, or None type: one of the characters 'eEfFgG%', or None NzInvalid format specifier: �fill�align�zeropadz7Fill character conflicts with '0' in format specifier: z2Alignment conflicts with '0' in format specifier: � �>rDrW�minimumwidthrTr�r'r�ZgGnr/r:r�� thousands_sepzJExplicit thousands separator conflicts with 'n' type in format specifier: �grouping� decimal_pointrVr^r�)�_parse_format_specifier_regex�matchrs� groupdictrX�_locale� localeconv)�format_specr�r|Zformat_dictr rr*r*r,r�sT �� r�c Cs�|d}|d}||t|�t|�}|d}|dkrF|||}nj|dkr\|||}nT|dkrr|||}n>|dkr�t|�d}|d |�||||d �}ntd ��|S)z�Given an unpadded, non-aligned numeric string 'body' and sign string 'sign', add padding and alignment conforming to the given format specifier dictionary 'spec' (as produced by parse_format_specifier). rr r�<r�=�^r`NzUnrecognised alignment field)rmrs) rDr�r�rr Zpaddingrr�Zhalfr*r*r,r�ms"r�cCspddlm}m}|sgS|ddkrJt|�dkrJ||dd�||d��S|dtjkrd|dd�Std��dS)zyConvert a localeconv-style grouping into a (possibly infinite) iterable of integers representing group lengths. r')�chain�repeatr�r`Nr�z unrecognised format for grouping)� itertoolsrrrmr�CHAR_MAXrs)rrrr*r*r,�_group_lengths�s r cCs�|d}|d}g}t|�D]�}|dkr0td��ttt|�|d�|�}|�d|t|�||d��|d|�}||8}|s�|dkr�q�|t|�8}qtt|�|d�}|�d|t|�||d��|�t|��S)anInsert thousands separators into a digit string. spec is a dictionary whose keys should include 'thousands_sep' and 'grouping'; typically it's the result of parsing the format specifier using _parse_format_specifier. The min_width keyword argument gives the minimum length of the result, which will be padded on the left with zeros if necessary. If necessary, the zero padding adds an extra '0' on the left to avoid a leading thousands separator. For example, inserting commas every three digits in '123456', with min_width=8, gives '0,123,456', even though that has length 9. rrr'zgroup length should be positiver/rTN)r rsr�r�rmrtru�reversed)rr�� min_width�sepr�groupsrKr*r*r,�_insert_thousands_sep�s $$r%cCs$|rdS|ddvr|dSdSdS)zDetermine sign character.rWrDz +rVNr*)�is_negativer�r*r*r,r��s r�cCs�t||�}|s|dr"|d|}|dks6|ddvr\ddddd�|d}|d �||�7}|dd krp|d 7}|dr�|dt|�t|�}nd}t|||�}t||||�S) acFormat a number, given the following data: is_negative: true if the number is negative, else false intpart: string of digits that must appear before the decimal point fracpart: string of digits that must come after the point exp: exponent, as an integer spec: dictionary resulting from parsing the format specifier This function uses the information in spec to: insert separators (decimal separator and thousands separators) format the sign format the exponent add trailing '%' for the '%' type zero-pad if necessary fill and align if necessary Zaltrr'r�r�r�r�)r�r�r�r�z{0}{1:+}r�rr)r��formatrmr%r�)r&r}r~rYr�rDZecharr"r*r*r,r��s r�ZInfz-Infr�r�r`)N)F)r')r )r )FF)F)N)r/)zr8�__all__r5Z __xname__�__version__Z__libmpdec_version__Zmathr�Znumbersr�sys�collectionsr(Z_namedtupler�ImportErrorrrrrrrrrr$r%�maxsizer r!r"r#�ArithmeticErrorrrr r�ZeroDivisionErrorr rrrrrr rrryrr5r�r�ZcontextvarsZ ContextVarrIrrrrdrr;�Number�registerrPrrpr�rXr�r%r&r�r�r�r�rlrhr�r�r�r�rXr4r'r�r�rrr�re�compile�VERBOSE� IGNORECASErrhr�r�DOTALLrZlocalerr�r�r r%r�r�rgrfr?rTr2rSrB� hash_info�modulusr�r�r�r�r�r�r�r*r*r*r,�<module>sbc# & �� . ^ 0",# %$+ � *�� P % )

NAME	SIZE	LAST TOUCH	USER	CAN-I?
..	--	22 Jul 2025 8.33 AM	root / linksafe	0755

__future__.cpython-39.opt-1.pyc	4.042 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
__future__.cpython-39.opt-2.pyc	2.116 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
__future__.cpython-39.pyc	4.042 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
__phello__.foo.cpython-39.opt-1.pyc	0.139 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
__phello__.foo.cpython-39.opt-2.pyc	0.139 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
__phello__.foo.cpython-39.pyc	0.139 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_aix_support.cpython-39.opt-1.pyc	2.987 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_aix_support.cpython-39.opt-2.pyc	1.664 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_aix_support.cpython-39.pyc	2.987 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_bootlocale.cpython-39.opt-1.pyc	1.201 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_bootlocale.cpython-39.opt-2.pyc	0.981 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_bootlocale.cpython-39.pyc	1.211 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_bootsubprocess.cpython-39.opt-1.pyc	2.205 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_bootsubprocess.cpython-39.opt-2.pyc	1.981 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_bootsubprocess.cpython-39.pyc	2.205 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_collections_abc.cpython-39.opt-1.pyc	31 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_collections_abc.cpython-39.opt-2.pyc	25.639 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_collections_abc.cpython-39.pyc	31 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_compat_pickle.cpython-39.opt-1.pyc	5.32 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_compat_pickle.cpython-39.opt-2.pyc	5.32 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_compat_pickle.cpython-39.pyc	5.372 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_compression.cpython-39.opt-1.pyc	4.112 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_compression.cpython-39.opt-2.pyc	3.903 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_compression.cpython-39.pyc	4.112 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_markupbase.cpython-39.opt-1.pyc	7.46 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_markupbase.cpython-39.opt-2.pyc	7.091 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_markupbase.cpython-39.pyc	7.607 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_osx_support.cpython-39.opt-1.pyc	11.323 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_osx_support.cpython-39.opt-2.pyc	8.696 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_osx_support.cpython-39.pyc	11.323 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_py_abc.cpython-39.opt-1.pyc	4.538 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_py_abc.cpython-39.opt-2.pyc	3.354 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_py_abc.cpython-39.pyc	4.56 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_pydecimal.cpython-39.opt-1.pyc	156.861 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_pydecimal.cpython-39.opt-2.pyc	77.157 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_pydecimal.cpython-39.pyc	156.861 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_pyio.cpython-39.opt-1.pyc	72.637 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_pyio.cpython-39.opt-2.pyc	50.374 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_pyio.cpython-39.pyc	72.656 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_sitebuiltins.cpython-39.opt-1.pyc	3.432 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_sitebuiltins.cpython-39.opt-2.pyc	2.92 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_sitebuiltins.cpython-39.pyc	3.432 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_strptime.cpython-39.opt-1.pyc	15.652 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_strptime.cpython-39.opt-2.pyc	12.012 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_strptime.cpython-39.pyc	15.652 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_sysconfigdata__linux_x86_64-linux-gnu.cpython-39.opt-1.pyc	29.254 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_sysconfigdata__linux_x86_64-linux-gnu.cpython-39.opt-2.pyc	29.254 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_sysconfigdata__linux_x86_64-linux-gnu.cpython-39.pyc	29.254 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_sysconfigdata_d_linux_x86_64-linux-gnu.cpython-39.opt-1.pyc	29.102 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_sysconfigdata_d_linux_x86_64-linux-gnu.cpython-39.opt-2.pyc	29.102 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_sysconfigdata_d_linux_x86_64-linux-gnu.cpython-39.pyc	29.102 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_threading_local.cpython-39.opt-1.pyc	6.366 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_threading_local.cpython-39.opt-2.pyc	3.124 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_threading_local.cpython-39.pyc	6.366 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_weakrefset.cpython-39.opt-1.pyc	7.556 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_weakrefset.cpython-39.opt-2.pyc	7.556 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
_weakrefset.cpython-39.pyc	7.556 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
abc.cpython-39.opt-1.pyc	5.652 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
abc.cpython-39.opt-2.pyc	3.153 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
abc.cpython-39.pyc	5.652 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
aifc.cpython-39.opt-1.pyc	24.687 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
aifc.cpython-39.opt-2.pyc	19.602 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
aifc.cpython-39.pyc	24.687 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
antigravity.cpython-39.opt-1.pyc	0.813 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
antigravity.cpython-39.opt-2.pyc	0.672 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
antigravity.cpython-39.pyc	0.813 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
argparse.cpython-39.opt-1.pyc	62.066 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
argparse.cpython-39.opt-2.pyc	52.922 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
argparse.cpython-39.pyc	62.175 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
ast.cpython-39.opt-1.pyc	51.118 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
ast.cpython-39.opt-2.pyc	42.773 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
ast.cpython-39.pyc	51.168 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
asynchat.cpython-39.opt-1.pyc	6.675 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
asynchat.cpython-39.opt-2.pyc	5.332 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
asynchat.cpython-39.pyc	6.675 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
asyncore.cpython-39.opt-1.pyc	15.673 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
asyncore.cpython-39.opt-2.pyc	14.497 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
asyncore.cpython-39.pyc	15.673 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
base64.cpython-39.opt-1.pyc	15.953 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
base64.cpython-39.opt-2.pyc	10.563 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
base64.cpython-39.pyc	16.082 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
bdb.cpython-39.opt-1.pyc	23.978 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
bdb.cpython-39.opt-2.pyc	15.152 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
bdb.cpython-39.pyc	23.978 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
binhex.cpython-39.opt-1.pyc	12.674 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
binhex.cpython-39.opt-2.pyc	12.152 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
binhex.cpython-39.pyc	12.674 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
bisect.cpython-39.opt-1.pyc	2.308 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
bisect.cpython-39.opt-2.pyc	1.026 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
bisect.cpython-39.pyc	2.308 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
bz2.cpython-39.opt-1.pyc	11.287 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
bz2.cpython-39.opt-2.pyc	6.389 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
bz2.cpython-39.pyc	11.287 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
cProfile.cpython-39.opt-1.pyc	5.009 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
cProfile.cpython-39.opt-2.pyc	4.559 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
cProfile.cpython-39.pyc	5.009 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
calendar.cpython-39.opt-1.pyc	26.41 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
calendar.cpython-39.opt-2.pyc	21.926 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
calendar.cpython-39.pyc	26.41 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
cgi.cpython-39.opt-1.pyc	25.874 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
cgi.cpython-39.opt-2.pyc	17.646 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
cgi.cpython-39.pyc	25.874 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
cgitb.cpython-39.opt-1.pyc	9.96 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
cgitb.cpython-39.opt-2.pyc	8.398 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
cgitb.cpython-39.pyc	9.96 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
chunk.cpython-39.opt-1.pyc	4.74 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
chunk.cpython-39.opt-2.pyc	2.646 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
chunk.cpython-39.pyc	4.74 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
cmd.cpython-39.opt-1.pyc	12.392 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
cmd.cpython-39.opt-2.pyc	7.094 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
cmd.cpython-39.pyc	12.392 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
code.cpython-39.opt-1.pyc	9.696 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
code.cpython-39.opt-2.pyc	4.549 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
code.cpython-39.pyc	9.696 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
codecs.cpython-39.opt-1.pyc	33.106 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
codecs.cpython-39.opt-2.pyc	17.899 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
codecs.cpython-39.pyc	33.106 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
codeop.cpython-39.opt-1.pyc	6.319 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
codeop.cpython-39.opt-2.pyc	2.354 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
codeop.cpython-39.pyc	6.319 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
colorsys.cpython-39.opt-1.pyc	3.196 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
colorsys.cpython-39.opt-2.pyc	2.604 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
colorsys.cpython-39.pyc	3.196 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
compileall.cpython-39.opt-1.pyc	12.307 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
compileall.cpython-39.opt-2.pyc	9.124 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
compileall.cpython-39.pyc	12.307 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
configparser.cpython-39.opt-1.pyc	44.807 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
configparser.cpython-39.opt-2.pyc	30.021 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
configparser.cpython-39.pyc	44.807 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
contextlib.cpython-39.opt-1.pyc	19.083 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
contextlib.cpython-39.opt-2.pyc	13.629 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
contextlib.cpython-39.pyc	19.093 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
contextvars.cpython-39.opt-1.pyc	0.252 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
contextvars.cpython-39.opt-2.pyc	0.252 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
contextvars.cpython-39.pyc	0.252 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
copy.cpython-39.opt-1.pyc	6.813 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
copy.cpython-39.opt-2.pyc	4.563 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
copy.cpython-39.pyc	6.813 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
copyreg.cpython-39.opt-1.pyc	4.32 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
copyreg.cpython-39.opt-2.pyc	3.537 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
copyreg.cpython-39.pyc	4.339 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
crypt.cpython-39.opt-1.pyc	3.443 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
crypt.cpython-39.opt-2.pyc	2.797 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
crypt.cpython-39.pyc	3.443 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
csv.cpython-39.opt-1.pyc	11.584 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
csv.cpython-39.opt-2.pyc	9.591 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
csv.cpython-39.pyc	11.584 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
dataclasses.cpython-39.opt-1.pyc	22.686 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
dataclasses.cpython-39.opt-2.pyc	19.327 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
dataclasses.cpython-39.pyc	22.686 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
datetime.cpython-39.opt-1.pyc	55.651 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
datetime.cpython-39.opt-2.pyc	47.405 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
datetime.cpython-39.pyc	56.766 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
decimal.cpython-39.opt-1.pyc	0.363 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
decimal.cpython-39.opt-2.pyc	0.363 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
decimal.cpython-39.pyc	0.363 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
difflib.cpython-39.opt-1.pyc	57.198 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
difflib.cpython-39.opt-2.pyc	24.45 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
difflib.cpython-39.pyc	57.22 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
dis.cpython-39.opt-1.pyc	15.462 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
dis.cpython-39.opt-2.pyc	11.744 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
dis.cpython-39.pyc	15.462 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
doctest.cpython-39.opt-1.pyc	74.067 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
doctest.cpython-39.opt-2.pyc	39.589 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
doctest.cpython-39.pyc	74.27 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
enum.cpython-39.opt-1.pyc	25.423 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
enum.cpython-39.opt-2.pyc	20.616 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
enum.cpython-39.pyc	25.423 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
filecmp.cpython-39.opt-1.pyc	8.433 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
filecmp.cpython-39.opt-2.pyc	5.954 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
filecmp.cpython-39.pyc	8.433 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
fileinput.cpython-39.opt-1.pyc	13.479 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
fileinput.cpython-39.opt-2.pyc	8.003 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
fileinput.cpython-39.pyc	13.479 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
fnmatch.cpython-39.opt-1.pyc	3.792 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
fnmatch.cpython-39.opt-2.pyc	2.612 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
fnmatch.cpython-39.pyc	3.862 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
formatter.cpython-39.opt-1.pyc	17.141 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
formatter.cpython-39.opt-2.pyc	14.758 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
formatter.cpython-39.pyc	17.141 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
fractions.cpython-39.opt-1.pyc	17.639 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
fractions.cpython-39.opt-2.pyc	10.607 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
fractions.cpython-39.pyc	17.639 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
ftplib.cpython-39.opt-1.pyc	28.034 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
ftplib.cpython-39.opt-2.pyc	18.128 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
ftplib.cpython-39.pyc	28.034 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
functools.cpython-39.opt-1.pyc	28.063 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
functools.cpython-39.opt-2.pyc	21.499 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
functools.cpython-39.pyc	28.063 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
genericpath.cpython-39.opt-1.pyc	4.447 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
genericpath.cpython-39.opt-2.pyc	3.292 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
genericpath.cpython-39.pyc	4.447 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
getopt.cpython-39.opt-1.pyc	6.108 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
getopt.cpython-39.opt-2.pyc	3.614 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
getopt.cpython-39.pyc	6.126 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
getpass.cpython-39.opt-1.pyc	4.114 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
getpass.cpython-39.opt-2.pyc	2.956 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
getpass.cpython-39.pyc	4.114 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
gettext.cpython-39.opt-1.pyc	17.662 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
gettext.cpython-39.opt-2.pyc	16.987 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
gettext.cpython-39.pyc	17.662 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
glob.cpython-39.opt-1.pyc	4.412 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
glob.cpython-39.opt-2.pyc	3.572 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
glob.cpython-39.pyc	4.45 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
graphlib.cpython-39.opt-1.pyc	7.358 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
graphlib.cpython-39.opt-2.pyc	4.003 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
graphlib.cpython-39.pyc	7.403 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
gzip.cpython-39.opt-1.pyc	18.073 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
gzip.cpython-39.opt-2.pyc	14.297 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
gzip.cpython-39.pyc	18.073 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
hashlib.cpython-39.opt-1.pyc	6.547 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
hashlib.cpython-39.opt-2.pyc	5.992 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
hashlib.cpython-39.pyc	6.547 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
heapq.cpython-39.opt-1.pyc	13.724 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
heapq.cpython-39.opt-2.pyc	10.778 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
heapq.cpython-39.pyc	13.724 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
hmac.cpython-39.opt-1.pyc	6.653 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
hmac.cpython-39.opt-2.pyc	4.195 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
hmac.cpython-39.pyc	6.653 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
imaplib.cpython-39.opt-1.pyc	39.451 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
imaplib.cpython-39.opt-2.pyc	27.065 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
imaplib.cpython-39.pyc	41.581 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
imghdr.cpython-39.opt-1.pyc	4.056 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
imghdr.cpython-39.opt-2.pyc	3.748 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
imghdr.cpython-39.pyc	4.056 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
imp.cpython-39.opt-1.pyc	9.633 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
imp.cpython-39.opt-2.pyc	7.323 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
imp.cpython-39.pyc	9.633 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
inspect.cpython-39.opt-1.pyc	79.339 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
inspect.cpython-39.opt-2.pyc	54.8 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
inspect.cpython-39.pyc	79.575 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
io.cpython-39.opt-1.pyc	3.341 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
io.cpython-39.opt-2.pyc	1.887 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
io.cpython-39.pyc	3.341 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
ipaddress.cpython-39.opt-1.pyc	64.155 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
ipaddress.cpython-39.opt-2.pyc	38.784 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
ipaddress.cpython-39.pyc	64.155 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
keyword.cpython-39.opt-1.pyc	0.907 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
keyword.cpython-39.opt-2.pyc	0.513 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
keyword.cpython-39.pyc	0.907 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
linecache.cpython-39.opt-1.pyc	3.946 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
linecache.cpython-39.opt-2.pyc	2.742 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
linecache.cpython-39.pyc	3.946 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
locale.cpython-39.opt-1.pyc	33.896 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
locale.cpython-39.opt-2.pyc	29.386 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
locale.cpython-39.pyc	33.896 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
lzma.cpython-39.opt-1.pyc	11.823 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
lzma.cpython-39.opt-2.pyc	5.771 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
lzma.cpython-39.pyc	11.823 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
mailbox.cpython-39.opt-1.pyc	59.14 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
mailbox.cpython-39.opt-2.pyc	52.69 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
mailbox.cpython-39.pyc	59.192 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
mailcap.cpython-39.opt-1.pyc	7.082 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
mailcap.cpython-39.opt-2.pyc	5.549 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
mailcap.cpython-39.pyc	7.082 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
mimetypes.cpython-39.opt-1.pyc	15.652 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
mimetypes.cpython-39.opt-2.pyc	9.778 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
mimetypes.cpython-39.pyc	15.652 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
modulefinder.cpython-39.opt-1.pyc	15.718 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
modulefinder.cpython-39.opt-2.pyc	14.83 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
modulefinder.cpython-39.pyc	15.763 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
netrc.cpython-39.opt-1.pyc	3.707 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
netrc.cpython-39.opt-2.pyc	3.475 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
netrc.cpython-39.pyc	3.707 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
nntplib.cpython-39.opt-1.pyc	31.031 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
nntplib.cpython-39.opt-2.pyc	19.703 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
nntplib.cpython-39.pyc	31.031 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
ntpath.cpython-39.opt-1.pyc	14.478 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
ntpath.cpython-39.opt-2.pyc	12.475 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
ntpath.cpython-39.pyc	14.478 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
nturl2path.cpython-39.opt-1.pyc	1.718 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
nturl2path.cpython-39.opt-2.pyc	1.309 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
nturl2path.cpython-39.pyc	1.718 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
numbers.cpython-39.opt-1.pyc	12.043 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
numbers.cpython-39.opt-2.pyc	8.179 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
numbers.cpython-39.pyc	12.043 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
opcode.cpython-39.opt-1.pyc	5.113 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
opcode.cpython-39.opt-2.pyc	4.976 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
opcode.cpython-39.pyc	5.113 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
operator.cpython-39.opt-1.pyc	13.474 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
operator.cpython-39.opt-2.pyc	11.141 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
operator.cpython-39.pyc	13.474 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
optparse.cpython-39.opt-1.pyc	46.778 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
optparse.cpython-39.opt-2.pyc	34.752 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
optparse.cpython-39.pyc	46.832 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
os.cpython-39.opt-1.pyc	30.901 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
os.cpython-39.opt-2.pyc	18.997 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
os.cpython-39.pyc	30.917 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pathlib.cpython-39.opt-1.pyc	42.521 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pathlib.cpython-39.opt-2.pyc	33.868 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pathlib.cpython-39.pyc	42.521 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pdb.cpython-39.opt-1.pyc	46.445 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pdb.cpython-39.opt-2.pyc	32.704 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pdb.cpython-39.pyc	46.483 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pickle.cpython-39.opt-1.pyc	45.923 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pickle.cpython-39.opt-2.pyc	40.19 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pickle.cpython-39.pyc	46.007 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pickletools.cpython-39.opt-1.pyc	64.752 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pickletools.cpython-39.opt-2.pyc	55.872 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pickletools.cpython-39.pyc	65.547 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pipes.cpython-39.opt-1.pyc	7.625 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pipes.cpython-39.opt-2.pyc	4.825 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pipes.cpython-39.pyc	7.625 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pkgutil.cpython-39.opt-1.pyc	18.144 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pkgutil.cpython-39.opt-2.pyc	11.602 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pkgutil.cpython-39.pyc	18.144 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
platform.cpython-39.opt-1.pyc	25.81 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
platform.cpython-39.opt-2.pyc	17.931 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
platform.cpython-39.pyc	25.81 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
plistlib.cpython-39.opt-1.pyc	22.958 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
plistlib.cpython-39.opt-2.pyc	20.654 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
plistlib.cpython-39.pyc	23.008 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
poplib.cpython-39.opt-1.pyc	13.35 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
poplib.cpython-39.opt-2.pyc	8.535 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
poplib.cpython-39.pyc	13.35 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
posixpath.cpython-39.opt-1.pyc	10.373 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
posixpath.cpython-39.opt-2.pyc	8.698 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
posixpath.cpython-39.pyc	10.373 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pprint.cpython-39.opt-1.pyc	16.416 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pprint.cpython-39.opt-2.pyc	14.31 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pprint.cpython-39.pyc	16.448 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
profile.cpython-39.opt-1.pyc	13.902 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
profile.cpython-39.opt-2.pyc	10.994 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
profile.cpython-39.pyc	14.086 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pstats.cpython-39.opt-1.pyc	23.208 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pstats.cpython-39.opt-2.pyc	20.367 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pstats.cpython-39.pyc	23.208 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pty.cpython-39.opt-1.pyc	3.876 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pty.cpython-39.opt-2.pyc	3.051 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pty.cpython-39.pyc	3.876 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
py_compile.cpython-39.opt-1.pyc	7.235 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
py_compile.cpython-39.opt-2.pyc	3.585 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
py_compile.cpython-39.pyc	7.235 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pyclbr.cpython-39.opt-1.pyc	10.217 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pyclbr.cpython-39.opt-2.pyc	6.7 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pyclbr.cpython-39.pyc	10.217 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pydoc.cpython-39.opt-1.pyc	83.438 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pydoc.cpython-39.opt-2.pyc	73.788 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
pydoc.cpython-39.pyc	83.47 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
queue.cpython-39.opt-1.pyc	10.634 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
queue.cpython-39.opt-2.pyc	6.386 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
queue.cpython-39.pyc	10.634 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
quopri.cpython-39.opt-1.pyc	5.484 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
quopri.cpython-39.opt-2.pyc	4.473 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
quopri.cpython-39.pyc	5.625 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
random.cpython-39.opt-1.pyc	21.539 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
random.cpython-39.opt-2.pyc	14.267 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
random.cpython-39.pyc	21.539 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
re.cpython-39.opt-1.pyc	14.038 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
re.cpython-39.opt-2.pyc	5.896 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
re.cpython-39.pyc	14.038 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
reprlib.cpython-39.opt-1.pyc	5.195 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
reprlib.cpython-39.opt-2.pyc	5.043 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
reprlib.cpython-39.pyc	5.195 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
rlcompleter.cpython-39.opt-1.pyc	5.683 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
rlcompleter.cpython-39.opt-2.pyc	3.082 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
rlcompleter.cpython-39.pyc	5.683 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
runpy.cpython-39.opt-1.pyc	9.178 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
runpy.cpython-39.opt-2.pyc	6.793 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
runpy.cpython-39.pyc	9.178 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sched.cpython-39.opt-1.pyc	6.49 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sched.cpython-39.opt-2.pyc	3.533 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sched.cpython-39.pyc	6.49 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
secrets.cpython-39.opt-1.pyc	2.142 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
secrets.cpython-39.opt-2.pyc	1.108 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
secrets.cpython-39.pyc	2.142 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
selectors.cpython-39.opt-1.pyc	16.854 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
selectors.cpython-39.opt-2.pyc	12.841 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
selectors.cpython-39.pyc	16.854 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
shelve.cpython-39.opt-1.pyc	9.333 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
shelve.cpython-39.opt-2.pyc	5.279 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
shelve.cpython-39.pyc	9.333 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
shlex.cpython-39.opt-1.pyc	7.565 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
shlex.cpython-39.opt-2.pyc	7.021 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
shlex.cpython-39.pyc	7.565 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
shutil.cpython-39.opt-1.pyc	37.607 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
shutil.cpython-39.opt-2.pyc	25.822 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
shutil.cpython-39.pyc	37.607 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
signal.cpython-39.opt-1.pyc	2.948 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
signal.cpython-39.opt-2.pyc	2.729 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
signal.cpython-39.pyc	2.948 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
site.cpython-39.opt-1.pyc	16.624 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
site.cpython-39.opt-2.pyc	11.218 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
site.cpython-39.pyc	16.624 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
smtpd.cpython-39.opt-1.pyc	25.915 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
smtpd.cpython-39.opt-2.pyc	23.356 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
smtpd.cpython-39.pyc	25.915 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
smtplib.cpython-39.opt-1.pyc	35.057 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
smtplib.cpython-39.opt-2.pyc	19.078 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
smtplib.cpython-39.pyc	35.101 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sndhdr.cpython-39.opt-1.pyc	6.842 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sndhdr.cpython-39.opt-2.pyc	5.597 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sndhdr.cpython-39.pyc	6.842 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
socket.cpython-39.opt-1.pyc	28.31 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
socket.cpython-39.opt-2.pyc	19.971 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
socket.cpython-39.pyc	28.333 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
socketserver.cpython-39.opt-1.pyc	24.93 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
socketserver.cpython-39.opt-2.pyc	14.465 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
socketserver.cpython-39.pyc	24.93 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sre_compile.cpython-39.opt-1.pyc	14.621 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sre_compile.cpython-39.opt-2.pyc	14.217 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sre_compile.cpython-39.pyc	14.812 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sre_constants.cpython-39.opt-1.pyc	6.2 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sre_constants.cpython-39.opt-2.pyc	5.785 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sre_constants.cpython-39.pyc	6.2 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sre_parse.cpython-39.opt-1.pyc	21.274 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sre_parse.cpython-39.opt-2.pyc	21.228 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sre_parse.cpython-39.pyc	21.311 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
ssl.cpython-39.opt-1.pyc	44.014 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
ssl.cpython-39.opt-2.pyc	33.287 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
ssl.cpython-39.pyc	44.014 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
stat.cpython-39.opt-1.pyc	4.282 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
stat.cpython-39.opt-2.pyc	3.518 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
stat.cpython-39.pyc	4.282 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
statistics.cpython-39.opt-1.pyc	31.052 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
statistics.cpython-39.opt-2.pyc	15.551 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
statistics.cpython-39.pyc	31.241 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
string.cpython-39.opt-1.pyc	7.01 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
string.cpython-39.opt-2.pyc	5.93 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
string.cpython-39.pyc	7.01 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
stringprep.cpython-39.opt-1.pyc	9.726 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
stringprep.cpython-39.opt-2.pyc	9.513 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
stringprep.cpython-39.pyc	9.765 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
struct.cpython-39.opt-1.pyc	0.312 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
struct.cpython-39.opt-2.pyc	0.312 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
struct.cpython-39.pyc	0.312 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
subprocess.cpython-39.opt-1.pyc	43.284 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
subprocess.cpython-39.opt-2.pyc	31.528 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
subprocess.cpython-39.pyc	43.358 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sunau.cpython-39.opt-1.pyc	16.436 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sunau.cpython-39.opt-2.pyc	11.953 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sunau.cpython-39.pyc	16.436 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
symbol.cpython-39.opt-1.pyc	2.531 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
symbol.cpython-39.opt-2.pyc	2.457 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
symbol.cpython-39.pyc	2.531 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
symtable.cpython-39.opt-1.pyc	10.841 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
symtable.cpython-39.opt-2.pyc	10.129 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
symtable.cpython-39.pyc	10.917 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sysconfig.cpython-39.opt-1.pyc	15.703 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sysconfig.cpython-39.opt-2.pyc	13.381 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
sysconfig.cpython-39.pyc	15.703 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
tabnanny.cpython-39.opt-1.pyc	6.912 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
tabnanny.cpython-39.opt-2.pyc	6.001 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
tabnanny.cpython-39.pyc	6.912 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
tarfile.cpython-39.opt-1.pyc	71.115 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
tarfile.cpython-39.opt-2.pyc	56.215 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
tarfile.cpython-39.pyc	71.13 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
telnetlib.cpython-39.opt-1.pyc	17.914 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
telnetlib.cpython-39.opt-2.pyc	10.588 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
telnetlib.cpython-39.pyc	17.914 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
tempfile.cpython-39.opt-1.pyc	23.114 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
tempfile.cpython-39.opt-2.pyc	16.741 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
tempfile.cpython-39.pyc	23.114 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
textwrap.cpython-39.opt-1.pyc	13.16 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
textwrap.cpython-39.opt-2.pyc	6.12 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
textwrap.cpython-39.pyc	13.217 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
this.cpython-39.opt-1.pyc	1.242 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
this.cpython-39.opt-2.pyc	1.242 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
this.cpython-39.pyc	1.242 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
threading.cpython-39.opt-1.pyc	40.751 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
threading.cpython-39.opt-2.pyc	23.967 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
threading.cpython-39.pyc	41.205 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
timeit.cpython-39.opt-1.pyc	11.493 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
timeit.cpython-39.opt-2.pyc	5.776 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
timeit.cpython-39.pyc	11.493 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
token.cpython-39.opt-1.pyc	2.45 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
token.cpython-39.opt-2.pyc	2.418 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
token.cpython-39.pyc	2.45 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
tokenize.cpython-39.opt-1.pyc	16.748 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
tokenize.cpython-39.opt-2.pyc	13.072 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
tokenize.cpython-39.pyc	16.775 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
trace.cpython-39.opt-1.pyc	19.309 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
trace.cpython-39.opt-2.pyc	16.364 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
trace.cpython-39.pyc	19.309 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
traceback.cpython-39.opt-1.pyc	19.974 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
traceback.cpython-39.opt-2.pyc	11.23 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
traceback.cpython-39.pyc	19.974 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
tracemalloc.cpython-39.opt-1.pyc	17.527 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
tracemalloc.cpython-39.opt-2.pyc	16.147 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
tracemalloc.cpython-39.pyc	17.527 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
tty.cpython-39.opt-1.pyc	1.065 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
tty.cpython-39.opt-2.pyc	0.959 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
tty.cpython-39.pyc	1.065 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
types.cpython-39.opt-1.pyc	9.032 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
types.cpython-39.opt-2.pyc	7.839 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
types.cpython-39.pyc	9.032 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
typing.cpython-39.opt-1.pyc	70.135 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
typing.cpython-39.opt-2.pyc	49.385 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
typing.cpython-39.pyc	70.262 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
uu.cpython-39.opt-1.pyc	3.77 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
uu.cpython-39.opt-2.pyc	3.531 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
uu.cpython-39.pyc	3.77 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
uuid.cpython-39.opt-1.pyc	21.885 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
uuid.cpython-39.opt-2.pyc	14.353 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
uuid.cpython-39.pyc	21.995 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
warnings.cpython-39.opt-1.pyc	12.87 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
warnings.cpython-39.opt-2.pyc	10.648 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
warnings.cpython-39.pyc	13.299 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
wave.cpython-39.opt-1.pyc	17.438 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
wave.cpython-39.opt-2.pyc	11.587 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
wave.cpython-39.pyc	17.467 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
weakref.cpython-39.opt-1.pyc	19.809 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
weakref.cpython-39.opt-2.pyc	16.601 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
weakref.cpython-39.pyc	19.822 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
webbrowser.cpython-39.opt-1.pyc	16.729 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
webbrowser.cpython-39.opt-2.pyc	14.375 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
webbrowser.cpython-39.pyc	16.745 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
xdrlib.cpython-39.opt-1.pyc	8.063 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
xdrlib.cpython-39.opt-2.pyc	7.589 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
xdrlib.cpython-39.pyc	8.063 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
zipapp.cpython-39.opt-1.pyc	5.857 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
zipapp.cpython-39.opt-2.pyc	4.709 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
zipapp.cpython-39.pyc	5.857 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
zipfile.cpython-39.opt-1.pyc	58.167 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
zipfile.cpython-39.opt-2.pyc	49.39 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
zipfile.cpython-39.pyc	58.188 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
zipimport.cpython-39.opt-1.pyc	16.77 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
zipimport.cpython-39.opt-2.pyc	13.334 KB	19 Jun 2025 12.11 PM	root / linksafe	0644
zipimport.cpython-39.pyc	16.846 KB	19 Jun 2025 12.11 PM	root / linksafe	0644

$90 GRAYBYTE WORDPRESS FILE MANAGER $32