This issue tracker has been migrated to GitHub, and is currently read-only.
For more information, see the GitHub FAQs in the Python's Developer Guide.

Author pitrou
Recipients belopolsky, pitrou, rhettinger, spiv
Date 2010-05-12.13:19:13
SpamBayes Score 0.001967724
Marked as misclassified No
Message-id <>
> 1. In constrained memory environments, creating a temporary internal
> copy of a large set may cause the difference operation to fail that
> would otherwise succeed.

It's a space/time tradeoff. There's nothing wrong about that.
(do note that hash tables themselves take much more space than the "equivalent" list)

> 2. The break-even point between extra lookups and a copy is likely to
> be different on different systems or even on the same system under
> different loads.

So what? It's just a matter of choosing reasonable settings. There are other optimization heuristics in the interpreter.

The optimization here looks ok to me.
Date User Action Args
2010-05-12 13:19:15pitrousetrecipients: + pitrou, rhettinger, spiv, belopolsky
2010-05-12 13:19:15pitrousetmessageid: <>
2010-05-12 13:19:14pitroulinkissue8685 messages
2010-05-12 13:19:13pitroucreate