[issue42911] Addition chains for pow saves 5-20% time for pow(int, int)

[Jurjen N.E. Bos]

Jurjen N.E. Bos <jneb at users.sourceforge.net> added the comment:

...not to mention the new gcd and lcm functions, and the fact that the number conversion is linear for exponent-of-two bases, and the negative power modulo a prime number!

----------

_______________________________________
Python tracker <report at bugs.python.org>
<https://bugs.python.org/issue42911>
_______________________________________