rossberg at google.com
Tue Feb 14 09:35:24 PST 2012
On 14 February 2012 18:15, Allen Wirfs-Brock <allen at wirfs-brock.com> wrote:
> On Feb 14, 2012, at 3:45 AM, Andreas Rossberg wrote:
>> Dynamic changes of representation, for example. V8 does things like
>> that all the time. And it currently goes to some length to make for-in
> Good hash table designs typically rehash (reorganize) themselves when they
> reach a certain percentage of their total capacity or are experiencing too
> many hash collisions. One of the simplest iteration strategies for a hash
> table is often physical placement order. Rehashing will typically change the
> physical placement of entries and hence that ordering.
Indeed. But I had in mind more radical changes like going from e.g. a
dense vector representation to a hashtable or a binary search tree.
More information about the es-discuss