/***** Code de MesExemples.com *******/ /************************************************************************************ Copyright (c) 2003, 2004 The Regents of the University of Michigan, Trustees of Indiana University,* Board of Trustees of the Leland Stanford, Jr., University, and The MIT Corporation** Licensed under the Educational Community License Version 1.0 (the "License");* By obtaining, using and/or copying this Original Work, you agree that you have read,* understand, and will comply with the terms and conditions of the Educational Community License.* You may obtain a copy of the License at:** http://cvs.sakaiproject.org/licenses/license_1_0.html** THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE* AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,* DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.***********************************************************************************/import org.w3c.dom.Node;public class Utils { /** * Search our next siblings for a given node * @param currentNode Starting point for our search * @param tagName Node name to look up * @return matching Node (null if none) */ public static Node getNextSiblingByName(Node currentNode, String tagName) { Node node = currentNode.getNextSibling(); while ((node != null) && (!node.getNodeName().equals(tagName))) { node = node.getNextSibling(); } return node; }} |
Code testé avec le fichier XML Suivant
<?xml version="1.0" encoding="windows-1252"?> <!-- Edited by MesEXemple.com --> <note> <to>Sakoba</to> <from>Adams</from> <heading>Rappel</heading> <body>Ne m'oubliez pas ce week-end!</body> </note> |
Cet article Java: Exemple de Recherche des prochains Noeud frères d’un nœud donné est apparu en premier sur .