Logged In: YES user_id=80475 Collin, you are welcome to write to me directly to discuss the results of your dynamic analysis. I suspect your results are almost certainly incorrect. The prediction was originally added after a detailed analysis of a great deal of Python code and checking the results of multiple pieces of benchmark code. Please do not arbitrarily start removing these unless you're damned certain the original study was erronenous. Also, I suspect that the given percentage does not reflect the conditional probability of the preceding PREDICT (STORE_FAST). The overwhelming majority of cases needing optimization involve "for x in iterable" where x is a fast local. If that prediction fails, then the next most common case is "for x,y in iterable". The latter is highly likely whenever we know the former has not occured. IOW, the unpack sequence may only come up 6% of the time, but its conditional probability rises above 90% when it follows the other prediction. Also, take some case with dynamic analysis. It is always tricky because it is very difficult to find truly representative code and to not have a single anomalous case run over and over again.
