Christian Heimes <li...@cheimes.de> added the comment:
Is there any particular reason you are using bisect search with sorted list of integers? Why don't you use a simple approach with a dict of digest bytes? bisect search is O(log(n)), dict lookup is O(1) and therefore scales much better. ---------- _______________________________________ Python tracker <rep...@bugs.python.org> <https://bugs.python.org/issue42942> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: https://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
