- From: John Cowan <cowan@locke.ccil.org>
- Date: Fri, 05 Mar 1999 14:44:44 -0500
- To: DOM List <www-dom@w3.org>
Ray Whitmer wrote: > NodeList implementations, I suppose you mean "NodeIterator implementations". > unlike NodeLists, does not involve a cache to > be dumped, because they do not offer random access, so as I showed > above, it is extremely efficient under mutation. [snip] > NodeIterator, on the other hand, has no caching issues, because it only > visits each node once. Not necessarily! As I pointed out, if the action taken at each node is to remove it and reinsert it as the last child of its parent, NodeIterators will have to maintain a history list if they want to be sure of visiting each node only once. -- John Cowan http://www.ccil.org/~cowan cowan@ccil.org You tollerday donsk? N. You tolkatiff scowegian? Nn. You spigotty anglease? Nnn. You phonio saxo? Nnnn. Clear all so! 'Tis a Jute.... (Finnegans Wake 16.5)
Received on Friday, 5 March 1999 14:45:08 UTC