Phrogz wrote:
> 
> I don't. I wouldn't call most JavaScript engines 'fast', but I suspect
> that has to do with aspects other than the native Object type.
> 
> Without having tried it, I would think that preserving insertion order
> would be a (small) memory size addition to each hash (as you've
> mentioned before), a *tiny* slowdown in the speed to store a new entry,
> and no performance change in accessing an entry.
> 
> Anyhow, because I'm too lazy to do so, you (or someone else) can get
> source code for the SpiderMonkey[1] and Rhino[2] and check out how
> insertion order is preserved on Object.
> 
> [1] http://www.mozilla.org/js/spidermonkey/ - the C-based JS engine
> [2] http://www.mozilla.org/rhino/ - the Java-based JS engine
> 

Haha... I've put that in my notes. That's all I guarantee right now.

Don't ever get in a laziness contest with a master.


Hal