1. 04 Eyl, 2016 2 kayıt (commit)
  2. 03 Eyl, 2016 1 kayıt (commit)
  3. 15 Agu, 2016 1 kayıt (commit)
  4. 28 Tem, 2016 1 kayıt (commit)
  5. 24 Nis, 2016 1 kayıt (commit)
  6. 31 May, 2015 1 kayıt (commit)
  7. 12 May, 2015 1 kayıt (commit)
  8. 11 Ock, 2015 1 kayıt (commit)
  9. 10 Nis, 2014 1 kayıt (commit)
  10. 03 Kas, 2013 2 kayıt (commit)
  11. 01 Haz, 2011 1 kayıt (commit)
  12. 10 May, 2011 1 kayıt (commit)
  13. 09 May, 2011 1 kayıt (commit)
  14. 08 May, 2011 1 kayıt (commit)
  15. 03 May, 2011 2 kayıt (commit)
  16. 16 Mar, 2011 2 kayıt (commit)
  17. 04 Ara, 2010 1 kayıt (commit)
  18. 21 Kas, 2010 2 kayıt (commit)
  19. 20 Kas, 2010 1 kayıt (commit)
  20. 07 Kas, 2010 1 kayıt (commit)
  21. 29 Eyl, 2010 1 kayıt (commit)
  22. 11 Tem, 2010 1 kayıt (commit)
  23. 07 Tem, 2010 2 kayıt (commit)
  24. 05 Tem, 2010 2 kayıt (commit)
  25. 13 Haz, 2010 2 kayıt (commit)
  26. 15 May, 2010 1 kayıt (commit)
    • Mark Dickinson's avatar
      Issue #8692: Improve performance of math.factorial: · 4c8a9a2d
      Mark Dickinson yazdı
      (1) use a different algorithm that roughly halves the total number of
          multiplications required and results in more balanced multiplications
      (2) use a lookup table for small arguments
      (3) fast accumulation of products in C integer arithmetic rather than
          PyLong arithmetic when possible.
      
      Typical speedup, from unscientific testing on a 64-bit laptop, is 4.5x
      to 6.5x for arguments in the range 100 - 10000.
      
      Patch by Daniel Stutzbach; extensive reviews by Alexander Belopolsky.
      4c8a9a2d
  27. 12 May, 2010 4 kayıt (commit)
  28. 06 Şub, 2010 2 kayıt (commit)