[issue19171] pow() improvement on longs

[Tim Peters]

Tim Peters added the comment:

I'll revert the 2.7 change if people agree that's a good thing.  I'm fine with it as-is.  Armin pulled the idea from timing a Python public-key crypto project (see the original message in this report), where he found a 14% improvement.

I don't care if the trivial exponent == 0 case slows down - that's _truly_ unlikely ;-)  The time spent special-casing it would marginally slow down other cases without good reason.  For any exponent other than 0, reduction by the base must be done.

----------

_______________________________________
Python tracker <report at bugs.python.org>
<http://bugs.python.org/issue19171>
_______________________________________