1. 09 May, 2010 3 kayıt (commit)
  2. 08 May, 2010 1 kayıt (commit)
  3. 07 Nis, 2010 1 kayıt (commit)
  4. 06 Nis, 2010 2 kayıt (commit)
  5. 30 Ock, 2010 1 kayıt (commit)
  6. 02 Ock, 2010 1 kayıt (commit)
    • Mark Dickinson's avatar
      Refactor some longobject internals: PyLong_AsDouble and _PyLong_AsScaledDouble · d3e32321
      Mark Dickinson yazdı
      (the latter renamed to _PyLong_Frexp) now use the same core code.  The
      exponent produced by _PyLong_Frexp now has type Py_ssize_t instead of the
      previously used int, and no longer needs scaling by PyLong_SHIFT.  This
      frees the math module from having to know anything about the PyLong
      implementation.  This closes issue #5576.
      d3e32321
  7. 27 Ara, 2009 1 kayıt (commit)
  8. 21 Ara, 2009 1 kayıt (commit)
  9. 25 Eki, 2009 1 kayıt (commit)
  10. 28 Eyl, 2009 1 kayıt (commit)
    • Mark Dickinson's avatar
      Style/consistency/nano-optimization nit: replace occurrences of · 71adc932
      Mark Dickinson yazdı
        (high_bits << PyLong_SHIFT) + low_bits with
        (high_bits << PyLong_SHIFT) | low_bits
      in Objects/longobject.c.  Motivation:
       - shouldn't unnecessarily mix bit ops with arithmetic ops (style)
       - this pattern should be spelt the same way thoughout (consistency)
       - it's very very very slightly faster: no need to worry about
         carries to the high digit (nano-optimization).
      71adc932
  11. 21 Eyl, 2009 1 kayıt (commit)
  12. 16 Eyl, 2009 1 kayıt (commit)
  13. 13 Eyl, 2009 1 kayıt (commit)
  14. 06 Eyl, 2009 1 kayıt (commit)
  15. 02 May, 2009 1 kayıt (commit)
  16. 20 Nis, 2009 1 kayıt (commit)
  17. 02 Nis, 2009 1 kayıt (commit)
  18. 23 Mar, 2009 1 kayıt (commit)
    • Mark Dickinson's avatar
      Issue #5512: speed up the long division algorithm for Python longs. · 0b666bfd
      Mark Dickinson yazdı
      The basic algorithm remains the same; the most significant speedups
      come from the following three changes:
      
        (1) normalize by shifting instead of multiplying and dividing
        (2) the old algorithm usually did an unnecessary extra iteration of
            the outer loop; remove this.  As a special case, this means that
            long divisions with a single-digit result run twice as fast as
            before.
        (3) make inner loop much tighter.
      
      Various benchmarks show speedups of between 50% and 150% for long
      integer divisions and modulo operations.
      0b666bfd
  19. 20 Mar, 2009 1 kayıt (commit)
  20. 25 Şub, 2009 1 kayıt (commit)
  21. 15 Şub, 2009 2 kayıt (commit)
  22. 10 Şub, 2009 1 kayıt (commit)
  23. 26 Ock, 2009 2 kayıt (commit)
  24. 25 Ock, 2009 1 kayıt (commit)
  25. 24 Ock, 2009 1 kayıt (commit)
  26. 17 Ara, 2008 1 kayıt (commit)
  27. 04 Agu, 2008 1 kayıt (commit)
  28. 31 Tem, 2008 1 kayıt (commit)
  29. 10 Tem, 2008 1 kayıt (commit)
  30. 24 Haz, 2008 1 kayıt (commit)
  31. 20 Haz, 2008 1 kayıt (commit)
  32. 09 Haz, 2008 1 kayıt (commit)
  33. 01 Haz, 2008 2 kayıt (commit)
  34. 30 May, 2008 1 kayıt (commit)