Removing DOM element effectively

Question

How can i efficiently remove child element from a Node? I have a scenario like this I have an xml doc given below
<menudocument>
<parentmenu name="menu">
<item title="Home" url="http://localhost:8081/struts" permission="home.show"; />
<menu name="create menus">
<item title="Create Person" url="/struts/jsp/Personcreate.jsp"; permission="Hide" />
<item title="Create Shop" url="/struts/jsp/ShopCreate.jsp"; permission="Hide" />
<item title="Create Book" url="/struts/jsp/BookCreate.jsp"; permission="Hide" />
</menu>
<menu name="search">
<item title="Search Book" url="/jsp/book!startSearch.action"; permission="book.search"; />
<item title="Search Person" url="/jsp/person!startSearch.action"; permission="Hide" />
</menu>
<menu name="sample menu">
<item title="Item Text1" url="itemurl.do"; permission="text1.item"; />
<item title="Item Text1" url="itemurl.do"; permission="Hide" />
</menu>
<menu name="dummy menu">
<item title="Dummy Title" rul="dummyurl" permission="title.dummy"; />
</menu>
</parentmenu>
</menudocument> Here if the permission attribute of an element is 'Hide' I have to remove that element from the document
I have a code snippet like below but i don't know why it is not removing all the elements with attribute value 'Hide'
File menuFile = new File("XMLmenuFile.xml";);
DocumentBuilder builder = Document().newDocumentBuilder();
Document menuDocument = builder.parse(menuFile);
NodeList nodes = menuDocument.getElementsByTagName("item");
for (int i = 0; i < nodes.getLength(); i++) {
Element itemTag = (Element) nodes.item(i);
if (itemTag.getAttribute("permission")).equalsIgnoreCase("Hide")) {
// remove the corresponding nodes from the new tree
itemTag.getParentNode().removeChild(itemTag);
} Any help will be greatly appreciated.
Thanks,

Answer 1

Is it only removing some of them? Then you are encountering the classic gotcha that when you remove an entry from a numbered list, you renumber all the entries after that one. But your code, which simply goes from 0 to n, doesn't account for that. If you traverse the entries from n to 0 then the problem doesn't arise.