On Wed, 20 Jan 2010 22:21:22 -0800, Dennis Lee Bieber wrote: > On Thu, 21 Jan 2010 02:02:02 +0100, "Jan Kaliszewski" > <z...@chopin.edu.pl> declaimed the following in > gmane.comp.python.general: > >> Hello, >> >> Inspired by some my needs as well as some discussions in the net, I've >> implemented a sorted dictionary (i.e. a dict that returns keys, values >> and items always sorted by keys): >> > How does this differ from all the other "ordered dictionary" > schemes out there (and maybe even included in 2.7? I'm still on 2.5)
Ordered dicts remember the insertion order of keys. Sorted dicts return the keys in sorted order. -- Steven -- http://mail.python.org/mailman/listinfo/python-list
