Author stutzbach
Recipients belopolsky, mark.dickinson, rhettinger, stutzbach
Date 2010-05-11.23:42:26
SpamBayes Score 0.0159647
Marked as misclassified No
Message-id <AANLkTilraSE7gFoSVOsuN7LPFhWavoEMMBjil-IqB_gP@mail.gmail.com>
In-reply-to <1273617211.59.0.766982968625.issue8692@psf.upfronthosting.co.za>
Content
On Tue, May 11, 2010 at 5:33 PM, Alexander Belopolsky
<report@bugs.python.org> wrote:
> It seems to me that the value of n for which number of digits will exceed sys.maxsize can be estimated fairly accurately using Stirling formula.  Only two values are relevant in practice - one for sys.maxsize = 2**63-1 and the other for sys.maxsize = 2**31-1.  These values can be hardcoded and factorial can quickly report the case when n! will exceed maxsize digits instead of hanging until memory is exhausted.

Isn't that adding an extra check in every case to speed up a
you-can't-seriously-expect-that-to-work corner case?
History
Date User Action Args
2010-05-11 23:42:28stutzbachsetrecipients: + stutzbach, rhettinger, mark.dickinson, belopolsky
2010-05-11 23:42:26stutzbachlinkissue8692 messages
2010-05-11 23:42:26stutzbachcreate