[issue1551113] random.choice(setinstance) fails

Tim Peters 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

[issue1551113] random.choice(setinstance) fails

Tim Peters 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

[issue1551113] random.choice(setinstance) fails

Changes by Tim Peters : -- ___ Python tracker ___ ___ Python-bugs-list mailing list Unsubscribe: http://mail.python.org/mailman/opt

[issue5557] Byte-code compilation uses excessive memory

Changes by Collin Winter : -- nosy: +collinwinter ___ Python tracker ___ ___ Python-bugs-list mailing list Unsubscribe: http://mail.py

[issue5573] multiprocessing Pipe poll() and recv() semantics.

Vaibhav Mallya added the comment: On second thought, it seems like it shouldn't make sense. This forces a destructive check. Suppose we do child.poll() and then child.recv() but it's legitimate data; that data will be removed from the queue even if we just wanted to check if the pipe was alive.

<    1   2