1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
|
/*
* Copyright (C) 2007-2010 Júlio Vilmar Gesser.
* Copyright (C) 2011, 2013-2016 The JavaParser Team.
*
* This file is part of JavaParser.
*
* JavaParser can be used either under the terms of
* a) the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
* b) the terms of the Apache License
*
* You should have received a copy of both licenses in LICENCE.LGPL and
* LICENCE.APACHE. Please refer to those files for details.
*
* JavaParser 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 Lesser General Public License for more details.
*/
package com.github.javaparser.ast.visitor;
import com.github.javaparser.JavaParser;
import com.github.javaparser.ast.CompilationUnit;
import com.github.javaparser.ast.Node;
import com.github.javaparser.ast.expr.ArrayInitializerExpr;
import com.github.javaparser.ast.expr.Expression;
import com.github.javaparser.ast.expr.IntegerLiteralExpr;
import com.github.javaparser.ast.expr.SimpleName;
import org.junit.Test;
import static com.github.javaparser.utils.TestUtils.assertEqualsNoEol;
import static org.junit.Assert.assertEquals;
public class TreeVisitorTest {
@Test
public void isValidBreadthFirstTraversal() {
Expression expression = JavaParser.parseExpression("(2+3)+(4+5)");
StringBuilder result = new StringBuilder();
TreeVisitor visitor = new TreeVisitor() {
@Override
public void process(Node node) {
result.append("<").append(node).append("> ");
}
};
visitor.visitBreadthFirst(expression);
assertEquals("<(2 + 3) + (4 + 5)> <(2 + 3)> <(4 + 5)> <2 + 3> <4 + 5> <2> <3> <4> <5> ", result.toString());
}
@Test
public void issue743ConcurrentModificationProblem() {
Expression expression = JavaParser.parseExpression("new int[]{1,2,3,4}");
StringBuilder result = new StringBuilder();
TreeVisitor visitor = new TreeVisitor() {
@Override
public void process(Node node) {
if (node instanceof IntegerLiteralExpr) {
node.getParentNode().ifPresent(
parent -> ((ArrayInitializerExpr) parent).getValues().add(new IntegerLiteralExpr("1")));
}
result.append("<").append(node).append("> ");
}
};
visitor.visitPreOrder(expression);
System.out.println(result);
}
@Test
public void isValidPreOrderTraversal() {
StringBuilder result = new StringBuilder();
new TreeVisitor() {
@Override
public void process(Node node) {
result.append("<").append(node).append("> ");
}
}.visitPreOrder(JavaParser.parseExpression("(2+3)+(4+5)"));
assertEquals("<(2 + 3) + (4 + 5)> <(2 + 3)> <2 + 3> <2> <3> <(4 + 5)> <4 + 5> <4> <5> ", result.toString());
}
@Test
public void isValidPostOrderTraversal() {
StringBuilder result = new StringBuilder();
new TreeVisitor() {
@Override
public void process(Node node) {
result.append("<").append(node).append("> ");
}
}.visitPostOrder(JavaParser.parseExpression("(2+3)+(4+5)"));
assertEquals("<2> <3> <2 + 3> <(2 + 3)> <4> <5> <4 + 5> <(4 + 5)> <(2 + 3) + (4 + 5)> ", result.toString());
}
@Test
public void preOrderConcurrentModificationIsOk() {
new TreeVisitor() {
@Override
public void process(Node node) {
if (node instanceof IntegerLiteralExpr) {
node.getParentNode().ifPresent(
parent -> ((ArrayInitializerExpr) parent).getValues().add(new IntegerLiteralExpr("1")));
}
}
}.visitPreOrder(JavaParser.parseExpression("new int[]{1,2,3,4}"));
}
@Test
public void postOrderConcurrentModificationIsOk() {
new TreeVisitor() {
@Override
public void process(Node node) {
if (node instanceof IntegerLiteralExpr) {
node.getParentNode().ifPresent(
parent -> ((ArrayInitializerExpr) parent).getValues().add(new IntegerLiteralExpr("1")));
}
}
}.visitPostOrder(JavaParser.parseExpression("new int[]{1,2,3,4}"));
}
@Test
public void parents() {
CompilationUnit cu = JavaParser.parse("class X{int x=1;}");
SimpleName x = cu.getClassByName("X").get().getMember(0).asFieldDeclaration().getVariable(0).getName();
Node.ParentsVisitor visitor = new Node.ParentsVisitor(x);
assertEquals("x = 1", visitor.next().toString());
assertEquals("int x = 1;", visitor.next().toString());
assertEqualsNoEol("class X {\n" +
"\n" +
" int x = 1;\n" +
"}", visitor.next().toString());
assertEqualsNoEol("class X {\n" +
"\n" +
" int x = 1;\n" +
"}\n", visitor.next().toString());
assertEquals(false, visitor.hasNext());
}
@Test
public void isValidDirectChildrenTraversal() {
Expression expression = JavaParser.parseExpression("(2+3)+(4+5)");
StringBuilder result = new StringBuilder();
TreeVisitor visitor = new TreeVisitor() {
@Override
public void process(Node node) {
result.append("<").append(node).append("> ");
}
};
visitor.visitDirectChildren(expression);
assertEquals("<(2 + 3)> <(4 + 5)> ", result.toString());
}
}
|
