Thanks for the info — <img src="{SMILIES_PATH}/icon_e_smile.gif" alt=":)" title="Smile">
Do you have any advice on which way to go if I want my list/tree interactions to be fast?
1. I think arrays could work, if I link them together to form more complex structures. The first thing I was considering building was a plugin like the C2 Dictionary, but with each key linking to an array/list instead of a single value. That said, hash tables are actually closer to what I was looking for, so objects might be a good approach as far as performance goes.
2. Good to know. Yeah, JQuery looked like it was mostly aimed at DOM traversal and other webpage-y stuff.
3. JSON would be pretty nice if its not too slow.
1a. Do you know off hand if deleting a property from an object is likely to change its performance?
Quite a while back, I read about interpreter optimizations that assume that objects are usually used for OOP, for which property deletion is unlikely. With interpreters being optimized for that purpose, interaction with an object takes a permanent performance hit upon the first deletion of a property from that object.
The only thing I could find about this was a discussion of the Chrome engine from 2009, so it may not be an issue any more:
(see time 8:16) http://channel9.msdn.com/Shows/Going+De ... al-Machine
3a. How fast is JSON compared to using objects for data structure purposes?
For instance, with JSON, I'm not sure if the underlying code is moving between nodes by following references, or if it is actually parsing its way through large segments of JSON text. I would think that parsing text would be the slower method in general, but even if JSON is doing everything via text, for all I know it could be getting some kind of special treatment by the interpreter.