[issue41487] Builtin bigint modulo operation can be made faster when the base is divisible by a large power of 2 (i.e: has many trailing 0 digits in binary)

[Karthikeyan Singaravelan]

Change by Karthikeyan Singaravelan <tir.kar...@gmail.com>:


----------
nosy: +lemburg, mark.dickinson, rhettinger, stutzbach

_______________________________________
Python tracker <rep...@bugs.python.org>
<https://bugs.python.org/issue41487>
_______________________________________
_______________________________________________
Python-bugs-list mailing list
Unsubscribe: 
https://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com