Java examples for XML:DOM Node
Count the DOM nodes of the supplied type (nodeType) before the supplied node, not including the node itself.
/*/*from w w w .j a v a 2 s . c om*/ * ePUB Corrector - https://github.com/vysokyj/epub-corrector/ * * Copyright (C) 2012 Jiri Vysoky * * ePUB Corrector is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published * by the Free Software Foundation; either version 3 of the License, * or (at your option) any later version. * * ePUB Corrector is distributed in the hope that it will be useful, but * WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * General Public License for more details. * * You should have received a copy of the GNU General Public License * along with Cobertura; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 * USA */ //package com.java2s; import org.w3c.dom.*; public class Main { /** * Count the DOM nodes of the supplied type (nodeType) before the supplied * node, not including the node itself. * <p/> * Counts the sibling nodes. * * @param node Node whose siblings are to be counted. * @param nodeType The DOM {@link Node} type of the siblings to be counted. * @return The number of siblings of the supplied type before the supplied node. */ public static int countNodesBefore(Node node, short nodeType) { Node parent = node.getParentNode(); if (parent == null) { System.out.println("Cannot count nodes before [" + node + "]. [" + node + "] has no parent."); return 0; } NodeList siblings = parent.getChildNodes(); int count = 0; int siblingCount = siblings.getLength(); for (int i = 0; i < siblingCount; i++) { Node sibling = siblings.item(i); if (sibling == node) { break; } if (sibling.getNodeType() == nodeType) { count++; } } return count; } /** * Count the DOM nodes before the supplied node, not including the node itself. * <p/> * Counts the sibling nodes. * * @param node Node whose siblings are to be counted. * @return The number of siblings before the supplied node. */ public static int countNodesBefore(Node node) { Node parent = node.getParentNode(); if (parent == null) { System.out.println("Cannot count nodes before [" + node + "]. [" + node + "] has no parent."); return 0; } NodeList siblings = parent.getChildNodes(); int count = 0; int siblingCount = siblings.getLength(); for (int i = 0; i < siblingCount; i++) { Node sibling = siblings.item(i); if (sibling == node) { break; } count++; } return count; } }