DO NOT REPLY TO THIS EMAIL, BUT PLEASE POST YOUR BUG RELATED COMMENTS THROUGH THE WEB INTERFACE AVAILABLE AT <http://nagoya.apache.org/bugzilla/show_bug.cgi?id=6888>. ANY REPLY MADE TO THIS MESSAGE WILL NOT BE COLLECTED AND INSERTED IN THE BUG DATABASE.
http://nagoya.apache.org/bugzilla/show_bug.cgi?id=6888 NodeIterator [EMAIL PROTECTED] changed: What |Removed |Added ---------------------------------------------------------------------------- Priority|Other |High ------- Additional Comments From [EMAIL PROTECTED] 2002-03-12 00:12 ------- Looks like the NodeIterator implementation, at least in the version of the code I'm looking at, is definitely wrong. It's determining whether to it needs to reset itself based on Node matchNodeOrParent(Node node) -- which only looks at whether the node being removed is a descendent of the root. That is NOT the correct criterion; we should only have to fix up iteration if the removed node is an _ancestor_ of the _reference_position_node_. This is a serious implementation error. It can be coded around, but only by not using NodeIterator. For a detailed description of expected behavior, please see: http://www.w3.org/TR/2000/REC-DOM-Level-2-Traversal-Range-20001113/traversal.htm l#Iterator-overview --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
