Your IP : 18.119.166.34

Current Path : /opt/alt/python39/lib64/python3.9/__pycache__/
Upload File :
Current File : //opt/alt/python39/lib64/python3.9/__pycache__/fractions.cpython-39.pyc

a

R�f_�@sxdZddlmZddlZddlZddlZddlZddlZdgZej	j
Zej	jZ
e�dejejB�ZGdd�dej�ZdS)z+Fraction, infinite-precision, real numbers.���DecimalN�FractionaC
    \A\s*                      # optional whitespace at the start, then
    (?P<sign>[-+]?)            # an optional sign, then
    (?=\d|\.\d)                # lookahead for digit or .digit
    (?P<num>\d*)               # numerator (possibly empty)
    (?:                        # followed by
       (?:/(?P<denom>\d+))?    # an optional denominator
    |                          # or
       (?:\.(?P<decimal>\d*))? # an optional fractional part
       (?:E(?P<exp>[-+]?\d+))? # and optional exponent
    )
    \s*\Z                      # and optional whitespace to finish
cs�eZdZdZdZdRdd��fdd�Zed	d
��Zedd��Zd
d�Z	dSdd�Z
edd��Zedd��Z
dd�Zdd�Zdd�Zdd�Zeeej�\ZZdd�Zeeej�\ZZd d!�Zeeej�\ZZd"d#�Zeeej�\Z Z!d$d%�Z"ee"ej#�\Z$Z%d&d'�Z&ee&e'�\Z(Z)d(d)�Z*ee*ej+�\Z,Z-d*d+�Z.d,d-�Z/d.d/�Z0d0d1�Z1d2d3�Z2d4d5�Z3d6d7�Z4d8d9�Z5dTd:d;�Z6d<d=�Z7d>d?�Z8d@dA�Z9dBdC�Z:dDdE�Z;dFdG�Z<dHdI�Z=dJdK�Z>dLdM�Z?dNdO�Z@dPdQ�ZA�ZBS)Ura]This class implements rational numbers.

    In the two-argument form of the constructor, Fraction(8, 6) will
    produce a rational number equivalent to 4/3. Both arguments must
    be Rational. The numerator defaults to 0 and the denominator
    defaults to 1 so that Fraction(3) == 3 and Fraction() == 0.

    Fractions can also be constructed from:

      - numeric strings similar to those accepted by the
        float constructor (for example, '-2.3' or '1e10')

      - strings of the form '123/456'

      - float and Decimal instances

      - other Rational instances (including integers)

    ��
_numerator�_denominatorrNT��
_normalizecs"tt|��|�}|du�rdt|�tur6||_d|_|St|tj	�rV|j
|_|j|_|St|tt
f�rx|��\|_|_|St|t��rZt�|�}|dur�td|��t|�d�p�d�}|�d�}|r�t|�}nvd}|�d�}|�rdt|�}||t|�}||9}|�d	�}	|	�rBt|	�}	|	d
k�r4|d|	9}n|d|	9}|�d�dk�rb|}ntd
��nft|�tu�r�t|�u�r�nnn@t|tj	��r�t|tj	��r�|j
|j|j
|j}}ntd��|d
k�r�td|��|�rt�||�}
|d
k�r|
}
||
}||
}||_||_|S)a�Constructs a Rational.

        Takes a string like '3/2' or '1.5', another Rational instance, a
        numerator/denominator pair, or a float.

        Examples
        --------

        >>> Fraction(10, -8)
        Fraction(-5, 4)
        >>> Fraction(Fraction(1, 7), 5)
        Fraction(1, 35)
        >>> Fraction(Fraction(1, 7), Fraction(2, 3))
        Fraction(3, 14)
        >>> Fraction('314')
        Fraction(314, 1)
        >>> Fraction('-35/4')
        Fraction(-35, 4)
        >>> Fraction('3.1415') # conversion from numeric string
        Fraction(6283, 2000)
        >>> Fraction('-47e-2') # string may include a decimal exponent
        Fraction(-47, 100)
        >>> Fraction(1.47)  # direct construction from float (exact conversion)
        Fraction(6620291452234629, 4503599627370496)
        >>> Fraction(2.25)
        Fraction(9, 4)
        >>> Fraction(Decimal('1.47'))
        Fraction(147, 100)

        N�z Invalid literal for Fraction: %rZnum�0�denom�decimal�
�exprZsign�-z2argument should be a string or a Rational instancez+both arguments should be Rational instanceszFraction(%s, 0))�superr�__new__�type�intrr�
isinstance�numbers�Rational�	numerator�denominator�floatr�as_integer_ratio�str�_RATIONAL_FORMAT�match�
ValueError�group�len�	TypeError�ZeroDivisionError�mathZgcd)�clsrrr	�self�mrr
Zscaler�g��	__class__��./opt/alt/python39/lib64/python3.9/fractions.pyr>st

�





$
�

�

zFraction.__new__cCsDt|tj�r||�St|t�s8td|j|t|�jf��||���S)z�Converts a finite float to a rational number, exactly.

        Beware that Fraction.from_float(0.3) != Fraction(3, 10).

        z.%s.from_float() only takes floats, not %r (%s))rr�Integralrr"�__name__rr)r%�fr+r+r,�
from_float�s
�zFraction.from_floatcCsVddlm}t|tj�r&|t|��}n$t||�sJtd|j|t|�jf��||�	��S)zAConverts a finite Decimal instance to a rational number, exactly.rrz2%s.from_decimal() only takes Decimals, not %r (%s))
r
rrrr-rr"r.rr)r%Zdecrr+r+r,�from_decimal�s
��zFraction.from_decimalcCs|j|jfS)z�Return the integer ratio as a tuple.

        Return a tuple of two integers, whose ratio is equal to the
        Fraction and with a positive denominator.
        r�r&r+r+r,r�szFraction.as_integer_ratio�@Bc
Cs�|dkrtd��|j|kr"t|�Sd\}}}}|j|j}}||}|||}	|	|krZq�||||||	f\}}}}||||}}q<|||}
t||
|||
|�}t||�}t||�t||�kr�|S|SdS)aWClosest Fraction to self with denominator at most max_denominator.

        >>> Fraction('3.141592653589793').limit_denominator(10)
        Fraction(22, 7)
        >>> Fraction('3.141592653589793').limit_denominator(100)
        Fraction(311, 99)
        >>> Fraction(4321, 8765).limit_denominator(10000)
        Fraction(4321, 8765)

        r
z$max_denominator should be at least 1)rr
r
rN)rrrr�abs)
r&Zmax_denominatorZp0Zq0Zp1Zq1�n�d�aZq2�kZbound1Zbound2r+r+r,�limit_denominator�s$ 

zFraction.limit_denominatorcCs|jS�N)r�r7r+r+r,rszFraction.numeratorcCs|jSr:)rr;r+r+r,rszFraction.denominatorcCsd|jj|j|jfS)z
repr(self)z
%s(%s, %s))r*r.rrr2r+r+r,�__repr__s�zFraction.__repr__cCs(|jdkrt|j�Sd|j|jfSdS)z	str(self)r
z%s/%sN)rrrr2r+r+r,�__str__
s

zFraction.__str__csT��fdd�}d�jd|_�j|_��fdd�}d�jd|_�j|_||fS)a�Generates forward and reverse operators given a purely-rational
        operator and a function from the operator module.

        Use this like:
        __op__, __rop__ = _operator_fallbacks(just_rational_op, operator.op)

        In general, we want to implement the arithmetic operations so
        that mixed-mode operations either call an implementation whose
        author knew about the types of both arguments, or convert both
        to the nearest built in type and do the operation there. In
        Fraction, that means that we define __add__ and __radd__ as:

            def __add__(self, other):
                # Both types have numerators/denominator attributes,
                # so do the operation directly
                if isinstance(other, (int, Fraction)):
                    return Fraction(self.numerator * other.denominator +
                                    other.numerator * self.denominator,
                                    self.denominator * other.denominator)
                # float and complex don't have those operations, but we
                # know about those types, so special case them.
                elif isinstance(other, float):
                    return float(self) + other
                elif isinstance(other, complex):
                    return complex(self) + other
                # Let the other type take over.
                return NotImplemented

            def __radd__(self, other):
                # radd handles more types than add because there's
                # nothing left to fall back to.
                if isinstance(other, numbers.Rational):
                    return Fraction(self.numerator * other.denominator +
                                    other.numerator * self.denominator,
                                    self.denominator * other.denominator)
                elif isinstance(other, Real):
                    return float(other) + float(self)
                elif isinstance(other, Complex):
                    return complex(other) + complex(self)
                return NotImplemented


        There are 5 different cases for a mixed-type addition on
        Fraction. I'll refer to all of the above code that doesn't
        refer to Fraction, float, or complex as "boilerplate". 'r'
        will be an instance of Fraction, which is a subtype of
        Rational (r : Fraction <: Rational), and b : B <:
        Complex. The first three involve 'r + b':

            1. If B <: Fraction, int, float, or complex, we handle
               that specially, and all is well.
            2. If Fraction falls back to the boilerplate code, and it
               were to return a value from __add__, we'd miss the
               possibility that B defines a more intelligent __radd__,
               so the boilerplate should return NotImplemented from
               __add__. In particular, we don't handle Rational
               here, even though we could get an exact answer, in case
               the other type wants to do something special.
            3. If B <: Fraction, Python tries B.__radd__ before
               Fraction.__add__. This is ok, because it was
               implemented with knowledge of Fraction, so it can
               handle those instances before delegating to Real or
               Complex.

        The next two situations describe 'b + r'. We assume that b
        didn't know about Fraction in its implementation, and that it
        uses similar boilerplate code:

            4. If B <: Rational, then __radd_ converts both to the
               builtin rational type (hey look, that's us) and
               proceeds.
            5. Otherwise, __radd__ tries to find the nearest common
               base ABC, and fall back to its builtin type. Since this
               class doesn't subclass a concrete type, there's no
               implementation to fall back to, so we need to try as
               hard as possible to return an actual value, or the user
               will get a TypeError.

        csPt|ttf�r�||�St|t�r0�t|�|�St|t�rH�t|�|�StSdSr:)rrrr�complex�NotImplemented�r7�b��fallback_operator�monomorphic_operatorr+r,�forwardds


z-Fraction._operator_fallbacks.<locals>.forward�__csZt|tj�r�||�St|tj�r4�t|�t|��St|tj�rR�t|�t|��StSdSr:)rrrZRealr�Complexr>r?�rAr7rBr+r,�reverseps
z-Fraction._operator_fallbacks.<locals>.reverseZ__r)r.�__doc__)rDrCrErIr+rBr,�_operator_fallbackssP	
zFraction._operator_fallbackscCs,|j|j}}t|j||j|||�S)za + b�rrr�r7rA�da�dbr+r+r,�_adds�z
Fraction._addcCs,|j|j}}t|j||j|||�S)za - brLrMr+r+r,�_sub�s�z
Fraction._subcCst|j|j|j|j�S)za * b�rrrr@r+r+r,�_mul�sz
Fraction._mulcCst|j|j|j|j�S)za / brRr@r+r+r,�_div�s
�z
Fraction._divcCs|j|j|j|jS)za // b�rrr@r+r+r,�	_floordiv�szFraction._floordivcCs:|j|j}}t|j|||j�\}}|t|||�fS)z(a // b, a % b))r�divmodrr)r7rArNrOZdivZn_modr+r+r,�_divmod�szFraction._divmodcCs,|j|j}}t|j||j|||�S)za % brLrMr+r+r,�_mod�sz
Fraction._modcCs�t|tj�r�|jdkr�|j}|dkr>t|j||j|dd�S|jdkrft|j||j|dd�St|j||j|dd�Sq�t|�t|�Snt|�|SdS)z�a ** b

        If b is not an integer, the result will be a float or complex
        since roots are generally irrational. If b is an integer, the
        result will be rational.

        r
rFrN)	rrrrrrrrr)r7rAZpowerr+r+r,�__pow__�s&

�

��zFraction.__pow__cCs\|jdkr|jdkr||jSt|tj�r<t|j|j�|S|jdkrP||jS|t|�S)za ** br
r)	rrrrrrrrrrHr+r+r,�__rpow__�s


zFraction.__rpow__cCst|j|jdd�S)z++a: Coerces a subclass instance to FractionFr�rrrr;r+r+r,�__pos__�szFraction.__pos__cCst|j|jdd�S)z-aFrr\r;r+r+r,�__neg__�szFraction.__neg__cCstt|j�|jdd�S)zabs(a)Fr)rr4rrr;r+r+r,�__abs__�szFraction.__abs__cCs*|jdkr|j|jS|j|jSdS)ztrunc(a)rNrr;r+r+r,�	__trunc__�s
zFraction.__trunc__cCs|j|jS)z
math.floor(a)rUr;r+r+r,�	__floor__�szFraction.__floor__cCs|j|jS)zmath.ceil(a)rUr;r+r+r,�__ceil__�szFraction.__ceil__cCs�|durZt|j|j�\}}|d|jkr,|S|d|jkrB|dS|ddkrR|S|dSdt|�}|dkr�tt||�|�Stt||�|�SdS)z?round(self, ndigits)

        Rounds half toward even.
        N�r
rr)rWrrr4r�round)r&�ndigitsZfloorZ	remainder�shiftr+r+r,�	__round__�szFraction.__round__cCsdzt|jdt�}Wnty(t}Yn0ttt|j��|�}|jdkrN|n|}|dkr`dS|S)z
hash(self)���r���)�powr�_PyHASH_MODULUSr�_PyHASH_INF�hashr4r)r&ZdinvZhash_�resultr+r+r,�__hash__s
zFraction.__hash__cCs�t|�tur |j|ko|jdkSt|tj�rD|j|jkoB|j|jkSt|tj	�r`|j
dkr`|j}t|t�r�t
�|�s~t
�|�r�d|kS||�|�kSntSdS)za == br
r�N)rrrrrrrrrrG�imag�realrr$�isnan�isinfr0r?r@r+r+r,�__eq__3s
�
zFraction.__eq__cCsht|tj�r&||j|j|j|j�St|t�r`t�	|�sDt�
|�rN|d|�S|||�|��SntSdS)acHelper for comparison operators, for internal use only.

        Implement comparison between a Rational instance `self`, and
        either another Rational instance or a float `other`.  If
        `other` is not a Rational instance or a float, return
        NotImplemented. `op` should be one of the six standard
        comparison operators.

        rpN)
rrrrrrrrr$rsrtr0r?)r&�other�opr+r+r,�_richcmpHs
�

zFraction._richcmpcCs|�|tj�S)za < b)rx�operator�ltr@r+r+r,�__lt__^szFraction.__lt__cCs|�|tj�S)za > b)rxry�gtr@r+r+r,�__gt__bszFraction.__gt__cCs|�|tj�S)za <= b)rxry�ler@r+r+r,�__le__fszFraction.__le__cCs|�|tj�S)za >= b)rxry�ger@r+r+r,�__ge__jszFraction.__ge__cCs
t|j�S)za != 0)�boolrr;r+r+r,�__bool__nszFraction.__bool__cCs|jt|�ffSr:)r*rr2r+r+r,�
__reduce__vszFraction.__reduce__cCs t|�tkr|S|�|j|j�Sr:�rrr*rrr2r+r+r,�__copy__yszFraction.__copy__cCs t|�tkr|S|�|j|j�Sr:r�)r&�memor+r+r,�__deepcopy__~szFraction.__deepcopy__)rN)r3)N)Cr.�
__module__�__qualname__rJ�	__slots__r�classmethodr0r1rr9�propertyrrr<r=rKrPry�add�__add__�__radd__rQ�sub�__sub__�__rsub__rS�mul�__mul__�__rmul__rT�truediv�__truediv__�__rtruediv__rV�floordiv�__floordiv__�
__rfloordiv__rXrW�
__divmod__�__rdivmod__rY�mod�__mod__�__rmod__rZr[r]r^r_r`rarbrgrorurxr{r}rr�r�r�r�r��
__classcell__r+r+r)r,r&sdi



7

k
!)rJr
rr$rry�re�sys�__all__�	hash_info�modulusrk�infrl�compile�VERBOSE�
IGNORECASErrrr+r+r+r,�<module>s
�
?>