➜

This issue tracker has been migrated to GitHub, and is currently read-only.
For more information, see the GitHub FAQs in the Python's Developer Guide.

Author belopolsky
Recipients belopolsky, mark.dickinson, rhettinger, stutzbach
Date 2010-05-12.00:38:39
SpamBayes Score 0.005547898
Marked as misclassified No
Message-id <AANLkTil2JQ6qpoPMlBHo13d9m294iJr4_Ov5m_8fGfSr@mail.gmail.com>
In-reply-to <AANLkTilraSE7gFoSVOsuN7LPFhWavoEMMBjil-IqB_gP@mail.gmail.com>
Content 
On Tue, May 11, 2010 at 7:42 PM, Daniel Stutzbach
<report@bugs.python.org> wrote:
..
> Isn't that adding an extra check in every case ...

Speaking of micro-optimizations, did you consider a better than naive
algorithm for "Count the number of set bits in n" in your patch?
HAKMEM 169 comes to mind and being a divide and conquer too, it seems
like a good fit.   Certainly an overkill if used just for
math.factorial(), but this is probably a useful function to have
around.
History
Date User Action Args
2010-05-12 00:38:42belopolskysetrecipients: + belopolsky, rhettinger, mark.dickinson, stutzbach
2010-05-12 00:38:40belopolskylinkissue8692 messages
2010-05-12 00:38:39belopolskycreate