On 2007-09-12, Mark Summerfield <[EMAIL PROTECTED]> wrote: > Actually I meant by key order, so insertion order doesn't > matter at all. If you need a dictionary-like data structure > that respects insertion order you could use a list of (key, > value) tuples. > > Another respondent asked about use cases.
A mapping with sorted keys could theoretically be convenient when your keys are comparable but not hashable. -- Neil Cerutti -- http://mail.python.org/mailman/listinfo/python-list
