Ooh, can you point me to them? This sounds very interesting. The only way I can think of doing it is to have some fun with pointers and not make the final copy until a change is made to the table. I'd love to read about an algoritm which can get around this! I feel so behind in the times, I still prefer the simpliciy of the redblacktree sometimes =p Paul Rubin wrote: > There are ways to do it so you don't have to copy, but the dict would > then no longer be a straightforward hash table.
-- http://mail.python.org/mailman/listinfo/python-list
