Michael Hoffman wrote: >>> For those who don't know, these implement a hash set/map which >>> iterates in the order that the keys were first added to the set/map. > > I would love to see such a thing.
I've proposed this on python-dev, but the general feeling so far is against it. So far the only use case is to remove duplicates without changing order, and there are iterator-based solutions which would normally be preferable. It's pretty simple to roll your own, and I'll probably put together a Cookbook recipe for it. Tim Delaney -- http://mail.python.org/mailman/listinfo/python-list
