When you are using an object as a hash map, using delete is OK, because then the object is very probably already in dictionary (= hash map) mode. Playing GC by hand is not necessary and almost always the wrong thing, anyway.
Is there a semantic reason for the structuring of the keys or do you intentionally want to use a trie? If the keys are conceptually flat, you can perhaps get better performance by just letting the JavaScript engine do the hashing of the flat keys. Mixing hashing and tree structures is often not a good idea: IIRC, there is an exercise in one of the classic Knuth books where you have to prove that a "clever" hash table with binary trees as buckets is worse than a simpler hash table with some probing strategy or linear chaining (don't remember). What is a "big integer set implementation"? Cheers, S. -- v8-users mailing list [email protected] http://groups.google.com/group/v8-users
