Antoon Pardon wrote:
Op 2004-12-22, Jeff Shannon schreef <[EMAIL PROTECTED]>:
The problem is that once the object has mutated, you *don't know* what
bucket it used to sort into. There is no point at which a dictionary
can see "before" and "after" -- it just sees two different lists.
This is half the problem. In the period where an element is in the
wrong hash bucket, a new entry for the same value can be created in
the proper hash bucket. Then the code will have to determine how to
merge two entries at rehash time.
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
