    1   /*
    2    * Copyright 2001-2005 (C) MetaStuff, Ltd. All Rights Reserved.
    3    *
    4    * This software is open source.
    5    * See the bottom of this file for the licence.
    6    */
    7
    8   package org.dom4j;
    9
    10  import junit.textui.TestRunner;
    11
    12  import java.util.Iterator;
    13
    14  import org.dom4j.io.SAXReader;
    15
    16  /***
    17   * A test harness for SAXReader option setMergeAdjacentText(true)
    18   *
    19   * @author <a href="mailto:slehmann@novell.com">Steen Lehmann </a>
    20   * @version $Revision: 1.4 $
    21   */
    22  public class MergeTextTest extends AbstractTestCase {
    23      /*** Input XML file to read */
    24      private static final String INPUT_XML_FILE = "/xml/test/mergetext.xml";
    25
    26      public static void main(String[] args) {
    27          TestRunner.run(MergeTextTest.class);
    28      }
    29
    30      // Test case(s)
    31      // -------------------------------------------------------------------------
    32      public void testNoAdjacentText() throws Exception {
    33          // After reading using SAXReader with mergeAdjacentText true,
    34          // no two Text objects should be adjacent to each other in the
    35          // document.
    36          SAXReader reader = new SAXReader();
    37          reader.setMergeAdjacentText(true);
    38
    39          Document document = getDocument(INPUT_XML_FILE, reader);
    40
    41          checkNoAdjacent(document.getRootElement());
    42          log("No adjacent Text nodes in " + document.asXML());
    43      }
    44
    45      // Implementation methods
    46      // -------------------------------------------------------------------------
    47      private void checkNoAdjacent(Element parent) {
    48          // Check that no two Text nodes are adjacent in the parent's content
    49          Node prev = null;
    50          Iterator iter = parent.nodeIterator();
    51
    52          while (iter.hasNext()) {
    53              Node n = (Node) iter.next();
    54
    55              if (n instanceof Text && ((prev != null) && prev instanceof Text)) {
    56                  fail("Node: " + n + " is text and so is its "
    57                          + "preceding sibling: " + prev);
    58              } else if (n instanceof Element) {
    59                  checkNoAdjacent((Element) n);
    60              }
    61
    62              prev = n;
    63          }
    64      }
    65  }
    66
    67  /*
    68   * Redistribution and use of this software and associated documentation
    69   * ("Software"), with or without modification, are permitted provided that the
    70   * following conditions are met:
    71   *
    72   * 1. Redistributions of source code must retain copyright statements and
    73   * notices. Redistributions must also contain a copy of this document.
    74   *
    75   * 2. Redistributions in binary form must reproduce the above copyright notice,
    76   * this list of conditions and the following disclaimer in the documentation
    77   * and/or other materials provided with the distribution.
    78   *
    79   * 3. The name "DOM4J" must not be used to endorse or promote products derived
    80   * from this Software without prior written permission of MetaStuff, Ltd. For
    81   * written permission, please contact dom4j-info@metastuff.com.
    82   *
    83   * 4. Products derived from this Software may not be called "DOM4J" nor may
    84   * "DOM4J" appear in their names without prior written permission of MetaStuff,
    85   * Ltd. DOM4J is a registered trademark of MetaStuff, Ltd.
    86   *
    87   * 5. Due credit should be given to the DOM4J Project - http://www.dom4j.org
    88   *
    89   * THIS SOFTWARE IS PROVIDED BY METASTUFF, LTD. AND CONTRIBUTORS ``AS IS'' AND
    90   * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
    91   * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
    92   * ARE DISCLAIMED. IN NO EVENT SHALL METASTUFF, LTD. OR ITS CONTRIBUTORS BE
    93   * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
    94   * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
    95   * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
    96   * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
    97   * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
    98   * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
    99   * POSSIBILITY OF SUCH DAMAGE.
    100  *
    101  * Copyright 2001-2005 (C) MetaStuff, Ltd. All Rights Reserved.
    102  */