Set iterators

Allen Wirfs-Brock allen at
Tue Feb 14 09:38:41 PST 2012

On Feb 14, 2012, at 9:35 AM, Andreas Rossberg wrote:

> On 14 February 2012 18:15, Allen Wirfs-Brock <allen at> 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
>>> deterministic.
>> 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.

Yes, all quite reasonable internal transformations for any identify-keyed data structure.


More information about the es-discuss mailing list