Steven Bethard <[EMAIL PROTECTED]> writes: > With this is the implementation, I'm definitely -1. Not because it's a > bad implementation, but because if the iteration is always doing a > sort, then there's no reason for a separate data structure.
Agreed. A true sorted dict would keep its keys sorted in the first place, a la C++ std::map. -- http://mail.python.org/mailman/listinfo/python-list
