Tim Peters <tim.pet...@gmail.com> added the comment: The CPython set/dict implementation does not guarantee "minimal constant density", so "quite easy" doesn't apply in reality. For example, a set that once contained a million elements may still contain a million /slots/ for elements after all but one of the elements has been removed. And in that case, the only way to find the sole occupied slot is to search over the million allocated slots.
In short, all the comments in this item from 2006 still apply without change. ---------- _______________________________________ Python tracker <rep...@bugs.python.org> <http://bugs.python.org/issue1551113> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: http://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
