AlkantarClanX12

Your IP : 18.226.93.22

Current Path : /opt/alt/python310/lib64/python3.10/__pycache__/
Upload File :
Current File : //opt/alt/python310/lib64/python3.10/__pycache__/_pydecimal.cpython-310.pyc

o

6��fD}�
@spdZgd�ZeZdZdZdZddlZddlZ	ddl
Z
z
ddlmZ
e
dd	�ZWn
ey4d
d�ZYnwdZd
ZdZdZdZdZdZdZdZdZe
jdkrUdZdZdZndZdZdZeedZGdd�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[XzddlbZcWn
e�y�Ynwd�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_CONTEXTVARZdecimalz1.70z2.4.2�N)�
namedtuplerzsign digits exponentcG�|S�N�)�argsr*r*�1/opt/alt/python310/lib64/python3.10/_pydecimal.py�<lambda>�sr-rrrrrrrrTl����l��N�Zol������N�Zoi@�Ti����c@�eZdZdZdd�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��zDecimalException.handleN��__name__�
__module__�__qualname__�__doc__r3r*r*r*r,r�src@�eZdZdZdS)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�r6r7r8r9r*r*r*r,r��rc@r/)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,|rt|dj|djdd�}|�|�StS)Nr&�nT)�_dec_from_triple�_sign�_int�_fix_nan�_NaN)r1r2r+�ansr*r*r,r3�s
zInvalidOperation.handleNr5r*r*r*r,r	�sr	c@r/)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].
    cG�tSr)�rBr0r*r*r,r3r4zConversionSyntax.handleNr5r*r*r*r,rsrc@r/)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.handleNr5r*r*r*r,r

sr
c@r/)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].
    cGrDr)rEr0r*r*r,r3"r4zDivisionImpossible.handleNr5r*r*r*r,r�rc@r/)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].
    cGrDr)rEr0r*r*r,r3-r4zDivisionUndefined.handleNr5r*r*r*r,r%rIrc@r:)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.
    Nr;r*r*r*r,r0r<rc@r/)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].
    cGrDr)rEr0r*r*r,r3Gr4zInvalidContext.handleNr5r*r*r*r,r<s
rc@r:)ra�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.
    Nr;r*r*r*r,rJr<rc@r:)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.
    Nr;r*r*r*r,r
Vr<r
c@r/)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�|jttttfvr
t|S|dkr)|jtkrt|St|d|j|j	|jd�S|dkrE|jt
kr6t|St|d|j|j	|jd�SdS)Nr&�9r.)�roundingrrrrrFrr>�prec�EmaxrrGr*r*r,r3ws"�
�
��zOverflow.handleNr5r*r*r*r,rasrc@r:)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.
    Nr;r*r*r*r,r�r<rc@r:)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.
    Nr;r*r*r*r,r�r<rZdecimal_contextcCs2zt��WStyt�}t�|�|YSw)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.
    )�_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_flagsrNrQrRr*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
@sneZdZdZdZd�dd�Zedd��Zd	d
�Zdd�Z	d�d
d�Z
dd�Zdd�Zdd�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�ZeZd�d7d8�Zd�d9d:�Z d�d;d<�Z!e!Z"d�d=d>�Z#d?d@�Z$d�dAdB�Z%d�dCdD�Z&d�dEdF�Z'd�dGdH�Z(d�dIdJ�Z)d�dKdL�Z*d�dMdN�Z+d�dOdP�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@d�drds�ZAdtdu�ZBdvdw�ZCd�dxdy�ZDd�dzd{�ZEd|d}�ZFd�d~d�ZGd�d�d��ZHd�d�d��ZId�d�d��ZJd�d�d��ZKd�d��ZLd�d��ZMd�d�d��ZNd�d�d��ZOeOZPd�d�d��ZQd�d�d��ZRd�d�d��ZSd�d��ZTd�d��ZUd�d��ZVd�d��ZWd�d�d��ZXd�d�d��ZYd�d�d��ZZd�d��Z[d�d��Z\d�d�d��Z]d�d�d��Z^d�d��Z_d�d��Z`d�d��Zad�d��Zbd�d�d��Zcd�d��Zdd�d��Zed�d��Zfd�d�d��Zgd�d��Zhd�d��Zid�d�dÄZjd�dńZkd�d�dDŽZld�d�dɄZmd�d˄Znd�d̈́Zod�d�dτZpd�d�dфZqd�d�dӄZrd�d�dՄZsd�d�dׄZtd�d�dلZud�d�dۄZvd�d�d݄Zwd�d�d߄Zxd�d�d�Zyd�d�Zzd�d�d�Z{d�d�d�Z|d�d�d�Z}d�d�Z~d�d�Zd�d�Z�d�d�d�Z�dS)�rz,Floating point class for decimal arithmetic.)�_expr@r?�_is_special�0NcCs|t�|�}t|t�r�t|���dd��}|dur'|durt�}|�t	d|�S|�
d�dkr2d|_nd|_|�
d	�}|durc|�
d
�pDd}t|�
d�pLd�}tt||��|_
|t|�|_d
|_|S|�
d�}|dur�tt|pqd���d�|_
|�
d�r�d|_n
d|_nd|_
d|_d|_|St|t�r�|dkr�d|_nd|_d|_tt|��|_
d
|_|St|t�r�|j|_|j|_|j
|_
|j|_|St|t�r�|j|_t|j�|_
t|j�|_d
|_|St|ttf��r�t|�dkr�td��t|dt��r|ddv�std��|d|_|ddk�rd|_
|d|_d|_|Sg}	|dD]+}
t|
t��rLd|
k�r8dk�rLntd��|	�sE|
dk�rJ|	�|
��q$td��|ddv�rjd�tt|	��|_
|d|_d|_|St|dt��r�d�tt|	�p{dg��|_
|d|_d
|_|Std��t|t��r�|du�r�t�}|�td�t�|�}|j|_|j|_|j
|_
|j|_|St d|��)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: %rrH�-r.r&�intZfrac�exprYF�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=razUThe 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?r]r@�lenrWrX�lstrip�absr�_WorkReprHr^�list�tuple�
ValueError�append�join�map�floatr�
from_float�	TypeError)�cls�valuer2r1�m�intpart�fracpartr^r_�digitsZdigitr*r*r,rj
s�

�

�





�&�
�

�
�
�
zDecimal.__new__cCs�t|t�r|dkrdnd}d}tt|��}n=t|t�rOt�|�s%t�|�r+|t|��St�	d|�dkr6d}nd}t|��
�\}}|��d}t|d|�}ntd��t
|||�}|tur`|S||�S)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.)rkr]rlrtr|�_mathZisinfZisnan�reprZcopysign�as_integer_ratio�
bit_lengthr~r>r)r�frH�k�coeffr=�d�resultr*r*r,r}�s$

zDecimal.from_floatcCs(|jr|j}|dkrdS|dkrdSdS)zrReturns whether the number is not actually one.

        0 if a number
        1 if NaN
        2 if sNaN
        r=r.rarer&)rXrW)r1r^r*r*r,�_isnan�szDecimal._isnancCs|jdkr|jr
dSdSdS)zyReturns whether the number is infinite

        0 if finite or not a number
        1 if +INF
        -1 if -INF
        rb���r.r&)rWr?�r1r*r*r,�_isinfinity�s

zDecimal._isinfinitycCs||��}|durd}n|��}|s|r<|durt�}|dkr%|�td|�S|dkr0|�td|�S|r7|�|�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.
        NFre�sNaNr&)r�rrpr	rA)r1�otherr2�self_is_nan�other_is_nanr*r*r,�_check_nans�s&
��

zDecimal._check_nanscCsv|durt�}|js
|jr9|��r|�td|�S|��r#|�td|�S|��r.|�td|�S|��r9|�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&)rrX�is_snanrpr	�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.
        rY�rXr@r�r*r*r,�__bool__*szDecimal.__bool__cCs
|js|jr|��}|��}||krdS||krdSdS|s(|s"dSd|jS|s/d|jS|j|jkr7dS|j|jkr?dS|��}|��}||krv|jd|j|j}|jd|j|j}||krgdS||krqd|jSd|jS||krd|jSd|jS)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.rY)rXr�r?�adjustedr@rW)r1r�Zself_infZ	other_inf�
self_adjustedZother_adjusted�self_paddedZother_paddedr*r*r,�_cmp1s>


zDecimal._cmpcCs<t||dd�\}}|tur|S|�||�rdS|�|�dkS)NT)�equality_opFr&)�_convert_for_comparison�NotImplementedr�r�r�r*r*r,�__eq__qszDecimal.__eq__cCs<t||�\}}|tur
|S|�||�}|rdS|�|�dkS�NFr&�r�r�r�r��r1r�r2rCr*r*r,�__lt__y�zDecimal.__lt__cCs<t||�\}}|tur
|S|�||�}|rdS|�|�dkSr�r�r�r*r*r,�__le__�r�zDecimal.__le__cCs<t||�\}}|tur
|S|�||�}|rdS|�|�dkSr�r�r�r*r*r,�__gt__�r�zDecimal.__gt__cCs<t||�\}}|tur
|S|�||�}|rdS|�|�dkSr�r�r�r*r*r,�__ge__�r�zDecimal.__ge__cCs>t|dd�}|js|r|jr|�||�}|r|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_otherrXr�rr�r�r*r*r,�compare�szDecimal.comparecCs�|jr|��rtd��|��rt�|�S|jrtStS|jdkr)t	d|jt
�}nt	t|jt
�}t|j
�|t
}|dkr@|n|}|dkrIdS|S)zx.__hash__() <==> hash(x)z"Cannot hash a signaling NaN value.r&�
r����)rXr�r~�is_nanri�__hash__r?�_PyHASH_INFrW�pow�_PyHASH_MODULUS�
_PyHASH_10INVr]r@)r1Zexp_hashZhash_rCr*r*r,r��s

zDecimal.__hash__cCst|jttt|j��|j�S)zeRepresents the number as a triple tuple.

        To show the internals exactly as they are.
        )rr?rwr{r]r@rWr�r*r*r,�as_tuple�szDecimal.as_tuplecCs�|jr|��rtd��td��|sdSt|j�}|jdkr(|d|jd}}n@|j}|dkrH|ddkrH|d}|d8}|dkrH|ddks6|j}t||@��d|�}|rb||L}||8}d||>}|j	rn|}||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 ratiordr&r�r.r�)
rXr�rx�
OverflowErrorr]r@rW�minr�r?)r1r=r�Zd5Zd2Zshift2r*r*r,r��s.

�zDecimal.as_integer_ratiocCsdt|�S)z0Represents the number as an instance of Decimal.z
Decimal('%s'))rlr�r*r*r,�__repr__szDecimal.__repr__Fc	Cs^ddg|j}|jr&|jdkr|dS|jdkr|d|jS|d|jS|jt|j�}|jdkr:|d	kr:|}n|s?d
}n|jdkrM|d
dd
}n|d
dd
}|dkrfd}d
d||j}n&|t|j�kr||jd|t|j�}d}n|jd|�}d
|j|d�}||kr�d}n|dur�t�}ddg|jd||}||||S)z�Return string representation of the number in scientific notation.

        Captures all of the information in the underlying representation.
        r[r\rbZInfinityr=�NaNr�r&���r.rYrc�.N�e�Ez%+d)r?rXrWr@rrr�capitals)	r1�engr2rH�
leftdigits�dotplacer�r�r^r*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|durt�}|s |jtkr |��}n|��}|�|�S)zRReturns a copy with the sign switched.

        Rounds, if it has reason.
        rRN)rXr�rrKr�copy_abs�copy_negate�_fix�r1r2rCr*r*r,�__neg__Ds

zDecimal.__neg__cCsR|jr
|j|d�}|r
|S|durt�}|s |jtkr |��}nt|�}|�|�S)zhReturns a copy, unless it is a sNaN.

        Rounds the number (if more than precision digits)
        rRN)rXr�rrKrr�rr�r�r*r*r,�__pos__Zs

zDecimal.__pos__TcCsL|s|��S|jr|j|d�}|r|S|jr|j|d�}|S|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().
        rR)r�rXr�r?r�r�)r1�roundr2rCr*r*r,�__abs__os�zDecimal.__abs__c
Cs\t|�}|tur
|S|durt�}|js|jrA|�||�}|r!|S|��r9|j|jkr5|��r5|�td�St	|�S|��rAt	|�St
|j|j�}d}|jt
krW|j|jkrWd}|ss|sst
|j|j�}|rfd}t|d|�}|�|�}|S|s�t||j|jd�}|�||j�}|�|�}|S|s�t||j|jd�}|�||j�}|�|�}|St|�}t|�}t|||j�\}}t�}	|j|jkr�|j|jkr�t|d|�}|�|�}|S|j|jkr�||}}|jdkr�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.rY)r&r&)r�r�rrXr�r�r?rpr	rr�rWrKrr>r��maxrL�_rescaleru�
_normalizerHr]r^)
r1r�r2rCr^ZnegativezerorH�op1�op2r�r*r*r,�__add__�s|






zDecimal.__add__cCsHt|�}|tur
|S|js|jr|j||d�}|r|S|j|��|d�S)zReturn self - otherrR)r�r�rXr�r�r�r�r*r*r,�__sub__�szDecimal.__sub__cC�"t|�}|tur
|S|j||d�S)zReturn other - selfrR)r�r�r�r�r*r*r,�__rsub__�szDecimal.__rsub__cCs>t|�}|tur
|S|durt�}|j|jA}|js|jrG|�||�}|r'|S|��r7|s3|�td�St	|S|��rG|sC|�td�St	|S|j
|j
}|rQ|s^t|d|�}|�|�}|S|j
dkrqt||j
|�}|�|�}|S|j
dkr�t||j
|�}|�|�}|St|�}t|�}t|t|j|j�|�}|�|�}|S)z\Return self * other.

        (+-) INF * 0 (or its reverse) raise InvalidOperation.
        Nz(+-)INF * 0z0 * (+-)INFrY�1)r�r�rr?rXr�r�rpr	rFrWr>r�r@rurlr])r1r�r2Z
resultsignrCZ	resultexpr�r�r*r*r,�__mul__�sH





zDecimal.__mul__cCs�t|�}|tur
tS|durt�}|j|jA}|js|jrO|�||�}|r'|S|��r5|��r5|�td�S|��r=t	|S|��rO|�t
d�t|d|���S|s`|sY|�t
d�S|�td|�S|sk|j|j}d}nnt|j�t|j�|jd}|j|j|}t|�}t|�}	|dkr�t|jd	||	j�\}}
nt|j|	jd	|�\}}
|
r�|d
dkr�|d7}n"|j|j}||kr�|d	dkr�|d	}|d7}||kr�|d	dks�t|t|�|�}|�|�S)zReturn self / other.Nz(+-)INF/(+-)INFzDivision by infinityrYz0 / 0zx / 0r&r.r�r�)r�r�rr?rXr�r�rpr	rFrr>�Etinyrr
rWrrr@rLru�divmodr]rlr�)r1r�r2rHrCr^r��shiftr�r��	remainder�	ideal_expr*r*r,�__truediv__,sT��
zDecimal.__truediv__cCs|j|jA}|��r|j}nt|j|j�}|��|��}|r'|��s'|dkr4t|dd�|�||j�fS||jkr�t	|�}t	|�}|j
|j
krU|jd|j
|j
9_n
|jd|j
|j
9_t|j|j�\}}	|d|jkr�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�rYr&r�z%quotient too large in //, % or divmod)r?r�rWr�r�r>r�rKrLrur^r]r�rlrpr)r1r�r2rHr��expdiffr�r��q�rrCr*r*r,�_dividegs0
�
��zDecimal._dividecCr�)z)Swaps self/other and returns __truediv__.rR)r�r�r�r�r*r*r,�__rtruediv__��zDecimal.__rtruediv__cCs�t|�}|tur
|S|durt�}|�||�}|r||fS|j|jA}|��r?|��r5|�td�}||fSt||�td�fS|sZ|sM|�t	d�}||fS|�t
d|�|�td�fS|�||�\}}|�|�}||fS)z6
        Return (self // other, self % other)
        Nzdivmod(INF, INF)�INF % xzdivmod(0, 0)�x // 0�x % 0)
r�r�rr�r?r�rpr	rFrr
r�r�)r1r�r2rCrHZquotientr�r*r*r,�
__divmod__�s4
�
�
zDecimal.__divmod__cCr�)z(Swaps self/other and returns __divmod__.rR)r�r�r�r�r*r*r,�__rdivmod__�r�zDecimal.__rdivmod__cCs�t|�}|tur
|S|durt�}|�||�}|r|S|��r%|�td�S|s5|r/|�td�S|�td�S|�||�d}|�	|�}|S)z
        self % other
        Nr�r�z0 % 0r.)
r�r�rr�r�rpr	rr�r�)r1r�r2rCr�r*r*r,�__mod__�s"
zDecimal.__mod__cCr�)z%Swaps self/other and returns __mod__.rR)r�r�r�r�r*r*r,�__rmod__�r�zDecimal.__rmod__cCs�|durt�}t|dd�}|�||�}|r|S|��r!|�td�S|s1|r+|�td�S|�td�S|��r>t|�}|�|�St	|j
|j
�}|sSt|jd|�}|�|�S|�
�|�
�}||jdkrg|�t�S|d	krw|�||j�}|�|�St|�}t|�}|j|jkr�|jd
|j|j9_n
|jd
|j|j9_t|j|j�\}}	d|	|d@|jkr�|	|j8}	|d7}|d
|jkr�|�t�S|j}
|	dkr�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)rYr.r�r�rer&)rr�r�r�rpr	rrr�r�rWr>r?r�rLrr�rKrur^r]r�rl)r1r�r2rC�ideal_exponentr�r�r�r�r�rHr*r*r,�remainder_near�s`���






zDecimal.remainder_nearcCs�t|�}|tur
|S|durt�}|�||�}|r|S|��r1|��r)|�td�St|j|jAS|sF|r@|�t	d|j|jA�S|�t
d�S|�||�dS)z
self // otherNz
INF // INFr�z0 // 0r&)r�r�rr�r�rpr	rFr?r
rr�r�r*r*r,�__floordiv__'s&
�zDecimal.__floordiv__cCr�)z*Swaps self/other and returns __floordiv__.rR)r�r�r�r�r*r*r,�
__rfloordiv__Cr�zDecimal.__rfloordiv__cCs>|��r|��rtd��|jrdnd}t|�St|�}t|�S)zFloat representation.z%Cannot convert signaling NaN to floatz-nan�nan)r�r�rxr?rlr|�r1�sr*r*r,�	__float__Js�zDecimal.__float__cCsn|jr|��rtd��|��rtd��d|j}|jdkr)|t|j�d|jS|t|jd|j�p4d�S)z1Converts self to an int, truncating if necessary.zCannot convert NaN to integerz"Cannot convert infinity to integerr�r&r�NrY)	rXr�rxr�r�r?rWr]r@r�r*r*r,�__int__Ts

zDecimal.__int__cCr(r)r*r�r*r*r,�realcszDecimal.realcC�td�S)Nr&�rr�r*r*r,�imagg�zDecimal.imagcCr(r)r*r�r*r*r,�	conjugatekr4zDecimal.conjugatecCstt|��Sr))�complexr|r�r*r*r,�__complex__n�zDecimal.__complex__cCsR|j}|j|j}t|�|kr%|t|�|d��d�}t|j||jd�St|�S)z2Decapitate the payload of a NaN to fit the contextNrYT)	r@rL�clamprrrsr>r?rWr)r1r2ZpayloadZmax_payload_lenr*r*r,rAqszDecimal._fix_nancCs@|jr|��r|�|�St|�S|��}|��}|s@|j|g|j}tt	|j
|�|�}||j
kr<|�t�t
|jd|�St|�St|j�|j
|j}||krc|�td|j�}|�t�|�t�|S||k}|rk|}|j
|kr�t|j�|j
|}	|	dkr�t
|jd|d�}d}	|j|j}
|
||	�}|jd|	�p�d}|dkr�tt|�d�}t|�|jkr�|dd�}|d7}||kr�|�td|j�}nt
|j||�}|r�|r�|�t�|r�|�t�|r�|�t�|�t�|s�|�t�|S|r�|�t�|jdk�r|j
|k�r|�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.
        rY�
above Emaxr&r�r.Nr�)rXr�rArr��EtoprMrr�r�rWrprr>r?rrr@rLrrr�_pick_rounding_functionrKrlr]rr
)r1r2r�r�exp_maxZnew_expZexp_minrCZself_is_subnormalr�Zrounding_method�changedr�r�r*r*r,r�}sn














zDecimal._fixcCst|j|�rdSdS)z(Also known as round-towards-0, truncate.r&r�)�
_all_zerosr@�r1rLr*r*r,�_round_down�szDecimal._round_downcCs|�|�S)zRounds away from 0.)r
r	r*r*r,�	_round_up�szDecimal._round_upcCs&|j|dvr	dSt|j|�rdSdS)zRounds 5 up (away from 0)Z56789r.r&r�)r@rr	r*r*r,�_round_half_up�s
zDecimal._round_half_upcCst|j|�rdS|�|�S)zRound 5 downr���_exact_halfr@rr	r*r*r,�_round_half_down�s
zDecimal._round_half_downcCs4t|j|�r|dks|j|ddvrdS|�|�S)z!Round 5 to even, rest to nearest.r&r.�02468r�r
r	r*r*r,�_round_half_even�s
zDecimal._round_half_evencCs|jr|�|�S|�|�S)z(Rounds up (not away from 0 if negative.)�r?r
r	r*r*r,�_round_ceiling�
zDecimal._round_ceilingcCs|js|�|�S|�|�S)z'Rounds down (not towards 0 if negative)rr	r*r*r,�_round_floor
rzDecimal._round_floorcCs,|r|j|ddvr|�|�S|�|�S)z)Round down unless digit prec-1 is 0 or 5.r.Z05)r@r
r	r*r*r,�_round_05ups
zDecimal._round_05up)rrrrrrrrcCs`|durt|t�s
td��tdd|�}|�|�S|jr(|��r$td��td��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)rkr]r~r>�quantizerXr�rxr�r�r)r1r=r^r*r*r,�	__round__&s/

zDecimal.__round__cC�.|jr|��rtd��td��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.

        rrr&)rXr�rxr�r]r�rr�r*r*r,�	__floor__d�
zDecimal.__floor__cCr)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.

        rrr&)rXr�rxr�r]r�rr�r*r*r,�__ceil__srzDecimal.__ceil__cCst|dd�}t|dd�}|js|jrm|durt�}|jdkr%|�td|�S|jdkr1|�td|�S|jdkr9|}nL|jdkrA|}nD|jdkrW|sN|�td�St|j|jA}n.|jdkrl|sd|�td	�St|j|jA}nt|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�Nrar�r=rbzINF * 0 in fmaz0 * INF in fma)
r�rXrrWrpr	rFr?r>rlr]r@r�)r1r�Zthirdr2�productr*r*r,�fma�s>




�
��
�zDecimal.fmacCs�t|�}|tur
|St|�}|tur|S|durt�}|��}|��}|��}|s-|s-|ra|dkr8|�td|�S|dkrC|�td|�S|dkrN|�td|�S|rU|�|�S|r\|�|�S|�|�S|��rm|��rm|��ss|�td�S|dkr}|�td�S|s�|�td�S|��|j	kr�|�td�S|s�|s�|�td	�S|�
�r�d}n|j}tt
|��}t|���}t|���}	|j
|td
|j|�|}t|	j�D]}
t|d
|�}q�t||	j
|�}t|t|�d�S)z!Three argument version of __pow__Nrer�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�rpr	rA�
_isintegerr�rL�_isevenr?rtr]ru�to_integral_valuer�r^�ranger>rl)r1r��modulor2r�r�Z
modulo_is_nanrH�base�exponent�ir*r*r,�
_power_modulo�s����


�������zDecimal._power_modulocCsRt|�}|j|j}}|ddkr|d}|d7}|ddkst|�}|j|j}}|ddkr>|d}|d7}|ddks0|dkr�||9}|ddkrZ|d}|d7}|ddksL|dkr`dS|d|}	|jdkrn|	}	|��r�|jdkr�|jt|�}
t|	|
|d�}nd}tddd||	|�S|jdk�rf|d}|dvr�||@|kr�dSt	|�d}
|dd	}|t
t|��kr�dSt|
||�}
t|||�}|
dus�|dur�dS|
|kr�dSd
|
}nj|d
k�rNt	|�dd	}
t
d
|
|�\}}|�rdS|d
dk�r|d
}|
d8}
|d
dk�s|dd}|t
t|��k�r(dSt|
||�}
t|||�}|
du�s@|du�rBdS|
|k�rIdSd
|
}ndS|d|k�rYdS|
|}tdt|�|�S|dk�ru|d|d}}n�|dk�r�t
tt||���|k�r�dSt	|�}|dk�r�t
tt|�|��|k�r�dS|d|}}|d
|d
k�r�dk�r�nn|d
}|d
}|d
|d
k�r�dk�s�n|d
|d
k�r�dk�rnn|d
}|d
}|d
|d
k�rdk�s�n|dk�rV|dk�r||k�rdSt
||�\}}|dk�r dSdt	|�|>}	t
|||d�\}}||k�r<n||d||}�q+||k�rR|dk�sTdS|}|dk�rh||dt|�k�rhdS||}||9}|d|k�rydSt|�}|���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�rY)re����]�Ar��rcreT�d)rur]r^rHr!r?rWr�r>�_nbitsrrrl�_decimal_lshift_exactr�rt�	_log10_lb)r1r��p�x�xc�xe�y�yc�yer'r�ZzerosZ
last_digitr�Zemaxr�r�r=Zxc_bits�rem�ar�r�Zstr_xcr*r*r,�_power_exacts�:���


�



&&$"�$"�


� zDecimal._power_exactcCs(|dur|�|||�St|�}|tur|S|durt�}|�||�}|r&|S|s2|s0|�td�StSd}|jdkrP|�	�rD|�
�sCd}n|rL|�td�S|��}|sa|jdkr]t|dd�St
|S|��rt|jdkrnt
|St|dd�S|tkr�|�	�r�|jdkr�d}n
||jkr�|j}nt|�}|j|}|d|jkr�d|j}|�t�n|�t�|�t�d|j}t|dd||�S|��}|��r�|jdk|dkkr�t|dd�St
|Sd}d}	|��|��}
|dk|jdkk�r|
tt|j��k�rt|d|jd�}n|��}|
tt|��k�rt|d|d�}|du�r?|�||jd�}|du�r?|dk�r=td|j|j�}d	}	|du�r�|j}t|�}
|
j|
j}}t|�}|j|j}}|jdk�rf|}d
}	t||||||�\}}|ddtt|��|d�r�n|d
7}�qit|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	|�|��q�|S|�$|�}|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 integerrYr�FTrcr�r�r)*r)r�r�rr�rpr	�_Oner?r!r"r�r>rFr�rLr]rWrrr��_log10_exp_boundrrrlrMr�r=r@rur^rH�_dpowerrSrT�_signals�trapsr��flagsr
rrr)r1r�r%r2rCZresult_signZ
multiplierr^Zself_adj�exactZboundr�r4r5r6r7r8r9r:�extrar�r�Z
newcontextZ	exceptionr*r*r,�__pow__�s�
��






�


�



"��



�
�zDecimal.__pow__cCr�)z%Swaps self/other and returns __pow__.rR)r�r�rFr�r*r*r,�__rpow__�	r�zDecimal.__rpow__cCs�|durt�}|jr|j|d�}|r|S|�|�}|��r|S|s(t|jdd�S|j|��g|j	}t
|j�}|j}|j|ddkr\||kr\|d7}|d8}|j|ddkr\||ksGt|j|jd|�|�S)z?Normalize- strip trailing 0s, change anything equal to 0 to 0e0NrRrYr&r.)
rrXr�r�r�r>r?rMrrrrr@rW)r1r2rC�dupr�endr^r*r*r,�	normalize�	s&

�zDecimal.normalizecCs�t|dd�}|dur
t�}|dur|j}|js|jr>|�||�}|r$|S|��s,|��r>|��r8|��r8t|�S|�td�S|�	�|j
krL|jksSn|�td�S|sbt|j
d|j
�}|�|�S|��}||jkrq|�td�S||j
d|jkr�|�td	�S|�|j
|�}|��|jkr�|�td�St|j�|jkr�|�td	�S|r�|��|jkr�|�t�|j
|j
kr�||kr�|�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 quantizerYz9exponent of quantize result too large for current contextr.z7quantize result has too many digits for current context)r�rrKrXr�r�rrpr	r�rWrMr>r?r�r�rLr�rrr@�Eminr
rr)r1r^rKr2rCr�r*r*r,r�	s`��

����



zDecimal.quantizecCsDt|dd�}|js|jr|��r|��p|��o|��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�rXr��is_infiniterWr�r*r*r,�same_quantum%
s	�zDecimal.same_quantumcCs�|jrt|�S|st|jd|�S|j|kr$t|j|jd|j||�St|j�|j|}|dkr=t|jd|d�}d}|j|}|||�}|jd|�pOd}|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
        rYr&r�r.N)
rXrr>r?rWr@rrrrlr])r1r^rKr�Z
this_functionrr�r*r*r,r�4
s$
�

zDecimal._rescalecCsf|dkrtd��|js
|st|�S|�|��d||�}|��|��kr1|�|��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.)rxrXrr�r�)r1�placesrKrCr*r*r,�_roundV
s

zDecimal._roundcCs�|jr|j|d�}|r
|St|�S|jdkrt|�S|s#t|jdd�S|dur*t�}|dur1|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.
        rRr&rYN)rXr�rrWr>r?rrKr�rprr�r1rKr2rCr*r*r,�to_integral_exactm
s$



zDecimal.to_integral_exactcCs\|durt�}|dur|j}|jr|j|d�}|r|St|�S|jdkr(t|�S|�d|�S)z@Rounds to the nearest integer, without raising inexact, rounded.NrRr&)rrKrXr�rrWr�rPr*r*r,r#�
s
zDecimal.to_integral_valuecCs�|durt�}|jr!|j|d�}|r|S|��r!|jdkr!t|�S|s2t|jd|jd�}|�|�S|jdkr=|�	t
d�S|jd}t|�}|j
d?}|j
d@r_|jd}t|j�d?d}n|j}t|j�dd?}||}|dkr||d	|9}d
}	n
t|d	|�\}}
|
}	||8}d|}	||}||kr�n||d?}q�|	o�|||k}	|	r�|dkr�|d|}n|d|9}||7}n
|ddkr�|d7}tdt|�|�}|��}|�t�}
|�|�}|
|_|S)zReturn the square root of self.NrRr&rYrer.zsqrt(-x), x > 0r�r0Tr�)rrXr�r�r?rr>rWr�rpr	rLrur^r]rrr@r�rl�
_shallow_copy�
_set_roundingrrK)r1r2rCrL�opr��c�lr�rDr�r=r�rKr*r*r,�sqrt�
sb





�


zDecimal.sqrtcCs�t|dd�}|dur
t�}|js|jr?|��}|��}|s|r?|dkr,|dkr,|�|�S|dkr9|dkr9|�|�S|�||�S|�|�}|dkrM|�|�}|dkrT|}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�rrXr�r�r�r��
compare_total�r1r�r2ZsnZonrUrCr*r*r,r�s&



	
zDecimal.maxcCs�t|dd�}|dur
t�}|js|jr?|��}|��}|s|r?|dkr,|dkr,|�|�S|dkr9|dkr9|�|�S|�||�S|�|�}|dkrM|�|�}|dkrT|}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�rXrZr*r*r,r�*s&




zDecimal.mincCs8|jrdS|jdkrdS|j|jd�}|dt|�kS)z"Returns whether self is an integerFr&TNrY)rXrWr@rr)r1�restr*r*r,r!Ls
zDecimal._isintegercCs&|r|jdkr	dS|jd|jdvS)z:Returns True if self is even.  Assumes self is an integer.r&Tr�r)rWr@r�r*r*r,r"UszDecimal._isevencCs,z|jt|j�dWStyYdSw)z$Return the adjusted exponent of selfr.r&)rWrrr@r~r�r*r*r,r�[s
�zDecimal.adjustedcCr()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,�	canonicalc�zDecimal.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�rR)r�r�r�r�r*r*r,�compare_signalks
zDecimal.compare_signalcCsPt|dd�}|jr|jstS|js|jrtS|j}|��}|��}|s%|r�||krOt|j�|jf}t|j�|jf}||krC|rAtStS||krM|rKtStStS|rj|dkrWtS|dkr]tS|dkrctS|dkritSn|dkrptS|dkrvtS|dkr|tS|dkr�tS||kr�tS||kr�tS|j|jkr�|r�tStS|j|jkr�|r�tStStS)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.re)	r�r?�_NegativeOner>r�rrr@�_ZerorW)r1r�r2rHZself_nanZ	other_nanZself_keyZ	other_keyr*r*r,rYwsh�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�rY)r1r�r2r��or*r*r,�compare_total_mag�s
zDecimal.compare_total_magcCstd|j|j|j�S)z'Returns a copy with the sign set to 0. r&)r>r@rWrXr�r*r*r,r���zDecimal.copy_abscCs.|jr
td|j|j|j�Std|j|j|j�S)z&Returns a copy with the sign inverted.r&r.)r?r>r@rWrXr�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@rWrXr�r*r*r,�	copy_sign�s
�zDecimal.copy_signcCs�|durt�}|j|d�}|r|S|��dkrtS|stS|��dkr't|�S|j}|��}|jdkrJ|t	t
|jdd��krJtdd|jd�}n�|jdkri|t	t
|�
�dd��kritdd|�
�d�}nr|jdkr�||kr�tddd|dd|�}nX|jdkr�||dkr�tdd	|d|d�}n>t|�}|j|j}}|jdkr�|}d}	t||||�\}	}
|	ddt	t
|	��|dr�n|d7}q�tdt
|	�|
�}|��}|�t�}|�|�}||_|S)
zReturns e ** self.NrRr�r.r&rcr�rYrJTr�r�)rr�r�r`r>rrLr�r?rrrlrMr>r�rur]r^rH�_dexprRrSrr�rK)r1r2rCr4�adjrTrUr�rEr�r^rKr*r*r,r^�sL$( 
 �

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'r]zDecimal.is_canonicalcCs|jS)z�Return True if self is finite; otherwise return False.

        A Decimal instance is considered finite if it is neither
        infinite nor a NaN.
        )rXr�r*r*r,�	is_finite/�zDecimal.is_finitecC�
|jdkS)z8Return True if self is infinite; otherwise return False.rb�rWr�r*r*r,rL7�
zDecimal.is_infinitecCs
|jdvS)z>Return True if self is a qNaN or sNaN; otherwise return False.rgrkr�r*r*r,r�;rlzDecimal.is_nancCs*|js|sdS|durt�}|j|��kS)z?Return True if self is a normal number; otherwise return False.FN)rXrrKr�r�r*r*r,�	is_normal?�

zDecimal.is_normalcCrj)z;Return True if self is a quiet NaN; otherwise return False.r=rkr�r*r*r,r�GrlzDecimal.is_qnancCrj)z8Return True if self is negative; otherwise return False.r.)r?r�r*r*r,�	is_signedKrlzDecimal.is_signedcCrj)z?Return True if self is a signaling NaN; otherwise return False.rarkr�r*r*r,r�OrlzDecimal.is_snancCs*|js|sdS|durt�}|��|jkS)z9Return True if self is subnormal; otherwise return False.FN)rXrr�rKr�r*r*r,�is_subnormalSrnzDecimal.is_subnormalcCs|jo|jdkS)z6Return True if self is a zero; otherwise return False.rYr�r�r*r*r,�is_zero[szDecimal.is_zerocCs�|jt|j�d}|dkrtt|dd��dS|dkr,ttd|dd��dSt|�}|j|j}}|dkrTt|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&�rWrrr@rlrur]r^�r1rfrTrUr��numZdenr*r*r,�
_ln_exp_bound_szDecimal._ln_exp_boundc
Cs
|durt�}|j|d�}|r|S|stS|��dkrtS|tkr#tS|jdkr.|�t	d�St
|�}|j|j}}|j
}||��d}	t|||�}|ddttt|���|dr^n|d	7}qEtt|d
k�tt|��|�}|��}|�t�}	|�|�}|	|_|S)z/Returns the natural (base e) logarithm of self.NrRr.zln of a negative valuereTr�r�rcr&)rr��_NegativeInfinityr��	_Infinityr>r`r?rpr	rur]r^rLrv�_dlogrrrlrtr>rRrSrr�rK�
r1r2rCrTrUr�r4rNr�rKr*r*r,�lnxs>
�$�

z
Decimal.lncCs�|jt|j�d}|dkrtt|��dS|dkr$ttd|��dSt|�}|j|j}}|dkrPt|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���reZ231rsrtr*r*r,r?�szDecimal._log10_exp_boundc
CsF|durt�}|j|d�}|r|S|stS|��dkrtS|jdkr(|�td�S|jddkrL|jdd�dt	|j�dkrLt
|jt	|j�d�}nDt|�}|j
|j}}|j}||��d}	t|||�}|d
dt	tt|���|dr|n|d7}qctt
|dk�tt|��|�}|��}|�t�}	|�|�}|	|_|S)
z&Returns the base 10 logarithm of self.NrRr.zlog10 of a negative valuer&r�rYreTr�r�rc)rr�rwr�rxr?rpr	r@rrrrWrur]r^rLr?�_dlog10rlrtr>rRrSrr�rKrzr*r*r,�log10�s>
�.$�

z
Decimal.log10cCsV|j|d�}|r
|S|durt�}|��rtS|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).
        rRNzlogb(0)r.)	r�rr�rxrpr
rr�r�r�r*r*r,�logb�s	
zDecimal.logbcCs6|jdks
|jdkrdS|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?rWr@)r1�digr*r*r,�
_islogical
s
�zDecimal._islogicalcCs�|jt|�}|dkrd||}n|dkr||jd�}|jt|�}|dkr3d||}||fS|dkr?||jd�}||fS)Nr&rY)rLrr)r1r2�opa�opbZdifr*r*r,�
_fill_logical'
s�zDecimal._fill_logicalcC�z|durt�}t|dd�}|��r|��s|�t�S|�||j|j�\}}d�dd�t||�D��}t	d|�
d�p:dd�S)	z;Applies an 'and' operation between self and other's digits.NTr�r[cSs$g|]\}}tt|�t|�@��qSr*�rlr]��.0r<�br*r*r,�
<listcomp>B
�$z'Decimal.logical_and.<locals>.<listcomp>r&rY�rr�r�rpr	r�r@rz�zipr>rs�r1r�r2r�r�r�r*r*r,�logical_and4
�
zDecimal.logical_andcCs(|durt�}|�tdd|jd�|�S)zInvert all its digits.Nr&r�)r�logical_xorr>rLr�r*r*r,�logical_invertE
s
�zDecimal.logical_invertcCr�)	z:Applies an 'or' operation between self and other's digits.NTr�r[cSs$g|]\}}tt|�t|�B��qSr*r�r�r*r*r,r�Z
r�z&Decimal.logical_or.<locals>.<listcomp>r&rYr�r�r*r*r,�
logical_orL
r�zDecimal.logical_orcCr�)	z;Applies an 'xor' operation between self and other's digits.NTr�r[cSs$g|]\}}tt|�t|�A��qSr*r�r�r*r*r,r�k
r�z'Decimal.logical_xor.<locals>.<listcomp>r&rYr�r�r*r*r,r�]
r�zDecimal.logical_xorcCs�t|dd�}|dur
t�}|js|jr?|��}|��}|s|r?|dkr,|dkr,|�|�S|dkr9|dkr9|�|�S|�||�S|���|���}|dkrQ|�|�}|dkrX|}n|}|�|�S�z8Compares the values numerically with their sign ignored.Tr�Nr.r&r��	r�rrXr�r�r�r�r�rYrZr*r*r,�max_magn
�&



zDecimal.max_magcCs�t|dd�}|dur
t�}|js|jr?|��}|��}|s|r?|dkr,|dkr,|�|�S|dkr9|dkr9|�|�S|�||�S|���|���}|dkrQ|�|�}|dkrX|}n|}|�|�Sr�r�rZr*r*r,�min_mag�
r�zDecimal.min_magcCs�|durt�}|j|d�}|r|S|��dkrtS|��dkr*tdd|j|���S|��}|�t	�|�
�|�|�}||krB|S|�tdd|�
�d�|�S)z=Returns the largest representable number smaller than itself.NrRr�r.r&rJr�)rr�r�rwr>rLrrSrSr�_ignore_all_flagsr�r�r��r1r2rCZnew_selfr*r*r,�
next_minus�
�$

�zDecimal.next_minuscCs�|durt�}|j|d�}|r|S|��dkrtS|��dkr*tdd|j|���S|��}|�t	�|�
�|�|�}||krB|S|�tdd|�
�d�|�S)z=Returns the smallest representable number larger than itself.NrRr.r�rJr&r�)rr�r�rxr>rLrrSrSrr�r�r�r�r�r*r*r,�	next_plus�
r�zDecimal.next_pluscCs�t|dd�}|dur
t�}|�||�}|r|S|�|�}|dkr%|�|�S|dkr/|�|�}n|�|�}|��rL|�t	d|j
�|�t�|�t�|S|�
�|jkrn|�t�|�t�|�t�|�t�|sn|�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�rdr�r�r�rprr?rrr�rKrr
r)r1r�r2rCZ
comparisonr*r*r,�next_toward�
s8	


�

�




zDecimal.next_towardcCs�|��rdS|��rdS|��}|dkrdS|dkrdS|��r'|jr%dSdS|d	ur.t�}|j|d
�r;|jr9dSdS|jr@d
SdS)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+ZeroNrRz
-Subnormalz
+Subnormalz-Normalz+Normal)r�r�r�rqr?rrp)r1r2�infr*r*r,�number_classs,zDecimal.number_classcCr�)z'Just returns 10, as this is Decimal, :)r�r�r�r*r*r,�radix0r�z
Decimal.radixcCs�|durt�}t|dd�}|�||�}|r|S|jdkr!|�t�S|jt|�kr0|jks6n|�t�S|��r>t	|�St|�}|j
}|jt|�}|dkrWd||}n|dkrb||d�}||d�|d|�}t|j
|�d�pwd|j�S)z5Returns a rotated copy of self, value-of-other times.NTr�r&rY�rr�r�rWrpr	rLr]r�rr@rrr>r?rs)r1r�r2rC�torot�rotdig�topadZrotatedr*r*r,�rotate4s.

 
�zDecimal.rotatecCs�|durt�}t|dd�}|�||�}|r|S|jdkr!|�t�Sd|j|j}d|j|j}|t|�kr=|ksCn|�t�S|�	�rKt
|�St|j|j
|jt|��}|�|�}|S)z>Returns self operand after adding the second value to its exp.NTr�r&r�re)rr�r�rWrpr	rMrLr]r�rr>r?r@r�)r1r�r2rCZliminfZlimsupr�r*r*r,�scalebUs"



zDecimal.scalebcCs|durt�}t|dd�}|�||�}|r|S|jdkr!|�t�S|jt|�kr0|jks6n|�t�S|��r>t	|�St|�}|j
}|jt|�}|dkrWd||}n|dkrb||d�}|dkrm|d|�}n|d|}||jd�}t|j
|�d�p�d|j�S)z5Returns a shifted copy of self, value-of-other times.NTr�r&rYr�)r1r�r2rCr�r�r�Zshiftedr*r*r,r�ns4

 
�z
Decimal.shiftcCs|jt|�ffSr))�	__class__rlr�r*r*r,�
__reduce__�szDecimal.__reduce__cC�t|�tur|S|�t|��Sr)��typerr�rlr�r*r*r,�__copy__��zDecimal.__copy__cCr�r)r�)r1Zmemor*r*r,�__deepcopy__�r�zDecimal.__deepcopy__cCs,|durt�}t||d�}|jr,t|j|�}t|���}|ddkr&|d7}t|||�S|ddur;ddg|j|d<|ddkrLt	|j|j
|jd�}|j}|d}|dur�|dd	vrf|�
|d
|�}n!|ddvrt|�||�}n|ddvr�t|j
�|kr�|�
||�}|s�|jd
kr�|ddvr�|�d
|�}|jt|j
�}	|dd	vr�|s�|dur�d
|}
n d
}
n|ddvr�|	}
n|ddvr�|jd
kr�|	dkr�|	}
nd
}
|
d
kr�d}d|
|j
}n'|
t|j
�kr�|j
d|
t|j
�}d}n|j
d|
��pd}|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�Gre�	precision�eEr.zfF%ZgGr&r�rYr[)r�_parse_format_specifierrX�_format_signr?rlr��
_format_alignr�r>r@rWrKrOr�rr�_format_number)r1Z	specifierr2r��specrH�bodyrKr�r�r�r�r�r^r*r*r,�
__format__�sZ
zDecimal.__format__)rYN)NNr))FN)TN)�r6r7r8r9�	__slots__rj�classmethodr}r�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�rrAr�r
rrrrrrr�dictrrrrr r)r=rFrGrJrrMr�rOrQr#�to_integralrWr�r�r!r"r�r\r^rYrbr�r�rdr^rgrhrLr�rmr�ror�rprqrvr{r?r~rr�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r*r*r*r,rs

,

 !
@

	
	
	
	2

4
	


V


7
;
!

$



K




f	�
>

,U
n
Y


="



c
*"	


I

K


2

3









.*

!
'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*.
    )rirjrr?r@rWrX)rHZcoefficientr'Zspecialr1r*r*r,r>�s
r>c@s(eZdZdZdd�Zdd�Zdd�ZdS)	rUz�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))rS�new_context)r1r�r*r*r,�__init__�z_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__r�z_ContextManager.__exit__N)r6r7r8r9r�r�r�r*r*r*r,rUs
rUc@s�eZdZdZ			d�dd�Zdd�Zdd�Zd	d
�Zdd�Zd
d�Z	dd�Z
dd�Zdd�Zdd�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}
Wn	ty
Ynw|dur|n|
j|_|dur|n|
j|_|dur(|n|
j|_|dur2|n|
j|_|dur<|n|
j|_|durF|n|
j|_|	durRg|_n|	|_�dur`|
j	�
�|_	nt�t�stt�fdd�t
�D��|_	n�|_	�dur�t�t
d�|_dSt�t�s�t�fdd�t
�D��|_dS�|_dS)Nc3� �|]}|t|�v�fVqdSr)�r]�r�r��rBr*r,�	<genexpr>I��z#Context.__init__.<locals>.<genexpr>r&c3r�r)r�r��rCr*r,r�Pr�)r�	NameErrorrLrKrKrMr�r�_ignored_flagsrBrSrkr�rA�fromkeysrC)r1rLrKrKrMr�rrCrBr�Zdcr*)rCrBr,r�0s0�

 
zContext.__init__cCs�t|t�std|��|dkr||krtd||||f��n%|dkr1||kr0td||||f��n||ks9||krCtd||||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)rkr]r~rxri�__setattr__)r1�namer�ZvminZvmaxr*r*r,�_set_integer_checkTs
��zContext._set_integer_checkcCs`t|t�std|��|D]}|tvrtd|��q
tD]}||vr(td|��qt�|||�S)Nz%s must be a signal dictz%s is not a valid signal dict)rkr�r~rA�KeyErrorrir�)r1r�r��keyr*r*r,�_set_signal_dictbs
��zContext._set_signal_dictcCs�|dkr|�||dd�S|dkr|�||dd�S|dkr$|�||dd�S|dkr0|�||dd�S|d	kr<|�||dd�S|d
krQ|tvrJtd|��t�|||�S|dksY|d
kr_|�||�S|dkrjt�|||�Std|��)NrLr.r�rKr�r&rMr�rrKz%s: invalid rounding moderCrBr�z.'decimal.Context' object has no attribute '%s')r��_rounding_modesr~rir�r��AttributeError)r1r�r�r*r*r,r�ms*�zContext.__setattr__cCstd|��)Nz%s cannot be deleted)r�)r1r�r*r*r,�__delattr__�rzContext.__delattr__c	CsNdd�|j��D�}dd�|j��D�}|j|j|j|j|j|j|j	||ffS)NcS�g|]\}}|r|�qSr*r*�r�Zsigr�r*r*r,r���z&Context.__reduce__.<locals>.<listcomp>cSr�r*r*r�r*r*r,r��r�)
rC�itemsrBr�rLrKrKrMr�r)r1rCrBr*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)dcS�g|]	\}}|r|j�qSr*�r6)r�r�r�r*r*r,r���z$Context.__repr__.<locals>.<listcomp>zflags=[z, �]cSr�r*r�)r�r�r�r*r*r,r��r�ztraps=[�))ry�varsrCr�rzrB)r1r��namesr*r*r,r��s�zContext.__repr__cC�|jD]}d|j|<qdS)zReset all flags to zeror&Nr��r1�flagr*r*r,rT��
�zContext.clear_flagscCr�)zReset all traps to zeror&Nr�r�r*r*r,�clear_traps�r�zContext.clear_trapsc
Cs.t|j|j|j|j|j|j|j|j|j	�	}|S)z!Returns a shallow copy from self.)
rrLrKrKrMr�rrCrBr��r1Zncr*r*r,rR�s
�zContext._shallow_copyc
Cs6t|j|j|j|j|j|j|j��|j	��|j
�	}|S)zReturns a deep copy from self.)rrLrKrKrMr�rrCrSrBr�r�r*r*r,rS�s�zContext.copycGsZt�||�}||jvr|�j|g|�R�Sd|j|<|j|s)|�j|g|�R�S||��)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.)�_condition_maprOr�r3rCrB)r1Z	conditionZexplanationr+�errorr*r*r,rp�s


zContext._raise_errorcCs
|jt�S)z$Ignore all flags, if they are raised)�
_ignore_flagsrAr�r*r*r,r��rlzContext._ignore_all_flagscGs|jt|�|_t|�S)z$Ignore the flags, if they are raised)r�rv)r1rCr*r*r,r��szContext._ignore_flagscGs8|rt|dttf�r|d}|D]}|j�|�qdS)z+Stop ignoring the flags, if they are raisedr&N)rkrwrvr��remove)r1rCr�r*r*r,�
_regard_flags�s
�zContext._regard_flagscC�t|j|jd�S)z!Returns Etiny (= Emin - prec + 1)r.)r]rKrLr�r*r*r,r��rcz
Context.EtinycCr�)z,Returns maximum exponent (= Emax - prec + 1)r.)r]rMrLr�r*r*r,r�rczContext.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.
        )rK)r1r�rKr*r*r,rS�szContext._set_roundingrYcCsjt|t�r||��ksd|vr|�td�St||d�}|��r0t|j�|j	|j
kr0|�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.rZzAtrailing or leading whitespace and underscores are not permitted.rRzdiagnostic info too long in NaN)rkrlrnrprrr�rrr@rLrr�)r1rur�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

        )rr}r�)r1r�r�r*r*r,�create_decimal_from_floats

z!Context.create_decimal_from_floatcC�t|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�rR)r�r��r1r<r*r*r,rt!szContext.abscC�2t|dd�}|j||d�}|turtd|��|S)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�rR�Unable to convert %s to Decimal)r�r�r�r~�r1r<r�r�r*r*r,�add6�
zContext.addcCst|�|��Sr))rlr�r�r*r*r,�_applyKr�zContext._applycC�t|t�s	td��|��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.)rkrr~r\r�r*r*r,r\N�
	zContext.canonicalcC�t|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�rR)r�r��r1r<r�r*r*r,r�[s!zContext.comparecCr)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�rR)r�r^rr*r*r,r^� zContext.compare_signalcC�t|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�rYrr*r*r,rY�s
zContext.compare_totalcCr)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�rbrr*r*r,rb�s
zContext.compare_total_magcC�t|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���
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�r
zContext.copy_decimalcCr	)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��r
zContext.copy_negatecCr)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�rdrr*r*r,rd��
zContext.copy_signcCr�)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�rRr�)r�r�r�r~r�r*r*r,�divides
zContext.dividecCr�)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�rRr�)r�r�r�r~r�r*r*r,�
divide_int+�
zContext.divide_intcCr�)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�rRr�)r�r�r�r~r�r*r*r,r�BrzContext.divmodcCr�)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�rR)r�r^r�r*r*r,r^W�zContext.expcCst|dd�}|j|||d�S)aReturns 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�rR)r�r )r1r<r�rUr*r*r,r oszContext.fmacCr)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.)rkrr~rgr�r*r*r,rg�rzContext.is_canonicalcCr	)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�rhr�r*r*r,rh�szContext.is_finitecCr	)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�rLr�r*r*r,rL��zContext.is_infinitecCr	)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���
zContext.is_nancCr�)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�rR)r�rmr�r*r*r,rm�szContext.is_normalcCr	)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��rzContext.is_qnancCr	)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�ror�r*r*r,ro��zContext.is_signedcCr	)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��rzContext.is_snancCr�)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�rR)r�rpr�r*r*r,rp�zContext.is_subnormalcCr	)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�rqr�r*r*r,rq%rzContext.is_zerocCr�)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�rR)r�r{r�r*r*r,r{6rz
Context.lncCr�)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�rR)r�r~r�r*r*r,r~L�z
Context.log10cCr�)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�rR)r�rr�r*r*r,rhszContext.logbcCr)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�rR)r�r�rr*r*r,r���zContext.logical_andcCr�)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�rR)r�r�r�r*r*r,r��szContext.logical_invertcCr)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�rR)r�r�rr*r*r,r��rzContext.logical_orcCr)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�rR)r�r�rr*r*r,r��rzContext.logical_xorcCr)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�rR)r�r�rr*r*r,r��rzContext.maxcCr)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�rR)r�r�rr*r*r,r��zContext.max_magcCr)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�rR)r�r�rr*r*r,r�rzContext.mincCr)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�rR)r�r�rr*r*r,r�-rzContext.min_magcCr�)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�rR)r�r�r�r*r*r,�minus>�z
Context.minuscCr�)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�rRr�)r�r�r�r~r�r*r*r,�multiplyOs
zContext.multiplycCr�)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�rR)r�r�r�r*r*r,r�o�zContext.next_minuscCr�)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�rR)r�r�r�r*r*r,r��rzContext.next_pluscCr)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�rR)r�r�rr*r*r,r��rzContext.next_towardcCr�)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�rR)r�rJr�r*r*r,rJ�rzContext.normalizecCr�)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�rR)r�r�r�r*r*r,r��s/zContext.number_classcCr�)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�rR)r�r�r�r*r*r,�plusrzContext.pluscCs4t|dd�}|j|||d�}|turtd|��|S)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�rRr�)r�rFr�r~)r1r<r�r%r�r*r*r,�powers
Iz
Context.powercCr)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�rR)r�rrr*r*r,res7zContext.quantizecCr�)zkJust returns 10, as this is Decimal, :)

        >>> ExtendedContext.radix()
        Decimal('10')
        r�r�r�r*r*r,r��riz
Context.radixcCr�)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�rRr�)r�r�r�r~r�r*r*r,r��s
zContext.remaindercCr)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�rR)r�r�rr*r*r,r��szContext.remainder_nearcCr)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�rR)r�r�rr*r*r,r��szContext.rotatecCr)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�rMrr*r*r,rMrzContext.same_quantumcCr)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�rR)r�r�rr*r*r,r�$szContext.scalebcCr)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�rR)r�r�rr*r*r,r�7sz
Context.shiftcCr�)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�rR)r�rWr�r*r*r,rWUszContext.sqrtcCr�)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�rRr�)r�r�r�r~r�r*r*r,�subtracturzContext.subtractcCr�)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�rR)r�r�r�r*r*r,r��rzContext.to_eng_stringcCr�)zyConverts a number to a string, using scientific notation.

        The operation is not affected by the context.
        Tr�rR)r�r�r�r*r*r,�
to_sci_string�szContext.to_sci_stringcCr�)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�rR)r�rQr�r*r*r,rQ�szContext.to_integral_exactcCr�)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�rR)r�r#r�r*r*r,r#�szContext.to_integral_value)	NNNNNNNNNr))rY)Xr6r7r8r9r�r�r�r�r�r�r�rTr�rRrSr�rpr�r�r�r�r�rrSr�r�rtrrr\r�r^rYrbr�rr�rdr
rr�r^r rgrhrLr�rmr�ror�rprqr{r~rr�r�r�r�r�r�r�r�rrr�r�r�rJr�rrrr�r�r�r�rMr�r�rWrr�rrQr#r�r*r*r*r,rs�
�$



$#


%
 #2
P:&" rc@s"eZdZdZddd�Zdd�ZdS)ru�rHr]r^NcCsj|durd|_d|_d|_dSt|t�r$|j|_t|j�|_|j|_dS|d|_|d|_|d|_dS)Nr&r.re)rHr]r^rkrr?r@rW)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__r))r6r7r8r�r�r�r*r*r*r,ru�s
rucCs�|j|jkr|}|}n|}|}tt|j��}tt|j��}|jtd||d�}||jd|kr8d|_||_|jd|j|j9_|j|_||fS)zcNormalizes op1, op2 to have the same exp and length of coefficient.

    Done during addition.
    r�rer.r�)r^rrrlr]r�)r�r�rL�tmpr�Ztmp_lenZ	other_lenr^r*r*r,r�sr�cCs^|dkrdS|dkr|d|Stt|��}t|�t|�d��}||kr(dS|d|S)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�rYN)rlrtrr�rstrip)r=r�Zstr_nZval_nr*r*r,r2(sr2cCsH|dks|dkrtd��d}||kr"||||d?}}||ks|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.)rx)r=r<r�r*r*r,�
_sqrt_nearest=s�r#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.rer*)r5r�r�r�r*r*r,�_rshift_nearestLs r$cCs&t||�\}}|d||d@|kS)zaClosest integer to a/b, a and b positive integers; rounds to even
    in the case of a tie.

    rer.)r�)r<r�r�r�r*r*r,�_div_nearestTsr%r,c		Cs||}d}||krt|�||>|ks"||krWt|�||?|krWt||d>|t||t||�|��}|d7}||krIt|�||>|ks"||krWt|�||?|ks"tdtt|��d|�}t||�}t||�}t|ddd�D]}t||�t|||�}qxt|||�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.���rcr�)rtr%r#r$r]rrrlr$)	r5�M�Lr8�R�TZyshift�wr�r*r*r,�_ilog\s ��

r,c
Cs�|d7}tt|��}||||dk}|dkrJd|}|||}|dkr-|d|9}nt|d|�}t||�}t|�}t|||�}||}	n
d}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.rer.r&r�r0)rrrlr%r,�
_log10_digits)
rUr�r4rVr�r'r��log_dZlog_10Zlog_tenpowerr*r*r,r}�s 

r}c	Cs�|d7}tt|��}||||dk}|dkr9|||}|dkr)|d|9}nt|d|�}t|d|�}nd}|r^ttt|���d}||dkr[t|t||�d|�}nd}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.rer.r&r�r0)rrrlr%r,rtr-)	rUr�r4rVr�r�r.rEZ	f_log_tenr*r*r,ry�s"ryc@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)r�r�r*r*r,r��s
z_Log10Memoize.__init__cCs�|dkrtd��|t|j�krAd}	d||d}tttd||�d��}||d�d	|kr2n|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 nonnegativercTr�rer0NrYr�r.)rxrrr�rlr%r,r"r])r1r4rEr'r�r*r*r,�	getdigits�s	�	z_Log10Memoize.getdigitsN)r6r7r8r9r�r0r*r*r*r,r/�sr/c	Cs�t||>|�}tdtt|��d|�}t||�}||>}t|ddd�D]
}t|||||�}q(t|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&rcr.r&r�re)r1r]rrrlr%r$)	r5r'r(r)r*r8ZMshiftr(r�r*r*r,�_iexp�s
r1c	Cs�|d7}td|tt|��d�}||}||}|dkr$|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.rer&r.r�i�rc)r�rrrlr�r-r%r1)	rUr�r4rEr�r�ZcshiftZquotr;r*r*r,re$s recCs�ttt|���|}t||||d�}||}|dkr%||d|}n
t||d|�}|dkr`tt|��|dk|dkkrRd|ddd|}	}
|	|
fSd|d|}	}
|	|
fSt||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�)rrrlrtryr%re)r6r7r9r:r4r�Zlxcr�Zpcr�r^r*r*r,r@Hs ��
r@r0�F�5�(�rr�r�r�)	r��2�3�4�5�6�7�8rJcCs0|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.r0)rxrlrr)rUZ
correctionZstr_cr*r*r,r3rsr3cCsLt|t�r|St|t�rt|�S|rt|t�rt�|�S|r$td|��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�)rkrr]r|r}r~r�)r�r�Zallow_floatr*r*r,r�}s


r�cCs�t|t�r	||fSt|tj�r)|js"t|jtt|j	�|j
�|j�}|t|j�fS|r9t|tj
�r9|jdkr9|j}t|t�rVt�}|rId|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.rh)rkr�_numbersZRationalrXr>r?rlr]r@�denominatorrW�	numeratorZComplexr�r�r|rrCrrpr}r�)r1r�r�r2r*r*r,r��s(
�
�r�r/i?Bi���)rLrKrBrCrMrKr�rrf)rLrKrBrCa�        # 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<|dr;|dur1td|��|dur;td|��|p>d|d<|pDd	|d<|d
durQd|d
<t|dpWd
�|d<|ddurit|d�|d<|ddkr|ddus{|ddvrd|d<|ddkr�d|d<|dur�t��}|ddur�td|��|d|d<|d|d<|d|d<|S|ddur�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: � �>rHr\�minimumwidthrYr�r&r�ZgGnr.r=r��
thousands_sepzJExplicit thousands separator conflicts with 'n' type in format specifier: �grouping�
decimal_pointr[rcr�)�_parse_format_specifier_regex�matchrx�	groupdictr]�_locale�
localeconv)�format_specr�r�Zformat_dictrArBr*r*r,r�sV
����r�c	Cs�|d}|d}||t|�t|�}|d}|dkr$|||}|S|dkr0|||}|S|dkr<|||}|S|dkrXt|�d}|d	|�||||d	�}|Std
��)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).

    rFrArB�<rE�=�^reNzUnrecognised alignment field)rrrx)	rHr�r�rFrAZpaddingrBr�Zhalfr*r*r,r�ms$�	�� �r�cCslddlm}m}|sgS|ddkr%t|�dkr%||dd�||d��S|dtjkr2|dd�Std��)zyConvert a localeconv-style grouping into a (possibly infinite)
    iterable of integers representing group lengths.

    r&)�chain�repeatr�reNr�z unrecognised format for grouping)�	itertoolsrSrTrrrM�CHAR_MAXrx)rHrSrTr*r*r,�_group_lengths�s
rWcCs�|d}|d}g}t|�D]@}|dkrtd��ttt|�|d�|�}|�d|t|�||d��|d|�}||8}|sH|dkrHn!|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.

    rGrHr&zgroup length should be positiver.rYN)rWrxr�r�rrryrz�reversed)r�r��	min_width�seprH�groupsrVr*r*r,�_insert_thousands_sep�s $$r\cCs |rdS|ddvr|dSdS)zDetermine sign character.r\rHz +r[r*)�is_negativer�r*r*r,r��s
r�cCs�t||�}|s|dr|d|}|dks|ddvr.ddddd�|d}|d	�||�7}|dd
kr8|d
7}|drI|dt|�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
    ZaltrIr&r�r�r�r�)r�r�r�r�z{0}{1:+}r�rCrF)r��formatrrr\r�)r]r�r�r^r�rHZecharrYr*r*r,r��s
r�ZInfz-Infr�r�rer))F)r&)r,)FF)r.)zr9�__all__r6Z	__xname__�__version__Z__libmpdec_version__Zmathr�Znumbersr>�sys�collectionsr'Z_namedtupler�ImportErrorrrrrrrrrr$r%�maxsizer r!r"r#�ArithmeticErrorrrr	r�ZeroDivisionErrorr
rrrrrr
rrr~rrAr�r�ZcontextvarsZ
ContextVarrNrrrrirr>�Number�registerrUrrur�r]r�r1r2r#r$r%r,r}ryr/r0r-r1rer@r3r�r�rrr�re�compile�VERBOSE�
IGNORECASErKrmrr�DOTALLrJ�localerMr�r�rWr\r�r�rxrwrBr`r>r_rF�	hash_info�modulusr�r�r�r�Z_PyHASH_NANr�r�r*r*r*r,�<module>slc#�

&
���

.
^

0",#
%$
+�

*���
��

��
P
%
)