Blocked revisions 81196 via svnmerge

Browse Source

........
  r81196 | mark.dickinson | 2010-05-15 18:02:38 +0100 (Sat, 15 May 2010) | 13 lines

  Issue #8692: Improve performance of math.factorial:

  (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.
........

...

This commit is contained in:

Mark Dickinson 2010-05-16 08:39:09 +00:00

parent f21d497b12

commit d05f93da31

Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL

Show Stats Download Patch File Download Diff File Expand all files Collapse all files

Diff Content Not Available