Interesting--the Python-Dev folks are moving more and more of 3.x into the 2.x series (2.7 corresponds to 3.1). They're pretty effectively shortening the gap that people will eventually have to jump when going from 2 to 3.<p>I wonder how this will turn out, long-term? Seems like a good idea on the face of it.
> How does the OrderedDict work? It maintains a doubly-linked list of keys, appending new keys to the list as they’re inserted. A secondary dictionary maps keys to their corresponding list node, so deletion doesn’t have to traverse the entire linked list and therefore remains O(1).<p>Hmm... shouldn't that be `O(log n)` or something like that? Or do they really use cuckoo (or similar) hashing with O(1) hash access?