🔐 Sid Gifari File Manager Pro
v8.0.5 | 2026-08-08 14:22:18 | PHP 8.2.32
📂
/ (Root)
/
opt
/
alt
/
python34
/
lib64
/
python3.4
/
__pycache__
📍 /opt/alt/python34/lib64/python3.4/__pycache__
🔄 Refresh
✏️
Editing: decimal.cpython-34.pyc
Read Only
� h fP} � + @ sf d Z d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d! d" d# d$ g$ Z d% Z d& Z d' d( l Z d' d( l Z d' d( l Z y# d' d) l m Z e d d* � Z Wn e k r� d+ d, � Z Yn Xd Z d Z d Z d Z d Z d Z d Z d Z d- Z e j d. d/ d0 k rOd1 Z d1 Z d1 Z n d2 Z d2 Z d2 Z e e d0 Z Gd3 d � d e � Z Gd4 d � d e � Z Gd5 d � d e � Z Gd6 d � d e � Z Gd7 d � d e e! � Z" Gd8 d � d e � Z# Gd9 d � d e e! � Z$ Gd: d � d e � Z% Gd; d � d e � Z& Gd< d � d e � Z' Gd= d � d e � Z( Gd> d � d e% e' � Z) Gd? d � d e% e' e( � Z* Gd@ d � d e e+ � Z, e e" e% e) e' e* e e( e, g Z- i e e 6e e# 6e e$ 6e e& 6Z. e e e e e e e e f Z/ y d' d( l0 Z0 Wn4 e k r]GdA dB � dB e1 � Z2 e2 � Z0 [2 Yn Xy e0 j3 WnN e4 k r�e5 e0 j6 � dC � r�e0 j6 � `7 n dD d � Z8 dE d � Z9 YnI Xe0 j3 � Z3 e5 e3 dC � r�e3 `7 n e3 dF d � Z9 e3 dG d � Z8 [0 [3 d( dH d � Z: GdI d � d e1 � Z; dJ dK dL � Z< e j= j> e; � GdM dN � dN e1 � Z? GdO d � d e1 � Z@ GdP dQ � dQ e1 � ZA d' dR dS � ZB eC jD ZE dT dU � ZF dV dW � ZG dX dY � ZH dZ d[ � ZI d\ d] d^ � ZJ d_ d` � ZK da db � ZL Gdc dd � dd e1 � ZM eM � jN ZO d\ de df � ZP dg dh � ZQ di dj � ZR i dk dl 6dm dn 6do dp 6dq dr 6ds dt 6du dv 6dw dx 6dy dz 6d{ d| 6d} d~ � ZS dJ dJ d d� � ZT dJ d� d� � ZU e@ d� d� d� e d� e" e) e g d� g d� d� d� d� d� d0 d� d' � ZV e@ d� d� d� e d� e" e) e e e* g d� g � ZW e@ d� d� d� e d� g d� g � ZX d' d( lY ZY eY jZ d� eY j[ eY j\ B� j] Z^ eY jZ d� � j] Z_ eY jZ d� � j] Z` eY jZ d� eY j[ eY ja B� Zb [Y y d' d( lc Zd Wn e k r�Yn Xd( d� d� � Ze d� d� � Zf d� d� � Zg d0 d� d� � Zh d� d� � Zi d� d� � Zj e; d� � Zk e; d� � Zl e; d� � Zm e; d' � Zn e; d0 � Zo e; d0 � Zp ek el f Zq e jr js Zt e jr ju Zv e jr jw Zx ey dy et d. et � Zz [ y d' d( l{ Z{ Wn e k r�YnT Xe| e} � � Z~ e| e} e{ � � Z x e~ e D] Z� e� � e� =qW[~ [ [� d' d� l{ Te� d� k rbd' d( l� Z� d' d( l� Z� e� j� e� � n d( S)�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_THREADSz1.70z2.4.1� N)� namedtuplezsign digits exponentc G s | S)N� )�argsr' r' �,/opt/alt/python34/lib64/python3.4/decimal.py�<lambda>� s r* T� �? � l ��N�Zoi@�Tc @ s" e Z d Z d Z d d � Z d S)r a1 Base 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. c G s d S)Nr' )�self�contextr( r' r' r) �handle� s zDecimalException.handleN)�__name__� __module__� __qualname__�__doc__r0 r' r' r' r) r � s c @ s e Z d Z d Z d S)r a) 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)r1 r2 r3 r4 r' r' r' r) r � s c @ s" e Z d Z d Z d d � Z d S)r a0 An 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. c G s: | r6 t | d j | d j d d � } | j | � St S)Nr% �nT)�_dec_from_triple�_sign�_int�_fix_nan�_NaN)r. r/ r( �ansr' r' r) r0 � s # zInvalidOperation.handleN)r1 r2 r3 r4 r0 r' r' r' r) r � s c @ s" e Z d Z d Z d d � Z d S)r z�Trying to convert badly formed string. This occurs and signals invalid-operation if an string is being converted to a number and it does not conform to the numeric string syntax. The result is [0,qNaN]. c G s t S)N)r: )r. r/ r( r' r' r) r0 s zConversionSyntax.handleN)r1 r2 r3 r4 r0 r' r' r' r) r � s c @ s" e Z d Z d Z d d � Z d S)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. c G s t | S)N)�_SignedInfinity)r. r/ �signr( r' r' r) r0 s zDivisionByZero.handleN)r1 r2 r3 r4 r0 r' r' r' r) r s c @ s" e Z d Z d Z d d � Z d S)r z�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]. c G s t S)N)r: )r. r/ r( r' r' r) r0 s zDivisionImpossible.handleN)r1 r2 r3 r4 r0 r' r' r' r) r s c @ s" e Z d Z d Z d d � Z d S)r z�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]. c G s t S)N)r: )r. r/ r( r' r' r) r0 ' s zDivisionUndefined.handleN)r1 r2 r3 r4 r0 r' r' r' r) r s c @ s e Z d Z d Z d S)r a� 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. N)r1 r2 r3 r4 r' r' r' r) r * s c @ s" e Z d Z d Z d d � Z d S)r a� 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]. c G s t S)N)r: )r. r/ r( r' r' r) r0 A s zInvalidContext.handleN)r1 r2 r3 r4 r0 r' r' r' r) r 6 s c @ s e Z d Z d Z d S)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. N)r1 r2 r3 r4 r' r' r' r) r D s c @ s e Z d Z d Z d S)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. N)r1 r2 r3 r4 r' r' r' r) r P s c @ s" e Z d Z d Z d d � Z d S)r a Numerical 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. c G s� | j t t t t f k r# t | S| d k rk | j t k rF t | St | d | j | j | j d � S| d k r� | j t k r� t | St | d | j | j | j d � Sd S)Nr% �9r- ) �roundingr r r r r< r r6 �prec�Emaxr )r. r/ r= r( r' r' r) r0 q s zOverflow.handleN)r1 r2 r3 r4 r0 r' r' r' r) r [ s c @ s e Z d Z d Z d S)r ax Numerical 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. N)r1 r2 r3 r4 r' r' r' r) r � s c @ s e Z d Z d Z d S)r a� 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. N)r1 r2 r3 r4 r' r' r' r) r � s c @ s e Z d Z e d d � Z d S)� MockThreadingc C s | j t S)N)�modulesr1 )r. �sysr' r' r) �local� s zMockThreading.localN)r1 r2 r3 rD rE r' r' r' r) rB � s rB �__decimal_context__c C sA | t t t f k r. | j � } | j � n | t j � _ d S)z%Set this thread's context to context.N)r r r �copy� clear_flags� threading�current_threadrF )r/ r' r' r) r � s c C sF y t j � j SWn. t k rA t � } | t j � _ | SYn Xd S)z�Returns this thread's context. If this thread does not yet have a context, returns a new context and sets this thread's context. New contexts are copies of DefaultContext. N)rI rJ rF �AttributeErrorr )r/ r' r' r) r � s c C s: y | j SWn( t k r5 t � } | | _ | SYn Xd S)z�Returns this thread's context. If this thread does not yet have a context, returns a new context and sets this thread's context. New contexts are copies of DefaultContext. N)rF rK r )�_localr/ r' r' r) r � s c C s; | t t t f k r. | j � } | j � n | | _ d S)z%Set this thread's context to context.N)r r r rG rH rF )r/ rL r' r' r) r � s c C s" | d k r t � } n t | � S)ab Return 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)Zctxr' r' r) r � s $ c @ s� e Z d Z d Z d� Z d d d d � Z e d d � � Z d d � Z d d � Z d d d d � Z d d � Z d d � Z d d � Z d d d � Z d d d � Z d d d � Z d d d � Z d d d! � Z d d" d# � Z d d$ d% � Z d& d' � Z d( d) � Z d* d+ � Z d, d d- d. � Z d d/ d0 � Z d d1 d2 � Z d d3 d4 � Z d5 d d6 d7 � Z d d8 d9 � Z e Z d d: d; � Z d d< d= � Z d d> d? � Z! e! Z" d d@ dA � Z# dB dC � Z$ d dD dE � Z% d dF dG � Z& d dH dI � Z' d dJ dK � Z( d dL dM � Z) d dN dO � Z* d dP dQ � Z+ d dR dS � Z, dT dU � Z- dV dW � Z. e. Z/ dX dY � Z0 e1 e0 � Z0 dZ d[ � Z2 e1 e2 � Z2 d\ d] � Z3 d^ d_ � Z4 d` da � Z5 db dc � Z6 dd de � Z7 df dg � Z8 dh di � Z9 dj dk � Z: dl dm � Z; dn do � Z< dp dq � Z= dr ds � Z> e? dt e7 du e8 dv e9 dw e: dx e; dy e< dz e= d{ e> � Z@ d d| d} � ZA d~ d � ZB d� d� � ZC d d� d� � ZD d d� d� � ZE d� d� � ZF d d d� d� � ZG d d� d� � ZH d d� d� � ZI d d d5 d� d� � ZJ d d� d� � ZK d� d� � ZL d� d� � ZM d d d� d� � ZN d d d� d� � ZO eO ZP d d� d� � ZQ d d� d� � ZR d d� d� � ZS d� d� � ZT d� d� � ZU d� d� � ZV d� d� � ZW d d� d� � ZX d d� d� � ZY d d� d� � ZZ d� d� � Z[ d� d� � Z\ d d� d� � Z] d d� d� � Z^ d� d� � Z_ d� d� � Z` d� d� � Za d� d� � Zb d d� d� � Zc d� d� � Zd d� d� � Ze d� d� � Zf d d� d� � Zg d� d� � Zh d� d� � Zi d d� d� � Zj d� d� � Zk d d� d� � Zl d d� d� � Zm d� d� � Zn d� d� � Zo d d� d� � Zp d d� d� � Zq d d� d� � Zr d d� d� � Zs d d� d� � Zt d d� d� � Zu d d� d� � Zv d d� d� � Zw d d� d� � Zx d d� d� � Zy d� d� � Zz d d� d� � Z{ d d� d� � Z| d d� d� � Z} d� d� � Z~ d� d� � Z d� d� � Z� d d d� d� � Z� d S)�r z,Floating point class for decimal arithmetic.�_expr8 r7 � _is_special�0Nc C s� t j | � } t | t � r�t | j � � } | d k rh | d k rT t � } n | j t d | � S| j d � d k r� d | _ n d | _ | j d � } | d k r| j d � p� d } t | j d � p� d � } t t | | � � | _ | t | � | _ d | _ n� | j d � } | d k r{t t | p?d � � j d � | _ | j d � rod | _ q�d | _ n d | _ d | _ d | _ | St | t � r�| d k r�d | _ n d | _ d | _ t t | � � | _ d | _ | St | t � r8| j | _ | j | _ | j | _ | j | _ | St | t � r�| j | _ t | j � | _ t | j � | _ d | _ | St | t t f � rFt | � d k r�t d � � n t | d t � o�| d d k s�t d � � n | d | _ | d d k r+d | _ | d | _ d | _ ng } xn | d D]b } t | t � r�d | k ohd k n r�| s| d k r�| j | � q�q<t d � � q<W| d d k r�d j t t | � � | _ | d | _ d | _ n\ t | d t � r6d j t t | pd g � � | _ | d | _ d | _ n t d � � | St | t � r�| d k rmt � } n | j t d � t j | � } | j | _ | j | _ | j | _ | j | _ | St d | � � d S) 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') Nz Invalid literal for Decimal: %rr= �-r- r% �intZfrac� �exprP F�diag�signal�Nr5 �FT� ztInvalid tuple size in creation of Decimal from list or tuple. The list or tuple should have exactly three elements.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.r+ � zTThe second value in the tuple must be composed of integers in the range 0 through 9.zUThe third value in the tuple must be an integer, or one of the strings 'F', 'n', 'N'.z;strict semantics for mixing floats and Decimals are enabledz Cannot convert %r to Decimal)r% r- )r5 rW ) �object�__new__� isinstance�str�_parser�stripr � _raise_errorr �groupr7 rR r8 �lenrN rO �lstrip�absr �_WorkRepr= rT �list�tuple� ValueError�append�join�map�floatr � from_float� TypeError) �cls�valuer/ r. �m�intpart�fracpartrT rU �digits�digitr' r' r) r\ 2 s� $ # + $ zDecimal.__new__c C s� t | t � r | | � St | t � s7 t d � � n t j | � sU t j | � re | t | � � St j d | � d k r� d } n d } t | � j � \ } } | j � d } t | t | d | � | � } | t k r� | S| | � Sd 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') z argument must be int or float.g �?r% r- � N)r] rR rm ro �_mathZisinfZisnan�reprZcopysignre �as_integer_ratio� bit_lengthr6 r^ r )rp �fr= r5 �d�k�resultr' r' r) rn � s ! zDecimal.from_floatc C s9 | j r5 | j } | d k r" d S| d k r5 d Sn d S)zrReturns whether the number is not actually one. 0 if a number 1 if NaN 2 if sNaN r5 r- rW r+ r% )rO rN )r. rT r' r' r) �_isnan� s zDecimal._isnanc C s$ | j d k r | j r d Sd Sd S)zyReturns whether the number is infinite 0 if finite or not a number 1 if +INF -1 if -INF rX r- r% ���)rN r7 )r. r' r' r) � _isinfinity� s zDecimal._isinfinityc C s� | j � } | d k r! d } n | j � } | s9 | r� | d k rQ t � } n | d k rp | j t d | � S| d k r� | j t d | � S| r� | j | � S| j | � Sd S)z�Returns whether the number is not actually one. if self, other are sNaN, signal if self, other are NaN return nan return 0 Done before operations. NFr+ �sNaNr% )r� r ra r r9 )r. �otherr/ � self_is_nan� other_is_nanr' r' r) � _check_nans s" zDecimal._check_nansc C s� | d k r t � } n | j s* | j r� | j � rI | j t d | � S| j � rh | j t d | � S| j � r� | j t d | � S| j � r� | j t d | � Sn d S)aC Version 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% )r rO �is_snanra r �is_qnan)r. r� r/ r' r' r) �_compare_check_nans, s( zDecimal._compare_check_nansc C s | j p | j d k S)zuReturn True if self is nonzero; otherwise return False. NaNs and infinities are considered nonzero. rP )rO r8 )r. r' r' r) �__bool__M s zDecimal.__bool__c C sd | j s | j rQ | j � } | j � } | | k r: d S| | k rJ d Sd Sn | sp | sa d Sd | j Sn | s� d | j S| j | j k r� d S| j | j k r� d S| j � } | j � } | | k r=| j d | j | j } | j d | j | j } | | k rd S| | k r/d | j Sd | j Sn# | | k rTd | j Sd | j Sd S) 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- rP Nr� r� r� r� r� r� r� r� )rO r� r7 �adjustedr8 rN )r. r� Zself_infZ other_inf� self_adjustedZother_adjusted� self_paddedZ other_paddedr' r' r) �_cmpT s> z Decimal._cmpc C sT t | | d d �\ } } | t k r+ | S| j | | � rA d S| j | � d k S)N� equality_opTFr% )�_convert_for_comparison�NotImplementedr� r� )r. r� r/ r' r' r) �__eq__� s zDecimal.__eq__c C sT t | | d d �\ } } | t k r+ | S| j | | � rA d S| j | � d k S)Nr� Tr% )r� r� r� r� )r. r� r/ r' r' r) �__ne__� s zDecimal.__ne__c C sT t | | � \ } } | t k r% | S| j | | � } | rA d S| j | � d k S)NFr% )r� r� r� r� )r. r� r/ r; r' r' r) �__lt__� s zDecimal.__lt__c C sT t | | � \ } } | t k r% | S| j | | � } | rA d S| j | � d k S)NFr% )r� r� r� r� )r. r� r/ r; r' r' r) �__le__� s zDecimal.__le__c C sT t | | � \ } } | t k r% | S| j | | � } | rA d S| j | � d k S)NFr% )r� r� r� r� )r. r� r/ r; r' r' r) �__gt__� s zDecimal.__gt__c C sT t | | � \ } } | t k r% | S| j | | � } | rA d S| j | � d k S)NFr% )r� r� r� r� )r. r� r/ r; r' r' r) �__ge__� s zDecimal.__ge__c C s\ t | d d �} | j s* | rI | j rI | j | | � } | rI | Sn t | j | � � 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') �raiseitT)�_convert_otherrO r� r r� )r. r� r/ r; r' r' r) �compare� s zDecimal.comparec C s� | j rI | j � r$ t d � � qI | j � r4 t S| j rB t St Sn | j d k rp t d | j t � } n t t | j t � } t | j � | t } | d k r� | n | } | d k r� d S| S)zx.__hash__() <==> hash(x)z"Cannot hash a signaling NaN value.r% � r- r+ r� ���) rO r� ro �is_nan� _PyHASH_NANr7 � _PyHASH_INFrN �pow�_PyHASH_MODULUS� _PyHASH_10INVrR r8 )r. Zexp_hashZhash_r; r' r' r) �__hash__� s zDecimal.__hash__c C s( t | j t t t | j � � | j � S)zeRepresents the number as a triple tuple. To show the internals exactly as they are. )r r7 rh rl rR r8 rN )r. r' r' r) �as_tuple� s zDecimal.as_tuplec C s d t | � S)z0Represents the number as an instance of Decimal.z Decimal('%s'))r^ )r. r' r' r) �__repr__� s zDecimal.__repr__Fc C s� d d g | j } | j rc | j d k r3 | d S| j d k rQ | d | j S| d | j Sn | j t | j � } | j d k r� | d k r� | } nE | s� d } n6 | j d k r� | d d d } n | d d d } | d k r d } d d | | j } nf | t | j � k rI| j d | t | j � } d } n* | j d | � } d | j | d � } | | k r�d } n7 | d k r�t � } n d d g | j d | | } | | | | S)z�Return string representation of the number in scientific notation. Captures all of the information in the underlying representation. rS rQ rX ZInfinityr5 �NaNr� r% � r- rP rY �.N�e�Ez%+di����)r7 rO rN r8 rc r �capitals) r. �engr/ r= � leftdigits�dotplacers rt rT r' r' r) �__str__ s: zDecimal.__str__c C s | j d d d | � S)a Convert to engineering-type string. Engineering notation has an exponent which is a multiple of 3, so there are up to 3 digits left of the decimal place. Same rules for when in exponential and when as a value as in __str__. r� Tr/ )r� )r. r/ r' r' r) � to_eng_string5 s zDecimal.to_eng_stringc C s~ | j r( | j d | � } | r( | Sn | d k r@ t � } n | re | j t k re | j � } n | j � } | j | � S)zRReturns a copy with the sign switched. Rounds, if it has reason. r/ N)rO r� r r? r �copy_abs� copy_negate�_fix)r. r/ r; r' r' r) �__neg__? s zDecimal.__neg__c C s~ | j r( | j d | � } | r( | Sn | d k r@ t � } n | re | j t k re | j � } n t | � } | j | � S)zhReturns a copy, unless it is a sNaN. Rounds the number (if more then precision digits) r/ N)rO r� r r? r r� r r� )r. r/ r; r' r' r) �__pos__U s zDecimal.__pos__Tc C sl | s | j � S| j r8 | j d | � } | r8 | Sn | j rV | j d | � } n | j d | � } | S)z�Returns the absolute value of self. If the keyword argument 'round' is false, do not round. The expression self.__abs__(round=False) is equivalent to self.copy_abs(). r/ )r� rO r� r7 r� r� )r. �roundr/ r; r' r' r) �__abs__j s zDecimal.__abs__c C sq t | � } | t k r | S| d k r4 t � } n | j sF | j r� | j | | � } | rb | S| j � r� | j | j k r� | j � r� | j t d � St | � S| j � r� t | � Sn t | j | j � } d } | j t k r| j | j k rd } n | r[| r[t | j | j � } | r6d } n t | d | � } | j | � } | S| s�t | | j | j d � } | j | | j � } | j | � } | S| s�t | | j | j d � } | j | | j � } | j | � } | St | � } t | � } t | | | j � \ } } t � } | j | j k r�| j | j k rvt | d | � } | j | � } | S| j | j k r�| | } } n | j d k r�d | _ | j | j | _ | _ qd | _ n6 | j d k rd | _ d \ | _ | _ n d | _ | j d k r3| j | j | _ n | j | j | _ | j | _ t | � } | j | � } | S)zbReturns self + other. -INF + INF (or the reverse) cause InvalidOperation errors. Nz -INF + INFr% r- rP )r% r% )r� r� r rO r� r� r7 ra r r �minrN r? r r6 r� �maxr@ �_rescalerf � _normalizer= rR rT ) r. r� r/ r; rT Z negativezeror= �op1�op2r r' r' r) �__add__� s| ! zDecimal.__add__c C si t | � } | t k r | S| j s. | j rP | j | d | �} | rP | Sn | j | j � d | �S)zReturn self - otherr/ )r� r� rO r� r� r� )r. r� r/ r; r' r' r) �__sub__� s zDecimal.__sub__c C s/ t | � } | t k r | S| j | d | �S)zReturn other - selfr/ )r� r� r� )r. r� r/ r' r' r) �__rsub__� s zDecimal.__rsub__c C s� t | � } | t k r | S| d k r4 t � } n | j | j A} | j sV | j r� | j | | � } | rr | S| j � r� | s� | j t d � St | S| j � r� | s� | j t d � St | Sn | j | j } | s� | r t | d | � } | j | � } | S| j d k rCt | | j | � } | j | � } | S| j d k rzt | | j | � } | j | � } | St | � } t | � } t | t | j | j � | � } | j | � } | S)z\Return self * other. (+-) INF * 0 (or its reverse) raise InvalidOperation. Nz (+-)INF * 0z 0 * (+-)INFrP �1)r� r� r r7 rO r� r� ra r r< rN r6 r� r8 rf r^ rR )r. r� r/ Z resultsignr; Z resultexpr� r� r' r' r) �__mul__� sH "zDecimal.__mul__c C sl t | � } | t k r t S| d k r4 t � } n | j | j A} | j sV | j r� | j | | � } | rr | S| j � r� | j � r� | j t d � S| j � r� t | S| j � r� | j t d � t | d | j � � Sn | s| s� | j t d � S| j t d | � S| s1| j | j } d } nt | j � t | j � | j d } | j | j | } t | � } t | � } | d k r�t | j d | | j � \ } } n$ t | j | j d | � \ } } | r | d d k rG| d 7} qGnG | j | j } x4 | | k rF| d d k rF| d } | d 7} qWt | t | � | � } | j | � S) zReturn self / other.Nz(+-)INF/(+-)INFzDivision by infinityrP z0 / 0zx / 0r% r- r� rw )r� r� r r7 rO r� r� ra r r< r r6 �Etinyr r rN rc r8 r@ rf �divmodrR r^ r� ) r. r� r/ r= r; rT �coeff�shiftr� r� � remainder� ideal_expr' r' r) � __truediv__' sP ' &$ zDecimal.__truediv__c C s� | j | j A} | j � r( | j } n t | j | j � } | j � | j � } | sr | j � sr | d k r� t | d d � | j | | j � f S| | j k rot | � } t | � } | j | j k r� | j d | j | j 9_ n | j d | j | j 9_ t | j | j � \ } } | d | j k rot | t | � d � t | j t | � | � f Sn | j t d � } | | f S)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+ rP r% r� z%quotient too large in //, % or divmodr� )r7 r� rN r� r� r6 r� r? r@ rf rT rR r� r^ ra r ) r. r� r/ r= r� �expdiffr� r� �q�rr; r' r' r) �_divideb s* zDecimal._dividec C s/ t | � } | t k r | S| j | d | �S)z)Swaps self/other and returns __truediv__.r/ )r� r� r� )r. r� r/ r' r' r) � __rtruediv__� s zDecimal.__rtruediv__c C s8 t | � } | t k r | S| d k r4 t � } n | j | | � } | rV | | f S| j | j A} | j � r� | j � r� | j t d � } | | f St | | j t d � f Sn | s| s� | j t d � } | | f S| j t d | � | j t d � f Sn | j | | � \ } } | j | � } | | f S)z6 Return (self // other, self % other) Nzdivmod(INF, INF)zINF % xz divmod(0, 0)zx // 0zx % 0) r� r� r r� r7 r� ra r r< r r r� r� )r. r� r/ r; r= Zquotientr� r' r' r) � __divmod__� s0 zDecimal.__divmod__c C s/ t | � } | t k r | S| j | d | �S)z(Swaps self/other and returns __divmod__.r/ )r� r� r� )r. r� r/ r' r' r) � __rdivmod__� s zDecimal.__rdivmod__c C s� t | � } | t k r | S| d k r4 t � } n | j | | � } | rP | S| j � rl | j t d � S| s� | r� | j t d � S| j t d � Sn | j | | � d } | j | � } | S)z self % other NzINF % xzx % 0z0 % 0r- ) r� r� r r� r� ra r r r� r� )r. r� r/ r; r� r' r' r) �__mod__� s" zDecimal.__mod__c C s/ t | � } | t k r | S| j | d | �S)z%Swaps self/other and returns __mod__.r/ )r� r� r� )r. r� r/ r' r' r) �__rmod__� s zDecimal.__rmod__c C s| | d k r t � } n t | d d �} | j | | � } | rF | S| j � rb | j t d � S| s� | r~ | j t d � S| j t d � Sn | j � r� t | � } | j | � St | j | j � } | s� t | j d | � } | j | � S| j � | j � } | | j d k r)| j t � S| d k rW| j | | j � } | j | � St | � } t | � } | j | j k r�| j d | j | j 9_ n | j d | j | j 9_ t | j | j � \ } } d | | d @| j k r| | j 8} | d 7} n | d | j k r.| j t � S| j } | d k rWd | } | } n t | t | � | � } | j | � S) zI Remainder nearest to 0- abs(remainder-near) <= other/2 Nr� Tzremainder_near(infinity, x)zremainder_near(x, 0)zremainder_near(0, 0)rP r- r+ r� r% r� )r r� r� r� ra r r r r� r� rN r6 r7 r� r@ r r� r? rf rT rR r� r^ ) r. r� r/ r; �ideal_exponentr� r� r� r� r� r= r' r' r) �remainder_near� sZ zDecimal.remainder_nearc C s� t | � } | t k r | S| d k r4 t � } n | j | | � } | rP | S| j � r� | j � rx | j t d � St | j | j ASn | s� | r� | j t d | j | j A� S| j t d � Sn | j | | � d S)z self // otherNz INF // INFzx // 0z0 // 0r% ) r� r� r r� r� ra r r< r7 r r r� )r. r� r/ r; r' r' r) � __floordiv__" s$ zDecimal.__floordiv__c C s/ t | � } | t k r | S| j | d | �S)z*Swaps self/other and returns __floordiv__.r/ )r� r� r� )r. r� r/ r' r' r) � __rfloordiv__> s zDecimal.__rfloordiv__c C sU | j � r? | j � r' t d � � n | j r6 d n d } n t | � } t | � S)zFloat representation.z%Cannot convert signaling NaN to floatz-nan�nan)r� r� ri r7 r^ rm )r. �sr' r' r) � __float__E s zDecimal.__float__c C s� | j rB | j � r$ t d � � qB | j � rB t d � � qB n d | j } | j d k rz | t | j � d | j S| t | j d | j � p� d � Sd S) z1Converts self to an int, truncating if necessary.z Cannot convert NaN to integerz"Cannot convert infinity to integerr- r% r� NrP r� ) rO r� ri r� � OverflowErrorr7 rN rR r8 )r. r� r' r' r) �__int__O s zDecimal.__int__c C s | S)Nr' )r. r' r' r) �real^ s z Decimal.realc C s t d � S)Nr% )r )r. r' r' r) �imagb s z Decimal.imagc C s | S)Nr' )r. r' r' r) � conjugatef s zDecimal.conjugatec C s t t | � � S)N)�complexrm )r. r' r' r) � __complex__i s zDecimal.__complex__c C sq | j } | j | j } t | � | k rg | t | � | d � j d � } t | j | | j d � St | � S)z2Decapitate the payload of a NaN to fit the contextNrP T) r8 r@ �clamprc rd r6 r7 rN r )r. r/ ZpayloadZmax_payload_lenr' r' r) r9 l s #zDecimal._fix_nanc C s; | j r/ | j � r" | j | � St | � Sn | j � } | j � } | s� | j | g | j } t t | j | � | � } | | j k r� | j t � t | j d | � St | � Sn t | j � | j | j } | | k r| j t d | j � } | j t � | j t � | S| | k } | r4| } n | j | k r�t | j � | j | } | d k r�t | j d | d � } d } n | j | j } | | | � } | j d | � p�d } | d k rt t | � d � } t | � | j k r| d d � } | d 7} qn | | k rA| j t d | j � } n t | j | | � } | rr| rr| j t � n | r�| j t � n | r�| j t � n | j t � | s�| j t � n | S| r�| j t � n | j d k r1| j | k r1| j t � | j d | 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. rP z above Emaxr% r� r- Nr� )rO r� r9 r r� �EtoprA r� r� r� rN ra r r6 r7 rc r8 r@ r r r �_pick_rounding_functionr? r^ rR r r )r. r/ r� r� �exp_maxZnew_expZexp_minr; Zself_is_subnormalru Zrounding_method�changedr� r� r' r' r) r� x sn z Decimal._fixc C s t | j | � r d Sd Sd S)z(Also known as round-towards-0, truncate.r% r- Nr� )� _all_zerosr8 )r. r@ r' r' r) � _round_down� s zDecimal._round_downc C s | j | � S)zRounds away from 0.)r� )r. r@ r' r' r) � _round_up� s zDecimal._round_upc C s5 | j | d k r d St | j | � r- d Sd Sd S)zRounds 5 up (away from 0)Z56789r- r% Nr� )r8 r� )r. r@ r' r' r) �_round_half_up� s zDecimal._round_half_upc C s' t | j | � r d S| j | � Sd S)z Round 5 downr- Nr� )� _exact_halfr8 r� )r. r@ r' r' r) �_round_half_down� s zDecimal._round_half_downc C sJ t | j | � r9 | d k s5 | j | d d k r9 d S| j | � Sd S)z!Round 5 to even, rest to nearest.r% r- �02468Nr� )r� r8 r� )r. r@ r' r' r) �_round_half_even� s #zDecimal._round_half_evenc C s( | j r | j | � S| j | � Sd S)z(Rounds up (not away from 0 if negative.)N)r7 r� )r. r@ r' r' r) �_round_ceiling s zDecimal._round_ceilingc C s( | j s | j | � S| j | � Sd S)z'Rounds down (not towards 0 if negative)N)r7 r� )r. r@ r' r' r) � _round_floor s zDecimal._round_floorc C s< | r* | j | d d k r* | j | � S| j | � Sd S)z)Round down unless digit prec-1 is 0 or 5.r- Z05N)r8 r� )r. r@ r' r' r) � _round_05up s zDecimal._round_05upr r r r r r r r c C s� | d k rJ t | t � s* t d � � n t d d | � } | j | � S| j r} | j � rn t d � � q} t d � � n t | j d t � � 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� zcannot round a NaNzcannot round an infinity) r] rR ro r6 �quantizerO r� ri r� r� r )r. r5 rT r' r' r) � __round__! s / zDecimal.__round__c C sI | j r3 | j � r$ t d � � q3 t d � � n t | j d t � � 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. zcannot round a NaNzcannot round an infinityr% )rO r� ri r� rR r� r )r. r' r' r) � __floor___ s zDecimal.__floor__c C sI | j r3 | j � r$ t d � � q3 t d � � n t | j d t � � S)z�Return the ceiling of self, as an integer. For a finite Decimal instance self, return the least integer n such that n >= self. If self is infinite or a NaN then a Python exception is raised. zcannot round a NaNzcannot round an infinityr% )rO r� ri r� rR r� r )r. r' r' r) �__ceil__n s zDecimal.__ceil__c C s� t | d d �} t | d d �} | j s6 | j r=| d k rN t � } n | j d k rp | j t d | � S| j d k r� | j t d | � S| j d k r� | } q| j d k r� | } q| j d k r� | s� | j t d � St | j | j A} q| j d k r| s#| j t d � St | j | j A} qnB t | j | j At t | j � t | j � � | 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. r� TNrW r� r5 rX zINF * 0 in fmaz0 * INF in fma) r� rO r rN ra r r< r7 r6 r^ rR r8 r� )r. r� Zthirdr/ �productr' r' r) �fma} s6 z Decimal.fmac C s� t | � } | t k r | St | � } | t k r8 | S| d k rP t � } n | j � } | j � } | j � } | s� | s� | r| d k r� | j t d | � S| d k r� | j t d | � S| d k r� | j t d | � S| r� | j | � S| r | j | � S| j | � S| j � o7| j � o7| j � sJ| j t d � S| d k rf| j t d � S| s|| j t d � S| j � | j k r�| j t d � S| r�| r�| j t d � S| j � r�d } n | j } t t | � � } t | j � � } t | j � � } | j | t d | j | � | } x) t | j � D] } t | d | � } qGWt | | j | � } t | t | � d � S) z!Three argument version of __pow__Nr+ r� z@pow() 3rd argument not allowed unless all arguments are integersr% zApow() 2nd argument cannot be negative when 3rd argument specifiedz pow() 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� r r� ra r r9 � _isintegerr� r@ �_isevenr7 re rR rf �to_integral_valuer� rT �ranger6 r^ ) r. r� �modulor/ r� r� Z modulo_is_nanr= �base�exponent�ir' r' r) � _power_modulo� sl $zDecimal._power_moduloc C s? t | � } | j | j } } x( | d d k rI | d } | d 7} q" Wt | � } | j | j } } x( | d d k r� | d } | d 7} ql W| d k rv| | 9} x( | d d k r� | d } | d 7} q� W| d k r� d S| d | } | j d k r | } n | j � rT| j d k rT| j t | � } t | | | d � } n d } t d d d | | | � S| j d k ry| d } | d k rI| | @| k r�d St | � d } | d d } | t t | � � k r�d St | | | � } t | | | � } | d k s(| d k r,d S| | k r<d Sd | } n� | d k r@t | � d d } t d | | � \ } } | r�d Sx( | d d k r�| d } | d 8} q�W| d d } | t t | � � k r�d St | | | � } t | | | � } | d k s | d k r#d S| | k r3d Sd | } n d S| d | k rXd S| | } t d t | � | � S| d k r�| d | d } } n| d k r�t t t | | � � � | k r�d St | � } | d k rt t t | � | � � | k rd S| d | } } x< | d | d k oCd k n r_| d } | d } q$Wx< | d | d k o�d k n r�| d } | d } qcW| d k rq| d k r�| | k r�d St | | � \ } } | d k r�d Sd t | � | >} xG t | | | d � \ } } | | k r2Pq| | d | | } qW| | k oa| d k shd S| } n | d k r�| | d t | � k r�d S| | } | | 9} | d | k r�d St | � } | j � r | j d k r | j t | � } t | | | t | � � } n d } t d | d | | | � S)ah Attempt 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� rP r+ � r� � �] �A rw � rY �d )r+ r r� r )rf rR rT r= r� r7 rN r� r6 �_nbitsrc r^ �_decimal_lshift_exactr� re � _log10_lb)r. r� �p�x�xc�xe�y�yc�yer� r� ZzerosZ last_digitr� Zemaxr� rr r5 Zxc_bits�rem�ar� r� Zstr_xcr' r' r) � _power_exact� s� : / /' ' & zDecimal._power_exactc C s� | d k r | j | | | � St | � } | t k r; | S| d k rS t � } n | j | | � } | ro | S| s� | s� | j t d � St Sn d } | j d k r� | j � r� | j � s� d } q� n | r� | j t d � S| j � } n | s | j d k rt | d d � St | Sn | j � rV| j d k rCt | St | d d � Sn | t k r-| j � r�| j d k r�d } n' | | j k r�| j } n t | � } | j | } | d | j k rd | j } | j t � qn' | j t � | j t � d | j } t | d d | | � S| j � } | j � r{| j d k | d k k rpt | d d � St | Sn d } d } | j � | j � } | d k | j d k k r�| t t | j � � k r0t | d | j d � } q0n> | j � } | t t | � � k r0t | d | d � } n | d k r�| j | | j d � } | d k r�| d k r�t d | j | j � } n d } q�n | d k r~| j } t | � } | j | j } } t | � } | j | j } } | j d k r | } n d } xZ t | | | | | | � \ } } | d d t t | � � | d rUPn | d 7} q Wt | t | � | � } n | r�| j � r�t | j � | j k r�| j d t | j � } t | j | j d | | j | � } n | j � } | j! � x t" D] } d | j# | <q W| j$ | � } | j t � | j% t& rZ| j t' � n | j% t( r�| j t( d | j � n xL t' t& t t t) f D]# } | j% | r�| j | � q�q�Wn | j$ | � } | S)aH Return 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 integerrP r� FTrY rw r� z above Emax)*r r� r� r r� ra r �_Oner7 r� r� r� r6 r< r� r@ rR rN r r r� �_log10_exp_boundrc r^ rA r� r r8 rf rT r= �_dpowerrG rH �_signals�trapsr� �flagsr r r r )r. r� r� r/ r; Z result_signZ multiplierrT Zself_adj�exactZboundr� r r r r r r r �extrar� r� Z newcontextZ exceptionr' r' r) �__pow__� s� "& zDecimal.__pow__c C s/ t | � } | t k r | S| j | d | �S)z%Swaps self/other and returns __pow__.r/ )r� r� r )r. r� r/ r' r' r) �__rpow__� s zDecimal.__rpow__c C s | d k r t � } n | j r@ | j d | � } | r@ | Sn | j | � } | j � r_ | S| sx t | j d d � S| j | j � g | j } t | j � } | j } x; | j | d d k r� | | k r� | d 7} | d 8} q� Wt | j | j d | � | � S)z?Normalize- strip trailing 0s, change anything equal to 0 to 0e0Nr/ rP r% r- ) r rO r� r� r� r6 r7 rA r� r� rc r8 rN )r. r/ r; �dupr� �endrT r' r' r) � normalize� s$ & zDecimal.normalizec C s� t | d d �} | d k r* t � } n | d k rB | j } n | j sT | j r� | j | | � } | rp | S| j � s� | j � r� | j � r� | j � r� t | � S| j t d � Sn | s| j | j | � } | j | j k r| j t � | | k r| j t � qn | S| j � | j k o=| j k n sR| j t d � S| s}t | j d | j � } | j | � S| j � } | | j k r�| j t d � S| | j d | j k r�| j t d � S| j | j | � } | j � | j k r | j t d � St | j � | j k r4| j t d � S| r_| j � | j k r_| j t � n | j | j k r�| | k r�| j t � n | j t � n | j | � } | S) z�Quantize self so its exponent is the same as that of exp. Similar to self._rescale(exp._exp) but with error checking. r� TNzquantize with one INFz)target exponent out of bounds in quantizerP z9exponent of quantize result too large for current contextr- z7quantize result has too many digits for current context)r� r r? rO r� r� r ra r r� rN r r r� rA r6 r7 r� r� r@ rc r8 �Eminr )r. rT r? r/ Zwatchexpr; r� r' r' r) r� � sb ( zDecimal.quantizec C sb t | d d �} | j s$ | j rR | j � r< | j � pQ | j � oQ | j � S| j | j k S)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. r� T)r� rO r� � is_infiniterN )r. r� r/ r' r' r) � same_quantum* s zDecimal.same_quantumc C s | j r t | � S| s, t | j d | � S| j | k r` t | j | j d | j | | � St | j � | j | } | d k r� t | j d | d � } d } n | j | } | | | � } | j d | � p� d } | d k rt t | � d � } n t | j | | � S)as Rescale 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 rP r% r� r- N) rO r r6 r7 rN r8 rc r� r^ rR )r. rT r? ru Z this_functionr� r� r' r' r) r� 9 s" zDecimal._rescalec C s� | d k r t d � � n | j s+ | r5 t | � S| j | j � d | | � } | j � | j � k r� | j | j � d | | � } n | 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- )ri rO r r� r� )r. �placesr? r; r' r' r) �_round[ s #zDecimal._roundc C s� | j r/ | j d | � } | r% | St | � S| j d k rH t | � S| sa t | j d d � S| d k ry t � } n | d k r� | j } n | j d | � } | | k r� | j t � n | j t � | S)aV Rounds 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. r/ r% rP N) rO r� r rN r6 r7 r r? r� ra r r )r. r? r/ r; r' r' r) �to_integral_exactr s$ zDecimal.to_integral_exactc C s� | d k r t � } n | d k r0 | j } n | j r_ | j d | � } | rU | St | � S| j d k rx t | � S| j d | � Sd S)z@Rounds to the nearest integer, without raising inexact, rounded.Nr/ r% )r r? rO r� r rN r� )r. r? r/ r; r' r' r) r� � s zDecimal.to_integral_valuec C s | d k r t � } n | j re | j d | � } | r= | S| j � re | j d k re t | � Sn | s� t | j d | j d � } | j | � S| j d k r� | j t d � S| j d } t | � } | j d ?} | j d @r | j d } t | j � d ?d } n | j } t | j � d d ?} | | } | d k rZ| d | 9} d } n! t | d | � \ } } | } | | 8} d | } x, | | } | | k r�Pq�| | d ?} q�W| o�| | | k } | r| d k r�| d | } n | d | 9} | | 7} n | d d k r0| d 7} n t d t | � | � } | j � } | j t � } | j | � } | | _ | S) z Return the square root of self.Nr/ r% rP r+ r- zsqrt(-x), x > 0r� r Trw )r rO r� r� r7 r r6 rN r� ra r r@ rf rT rR rc r8 r� r^ � _shallow_copy� _set_roundingr r? )r. r/ r; r@ �opr� �c�lr� r r� r5 r� r? r' r' r) �sqrt� s` z Decimal.sqrtc C s t | d d �} | d k r* t � } n | j s< | j r� | j � } | j � } | s` | r� | d k r� | d k r� | j | � S| d k r� | d k r� | j | � S| j | | � Sn | j | � } | d k r� | j | � } n | d k r� | } n | } | j | � 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. r� TNr- r% r� )r� r rO r� r� r� r� � compare_total)r. r� r/ �sn�onr* r; r' r' r) r� s& z Decimal.maxc C s t | d d �} | d k r* t � } n | j s< | j r� | j � } | j � } | s` | r� | d k r� | d k r� | j | � S| d k r� | d k r� | j | � S| j | | � Sn | j | � } | d k r� | j | � } n | d k r� | } n | } | j | � 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. r� TNr- r% r� )r� r rO r� r� r� r� r- )r. r� r/ r. r/ r* r; r' r' r) r� / s& z Decimal.minc C sJ | j r d S| j d k r d S| j | j d � } | d t | � k S)z"Returns whether self is an integerFr% TNrP )rO rN r8 rc )r. �restr' r' r) r� Q s zDecimal._isintegerc C s2 | s | j d k r d S| j d | j d k S)z:Returns True if self is even. Assumes self is an integer.r% Tr- r� r� )rN r8 )r. r' r' r) r� Z s zDecimal._isevenc C s9 y | j t | j � d SWn t k r4 d SYn Xd S)z$Return the adjusted exponent of selfr- r% N)rN rc r8 ro )r. r' r' r) r� ` s zDecimal.adjustedc C s | S)z�Returns the same Decimal object. As we do not have different encodings for the same number, the received object already is in its canonical form. r' )r. r' r' r) � canonicalh s zDecimal.canonicalc C sA t | d d �} | j | | � } | 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. r� Tr/ )r� r� r� )r. r� r/ r; r' r' r) �compare_signalp s zDecimal.compare_signalc C s� t | d d �} | j r) | j r) t S| j r@ | j r@ t S| j } | j � } | j � } | sm | rs| | k r� t | j � | j f } t | j � | j f } | | k r� | r� t St Sn | | k r� | r� t St Sn t S| r0| d k r� t S| d k r t S| d k r t S| d k rpt Sqs| d k r@t S| d k rPt S| d k r`t S| d k rst Sn | | k r�t S| | k r�t S| j | j k r�| r�t St Sn | j | j k r�| r�t St Sn t S)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. r� Tr- r+ ) r� r7 � _NegativeOner r� rc r8 �_ZerorN )r. r� r/ r= Zself_nanZ other_nanZself_keyZ other_keyr' r' r) r- | sf zDecimal.compare_totalc C s7 t | d d �} | j � } | j � } | j | � 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. r� T)r� r� r- )r. r� r/ r� �or' r' r) �compare_total_mag� s zDecimal.compare_total_magc C s t d | j | j | j � S)z'Returns a copy with the sign set to 0. r% )r6 r8 rN rO )r. r' r' r) r� � s zDecimal.copy_absc C sE | j r% t d | j | j | j � St d | j | j | j � Sd S)z&Returns a copy with the sign inverted.r% r- N)r7 r6 r8 rN rO )r. r' r' r) r� � s zDecimal.copy_negatec C s1 t | d d �} t | j | j | j | j � S)z$Returns self with the sign of other.r� T)r� r6 r7 r8 rN rO )r. r� r/ r' r' r) � copy_sign� s zDecimal.copy_signc C s� | d k r t � } n | j d | � } | r4 | S| j � d k rJ t S| sT t S| j � d k rp t | � S| j } | j � } | j d k r� | t t | j d d � � k r� t d d | j d � } n�| j d k r(| t t | j � d d � � k r(t d d | j � d � } n1| j d k rj| | k rjt d d d | d d | � } n� | j d k r�| | d k r�t d d | d | d � } n� t | � } | j | j } } | j d k r�| } n d } xT t | | | | � \ } } | d d t t | � � | d r3Pn | d 7} q�Wt d t | � | � } | j � } | j t � } | j | � } | | _ | S) zReturns e ** self.Nr/ r- r% rY r� rP r> rw r� r� )r r� r� r4 r r r@ r� r7 rc r^ rA r6 r� rf rR rT r= �_dexpr' r( r r� r? ) r. r/ r; r �adjr) r* r� r r� rT r? r' r' r) rT � sJ 2 6 & " & z Decimal.expc C s d S)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, s zDecimal.is_canonicalc C s | 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. )rO )r. r' r' r) � is_finite4 s zDecimal.is_finitec C s | j d k S)z8Return True if self is infinite; otherwise return False.rX )rN )r. r' r' r) r" < s zDecimal.is_infinitec C s | j d k S)z>Return True if self is a qNaN or sNaN; otherwise return False.r5 rW )r5 rW )rN )r. r' r' r) r� @ s zDecimal.is_nanc C s? | j s | r d S| d k r, t � } n | j | j � k S)z?Return True if self is a normal number; otherwise return False.FN)rO r r! r� )r. r/ r' r' r) � is_normalD s zDecimal.is_normalc C s | j d k S)z;Return True if self is a quiet NaN; otherwise return False.r5 )rN )r. r' r' r) r� L s zDecimal.is_qnanc C s | j d k S)z8Return True if self is negative; otherwise return False.r- )r7 )r. r' r' r) � is_signedP s zDecimal.is_signedc C s | j d k S)z?Return True if self is a signaling NaN; otherwise return False.rW )rN )r. r' r' r) r� T s zDecimal.is_snanc C s? | j s | r d S| d k r, t � } n | j � | j k S)z9Return True if self is subnormal; otherwise return False.FN)rO r r� r! )r. r/ r' r' r) � is_subnormalX s zDecimal.is_subnormalc C s | j o | j d k S)z6Return True if self is a zero; otherwise return False.rP )rO r8 )r. r' r' r) �is_zero` s zDecimal.is_zeroc C s� | j t | j � d } | d k rB t t | d d � � d S| d k rn t t d | d d � � d St | � } | j | j } } | d k r� t | d | � } t | � } t | � t | � | | k S| t t d | | � � d S)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� r� )rN rc r8 r^ rf rR rT )r. r9 r) r* r� �num�denr' r' r) � _ln_exp_boundd s zDecimal._ln_exp_boundc C st | d k r t � } n | j d | � } | r4 | S| s> t S| j � d k rT t S| t k rd t S| j d k r� | j t d � St | � } | j | j } } | j } | | j � d } xP t | | | � } | d d t t t | � � � | d rPn | d 7} q� Wt t | d k � t t | � � | � } | j � } | j t � } | j | � } | | _ | S) z/Returns the natural (base e) logarithm of self.Nr/ r- zln of a negative valuer+ rw r� rY r% )r r� �_NegativeInfinityr� � _Infinityr r4 r7 ra r rf rR rT r@ rC �_dlogrc r^ re r6 r' r( r r� r? ) r. r/ r; r) r* r� r r$ r� r? r' r' r) �ln} s: ,+ z Decimal.lnc C s | j t | j � d } | d k r: t t | � � d S| d k r^ t t d | � � d St | � } | j | j } } | d k r� t | d | � } t d | � } t | � t | � | | k d St d | | � } t | � | | d k d S) 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� �� Z231r� r� )rN rc r8 r^ rf rR rT )r. r9 r) r* r� rA rB r' r' r) r � s "zDecimal._log10_exp_boundc C s� | d k r t � } n | j d | � } | r4 | S| s> t S| j � d k rT t S| j d k rs | j t d � S| j d d k r� | j d d � d t | j � d k r� t | j t | j � d � } n� t | � } | j | j } } | j } | | j � d } xP t | | | � } | d d t t t | � � � | d rTPn | d 7} qWt t | d k � t t | � � | � } | j � } | j t � } | j | � } | | _ | S) z&Returns the base 10 logarithm of self.Nr/ r- zlog10 of a negative valuer% r� rP r+ rw r� rY )r r� rD r� rE r7 ra r r8 rc r rN rf rR rT r@ r �_dlog10r^ re r6 r' r( r r� r? ) r. r/ r; r) r* r� r r$ r� r? r' r' r) �log10� s: =# ,+ z Decimal.log10c C s| | j d | � } | r | S| d k r4 t � } n | j � rD t S| s] | j t d d � St | j � � } | j | � 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). r/ Nzlogb(0)r- ) r� r r� rE ra r r r� r� )r. r/ r; r' r' r) �logb s z Decimal.logbc C sJ | j d k s | j d k r" d Sx! | j D] } | d k r, d Sq, Wd S)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)r7 rN r8 )r. �digr' r' r) � _islogical s zDecimal._islogicalc C s� | j t | � } | d k r0 d | | } n# | d k rS | | j d � } n | j t | � } | d k r� d | | } n# | d k r� | | j d � } n | | f S)Nr% rP )r@ rc )r. r/ �opa�opbZdifr' r' r) � _fill_logical, s zDecimal._fill_logicalc C s� | d k r t � } n t | d d �} | j � sD | j � rQ | j t � S| j | | j | j � \ } } d j d d � t | | � D� � } t d | j d � p� d d � S) z;Applies an 'and' operation between self and other's digits.Nr� TrS c S s2 g | ]( \ } } t t | � t | � @� � q Sr' )r^ rR )�.0r �br' r' r) � <listcomp>G s z'Decimal.logical_and.<locals>.<listcomp>r% rP ) r r� rM ra r rP r8 rk �zipr6 rd )r. r� r/ rN rO r r' r' r) � logical_and9 s !%zDecimal.logical_andc C s; | d k r t � } n | j t d d | j d � | � S)zInvert all its digits.Nr% r� )r � logical_xorr6 r@ )r. r/ r' r' r) �logical_invertJ s zDecimal.logical_invertc C s� | d k r t � } n t | d d �} | j � sD | j � rQ | j t � S| j | | j | j � \ } } d j d d � t | | � D� � } t d | j d � p� d d � S) z:Applies an 'or' operation between self and other's digits.Nr� TrS c S s2 g | ]( \ } } t t | � t | � B� � q Sr' )r^ rR )rQ r rR r' r' r) rS _ s z&Decimal.logical_or.<locals>.<listcomp>r% rP ) r r� rM ra r rP r8 rk rT r6 rd )r. r� r/ rN rO r r' r' r) � logical_orQ s !%zDecimal.logical_orc C s� | d k r t � } n t | d d �} | j � sD | j � rQ | j t � S| j | | j | j � \ } } d j d d � t | | � D� � } t d | j d � p� d d � S) z;Applies an 'xor' operation between self and other's digits.Nr� TrS c S s2 g | ]( \ } } t t | � t | � A� � q Sr' )r^ rR )rQ r rR r' r' r) rS p s z'Decimal.logical_xor.<locals>.<listcomp>r% rP ) r r� rM ra r rP r8 rk rT r6 rd )r. r� r/ rN rO r r' r' r) rV b s !%zDecimal.logical_xorc C s t | d d �} | d k r* t � } n | j s< | j r� | j � } | j � } | s` | r� | d k r� | d k r� | j | � S| d k r� | d k r� | j | � S| j | | � Sn | j � j | j � � } | d k r� | j | � } n | d k r | } n | } | j | � S)z8Compares the values numerically with their sign ignored.r� TNr- r% r� ) r� r rO r� r� r� r� r� r- )r. r� r/ r. r/ r* r; r' r' r) �max_mags s& zDecimal.max_magc C s t | d d �} | d k r* t � } n | j s< | j r� | j � } | j � } | s` | r� | d k r� | d k r� | j | � S| d k r� | d k r� | j | � S| j | | � Sn | j � j | j � � } | d k r� | j | � } n | d k r | } n | } | j | � S)z8Compares the values numerically with their sign ignored.r� TNr- r% r� ) r� r rO r� r� r� r� r� r- )r. r� r/ r. r/ r* r; r' r' r) �min_mag� s& zDecimal.min_magc C s� | d k r t � } n | j d | � } | r4 | S| j � d k rJ t S| j � d k ry t d d | j | j � � S| j � } | j t � | j � | j | � } | | k r� | S| j t d d | j � d � | � S)z=Returns the largest representable number smaller than itself.Nr/ r- r% r> r� r� )r r� r� rD r6 r@ r� rG r( r �_ignore_all_flagsr� r� r� )r. r/ r; �new_selfr' r' r) � next_minus� s" zDecimal.next_minusc C s� | d k r t � } n | j d | � } | r4 | S| j � d k rJ t S| j � d k ry t d d | j | j � � S| j � } | j t � | j � | j | � } | | k r� | S| j t d d | j � d � | � S)z=Returns the smallest representable number larger than itself.Nr/ r- r> r% r� r� )r r� r� rE r6 r@ r� rG r( r r[ r� r� r� )r. r/ r; r\ r' r' r) � next_plus� s" zDecimal.next_plusc C s@ t | d d �} | d k r* t � } n | j | | � } | rF | S| j | � } | d k rn | j | � S| d k r� | j | � } n | j | � } | j � r� | j t d | j � | j t � | j t � nb | j � | j k r<| j t � | j t � | j t � | j t � | s<| j t � q<n | 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. r� TNr% r- z Infinite result from next_towardr� )r� r r� r� r7 r^ r] r� ra r r7 r r r� r! r r r )r. r� r/ r; Z comparisonr' r' r) � next_toward� s4 zDecimal.next_towardc C s� | j � r d S| j � r d S| j � } | d k r< d S| d k rL d S| j � rl | j re d Sd Sn | d k r� t � } n | j d | � r� | j r� d Sd Sn | j r� d Sd Sd S)a Returns 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 +Infinityz -Infinityz-Zeroz+ZeroNr/ z -Subnormalz +Subnormalz-Normalz+Normalr� )r� r� r� r? r7 r r> )r. r/ �infr' r' r) � number_class s, zDecimal.number_classc C s t d � S)z'Just returns 10, as this is Decimal, :)r� )r )r. r' r' r) �radix5 s z Decimal.radixc C sV | d k r t � } n t | d d �} | j | | � } | rF | S| j d k rb | j t � S| j t | � k o� | j k n s� | j t � S| j � r� t | � St | � } | j } | j t | � } | d k r� d | | } n | d k r| | d � } n | | d � | d | � } t | j | j d � pLd | j � S)z5Returns a rotated copy of self, value-of-other times.Nr� Tr% rP )r r� r� rN ra r r@ rR r� r r8 rc r6 r7 rd )r. r� r/ r; �torot�rotdig�topadZrotatedr' r' r) �rotate9 s, ) zDecimal.rotatec C s | d k r t � } n t | d d �} | j | | � } | rF | S| j d k rb | j t � Sd | j | j } d | j | j } | t | � k o� | k n s� | j t � S| j � r� t | � St | j | j | j t | � � } | j | � } | S)z>Returns self operand after adding the second value to its exp.Nr� Tr% r+ r� )r r� r� rN ra r rA r@ rR r� r r6 r7 r8 r� )r. r� r/ r; ZliminfZlimsupr} r' r' r) �scalebZ s" " %zDecimal.scalebc C sy | d k r t � } n t | d d �} | j | | � } | rF | S| j d k rb | j t � S| j t | � k o� | j k n s� | j t � S| j � r� t | � St | � } | j } | j t | � } | d k r� d | | } n | d k r| | d � } n | d k r2| d | � } n" | d | } | | j d � } t | j | j d � pod | j � S)z5Returns a shifted copy of self, value-of-other times.Nr� Tr% rP )r r� r� rN ra r r@ rR r� r r8 rc r6 r7 rd )r. r� r/ r; rc rd re Zshiftedr' r' r) r� s s2 ) z Decimal.shiftc C s | j t | � f f S)N)� __class__r^ )r. r' r' r) � __reduce__� s zDecimal.__reduce__c C s) t | � t k r | S| j t | � � S)N)�typer rh r^ )r. r' r' r) �__copy__� s zDecimal.__copy__c C s) t | � t k r | S| j t | � � S)N)rj r rh r^ )r. �memor' r' r) � __deepcopy__� s zDecimal.__deepcopy__c C s | d k r t � } n t | d | �} | j r� t | j | � } t | j � � } | d d k rt | d 7} n t | | | � S| d d k r� d d g | j | d <n | d d k r� t | j | j | j d � } n | j } | d } | d k r�| d d k r(| j | d | � } q�| d d k rN| j | | � } q�| d d k r�t | j � | k r�| j | | � } q�n | r�| j d k r�| d d k r�| j d | � } n | j t | j � } | d d k r| r | d k r d | } qkd } nV | d d k r.| } n= | d d k rk| j d k rb| d k rb| } qkd } n | d k r�d } d | | j } nh | t | j � k r�| j d | t | j � } d } n, | j d | � p�d } | j | d � } | | } t | j | | | | � S)a| Format a Decimal instance according to the given specifier. The specifier should be a standard format specifier, with the form described in PEP 3101. Formatting types 'e', 'E', 'f', 'F', 'g', 'G', 'n' and '%' are supported. If the formatting type is omitted it defaults to 'g' or 'G', depending on the value of context.capitals. N� _localeconvrj �%�g�Gr+ � precision�eEr- zfF%ZgGr% r� rP rS i����)r �_parse_format_specifierrO � _format_signr7 r^ r� � _format_alignr� r6 r8 rN r? r% r� rc �_format_number)r. Z specifierr/ rn �specr= �bodyr? rr r� r� rs rt rT r' r' r) � __format__� sZ " %& zDecimal.__format__)z_expz_intz_signz _is_special)�r1 r2 r3 r4 � __slots__r\ � classmethodrn 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__r� �propertyr� r� r� r9 r� r� r� r� r� r� r� r� r� �dictr� r� r� r� r� r r r r r r� r# r� r% r& r� � to_integralr, r� r� r� r� r� r1 r2 r- r6 r� r� r7 rT r: r; r" r� r< r� r= r� r> r? rC rG r rJ rK rM rP rU rW rX rV rY rZ r] r^ r_ ra rb rf rg r� ri rk rm rz r' r' r' r) r ) s �( ! @ 4 V7; !$K f > ,U ��G " c*" I K 2 3 .* !' Fc C s7 t j 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*. )r[ r\ r r7 r8 rN rO )r= Z coefficientr� Zspecialr. r' r' r) r6 � s r6 c @ s: e Z d Z d Z d d � Z d d � Z d d � Z d S) rM z�Context manager class to support localcontext(). Sets a copy of the supplied context in __enter__() and restores the previous decimal context in __exit__() c C s | j � | _ d S)N)rG � new_context)r. r� r' r' r) �__init__ s z_ContextManager.__init__c C s t � | _ t | j � | j S)N)r � saved_contextr r� )r. r' r' r) � __enter__ s z_ContextManager.__enter__c C s t | j � d S)N)r r� )r. �t�v�tbr' r' r) �__exit__ s z_ContextManager.__exit__N)r1 r2 r3 r4 r� r� r� r' r' r' r) rM s rM c @ s e Z d Z d Z d d d d d d d d d d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z e Z d d d � Z d d � Z d d � Z d d � Z d Z d! d" � Z d# d$ � Z d% d& � Z d' d( d) � Z d* d+ � Z d, d- � Z d. d/ � Z d0 d1 � Z d2 d3 � Z d4 d5 � Z d6 d7 � Z d8 d9 � Z d: d; � Z! d< d= � Z" d> d? � Z# d@ dA � Z$ dB dC � Z% dD dE � Z& dF dG � Z' dH dI � Z( dJ dK � Z) dL dM � Z* dN dO � Z+ dP dQ � Z, dR dS � Z- dT dU � Z. dV dW � Z/ dX dY � Z0 dZ d[ � Z1 d\ d] � Z2 d^ d_ � Z3 d` da � Z4 db dc � Z5 dd de � Z6 df dg � Z7 dh di � Z8 dj dk � Z9 dl dm � Z: dn do � Z; dp dq � Z< dr ds � Z= dt du � Z> dv dw � Z? dx dy � Z@ dz d{ � ZA d| d} � ZB d~ d � ZC d� d� � ZD d� d� � ZE d� d� � ZF d� d� � ZG d d� d� � ZH d� d� � ZI d� d� � ZJ d� d� � ZK d� d� � ZL d� d� � ZM d� d� � ZN d� d� � ZO d� d� � ZP d� d� � ZQ d� d� � ZR d� d� � ZS d� d� � ZT d� d� � ZU d� d� � ZV eV ZW d S)�r a� 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� y t } Wn t k r Yn X| d k r1 | n | j | _ | d k rO | n | j | _ | d k rm | n | j | _ | d k r� | n | j | _ | d k r� | n | j | _ | d k r� | n | j | _ | d k r� g | _ n | | _ � d k r| j j � | _ nA t � t � sMt � f d d � t � D� � | _ n � | _ � d k rzt j t d � | _ nA t � t � s�t � f d d � t � D� � | _ n � | _ d S)Nc 3 s' | ] } | t | � k � f Vq d S)N)rR )rQ r� )r r' r) � <genexpr>N s z#Context.__init__.<locals>.<genexpr>r% c 3 s' | ] } | t | � k � f Vq d S)N)rR )rQ r� )r r' r) r� U s )r � NameErrorr@ r? r! rA r� r� �_ignored_flagsr rG r] r� r �fromkeysr ) r. r@ r? r! rA r� r� r r r� Zdcr' )r r r) r� 5 s. ) )zContext.__init__c C s� t | t � s" t d | � � n | d k r\ | | k r� t d | | | | f � � q� nq | d k r� | | k r� t d | | | | f � � q� n7 | | k s� | | k r� t d | | | | f � � n t j | | | � S)Nz%s must be an integerz-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)r] rR ro ri r[ � __setattr__)r. �namerq ZvminZvmaxr' r' r) �_set_integer_checkY s " " zContext._set_integer_checkc C s� t | t � s" t d | � � n x- | D]% } | t k r) t d | � � q) q) Wx- t D]% } | | k rY t d | � � qY qY Wt j | | | � S)Nz%s must be a signal dictz %s is not a valid signal dict)r] r� ro r �KeyErrorr[ r� )r. r� r} �keyr' r' r) �_set_signal_dictg s zContext._set_signal_dictc C sC | d k r" | j | | d d � S| d k rD | j | | d d � S| d k rf | j | | d d � S| d k r� | j | | d d � S| d k r� | j | | d d � S| d k r� | t k r� t d | � � n t j | | | � S| d k s | d k r| j | | � S| d k r/t j | | | � St d | � � d S)Nr@ r- r` r! z-infr% rA r� r� r? z%s: invalid rounding moder r r� z.'decimal.Context' object has no attribute '%s')r� �_rounding_modesro r[ r� r� rK )r. r� rq r' r' r) r� r s( zContext.__setattr__c C s t d | � � d S)Nz%s cannot be deleted)rK )r. r� r' r' r) � __delattr__� s zContext.__delattr__c C so d d � | j j � D� } d d � | j j � D� } | j | j | j | j | j | j | j | | f f S)Nc S s" g | ] \ } } | r | � q Sr' r' )rQ �sigr� r' r' r) rS � s z&Context.__reduce__.<locals>.<listcomp>c S s" g | ] \ } } | r | � q Sr' r' )rQ r� r� r' r' r) rS � s ) r �itemsr rh r@ r? r! rA r� r� )r. r r r' r' r) ri � s zContext.__reduce__c C s� g } | j d t | � � d d � | j j � D� } | j d d j | � d � d d � | j j � D� } | j d d j | � d � d j | � d S) zShow the current context.zrContext(prec=%(prec)d, rounding=%(rounding)s, Emin=%(Emin)d, Emax=%(Emax)d, capitals=%(capitals)d, clamp=%(clamp)dc S s% g | ] \ } } | r | j � q Sr' )r1 )rQ r| r� r' r' r) rS � s z$Context.__repr__.<locals>.<listcomp>zflags=[z, �]c S s% g | ] \ } } | r | j � q Sr' )r1 )rQ r� r� r' r' r) rS � s ztraps=[�))rj �varsr r� rk r )r. r� �namesr' r' r) r� � s zContext.__repr__c C s% x | j D] } d | j | <q Wd S)zReset all flags to zeror% N)r )r. �flagr' r' r) rH � s zContext.clear_flagsc C s% x | j D] } d | j | <q Wd S)zReset all traps to zeror% N)r )r. r� r' r' r) � clear_traps� s zContext.clear_trapsc C sC t | j | j | j | j | j | j | j | j | j � } | S)z!Returns a shallow copy from self.) r r@ r? r! rA r� r� r r r� )r. �ncr' r' r) r' � s zContext._shallow_copyc C sO t | j | j | j | j | j | j | j j � | j j � | j � } | S)z Returns a deep copy from self.) r r@ r? r! rA r� r� r rG r r� )r. r� r' r' r) rG � s z Context.copyc G sq t j | | � } | | j k r4 | � j | | � Sd | j | <| j | sa | � j | | � S| | � � d 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- N)�_condition_map�getr� r0 r r )r. Z conditionZ explanationr( �errorr' r' r) ra � s zContext._raise_errorc C s | j t � S)z$Ignore all flags, if they are raised)� _ignore_flagsr )r. r' r' r) r[ � s zContext._ignore_all_flagsc G s | j t | � | _ t | � S)z$Ignore the flags, if they are raised)r� rg )r. r r' r' r) r� � s zContext._ignore_flagsc G sQ | r, t | d t t f � r, | d } n x | D] } | j j | � q3 Wd S)z+Stop ignoring the flags, if they are raisedr% N)r] rh rg r� �remove)r. r r� r' r' r) � _regard_flags� s zContext._regard_flagsc C s t | j | j d � S)z!Returns Etiny (= Emin - prec + 1)r- )rR r! r@ )r. r' r' r) r� � s z Context.Etinyc C s t | j | j d � S)z,Returns maximum exponent (= Emax - prec + 1)r- )rR rA r@ )r. r' r' r) r� � s z Context.Etopc C s | 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. )r? )r. rj r? r' r' r) r( � s zContext._set_roundingrP c C s� t | t � r1 | | j � k r1 | j t d � St | d | �} | j � r~ t | j � | j | j k r~ | j t d � S| j | � S)z�Creates a new Decimal instance but using self as context. This method implements the to-number operation of the IBM Decimal specification.z/no trailing or leading whitespace is permitted.r/ z diagnostic info too long in NaN) r] r^ r` ra r r r� rc r8 r@ r� r� )r. rA r} r' r' r) �create_decimal s ! + zContext.create_decimalc C s t j | � } | j | � 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 )r rn r� )r. r| r} r' r' r) �create_decimal_from_float s z!Context.create_decimal_from_floatc C s" t | d d �} | 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') r� Tr/ )r� r� )r. r r' r' r) re & s z Context.absc C sN t | d d �} | j | d | �} | t k rF t d | � � n | Sd 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') r� Tr/ z Unable to convert %s to DecimalN)r� r� r� ro )r. r rR r� r' r' r) �add; s z Context.addc C s t | j | � � S)N)r^ r� )r. r r' r' r) �_applyP s zContext._applyc C s( t | t � s t d � � n | j � 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.)r] r ro r1 )r. r r' r' r) r1 S s zContext.canonicalc C s% t | d d �} | 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') r� Tr/ )r� r� )r. r rR r' r' r) r� ` s !zContext.comparec C s% t | d d �} | j | d | �S)a Compares 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') r� Tr/ )r� r2 )r. r rR r' r' r) r2 � s zContext.compare_signalc C s t | d d �} | j | � 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') r� T)r� r- )r. r rR r' r' r) r- � s zContext.compare_totalc C s t | d d �} | j | � S)z�Compares two operands using their abstract representation ignoring sign. Like compare_total, but with operand's sign ignored and assumed to be 0. r� T)r� r6 )r. r rR r' r' r) r6 � s zContext.compare_total_magc C s t | d d �} | j � S)a Returns 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') r� T)r� r� )r. r r' r' r) r� � s zContext.copy_absc C s t | d d �} t | � S)a Returns 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') r� T)r� r )r. r r' r' r) � copy_decimal� s zContext.copy_decimalc C s t | d d �} | j � S)a( Returns a copy of the operand with the sign inverted. >>> ExtendedContext.copy_negate(Decimal('101.5')) Decimal('-101.5') >>> ExtendedContext.copy_negate(Decimal('-101.5')) Decimal('101.5') >>> ExtendedContext.copy_negate(1) Decimal('-1') r� T)r� r� )r. r r' r' r) r� � s zContext.copy_negatec C s t | d d �} | j | � S)a Copies 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') r� T)r� r7 )r. r rR r' r' r) r7 � s zContext.copy_signc C sN t | d d �} | j | d | �} | t k rF t d | � � n | Sd S)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') r� Tr/ z Unable to convert %s to DecimalN)r� r� r� ro )r. r rR r� r' r' r) �divide s zContext.dividec C sN t | d d �} | j | d | �} | t k rF t d | � � n | Sd S)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') r� Tr/ z Unable to convert %s to DecimalN)r� r� r� ro )r. r rR r� r' r' r) � divide_int0 s zContext.divide_intc C sN t | d d �} | j | d | �} | t k rF t d | � � n | Sd S)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')) r� Tr/ z Unable to convert %s to DecimalN)r� r� r� ro )r. r rR r� r' r' r) r� G s zContext.divmodc C s" t | d d �} | j d | � S)a# Returns e ** a. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.exp(Decimal('-Infinity')) Decimal('0') >>> c.exp(Decimal('-1')) Decimal('0.367879441') >>> c.exp(Decimal('0')) Decimal('1') >>> c.exp(Decimal('1')) Decimal('2.71828183') >>> c.exp(Decimal('0.693147181')) Decimal('2.00000000') >>> c.exp(Decimal('+Infinity')) Decimal('Infinity') >>> c.exp(10) Decimal('22026.4658') r� Tr/ )r� rT )r. r r' r' r) rT \ s z Context.expc C s( t | d d �} | 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') r� Tr/ )r� r� )r. r rR r* r' r' r) r� t s z Context.fmac C s( t | t � s t d � � n | j � S)a Return 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.)r] r ro r: )r. r r' r' r) r: � s zContext.is_canonicalc C s t | d d �} | j � S)a, Return True if the operand is finite; otherwise return False. A Decimal instance is considered finite if it is neither infinite nor a NaN. >>> ExtendedContext.is_finite(Decimal('2.50')) True >>> ExtendedContext.is_finite(Decimal('-0.3')) True >>> ExtendedContext.is_finite(Decimal('0')) True >>> ExtendedContext.is_finite(Decimal('Inf')) False >>> ExtendedContext.is_finite(Decimal('NaN')) False >>> ExtendedContext.is_finite(1) True r� T)r� r; )r. r r' r' r) r; � s zContext.is_finitec C s t | d d �} | j � S)aU Return 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 r� T)r� r" )r. r r' r' r) r" � s zContext.is_infinitec C s t | d d �} | j � S)aO Return 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 r� T)r� r� )r. r r' r' r) r� � s zContext.is_nanc C s" t | d d �} | j d | � S)a� Return True if the operand is a normal number; otherwise return False. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.is_normal(Decimal('2.50')) True >>> c.is_normal(Decimal('0.1E-999')) False >>> c.is_normal(Decimal('0.00')) False >>> c.is_normal(Decimal('-Inf')) False >>> c.is_normal(Decimal('NaN')) False >>> c.is_normal(1) True r� Tr/ )r� r< )r. r r' r' r) r< � s zContext.is_normalc C s t | d d �} | j � S)aH Return 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 r� T)r� r� )r. r r' r' r) r� � s zContext.is_qnanc C s t | d d �} | j � S)a� Return True if the operand is negative; otherwise return False. >>> ExtendedContext.is_signed(Decimal('2.50')) False >>> ExtendedContext.is_signed(Decimal('-12')) True >>> ExtendedContext.is_signed(Decimal('-0')) True >>> ExtendedContext.is_signed(8) False >>> ExtendedContext.is_signed(-8) True r� T)r� r= )r. r r' r' r) r= � s zContext.is_signedc C s t | d d �} | j � S)aT Return 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 r� T)r� r� )r. r r' r' r) r� s zContext.is_snanc C s" t | d d �} | j d | � S)a� Return True if the operand is subnormal; otherwise return False. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.is_subnormal(Decimal('2.50')) False >>> c.is_subnormal(Decimal('0.1E-999')) True >>> c.is_subnormal(Decimal('0.00')) False >>> c.is_subnormal(Decimal('-Inf')) False >>> c.is_subnormal(Decimal('NaN')) False >>> c.is_subnormal(1) False r� Tr/ )r� r> )r. r r' r' r) r> s zContext.is_subnormalc C s t | d d �} | j � S)au Return 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 r� T)r� r? )r. r r' r' r) r? * s zContext.is_zeroc C s" t | d d �} | j d | � S)a� Returns the natural (base e) logarithm of the operand. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.ln(Decimal('0')) Decimal('-Infinity') >>> c.ln(Decimal('1.000')) Decimal('0') >>> c.ln(Decimal('2.71828183')) Decimal('1.00000000') >>> c.ln(Decimal('10')) Decimal('2.30258509') >>> c.ln(Decimal('+Infinity')) Decimal('Infinity') >>> c.ln(1) Decimal('0') r� Tr/ )r� rG )r. r r' r' r) rG ; s z Context.lnc C s" t | d d �} | j d | � S)a� Returns the base 10 logarithm of the operand. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.log10(Decimal('0')) Decimal('-Infinity') >>> c.log10(Decimal('0.001')) Decimal('-3') >>> c.log10(Decimal('1.000')) Decimal('0') >>> c.log10(Decimal('2')) Decimal('0.301029996') >>> c.log10(Decimal('10')) Decimal('1') >>> c.log10(Decimal('70')) Decimal('1.84509804') >>> c.log10(Decimal('+Infinity')) Decimal('Infinity') >>> c.log10(0) Decimal('-Infinity') >>> c.log10(1) Decimal('0') r� Tr/ )r� rJ )r. r r' r' r) rJ Q s z Context.log10c C s" t | d d �} | j d | � S)a4 Returns the exponent of the magnitude of the operand's MSD. The result is the integer which is the exponent of the magnitude of the most significant digit of the operand (as though the operand were truncated to a single digit while maintaining the value of that digit and without limiting the resulting exponent). >>> ExtendedContext.logb(Decimal('250')) Decimal('2') >>> ExtendedContext.logb(Decimal('2.50')) Decimal('0') >>> ExtendedContext.logb(Decimal('0.03')) Decimal('-2') >>> ExtendedContext.logb(Decimal('0')) Decimal('-Infinity') >>> ExtendedContext.logb(1) Decimal('0') >>> ExtendedContext.logb(10) Decimal('1') >>> ExtendedContext.logb(100) Decimal('2') r� Tr/ )r� rK )r. r r' r' r) rK m s z Context.logbc C s% t | d d �} | j | d | �S)a� Applies the logical operation 'and' between each operand's digits. The operands must be both logical numbers. >>> ExtendedContext.logical_and(Decimal('0'), Decimal('0')) Decimal('0') >>> ExtendedContext.logical_and(Decimal('0'), Decimal('1')) Decimal('0') >>> ExtendedContext.logical_and(Decimal('1'), Decimal('0')) Decimal('0') >>> ExtendedContext.logical_and(Decimal('1'), Decimal('1')) Decimal('1') >>> ExtendedContext.logical_and(Decimal('1100'), Decimal('1010')) Decimal('1000') >>> ExtendedContext.logical_and(Decimal('1111'), Decimal('10')) Decimal('10') >>> ExtendedContext.logical_and(110, 1101) Decimal('100') >>> ExtendedContext.logical_and(Decimal(110), 1101) Decimal('100') >>> ExtendedContext.logical_and(110, Decimal(1101)) Decimal('100') r� Tr/ )r� rU )r. r rR r' r' r) rU � s zContext.logical_andc C s" t | d d �} | j d | � S)a Invert 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') r� Tr/ )r� rW )r. r r' r' r) rW � s zContext.logical_invertc C s% t | d d �} | j | d | �S)a� Applies the logical operation 'or' between each operand's digits. The operands must be both logical numbers. >>> ExtendedContext.logical_or(Decimal('0'), Decimal('0')) Decimal('0') >>> ExtendedContext.logical_or(Decimal('0'), Decimal('1')) Decimal('1') >>> ExtendedContext.logical_or(Decimal('1'), Decimal('0')) Decimal('1') >>> ExtendedContext.logical_or(Decimal('1'), Decimal('1')) Decimal('1') >>> ExtendedContext.logical_or(Decimal('1100'), Decimal('1010')) Decimal('1110') >>> ExtendedContext.logical_or(Decimal('1110'), Decimal('10')) Decimal('1110') >>> ExtendedContext.logical_or(110, 1101) Decimal('1111') >>> ExtendedContext.logical_or(Decimal(110), 1101) Decimal('1111') >>> ExtendedContext.logical_or(110, Decimal(1101)) Decimal('1111') r� Tr/ )r� rX )r. r rR r' r' r) rX � s zContext.logical_orc C s% t | d d �} | j | d | �S)a� Applies the logical operation 'xor' between each operand's digits. The operands must be both logical numbers. >>> ExtendedContext.logical_xor(Decimal('0'), Decimal('0')) Decimal('0') >>> ExtendedContext.logical_xor(Decimal('0'), Decimal('1')) Decimal('1') >>> ExtendedContext.logical_xor(Decimal('1'), Decimal('0')) Decimal('1') >>> ExtendedContext.logical_xor(Decimal('1'), Decimal('1')) Decimal('0') >>> ExtendedContext.logical_xor(Decimal('1100'), Decimal('1010')) Decimal('110') >>> ExtendedContext.logical_xor(Decimal('1111'), Decimal('10')) Decimal('1101') >>> ExtendedContext.logical_xor(110, 1101) Decimal('1011') >>> ExtendedContext.logical_xor(Decimal(110), 1101) Decimal('1011') >>> ExtendedContext.logical_xor(110, Decimal(1101)) Decimal('1011') r� Tr/ )r� rV )r. r rR r' r' r) rV � s zContext.logical_xorc C s% t | d d �} | j | d | �S)a� max compares two values numerically and returns the maximum. If either operand is a NaN then the general rules apply. Otherwise, the operands are compared as though by the compare operation. If they are numerically equal then the left-hand operand is chosen as the result. Otherwise the maximum (closer to positive infinity) of the two operands is chosen as the result. >>> ExtendedContext.max(Decimal('3'), Decimal('2')) Decimal('3') >>> ExtendedContext.max(Decimal('-10'), Decimal('3')) Decimal('3') >>> ExtendedContext.max(Decimal('1.0'), Decimal('1')) Decimal('1') >>> ExtendedContext.max(Decimal('7'), Decimal('NaN')) Decimal('7') >>> ExtendedContext.max(1, 2) Decimal('2') >>> ExtendedContext.max(Decimal(1), 2) Decimal('2') >>> ExtendedContext.max(1, Decimal(2)) Decimal('2') r� Tr/ )r� r� )r. r rR r' r' r) r� � s z Context.maxc C s% t | d d �} | j | d | �S)a� Compares the values numerically with their sign ignored. >>> ExtendedContext.max_mag(Decimal('7'), Decimal('NaN')) Decimal('7') >>> ExtendedContext.max_mag(Decimal('7'), Decimal('-10')) Decimal('-10') >>> ExtendedContext.max_mag(1, -2) Decimal('-2') >>> ExtendedContext.max_mag(Decimal(1), -2) Decimal('-2') >>> ExtendedContext.max_mag(1, Decimal(-2)) Decimal('-2') r� Tr/ )r� rY )r. r rR r' r' r) rY s zContext.max_magc C s% t | d d �} | j | d | �S)a� min compares two values numerically and returns the minimum. If either operand is a NaN then the general rules apply. Otherwise, the operands are compared as though by the compare operation. If they are numerically equal then the left-hand operand is chosen as the result. Otherwise the minimum (closer to negative infinity) of the two operands is chosen as the result. >>> ExtendedContext.min(Decimal('3'), Decimal('2')) Decimal('2') >>> ExtendedContext.min(Decimal('-10'), Decimal('3')) Decimal('-10') >>> ExtendedContext.min(Decimal('1.0'), Decimal('1')) Decimal('1.0') >>> ExtendedContext.min(Decimal('7'), Decimal('NaN')) Decimal('7') >>> ExtendedContext.min(1, 2) Decimal('1') >>> ExtendedContext.min(Decimal(1), 2) Decimal('1') >>> ExtendedContext.min(1, Decimal(29)) Decimal('1') r� Tr/ )r� r� )r. r rR r' r' r) r� s z Context.minc C s% t | d d �} | j | d | �S)a� Compares the values numerically with their sign ignored. >>> ExtendedContext.min_mag(Decimal('3'), Decimal('-2')) Decimal('-2') >>> ExtendedContext.min_mag(Decimal('-3'), Decimal('NaN')) Decimal('-3') >>> ExtendedContext.min_mag(1, -2) Decimal('1') >>> ExtendedContext.min_mag(Decimal(1), -2) Decimal('1') >>> ExtendedContext.min_mag(1, Decimal(-2)) Decimal('1') r� Tr/ )r� rZ )r. r rR r' r' r) rZ 2 s zContext.min_magc C s" t | d d �} | j d | � S)a� Minus corresponds to unary prefix minus in Python. The operation is evaluated using the same rules as subtract; the operation minus(a) is calculated as subtract('0', a) where the '0' has the same exponent as the operand. >>> ExtendedContext.minus(Decimal('1.3')) Decimal('-1.3') >>> ExtendedContext.minus(Decimal('-1.3')) Decimal('1.3') >>> ExtendedContext.minus(1) Decimal('-1') r� Tr/ )r� r� )r. r r' r' r) �minusC s z Context.minusc C sN t | d d �} | j | d | �} | t k rF t d | � � n | Sd S)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') r� Tr/ z Unable to convert %s to DecimalN)r� r� r� ro )r. r rR r� r' r' r) �multiplyT s zContext.multiplyc C s" t | d d �} | j d | � S)a" Returns the largest representable number smaller than a. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> ExtendedContext.next_minus(Decimal('1')) Decimal('0.999999999') >>> c.next_minus(Decimal('1E-1007')) Decimal('0E-1007') >>> ExtendedContext.next_minus(Decimal('-1.00000003')) Decimal('-1.00000004') >>> c.next_minus(Decimal('Infinity')) Decimal('9.99999999E+999') >>> c.next_minus(1) Decimal('0.999999999') r� Tr/ )r� r] )r. r r' r' r) r] t s zContext.next_minusc C s" t | d d �} | j d | � S)a Returns 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') r� Tr/ )r� r^ )r. r r' r' r) r^ � s zContext.next_plusc C s% t | d d �} | j | d | �S)a� Returns the number closest to a, in direction towards b. The result is the closest representable number from the first operand (but not the first operand) that is in the direction towards the second operand, unless the operands have the same value. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.next_toward(Decimal('1'), Decimal('2')) Decimal('1.00000001') >>> c.next_toward(Decimal('-1E-1007'), Decimal('1')) Decimal('-0E-1007') >>> c.next_toward(Decimal('-1.00000003'), Decimal('0')) Decimal('-1.00000002') >>> c.next_toward(Decimal('1'), Decimal('0')) Decimal('0.999999999') >>> c.next_toward(Decimal('1E-1007'), Decimal('-100')) Decimal('0E-1007') >>> c.next_toward(Decimal('-1.00000003'), Decimal('-10')) Decimal('-1.00000004') >>> c.next_toward(Decimal('0.00'), Decimal('-0.0000')) Decimal('-0.00') >>> c.next_toward(0, 1) Decimal('1E-1007') >>> c.next_toward(Decimal(0), 1) Decimal('1E-1007') >>> c.next_toward(0, Decimal(1)) Decimal('1E-1007') r� Tr/ )r� r_ )r. r rR r' r' r) r_ � s zContext.next_towardc C s" t | d d �} | j d | � S)a� normalize reduces an operand to its simplest form. Essentially a plus operation with all trailing zeros removed from the result. >>> ExtendedContext.normalize(Decimal('2.1')) Decimal('2.1') >>> ExtendedContext.normalize(Decimal('-2.0')) Decimal('-2') >>> ExtendedContext.normalize(Decimal('1.200')) Decimal('1.2') >>> ExtendedContext.normalize(Decimal('-120')) Decimal('-1.2E+2') >>> ExtendedContext.normalize(Decimal('120.00')) Decimal('1.2E+2') >>> ExtendedContext.normalize(Decimal('0.00')) Decimal('0') >>> ExtendedContext.normalize(6) Decimal('6') r� Tr/ )r� r )r. r r' r' r) r � s zContext.normalizec C s" t | d d �} | j d | � S)a� Returns an indication of the class of the operand. The class is one of the following strings: -sNaN -NaN -Infinity -Normal -Subnormal -Zero +Zero +Subnormal +Normal +Infinity >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.number_class(Decimal('Infinity')) '+Infinity' >>> c.number_class(Decimal('1E-10')) '+Normal' >>> c.number_class(Decimal('2.50')) '+Normal' >>> c.number_class(Decimal('0.1E-999')) '+Subnormal' >>> c.number_class(Decimal('0')) '+Zero' >>> c.number_class(Decimal('-0')) '-Zero' >>> c.number_class(Decimal('-0.1E-999')) '-Subnormal' >>> c.number_class(Decimal('-1E-10')) '-Normal' >>> c.number_class(Decimal('-2.50')) '-Normal' >>> c.number_class(Decimal('-Infinity')) '-Infinity' >>> c.number_class(Decimal('NaN')) 'NaN' >>> c.number_class(Decimal('-NaN')) 'NaN' >>> c.number_class(Decimal('sNaN')) 'sNaN' >>> c.number_class(123) '+Normal' r� Tr/ )r� ra )r. r r' r' r) ra � s /zContext.number_classc C s" t | d d �} | j d | � S)a� Plus corresponds to unary prefix plus in Python. The operation is evaluated using the same rules as add; the operation plus(a) is calculated as add('0', a) where the '0' has the same exponent as the operand. >>> ExtendedContext.plus(Decimal('1.3')) Decimal('1.3') >>> ExtendedContext.plus(Decimal('-1.3')) Decimal('-1.3') >>> ExtendedContext.plus(-1) Decimal('-1') r� Tr/ )r� r� )r. r r' r' r) �plus s z Context.plusc C sQ t | d d �} | j | | d | �} | t k rI t d | � � n | Sd S)a Raises 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') r� Tr/ z Unable to convert %s to DecimalN)r� r r� ro )r. r rR r� r� r' r' r) �power s I z Context.powerc C s% t | d d �} | j | d | �S)a Returns a value equal to 'a' (rounded), having the exponent of 'b'. The coefficient of the result is derived from that of the left-hand operand. It may be rounded using the current rounding setting (if the exponent is being increased), multiplied by a positive power of ten (if the exponent is being decreased), or is unchanged (if the exponent is already equal to that of the right-hand operand). Unlike other operations, if the length of the coefficient after the quantize operation would be greater than precision then an Invalid operation condition is raised. This guarantees that, unless there is an error condition, the exponent of the result of a quantize is always equal to that of the right-hand operand. Also unlike other operations, quantize will never raise Underflow, even if the result is subnormal and inexact. >>> ExtendedContext.quantize(Decimal('2.17'), Decimal('0.001')) Decimal('2.170') >>> ExtendedContext.quantize(Decimal('2.17'), Decimal('0.01')) Decimal('2.17') >>> ExtendedContext.quantize(Decimal('2.17'), Decimal('0.1')) Decimal('2.2') >>> ExtendedContext.quantize(Decimal('2.17'), Decimal('1e+0')) Decimal('2') >>> ExtendedContext.quantize(Decimal('2.17'), Decimal('1e+1')) Decimal('0E+1') >>> ExtendedContext.quantize(Decimal('-Inf'), Decimal('Infinity')) Decimal('-Infinity') >>> ExtendedContext.quantize(Decimal('2'), Decimal('Infinity')) Decimal('NaN') >>> ExtendedContext.quantize(Decimal('-0.1'), Decimal('1')) Decimal('-0') >>> ExtendedContext.quantize(Decimal('-0'), Decimal('1e+5')) Decimal('-0E+5') >>> ExtendedContext.quantize(Decimal('+35236450.6'), Decimal('1e-2')) Decimal('NaN') >>> ExtendedContext.quantize(Decimal('-35236450.6'), Decimal('1e-2')) Decimal('NaN') >>> ExtendedContext.quantize(Decimal('217'), Decimal('1e-1')) Decimal('217.0') >>> ExtendedContext.quantize(Decimal('217'), Decimal('1e-0')) Decimal('217') >>> ExtendedContext.quantize(Decimal('217'), Decimal('1e+1')) Decimal('2.2E+2') >>> ExtendedContext.quantize(Decimal('217'), Decimal('1e+2')) Decimal('2E+2') >>> ExtendedContext.quantize(1, 2) Decimal('1') >>> ExtendedContext.quantize(Decimal(1), 2) Decimal('1') >>> ExtendedContext.quantize(1, Decimal(2)) Decimal('1') r� Tr/ )r� r� )r. r rR r' r' r) r� j s 7zContext.quantizec C s t d � S)zkJust returns 10, as this is Decimal, :) >>> ExtendedContext.radix() Decimal('10') r� )r )r. r' r' r) rb � s z Context.radixc C sN t | d d �} | j | d | �} | t k rF t d | � � n | Sd S)a Returns 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') r� Tr/ z Unable to convert %s to DecimalN)r� r� r� ro )r. r rR r� r' r' r) r� � s zContext.remainderc C s% t | d d �} | j | d | �S)aG Returns 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') r� Tr/ )r� r� )r. r rR r' r' r) r� � s zContext.remainder_nearc C s% t | d d �} | j | d | �S)aN Returns 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') r� Tr/ )r� rf )r. r rR r' r' r) rf � s zContext.rotatec C s t | d d �} | j | � S)a� Returns True if the two operands have the same exponent. The result is never affected by either the sign or the coefficient of either operand. >>> ExtendedContext.same_quantum(Decimal('2.17'), Decimal('0.001')) False >>> ExtendedContext.same_quantum(Decimal('2.17'), Decimal('0.01')) True >>> ExtendedContext.same_quantum(Decimal('2.17'), Decimal('1')) False >>> ExtendedContext.same_quantum(Decimal('Inf'), Decimal('-Inf')) True >>> ExtendedContext.same_quantum(10000, -1) True >>> ExtendedContext.same_quantum(Decimal(10000), -1) True >>> ExtendedContext.same_quantum(10000, Decimal(-1)) True r� T)r� r# )r. r rR r' r' r) r# s zContext.same_quantumc C s% t | d d �} | j | d | �S)a3 Returns 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') r� Tr/ )r� rg )r. r rR r' r' r) rg ) s zContext.scalebc C s% t | d d �} | j | d | �S)a{ Returns a shifted copy of a, b times. The coefficient of the result is a shifted copy of the digits in the coefficient of the first operand. The number of places to shift is taken from the absolute value of the second operand, with the shift being to the left if the second operand is positive or to the right otherwise. Digits shifted into the coefficient are zeros. >>> ExtendedContext.shift(Decimal('34'), Decimal('8')) Decimal('400000000') >>> ExtendedContext.shift(Decimal('12'), Decimal('9')) Decimal('0') >>> ExtendedContext.shift(Decimal('123456789'), Decimal('-2')) Decimal('1234567') >>> ExtendedContext.shift(Decimal('123456789'), Decimal('0')) Decimal('123456789') >>> ExtendedContext.shift(Decimal('123456789'), Decimal('+2')) Decimal('345678900') >>> ExtendedContext.shift(88888888, 2) Decimal('888888800') >>> ExtendedContext.shift(Decimal(88888888), 2) Decimal('888888800') >>> ExtendedContext.shift(88888888, Decimal(2)) Decimal('888888800') r� Tr/ )r� r� )r. r rR r' r' r) r� < s z Context.shiftc C s" t | d d �} | j d | � S)a� Square root of a non-negative number to context precision. If the result must be inexact, it is rounded using the round-half-even algorithm. >>> ExtendedContext.sqrt(Decimal('0')) Decimal('0') >>> ExtendedContext.sqrt(Decimal('-0')) Decimal('-0') >>> ExtendedContext.sqrt(Decimal('0.39')) Decimal('0.624499800') >>> ExtendedContext.sqrt(Decimal('100')) Decimal('10') >>> ExtendedContext.sqrt(Decimal('1')) Decimal('1') >>> ExtendedContext.sqrt(Decimal('1.0')) Decimal('1.0') >>> ExtendedContext.sqrt(Decimal('1.00')) Decimal('1.0') >>> ExtendedContext.sqrt(Decimal('7')) Decimal('2.64575131') >>> ExtendedContext.sqrt(Decimal('10')) Decimal('3.16227766') >>> ExtendedContext.sqrt(2) Decimal('1.41421356') >>> ExtendedContext.prec 9 r� Tr/ )r� r, )r. r r' r' r) r, Z s z Context.sqrtc C sN t | d d �} | j | d | �} | t k rF t d | � � n | Sd S)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') r� Tr/ z Unable to convert %s to DecimalN)r� r� r� ro )r. r rR r� r' r' r) �subtractz s zContext.subtractc C s" t | d d �} | j d | � S)zyConverts a number to a string, using scientific notation. The operation is not affected by the context. r� Tr/ )r� r� )r. r r' r' r) r� � s zContext.to_eng_stringc C s" t | d d �} | j d | � S)zyConverts a number to a string, using scientific notation. The operation is not affected by the context. r� Tr/ )r� r� )r. r r' r' r) � to_sci_string� s zContext.to_sci_stringc C s" t | d d �} | j d | � S)ak Rounds 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') r� Tr/ )r� r& )r. r r' r' r) r& � s zContext.to_integral_exactc C s" t | d d �} | j d | � S)aL Rounds 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') r� Tr/ )r� r� )r. r r' r' r) r� � s zContext.to_integral_value)Xr1 r2 r3 r4 r� r� r� r� r� ri r� rH r� r' rG rk ra r[ r� r� r� r� r� r( r� r� re r� r� r1 r� r2 r- r6 r� r� r� r7 r� r� r� rT r� r: r; r" r� r< r� r= r� r> r? rG rJ rK rU rW rX rV r� rY r� rZ r� r� r] r^ r_ r ra r� r� r� rb r� r� rf r# rg r� r, r� r� r� r& r� r� r' r' r' r) r " s� " $ # % # 2 P : & " c @ s7 e Z d Z d Z d d d � Z d d � Z e Z d S) rf r= rR rT Nc C s� | d k r* d | _ d | _ d | _ nc t | t � rf | j | _ t | j � | _ | j | _ n' | d | _ | d | _ | d | _ d S)Nr% r- r+ )r= rR rT r] r r7 r8 rN )r. rq r' r' r) r� � s z_WorkRep.__init__c C s d | j | j | j f S)Nz (%r, %r, %r))r= rR rT )r. r' r' r) r� � s z_WorkRep.__repr__)zsignzintzexp)r1 r2 r3 r{ r� r� r� r' r' r' r) rf � s rf c C s� | j | j k r! | } | } n | } | } t t | j � � } t t | j � � } | j t d | | d � } | | j d | k r� d | _ | | _ n | j d | j | j 9_ | j | _ | | f S)zcNormalizes op1, op2 to have the same exp and length of coefficient. Done during addition. r- r+ r� r� )rT rc r^ rR r� )r� r� r@ Ztmpr� Ztmp_lenZ other_lenrT r' r' r) r� � s r� c C s{ | d k r d S| d k r( | d | St t | � � } t | � t | j d � � } | | k rj d S| d | Sd 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� rP N)r^ re rc �rstrip)r5 r� Zstr_nZval_nr' r' r) r s r c C s^ | d k s | d k r' t d � � n d } x* | | k rY | | | | d ?} } q0 W| 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- )ri )r5 r rR r' r' r) � _sqrt_nearest0 s r� c C s7 d | >| | ?} } | d | | d @| d @| k S)z�Given an integer x and a nonnegative integer shift, return closest integer to x / 2**shift; use round-to-even in case of a tie. r- r+ r' )r r� rR r� r' r' r) �_rshift_nearest? s r� c C s/ t | | � \ } } | d | | d @| k S)zaClosest integer to a/b, a and b positive integers; rounds to even in the case of a tie. r+ r- )r� )r rR r� r� r' r' r) � _div_nearestG s r� r c C s7 | | } d } x� | | k r9 t | � | | >| k s_ | | k r� t | � | | ?| k r� t | | d >| t | | t | | � | � � } | d 7} q Wt d t t | � � d | � } t | | � } t | | � } x> t | d d d � D]& } t | | � t | | | � } q� Wt | | | � S)a� Integer approximation to M*log(x/M), with absolute error boundable in terms only of x/M. Given positive integers x and M, return an integer approximation to M * log(x/M). For L = 8 and 0.1 <= x/M <= 10 the difference between the approximation and the exact result is at most 22. For L = 8 and 1.0 <= x/M <= 10.0 the difference is at most 15. In both cases these are upper bounds on the error; it will usually be much smaller.r% r- r� rY i����r� )re r� r� r� rR rc r^ r� ) r �M�Lr �R�TZyshift�wr~ r' r' r) �_ilogO s )&'% $r� c C s� | d 7} t t | � � } | | | | d k } | d k r� d | } | | | } | d k ru | d | 9} n t | 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.r+ r- r% r� r )rc r^ r� r� � _log10_digits) r* r� r r+ r| r� r~ �log_dZlog_10Z log_tenpowerr' r' r) rI s rI c C s | d 7} t t | � � } | | | | d k } | d k r� | | | } | d k rk | d | 9} n t | d | � } t | d | � } n d } | r� t t t | � � � d } | | d k r� t | t | | � d | � } q d } n d } t | | d � S)z�Given integers c, e and p with c > 0, compute an integer approximation to 10**p * log(c*10**e), with an absolute error of at most 1. Assumes that c*10**e is not exactly 1.r+ r- r% r� r )rc r^ r� r� re r� ) r* r� r r+ r| r~ r� r Z f_log_tenr' r' r) rF � s" $ rF c @ s. e Z d Z d Z d d � Z d d � Z d S)� _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__.c C s d | _ d S)NZ/23025850929940456840179914546843642076011014886)ru )r. r' r' r) r� � s z_Log10Memoize.__init__c C s� | d k r t d � � n | t | j � k r� d } xa d | | d } t t t d | | � d � � } | | d � d | k r� Pn | d 7} q9 W| j d � d d � | _ n t | j d | d � � S) ztGiven an integer p >= 0, return floor(10**p)*log(10). For example, self.getdigits(3) returns 2302. r% zp should be nonnegativerY r� r+ r NrP r- r� )ri rc ru r^ r� r� r� rR )r. r r r� ru r' r' r) � getdigits� s " z_Log10Memoize.getdigitsN)r1 r2 r3 r4 r� r� r' r' r' r) r� � s r� c C s� t | | >| � } t d t t | � � d | � } t | | � } | | >} x9 t | d d d � D]! } t | | | | | � } qi WxC t | d d d � D]+ } | | d >} t | | | | � } q� W| | 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� rY r- r% r+ i����r� r� r� )r rR rc r^ r� r� ) r r� r� r� r� r ZMshiftr� r~ r' r' r) �_iexp� s % r� c C s� | d 7} t d | t t | � � d � } | | } | | } | d k r^ | d | } n | d | } t | t | � � \ } } t | d | � } t t | d | � d � | | d f S)a� Compute an approximation to exp(c*10**e), with p decimal places of precision. Returns integers d, f such that: 10**(p-1) <= d <= 10**p, and (d-1)*10**f < exp(c*10**e) < (d+1)*10**f In other words, d*10**f is an approximation to exp(c*10**e) with p digits of precision, and with an error in d of at most 1. This is almost, but not quite, the same as the error being < 1ulp: when d = 10**(p-1) the error could be up to 10 ulp.r+ r% r- r� i� rY )r� rc r^ r� r� r� r� ) r* r� r r r� r� ZcshiftZquotr r' r' r) r8 s # r8 c C s* t t t | � � � | } t | | | | d � } | | } | d k ra | | d | } n t | | d | � } | d k r� t t | � � | d k | d k k r� d | d d d | } } q d | d | } } n: t | | d | d � \ } } t | d � } | d 7} | | f S)a5 Given 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� )rc r^ re rF r� r8 ) r r r r r rR Zlxcr� Zpcr� rT r' r' r) r ; s ( ! r r r� �F �2�5 �3�( �4� �5r@ �6� �7r� �8rw r> c C sA | d k r t d � � n t | � } d t | � | | d S)z@Compute a lower bound for 100*log10(c) for a positive integer c.r% z0The argument to _log10_lb should be nonnegative.r )ri r^ rc )r* Z correctionZstr_cr' r' r) r e s r c C sk t | t � r | St | t � r, t | � S| rN t | t � rN t j | � S| rg t d | � � n t S)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). z Unable to convert %s to Decimal)r] r rR rm rn ro r� )r� r� Z allow_floatr' r' r) r� p s r� c C s t | t � r | | f St | t j � rx | j se t | j t t | j � | j � | j � } n | t | j � f S| r� t | t j � r� | j d k r� | j } n t | t � r� t � } | r� d | j t <n | j t d � | t j | � f St t f S)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- z;strict semantics for mixing floats and Decimals are enabled)r] r �_numbersZRationalrO r6 r7 r^ rR r8 � denominatorrN � numeratorZComplexr� r� rm r r r ra rn r� )r. r� r� r/ r' r' r) r� � s$ ' r� r@ r r? r r rA i?B r! r� r� rZ a� # 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 c C s+ t j | � } | d k r. t d | � � n | j � } | d } | d } | d d k | d <| d r� | d k r� t d | � � n | d k r� t d | � � q� n | p� d | d <| p� d | d <| d d k r� d | d <n t | d p� d � | d <| d d k r+t | d � | d <n | d d k rk| d d k s[| d d k rkd | d <qkn | d d k r�d | d <| d k r�t j � } n | d d k r�t d | � � n | d | d <| d | d <| d | d <n7 | d d k r d | d <n d d g | 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: � �>r= rQ � minimumwidthrP rr r% rj ZgGnr- r5 rp � thousands_sepzJExplicit thousands separator conflicts with 'n' type in format specifier: �grouping� decimal_pointrS rY r� )� _parse_format_specifier_regex�matchri � groupdictrR �_locale� localeconv)Z format_specrn rr Z format_dictr� r� r' r' r) rt sN rt c C s� | d } | d } | | t | � t | � } | d } | d k rY | | | } n� | d k rv | | | } nn | d k r� | | | } nQ | d k r� t | � d } | d | � | | | | d � } n t d � � | S) z�Given an unpadded, non-aligned numeric string 'body' and sign string 'sign', add padding and alignment conforming to the given format specifier dictionary 'spec' (as produced by parse_format_specifier). r� r� r� �<r� �=�^r+ Nz Unrecognised alignment field)rc ri ) r= ry rx r� r� Zpaddingr� r Zhalfr' r' r) rv ` s ) rv c C s� d d l m } m } | s g S| d d k rc t | � d k rc | | d d � | | d � � S| d t j k r� | d d � St d � � d S) zyConvert a localeconv-style grouping into a (possibly infinite) iterable of integers representing group lengths. r% )�chain�repeatr- r+ Nz unrecognised format for groupingr� r� r� r� r� )� itertoolsr� r� rc r� �CHAR_MAXri )r� r� r� r' r' r) �_group_lengths{ s "!r� c C s. | d } | d } g } x� t | � D]� } | d k rH t d � � n t t t | � | d � | � } | j d | t | � | | d � � | d | � } | | 8} | r� | d k r� Pn | t | � 8} q' Wt t | � | d � } | j d | t | � | | d � � | j t | � � S)an Insert 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. r� r� r% z group length should be positiver- rP N)r� ri r� r� rc rj rk �reversed)ru rx � min_width�sepr� �groupsr+ r' r' r) �_insert_thousands_sep� s !* *r� c C s* | r d S| d d k r" | d Sd Sd S)zDetermine sign character.rQ r= z +rS Nr' )� is_negativerx r' r' r) ru � s ru c C s t | | � } | s | d r0 | d | } n | d k sL | d d k r� i d d 6d d 6d d 6d d 6| d } | d j | | � 7} n | d d k r� | d 7} n | d r� | d t | � t | � } n d } t | | | � } t | | | | � S)ac Format 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 Zaltr� r% rj rs r� r� rq rp z{0}{1:+}ro r� r� )ru �formatrc r� rv )r� rs rt rT rx r= Zecharr� r' r' r) rw � s * !rw ZInfz-Infr� )�*�__main__)�r4 �__all__� __version__Z__libmpdec_version__Zmathrx Znumbersr� rD � collectionsr& Z _namedtupler � ImportErrorr r r r r r r r r$ �maxsizer r! r" r# �ArithmeticErrorr r r r �ZeroDivisionErrorr r r r r r r r r ro r r r� r� rI r[ rB rE rK �hasattrrJ rF r r r r r6 �Number�registerrM r rf r� rR r{ r r r� r� r� r� rI rF r� r� r� r� r8 r r r� r� r r r �re�compile�VERBOSE� IGNORECASEr� r_ r� r� �DOTALLr� Zlocaler� rt rv r� r� ru rw rE rD r: r4 r r3 r< � hash_info�modulusr� r` r� r� r� r� r� Z_decimal�set�dir�s1�s2r� �globalsr1 Zdoctest�decimalZtestmodr' r' r' r) �<module>q sn & .� � � � � � � � � � � � �� � � � � � � 0 " ,# % $ *#( * P % )
💾 Save Changes
❌ Cancel