node.insertAfter(newKid,refChild), if it existed, would be precisely equivalent to node.insertBefore(newKid,refChild.getNextSibling()). Note that inserting before null means inserting at the end of the list, so the Right Thing should happen even in that case. Also note that a shorthand in that case is node.appendChild(newKid). So insertAfter might be convenient, but isn't strictly necessary. Which is why we left it out of Level 1. ______________________________________ Joe Kesselman / IBM ResearchReceived on Wednesday, 8 March 2000 11:49:51 GMT
This archive was generated by hypermail 2.2.0+W3C-0.50 : Tuesday, 27 October 2009 08:24:51 GMT