Author mark.dickinson
Recipients PedanticHacker, Stefan Pochmann, mark.dickinson, mcognetta, pablogsal, rhettinger, serhiy.storchaka, tim.peters
Date 2021-12-20.10:56:21
SpamBayes Score -1.0
Marked as misclassified Yes
Message-id <1639997782.13.0.266731772465.issue37295@roundup.psfhosted.org>
In-reply-to
Content
> we can get faster code by using a small (3Kb) table of factorial logarithms

The problem here is that C gives no guarantees about accuracy of either log2 or exp2, so we'd be playing a guessing game about how far we can go before the calculation becomes unsafe (in the sense of the `round` operation potentially giving the wrong answer). I think it would be better to stick to integer-only arithmetic.
History
Date User Action Args
2021-12-20 10:56:22mark.dickinsonsetrecipients: + mark.dickinson, tim.peters, rhettinger, serhiy.storchaka, PedanticHacker, mcognetta, Stefan Pochmann, pablogsal
2021-12-20 10:56:22mark.dickinsonsetmessageid: <1639997782.13.0.266731772465.issue37295@roundup.psfhosted.org>
2021-12-20 10:56:22mark.dickinsonlinkissue37295 messages
2021-12-20 10:56:21mark.dickinsoncreate