Raymond Hettinger <raymond.hettin...@gmail.com> added the comment:
Presumably the OP is referring to this text: """ `powerloop()` emulates these divisions, 1 bit at a time, using comparisons, subtractions, and shifts in a loop. You'll notice the paper uses an O(1) method instead, but that relies on two things we don't have: - An O(1) "count leading zeroes" primitive. We can find such a thing as a C extension on most platforms, but not all, and there's no uniform spelling on the platforms that support it. - Integer division on an integer type twice as wide as needed to hold the list length. But the latter is Py_ssize_t for us, and is typically the widest native signed integer type the platform supports. But since runs in our algorithm are almost never very short, the once-per-run overhead of `powerloop()` seems lost in the noise. """ ---------- assignee: docs@python -> tim.peters nosy: +rhettinger _______________________________________ Python tracker <rep...@bugs.python.org> <https://bugs.python.org/issue46488> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: https://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
