Information System : Linux apprendre2 3.10.0-1160.119.1.el7.x86_64 #1 SMP Tue Jun 4 14:43:51 UTC 2024 x86_64
Disable Function : NONE
3
\W\ @ s d Z ddlmZ ddlZddlZddlZddlZddlZddgZdd Z dd Z
ej j Z
ej jZejd ejejB ZG d
d dejZdS ) z+Fraction, infinite-precision, real numbers. )DecimalNFractiongcdc C sf ddl }|jdtd t| t ko0t|kn r\|p<| dk rPtj| | S tj| |S t| |S )zCalculate the Greatest Common Divisor of a and b.
Unless b==0, the result will have the same sign as b (so that when
b is divided by it, the result comes out positive).
r Nz6fractions.gcd() is deprecated. Use math.gcd() instead. )warningswarnDeprecationWarningtypeintmathr _gcd)abr r !/usr/lib64/python3.6/fractions.pyr s c C s x|r|| | } }qW | S )Nr )r
r r r r r s r aC
\A\s* # optional whitespace at the start, then
(?P[-+]?) # an optional sign, then
(?=\d|\.\d) # lookahead for digit or .digit
(?P\d*) # numerator (possibly empty)
(?: # followed by
(?:/(?P\d+))? # an optional denominator
| # or
(?:\.(?P\d*))? # an optional fractional part
(?:E(?P[-+]?\d+))? # and optional exponent
)
\s*\Z # and optional whitespace to finish
c s e Zd ZdZdSZdTdd fdd Zed
d Zed d
ZdUddZ e
dd Z e
dd Z dd Z
dd Zdd Zdd Zeeej\ZZd d Zeeej\ZZd d Zeeej\ZZ d!d" Z ee ej \Z Z d#d$ Z!d%d& Z"d'd( Z#d)d* Z$d+d, Z%d-d. Z&d/d0 Z'd1d2 Z(d3d4 Z)d5d6 Z*d7d8 Z+d9d: Z,dVd;d<Z-d=d> Z.d?d@ Z/dAdB Z0dCdD Z1dEdF Z2dGdH Z3dIdJ Z4dKdL Z5dMdN Z6dOdP Z7dQdR Z8 Z9S )Wr a] 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 _denominatorr NT)
_normalizec sR t t| j| }|dkrdt|tkr6||_d|_|S t|tj rV|j
|_|j |_|S t|t t
frx|j \|_|_|S t|trZtj|}|dkrtd| t|jdpd}|jd}|rt|}nvd}|jd}|rdt| }|| t| }||9 }|jd } | rBt| } | d
kr4|d| 9 }n|d| 9 }|jd d krb| }ntd
nft|t kot|kn rn@t|tj rt|tj r|j
|j |j
|j }}ntd|d
krtd| |rBt|t kot|kn r(tj||}
|d
k r2|
}
n
t||}
||
}||
}||_||_|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: %rZnum0denomdecimal
expr Zsign-z2argument should be a string or a Rational instancez+both arguments should be Rational instanceszFraction(%s, 0))superr __new__r r
r r
isinstancenumbersRational numerator denominatorfloatr as_integer_ratiostr_RATIONAL_FORMATmatch
ValueErrorgrouplen TypeErrorZeroDivisionErrorr r r ) clsr r! r selfmr r Zscaler g) __class__r r r T sr
$
$
zFraction.__new__c C sD t |tjr| |S t |ts8td| j|t|jf | |j S )zConverts 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))r r Integralr" r* __name__r r# )r, fr r r
from_float s
zFraction.from_floatc C sV ddl m} t|tjr&|t|}n$t||sJtd| j|t|jf | |j S )zAConverts a finite Decimal instance to a rational number, exactly.r )r z2%s.from_decimal() only takes Decimals, not %r (%s))
r r r r r1 r
r* r2 r r# )r, Zdecr r r r from_decimal s
zFraction.from_decimal@B c
C s |dk rt d| j|kr"t| S d\}}}}| j| j }}xP|| }||| } | |kr\P ||||| | f\}}}}|||| }}q>W || | }
t||
| ||
| } t||} t| | t| | kr| S | S dS )aW Closest 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 1r N)r r r r )r' r r r abs)
r- Zmax_denominatorZp0Zq0Zp1Zq1ndr
Zq2kZbound1Zbound2r r r limit_denominator s&
zFraction.limit_denominatorc C s | j S )N)r )r
r r r r s zFraction.numeratorc C s | j S )N)r )r
r r r r! s zFraction.denominatorc C s d| j j| j| jf S )z
repr(self)z
%s(%s, %s))r0 r2 r r )r- r r r __repr__ s zFraction.__repr__c C s( | j dkrt| jS d| j| j f S dS )z str(self)r z%s/%sN)r r$ r )r- r r r __str__ s
zFraction.__str__c sT fdd}d j d |_ j|_ fdd}d j d |_ 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.
c sP t |ttfr| |S t |tr0 t| |S t |trH t| |S tS d S )N)r r
r r" complexNotImplemented)r
r )fallback_operatormonomorphic_operatorr r forwardv s
z-Fraction._operator_fallbacks..forward__c sZ t |tjr|| S t |tjr4 t|t| S t |tjrR t|t| S tS d S )N)r r r ZRealr" Complexr> r? )r r
)r@ rA r r reverse s
z-Fraction._operator_fallbacks..reverseZ__r)r2 __doc__)rA r@ rB rE r )r@ rA r _operator_fallbacks& s P
z Fraction._operator_fallbacksc C s, | j |j }}t| j| |j| || S )za + b)r! r r )r
r dadbr r r _add s z
Fraction._addc C s, | j |j }}t| j| |j| || S )za - b)r! r r )r
r rH rI r r r _sub s z
Fraction._subc C s t | j|j | j|j S )za * b)r r r! )r
r r r r _mul s z
Fraction._mulc C s t | j|j | j|j S )za / b)r r r! )r
r r r r _div s z
Fraction._divc C s t j| | S )za // b)r floor)r
r r r r __floordiv__ s zFraction.__floordiv__c C s t j|| S )za // b)r rN )r r
r r r
__rfloordiv__ s zFraction.__rfloordiv__c C s | | }| || S )za % br )r
r divr r r __mod__ s zFraction.__mod__c C s || }|| | S )za % br )r r
rQ r r r __rmod__ s zFraction.__rmod__c C s t |tjr|jdkr|j}|dkr>t| j| | j| ddS | jdkrft| j| | j| ddS t| j | | j | ddS qt| t| S n t| | S dS )za ** 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 r F)r N) r r r r! r r r r r" )r
r Zpowerr r r __pow__ s
zFraction.__pow__c C s\ | j dkr | jdkr || j S t|tjr b)rm rn gt)r
r r r r __gt__f s zFraction.__gt__c C s | j |tjS )za <= b)rm rn le)r
r r r r __le__j s zFraction.__le__c C s | j |tjS )za >= b)rm rn ge)r
r r r r __ge__n s zFraction.__ge__c C s
| j dkS )za != 0r )r )r
r r r __bool__r s zFraction.__bool__c C s | j t| ffS )N)r0 r$ )r- r r r
__reduce__x s zFraction.__reduce__c C s t | tkr| S | j| j| jS )N)r r r0 r r )r- r r r __copy__{ s zFraction.__copy__c C s t | tkr| S | j| j| jS )N)r r r0 r r )r- memor r r __deepcopy__ s zFraction.__deepcopy__)r r )r N)r6 )N):r2
__module__ __qualname__rF __slots__r classmethodr4 r5 r; propertyr r! r< r= rG rJ rn add__add____radd__rK sub__sub____rsub__rL mul__mul____rmul__rM truediv __truediv__ __rtruediv__rO rP rR rS rT rU rV rW rX rY rZ r[ r^ re rj rm rp rr rt rv rw rx ry r{
__classcell__r r )r0 r r < sV m
7 k
)rF r r r r rn resys__all__r r hash_infomodulusrb infrc compileVERBOSE
IGNORECASEr% r r r r r r s