Use Fraction's private attributes in arithmetic methods

That's slightly faster for small components. Before: $ ./python -m timeit -r11 -s 'from fractions import Fraction as F' \ -s 'a = F(10, 3)' -s 'b = F(6, 5)' 'a + b' 20000 loops, best of 11: 12.1 usec per loop $ ./python -m timeit -r11 -s 'from fractions import Fraction as F' \ -s 'a = F(10, 3)' -s 'b = 7' 'a + b' 20000 loops, best of 11: 11.4 usec per loop After: $ ./python -m timeit -r11 -s 'from fractions import Fraction as F' \ -s 'a = F(10, 3)' -s 'b = F(6, 5)' 'a + b' 50000 loops, best of 11: 9.74 usec per loop $ ./python -m timeit -r11 -s 'from fractions import Fraction as F' \ -s 'a = F(10, 3)' -s 'b = 7' 'a + b' 20000 loops, best of 11: 16.5 usec per loop On the master: $ ./python -m timeit -r11 -s 'from fractions import Fraction as F' \ -s 'a = F(10, 3)' -s 'b = F(6, 5)' 'a + b' 50000 loops, best of 11: 9.61 usec per loop $ ./python -m timeit -r11 -s 'from fractions import Fraction as F' \ -s 'a = F(10, 3)' -s 'b = 7' 'a + b' 50000 loops, best of 11: 9.11 usec per loop

Author: skirpichev

Lib/fractions.py

@@ -355,8 +355,10 @@ class doesn't subclass a concrete type, there's no
 
  """
 defforward(a, b):
-ifisinstance(b, (int, Fraction)):
+ifisinstance(b, Fraction):
 returnmonomorphic_operator(a, b)
+elifisinstance(b, int):
+returnmonomorphic_operator(a, Fraction(b))
 elifisinstance(b, float):
 returnfallback_operator(float(a), b)
 elifisinstance(b, complex):
@@ -367,9 +369,10 @@ def forward(a, b):
 forward.__doc__=monomorphic_operator.__doc__
 
 defreverse(b, a):
-ifisinstance(a, numbers.Rational):
-# Includes ints.
+ifisinstance(a, Fraction):
 returnmonomorphic_operator(a, b)
+elifisinstance(a, numbers.Integral):
+returnmonomorphic_operator(Fraction(a), b)
 elifisinstance(a, numbers.Real):
 returnfallback_operator(float(a), float(b))
 elifisinstance(a, numbers.Complex):
@@ -444,8 +447,8 @@ def reverse(b, a):
 # common factors are removed by g1 == gcd(na, db).
 
 def_add_sub_(a, b, pm=int.__add__):
-na, da=a.numerator, a.denominator
-nb, db=b.numerator, b.denominator
+na, da=a._numerator, a._denominator
+nb, db=b._numerator, b._denominator
 g=math.gcd(da, db)
 ifg==1:
 returnFraction(pm(na*db, da*nb), da*db, _normalize=False)
@@ -465,8 +468,8 @@ def _add_sub_(a, b, pm=int.__add__):
 
 def_mul(a, b):
 """a * b"""
-na, da=a.numerator, a.denominator
-nb, db=b.numerator, b.denominator
+na, da=a._numerator, a._denominator
+nb, db=b._numerator, b._denominator
 g1=math.gcd(na, db)
 g2=math.gcd(nb, da)
 returnFraction((na//g1) * (nb//g2),
@@ -477,8 +480,8 @@ def _mul(a, b):
 def_div(a, b):
 """a / b"""
 # Same as _mul(), with inversed b.
-na, da=a.numerator, a.denominator
-nb, db=b.numerator, b.denominator
+na, da=a._numerator, a._denominator
+nb, db=b._numerator, b._denominator
 g1=math.gcd(na, nb)
 g2=math.gcd(db, da)
 n, d= (na//g1) * (db//g2), (nb//g1) * (da//g2)