| commit | b7fbcd396fc4a366433cf6f26cae64fecb056099 | [log] [tgz] |
|---|---|---|
| author | Antoine Pitrou <solipsis@pitrou.net> | Sat Jan 16 18:37:38 2010 +0000 |
| committer | Antoine Pitrou <solipsis@pitrou.net> | Sat Jan 16 18:37:38 2010 +0000 |
| tree | 15efa75386a0f8e2d8381267a0c2edd6b551aac3 | |
| parent | a8f480f54597cf20e460b12e17bb0416a8008868 [diff] |
Issue #6690: Optimize the bytecode for expressions such as `x in {1, 2, 3}`,
where the right hand operand is a set of constants, by turning the set into
a frozenset and pre-building it as a constant. The comparison operation
is made against the constant instead of building a new set each time it is
executed (a similar optimization already existed which turned a list of
constants into a pre-built tuple). Patch and additional tests by Dave
Malcolm.