1 /* ====================================================================
2 * The Apache Software License, Version 1.1
3 *
4 * Copyright (c) 2000 The Apache Software Foundation. All rights
5 * reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 *
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 *
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in
16 * the documentation and/or other materials provided with the
17 * distribution.
18 *
19 * 3. The end-user documentation included with the redistribution,
20 * if any, must include the following acknowledgment:
21 * "This product includes software developed by the
22 * Apache Software Foundation (http://www.apache.org/)."
23 * Alternately, this acknowledgment may appear in the software itself,
24 * if and wherever such third-party acknowledgments normally appear.
25 *
26 * 4. The names "Apache" and "Apache Software Foundation" must
27 * not be used to endorse or promote products derived from this
28 * software without prior written permission. For written
29 * permission, please contact apache@apache.org.
30 *
31 * 5. Products derived from this software may not be called "Apache",
32 * nor may "Apache" appear in their name, without prior written
33 * permission of the Apache Software Foundation.
34 *
35 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
36 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
37 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
38 * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
39 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
40 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
41 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
42 * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
43 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
44 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
45 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
46 * SUCH DAMAGE.
47 * ====================================================================
48 *
49 * This software consists of voluntary contributions made by many
50 * individuals on behalf of the Apache Software Foundation. For more
51 * information on the Apache Software Foundation, please see
52 * <http://www.apache.org/>;.
53 *
54 * Portions of this software are based upon public domain software
55 * originally written at the National Center for Supercomputing Applications,
56 * University of Illinois, Urbana-Champaign.
57 */
58
59 package net.sourceforge.jane.jjtree;
60
61 import java.util.Enumeration;
62 import java.util.NoSuchElementException;
63 import junit.framework.TestCase;
64
65 /***
66 * Tests {@link JJTreeUtils}.
67 *
68 * @author Calvin Yu
69 */
70 public class JJTreeUtilsTest extends TestCase
71 implements JavaParserConstants
72 {
73
74 private SimpleNode testNode;
75 private Node child1, child2, child3, child4;
76
77 /***
78 * Create a new <code>JJTreeUtilsTest</code>.
79 */
80 public JJTreeUtilsTest(String name)
81 {
82 super(name);
83 }
84
85 /***
86 * Tests {@link JJTreeUtils#findChild(Node,int,Class)}.
87 */
88 public void testFindChild()
89 {
90 Node node = JJTreeUtils.findChild(testNode, 0, SimpleNode.class);
91 assertEquals("simple node", child2, node);
92 node = JJTreeUtils.findChild(testNode, 1, JavaBlock.class);
93 assertEquals("block", child3, node);
94 }
95
96 /***
97 * Tests {@link JJTreeUtils#childNodes(Node,Class)}.
98 */
99 public void testChildNodes()
100 {
101 ChildNodeEnumeration children = JJTreeUtils.childNodes(testNode, JavaBlock.class);
102 assertChild(0, children, child1);
103 assertTrue("Extra hasMore... call", children.hasMoreElements());
104 assertChild(3, children, child3);
105 assertChild(4, children, child4);
106 assertTrue("No more", !children.hasMoreElements());
107 try {
108 children.nextElement();
109 fail("Expected NoSuchElementException");
110 } catch (NoSuchElementException e) {}
111
112 children.reset();
113 assertTrue("Reset", children.hasMoreElements());
114 }
115
116 /***
117 * Tests {@link JJTreeUtils#getNormalizedTokenImage(int)}.
118 */
119 public void testGetNormalizedTokenImage()
120 {
121 assertEquals("implements", "implements",
122 JJTreeUtils.getNormalizedTokenImage(IMPLEMENTS));
123 assertEquals("EOF", "<EOF>", JJTreeUtils.getNormalizedTokenImage(EOF));
124 }
125
126 /***
127 * Set up.
128 */
129 protected void setUp() throws Exception
130 {
131 int id = 0;
132 testNode = new SimpleNode(id++);
133 child1 = new JavaBlock(id++);
134 child2 = new SimpleNode(id++);
135 child3 = new JavaBlock(id++);
136 child4 = new JavaBlock(id++);
137
138 int i = 0;
139 testNode.jjtAddChild(child1, i++);
140 testNode.jjtAddChild(child2, i++);
141 testNode.jjtAddChild(child3, i++);
142 testNode.jjtAddChild(child4, i++);
143
144 super.setUp();
145 }
146
147 /***
148 * Assert that the child is the next element.
149 */
150 static private void assertChild(int idx, Enumeration children, Node expectedChild)
151 {
152 assertTrue("has child " + idx, children.hasMoreElements());
153 assertEquals("child " + idx, expectedChild, children.nextElement());
154 }
155
156 }
157
This page was automatically generated by Maven