|
Apache/2.2.15 (CentOS) Linux obd60-6c49958d75-2q7cw 5.4.0-174-generic #193-Ubuntu SMP Thu Mar 7 14:29:28 UTC 2024 x86_64 uid=48(apache) gid=48(apache) groups=48(apache) server ip : 104.21.65.202 | your ip : 10.244.126.0 safemode OFF > / usr / lib64 / python2.6 / |
| Filename | /usr/lib64/python2.6/fractions.pyo |
| Size | 17.69 kb |
| Permission | rw-r--r-- |
| Owner | apache |
| Create time | 23-Dec-2025 17:41 |
| Last modified | 20-Jun-2019 19:45 |
| Last accessed | 22-Apr-2026 05:28 |
| Actions | edit | rename | delete | download (gzip) |
| View | text | code | image |
Ñò
§ÚêLc @ s� d Z d d k l Z d d k Z d d k Z d d k Z d d k Z d d g Z e i Z d � Z e i
d e i � Z d e f d � � YZ
d S( s+ Rational, infinite-precision, real numbers.iÿÿÿÿ( t divisionNt Fractiont gcdc C s$ x | o | | | } } q W| S( s¶ Calculate 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).
( ( t at b( ( s! /usr/lib64/python2.6/fractions.pyR s s
\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 an optional
/(?P<denom>\d+) # / and denominator
| # or
\.(?P<decimal>\d*) # decimal point and fractional part
)?
\s*\Z # and optional whitespace to finish
c B sß e Z d Z d( Z d d d � Z e d � � Z e d � � Z d d � Z e d
� � Z
e d � � Z d � Z d
� Z
d � Z d � Z e e e i � \ Z Z d � Z e e e i � \ Z Z d � Z e e e i � \ Z Z d � Z e e e i � \ Z Z e e e i � \ Z! Z" d � Z# d � Z$ d � Z% d � Z& d � Z' d � Z( d � Z) d � Z* d � Z+ d � Z, d � Z- d � Z. d � Z/ d � Z0 d! � Z1 d" � Z2 d# � Z3 d$ � Z4 d% � Z5 d& � Z6 d' � Z7 RS() s� This class implements rational numbers.
Fraction(8, 6) will produce a rational number equivalent to
4/3. Both arguments must be Integral. 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 strings of the form
'[-+]?[0-9]+((/|.)[0-9]+)?', optionally surrounded by spaces.
t
_numeratort _denominatori i c C s¶ t t | � i | � } t | � t t f j o| d j o t | t � oÌ | } t i | � } | d j o t d | � � n | i d � } | i d � } | o$ t | | � } d t
| � } n) t | � } t | i d � p d � } | i d � d j o | } qFqJt | t � o | } | i } | i } qJn | d j o t d
| � � n t i | � } t i | � } t | | � } | | | _ | | | _ | S( s� Constructs a Fraction.
Takes a string like '3/2' or '1.5', another Fraction, or a
numerator/denominator pair.
i s Invalid literal for Fraction: %rt numt decimali
t denomt signt -i s Fraction(%s, 0)N( t superR t __new__t typet intt longt
isinstancet
basestringt _RATIONAL_FORMATt matcht Nonet
ValueErrort groupt lent Rationalt numeratort denominatort ZeroDivisionErrort operatort indexR R R ( t clsR R t selft inputt mR t other_rationalt g( ( s! /usr/lib64/python2.6/fractions.pyR
: s8 &
c C s¤ t | t i � o | | � St | t � p) t d | i | t | � i f � � n t i | � p t i | � o t d | | i f � � n | | i
� � S( s� Converts a finite float to a rational number, exactly.
Beware that Fraction.from_float(0.3) != Fraction(3, 10).
s. %s.from_float() only takes floats, not %r (%s)s Cannot convert %r to %s.( R t numberst Integralt floatt TypeErrort __name__R t matht isnant isinft as_integer_ratio( R t f( ( s! /usr/lib64/python2.6/fractions.pyt
from_floatj s # c C s d d k l } t | t i � o | t | � � } n: t | | � p) t d | i | t | � i f � � n | i � p t d | | i f � � n | i
� \ } } } t d i t t
| � � � } | o | } n | d j o | | d | � S| | d | � Sd S( sA Converts a finite Decimal instance to a rational number, exactly.iÿÿÿÿ( t Decimals2 %s.from_decimal() only takes Decimals, not %r (%s)s Cannot convert %s to %s.t i i
N( R R0 R R% R& R R( R) R t is_finitet as_tuplet joint mapt str( R t decR0 R
t digitst exp( ( s! /usr/lib64/python2.6/fractions.pyt from_decimalz s #
i@B c
C s; | d j o t d � � n | i | j o t | � Sd \ } } } } | i | i } } xq t oi | | } | | | } | | j o Pn | | | | | | f \ } } } } | | | | } } q` W| | | }
t | |
| | |
| � } t | | � } t | | � t | | � j o | S| Sd S( sW 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)
i s$ max_denominator should be at least 1i N( i i i i ( R R R R t Truet abs(
R t max_denominatort p0t q0t p1t q1t nt dR t q2t kt bound1t bound2( ( s! /usr/lib64/python2.6/fractions.pyt limit_denominator� s(
& !c C s | i S( N( R ( R ( ( s! /usr/lib64/python2.6/fractions.pyR Ç s c C s | i S( N( R ( R ( ( s! /usr/lib64/python2.6/fractions.pyR Ë s c C s d | i | i f S( s
repr(self)s Fraction(%s, %s)( R R ( R ( ( s! /usr/lib64/python2.6/fractions.pyt __repr__Ï s c C s6 | i d j o t | i � Sd | i | i f Sd S( s str(self)i s %s/%sN( R R6 R ( R ( ( s! /usr/lib64/python2.6/fractions.pyt __str__Ó s c sn � � f d � } d � i d | _ � i | _ � � f d � } d � i d | _ � i | _ | | f S( sÓ 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, long, 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, 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 sw t | t t t f � o � | | � St | t � o � t | � | � St | t � o � t | � | � St Sd S( N( R R R R R' t complext NotImplemented( R R ( t fallback_operatort monomorphic_operator( s! /usr/lib64/python2.6/fractions.pyt forward* s t __c s� t | t � o � | | � St | t i � o � t | � t | � � St | t i � o � t | � t | � � St Sd S( N( R R R% t RealR' t ComplexRK RL ( R R ( RM RN ( s! /usr/lib64/python2.6/fractions.pyt reverse6 s t __r( R) t __doc__( RN RM RO RS ( ( RM RN s! /usr/lib64/python2.6/fractions.pyt _operator_fallbacksÚ s P
c C s/ t | i | i | i | i | i | i � S( s a + b( R R R ( R R ( ( s! /usr/lib64/python2.6/fractions.pyt _addE s c C s/ t | i | i | i | i | i | i � S( s a - b( R R R ( R R ( ( s! /usr/lib64/python2.6/fractions.pyt _subM s c C s! t | i | i | i | i � S( s a * b( R R R ( R R ( ( s! /usr/lib64/python2.6/fractions.pyt _mulU s c C s! t | i | i | i | i � S( s a / b( R R R ( R R ( ( s! /usr/lib64/python2.6/fractions.pyt _div[ s c C s: | | } t | t � o | i | i St i | � Sd S( s a // bN( R R R R R* t floor( R R t div( ( s! /usr/lib64/python2.6/fractions.pyt __floordiv__c s
c C s: | | } t | t � o | i | i St i | � Sd S( s a // bN( R R R R R* R[ ( R R R\ ( ( s! /usr/lib64/python2.6/fractions.pyt
__rfloordiv__o s
c C s | | } | | | S( s a % b( ( R R R\ ( ( s! /usr/lib64/python2.6/fractions.pyt __mod__{ s
c C s | | } | | | S( s a % b( ( R R R\ ( ( s! /usr/lib64/python2.6/fractions.pyt __rmod__� s
c C s� t | t � o{ | i d j oS | i } | d j o t | i | | i | � St | i | | i | � Sq� t | � t | � Sn t | � | Sd S( s¾ 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.
i i N( R R R R R R R R' ( R R t power( ( s! /usr/lib64/python2.6/fractions.pyt __pow__� s
c C s~ | i d j o | i d j o | | i St | t � o t | i | i � | S| i d j o | | i S| t | � S( s a ** bi i ( R R R R R R R R' ( R R ( ( s! /usr/lib64/python2.6/fractions.pyt __rpow__� s c C s t | i | i � S( s+ +a: Coerces a subclass instance to Fraction( R R R ( R ( ( s! /usr/lib64/python2.6/fractions.pyt __pos__« s c C s t | i | i � S( s -a( R R R ( R ( ( s! /usr/lib64/python2.6/fractions.pyt __neg__¯ s c C s t t | i � | i � S( s abs(a)( R R< R R ( R ( ( s! /usr/lib64/python2.6/fractions.pyt __abs__³ s c C s3 | i d j o | i | i S| i | i Sd S( s trunc(a)i N( R R ( R ( ( s! /usr/lib64/python2.6/fractions.pyt __trunc__· s c C s\ | i d j o t | i � S| t | � j o t t | � � St | i | i f � Sd S( s� hash(self)
Tricky because values that are exactly representable as a
float must have the same hash as that float.
i N( R t hashR R' ( R ( ( s! /usr/lib64/python2.6/fractions.pyt __hash__¾ s
c C s� t | t � o$ | i | i j o | i | i j St | t i � o | i d j o
| i } n t | t
� o | | i | � j St
| � | j Sd S( s a == bi N( R R R R R R R% RR t imagt realR' R/ ( R R ( ( s! /usr/lib64/python2.6/fractions.pyt __eq__Ñ s #
c C s¦ t | t i � o | i d j o
| i } n t | t � o | i | � } n y | | } Wn t j
o t SXt | t � o | | i
d � S| | d � S( s Helper function for comparison operators.
Subtracts b from a, exactly if possible, and compares the
result with 0 using op, in such a way that the comparison
won't recurse. If the difference raises a TypeError, returns
NotImplemented instead.
i ( R R% RR Rj Rk R' R/ R( RL R R ( R R t opt diff( ( s! /usr/lib64/python2.6/fractions.pyt _subtractAndCompareToZeroà s #
c C s | i | t i � S( s a < b( Ro R t lt( R R ( ( s! /usr/lib64/python2.6/fractions.pyt __lt__ú s c C s | i | t i � S( s a > b( Ro R t gt( R R ( ( s! /usr/lib64/python2.6/fractions.pyt __gt__þ s c C s | i | t i � S( s a <= b( Ro R t le( R R ( ( s! /usr/lib64/python2.6/fractions.pyt __le__ s c C s | i | t i � S( s a >= b( Ro R t ge( R R ( ( s! /usr/lib64/python2.6/fractions.pyt __ge__ s c C s
| i d j S( s a != 0i ( R ( R ( ( s! /usr/lib64/python2.6/fractions.pyt __nonzero__
s c C s | i t | � f f S( N( t __class__R6 ( R ( ( s! /usr/lib64/python2.6/fractions.pyt
__reduce__ s c C s. t | � t j o | S| i | i | i � S( N( R R Ry R R ( R ( ( s! /usr/lib64/python2.6/fractions.pyt __copy__ s c C s. t | � t j o | S| i | i | i � S( N( R R Ry R R ( R t memo( ( s! /usr/lib64/python2.6/fractions.pyt __deepcopy__ s ( s
_numerators _denominator(8 R) t
__module__RU t __slots__R
t classmethodR/ R: RH t propertyR R RI RJ RV RW R t addt __add__t __radd__RX t subt __sub__t __rsub__RY t mult __mul__t __rmul__RZ t truedivt __truediv__t __rtruediv__R\ t __div__t __rdiv__R] R^ R_ R` Rb Rc Rd Re Rf Rg Ri Rl Ro Rq Rs Ru Rw Rx Rz R{ R} ( ( ( s! /usr/lib64/python2.6/fractions.pyR * sR 0 7 k ( RU t
__future__R R* R% R t ret __all__R R t compilet VERBOSER R ( ( ( s! /usr/lib64/python2.6/fractions.pyt <module> s
§ÚêLc @ s� d Z d d k l Z d d k Z d d k Z d d k Z d d k Z d d g Z e i Z d � Z e i
d e i � Z d e f d � � YZ
d S( s+ Rational, infinite-precision, real numbers.iÿÿÿÿ( t divisionNt Fractiont gcdc C s$ x | o | | | } } q W| S( s¶ Calculate 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).
( ( t at b( ( s! /usr/lib64/python2.6/fractions.pyR s s
\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 an optional
/(?P<denom>\d+) # / and denominator
| # or
\.(?P<decimal>\d*) # decimal point and fractional part
)?
\s*\Z # and optional whitespace to finish
c B sß e Z d Z d( Z d d d � Z e d � � Z e d � � Z d d � Z e d
� � Z
e d � � Z d � Z d
� Z
d � Z d � Z e e e i � \ Z Z d � Z e e e i � \ Z Z d � Z e e e i � \ Z Z d � Z e e e i � \ Z Z e e e i � \ Z! Z" d � Z# d � Z$ d � Z% d � Z& d � Z' d � Z( d � Z) d � Z* d � Z+ d � Z, d � Z- d � Z. d � Z/ d � Z0 d! � Z1 d" � Z2 d# � Z3 d$ � Z4 d% � Z5 d& � Z6 d' � Z7 RS() s� This class implements rational numbers.
Fraction(8, 6) will produce a rational number equivalent to
4/3. Both arguments must be Integral. 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 strings of the form
'[-+]?[0-9]+((/|.)[0-9]+)?', optionally surrounded by spaces.
t
_numeratort _denominatori i c C s¶ t t | � i | � } t | � t t f j o| d j o t | t � oÌ | } t i | � } | d j o t d | � � n | i d � } | i d � } | o$ t | | � } d t
| � } n) t | � } t | i d � p d � } | i d � d j o | } qFqJt | t � o | } | i } | i } qJn | d j o t d
| � � n t i | � } t i | � } t | | � } | | | _ | | | _ | S( s� Constructs a Fraction.
Takes a string like '3/2' or '1.5', another Fraction, or a
numerator/denominator pair.
i s Invalid literal for Fraction: %rt numt decimali
t denomt signt -i s Fraction(%s, 0)N( t superR t __new__t typet intt longt
isinstancet
basestringt _RATIONAL_FORMATt matcht Nonet
ValueErrort groupt lent Rationalt numeratort denominatort ZeroDivisionErrort operatort indexR R R ( t clsR R t selft inputt mR t other_rationalt g( ( s! /usr/lib64/python2.6/fractions.pyR
: s8 &
c C s¤ t | t i � o | | � St | t � p) t d | i | t | � i f � � n t i | � p t i | � o t d | | i f � � n | | i
� � S( s� Converts a finite float to a rational number, exactly.
Beware that Fraction.from_float(0.3) != Fraction(3, 10).
s. %s.from_float() only takes floats, not %r (%s)s Cannot convert %r to %s.( R t numberst Integralt floatt TypeErrort __name__R t matht isnant isinft as_integer_ratio( R t f( ( s! /usr/lib64/python2.6/fractions.pyt
from_floatj s # c C s d d k l } t | t i � o | t | � � } n: t | | � p) t d | i | t | � i f � � n | i � p t d | | i f � � n | i
� \ } } } t d i t t
| � � � } | o | } n | d j o | | d | � S| | d | � Sd S( sA Converts a finite Decimal instance to a rational number, exactly.iÿÿÿÿ( t Decimals2 %s.from_decimal() only takes Decimals, not %r (%s)s Cannot convert %s to %s.t i i
N( R R0 R R% R& R R( R) R t is_finitet as_tuplet joint mapt str( R t decR0 R
t digitst exp( ( s! /usr/lib64/python2.6/fractions.pyt from_decimalz s #
i@B c
C s; | d j o t d � � n | i | j o t | � Sd \ } } } } | i | i } } xq t oi | | } | | | } | | j o Pn | | | | | | f \ } } } } | | | | } } q` W| | | }
t | |
| | |
| � } t | | � } t | | � t | | � j o | S| Sd S( sW 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)
i s$ max_denominator should be at least 1i N( i i i i ( R R R R t Truet abs(
R t max_denominatort p0t q0t p1t q1t nt dR t q2t kt bound1t bound2( ( s! /usr/lib64/python2.6/fractions.pyt limit_denominator� s(
& !c C s | i S( N( R ( R ( ( s! /usr/lib64/python2.6/fractions.pyR Ç s c C s | i S( N( R ( R ( ( s! /usr/lib64/python2.6/fractions.pyR Ë s c C s d | i | i f S( s
repr(self)s Fraction(%s, %s)( R R ( R ( ( s! /usr/lib64/python2.6/fractions.pyt __repr__Ï s c C s6 | i d j o t | i � Sd | i | i f Sd S( s str(self)i s %s/%sN( R R6 R ( R ( ( s! /usr/lib64/python2.6/fractions.pyt __str__Ó s c sn � � f d � } d � i d | _ � i | _ � � f d � } d � i d | _ � i | _ | | f S( sÓ 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, long, 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, 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 sw t | t t t f � o � | | � St | t � o � t | � | � St | t � o � t | � | � St Sd S( N( R R R R R' t complext NotImplemented( R R ( t fallback_operatort monomorphic_operator( s! /usr/lib64/python2.6/fractions.pyt forward* s t __c s� t | t � o � | | � St | t i � o � t | � t | � � St | t i � o � t | � t | � � St Sd S( N( R R R% t RealR' t ComplexRK RL ( R R ( RM RN ( s! /usr/lib64/python2.6/fractions.pyt reverse6 s t __r( R) t __doc__( RN RM RO RS ( ( RM RN s! /usr/lib64/python2.6/fractions.pyt _operator_fallbacksÚ s P
c C s/ t | i | i | i | i | i | i � S( s a + b( R R R ( R R ( ( s! /usr/lib64/python2.6/fractions.pyt _addE s c C s/ t | i | i | i | i | i | i � S( s a - b( R R R ( R R ( ( s! /usr/lib64/python2.6/fractions.pyt _subM s c C s! t | i | i | i | i � S( s a * b( R R R ( R R ( ( s! /usr/lib64/python2.6/fractions.pyt _mulU s c C s! t | i | i | i | i � S( s a / b( R R R ( R R ( ( s! /usr/lib64/python2.6/fractions.pyt _div[ s c C s: | | } t | t � o | i | i St i | � Sd S( s a // bN( R R R R R* t floor( R R t div( ( s! /usr/lib64/python2.6/fractions.pyt __floordiv__c s
c C s: | | } t | t � o | i | i St i | � Sd S( s a // bN( R R R R R* R[ ( R R R\ ( ( s! /usr/lib64/python2.6/fractions.pyt
__rfloordiv__o s
c C s | | } | | | S( s a % b( ( R R R\ ( ( s! /usr/lib64/python2.6/fractions.pyt __mod__{ s
c C s | | } | | | S( s a % b( ( R R R\ ( ( s! /usr/lib64/python2.6/fractions.pyt __rmod__� s
c C s� t | t � o{ | i d j oS | i } | d j o t | i | | i | � St | i | | i | � Sq� t | � t | � Sn t | � | Sd S( s¾ 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.
i i N( R R R R R R R R' ( R R t power( ( s! /usr/lib64/python2.6/fractions.pyt __pow__� s
c C s~ | i d j o | i d j o | | i St | t � o t | i | i � | S| i d j o | | i S| t | � S( s a ** bi i ( R R R R R R R R' ( R R ( ( s! /usr/lib64/python2.6/fractions.pyt __rpow__� s c C s t | i | i � S( s+ +a: Coerces a subclass instance to Fraction( R R R ( R ( ( s! /usr/lib64/python2.6/fractions.pyt __pos__« s c C s t | i | i � S( s -a( R R R ( R ( ( s! /usr/lib64/python2.6/fractions.pyt __neg__¯ s c C s t t | i � | i � S( s abs(a)( R R< R R ( R ( ( s! /usr/lib64/python2.6/fractions.pyt __abs__³ s c C s3 | i d j o | i | i S| i | i Sd S( s trunc(a)i N( R R ( R ( ( s! /usr/lib64/python2.6/fractions.pyt __trunc__· s c C s\ | i d j o t | i � S| t | � j o t t | � � St | i | i f � Sd S( s� hash(self)
Tricky because values that are exactly representable as a
float must have the same hash as that float.
i N( R t hashR R' ( R ( ( s! /usr/lib64/python2.6/fractions.pyt __hash__¾ s
c C s� t | t � o$ | i | i j o | i | i j St | t i � o | i d j o
| i } n t | t
� o | | i | � j St
| � | j Sd S( s a == bi N( R R R R R R R% RR t imagt realR' R/ ( R R ( ( s! /usr/lib64/python2.6/fractions.pyt __eq__Ñ s #
c C s¦ t | t i � o | i d j o
| i } n t | t � o | i | � } n y | | } Wn t j
o t SXt | t � o | | i
d � S| | d � S( s Helper function for comparison operators.
Subtracts b from a, exactly if possible, and compares the
result with 0 using op, in such a way that the comparison
won't recurse. If the difference raises a TypeError, returns
NotImplemented instead.
i ( R R% RR Rj Rk R' R/ R( RL R R ( R R t opt diff( ( s! /usr/lib64/python2.6/fractions.pyt _subtractAndCompareToZeroà s #
c C s | i | t i � S( s a < b( Ro R t lt( R R ( ( s! /usr/lib64/python2.6/fractions.pyt __lt__ú s c C s | i | t i � S( s a > b( Ro R t gt( R R ( ( s! /usr/lib64/python2.6/fractions.pyt __gt__þ s c C s | i | t i � S( s a <= b( Ro R t le( R R ( ( s! /usr/lib64/python2.6/fractions.pyt __le__ s c C s | i | t i � S( s a >= b( Ro R t ge( R R ( ( s! /usr/lib64/python2.6/fractions.pyt __ge__ s c C s
| i d j S( s a != 0i ( R ( R ( ( s! /usr/lib64/python2.6/fractions.pyt __nonzero__
s c C s | i t | � f f S( N( t __class__R6 ( R ( ( s! /usr/lib64/python2.6/fractions.pyt
__reduce__ s c C s. t | � t j o | S| i | i | i � S( N( R R Ry R R ( R ( ( s! /usr/lib64/python2.6/fractions.pyt __copy__ s c C s. t | � t j o | S| i | i | i � S( N( R R Ry R R ( R t memo( ( s! /usr/lib64/python2.6/fractions.pyt __deepcopy__ s ( s
_numerators _denominator(8 R) t
__module__RU t __slots__R
t classmethodR/ R: RH t propertyR R RI RJ RV RW R t addt __add__t __radd__RX t subt __sub__t __rsub__RY t mult __mul__t __rmul__RZ t truedivt __truediv__t __rtruediv__R\ t __div__t __rdiv__R] R^ R_ R` Rb Rc Rd Re Rf Rg Ri Rl Ro Rq Rs Ru Rw Rx Rz R{ R} ( ( ( s! /usr/lib64/python2.6/fractions.pyR * sR 0 7 k ( RU t
__future__R R* R% R t ret __all__R R t compilet VERBOSER R ( ( ( s! /usr/lib64/python2.6/fractions.pyt <module> s