On Feb 20, 8:12 am, "Jorge Vargas" <[EMAIL PROTECTED]> wrote: > I need a data structure that will let me do: > > - attribute access (or index) > - maintain the order (for iter and print) > - be mutable. > > in case there isn't one. I was thinking having a base class like > Bunchhttp://aspn.activestate.com/ASPN/Cookbook/Python/Recipe/52308and on > top of that keeping a list of the keys and pop/push to the list when > adding/deleting items. I don't like this idea because I'll have to > keep each key twice. (in the list and in __dict__, is this the only > way of doing it?
OrderedDict is usually the term used here for this (not to be confused with SortedDict, which is a mapping type with identically sorted keys). It's asked for pretty often but no one's stepped up to implement one for the standard library. Carl Banks -- http://mail.python.org/mailman/listinfo/python-list
