Cryptographically random numbers
Wed Mar 8 02:30:22 CET 2006
Tim Hochberg <tim.hochberg at ieee.org> writes:
> > is fast, but if a is aliased, Python can't do the optimization, so
> Is this really true? After the first time through the loop, 'a' won't
> be aliased any more since strings are immutable.
Hmm, ok, there was some previous discussion of this problem and I
guess I mis-remembered it. Thanks. I think there is still a fairly
natural case where the optimization doesn't work. Anyone know?
More information about the Python-list