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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
|
/*
* 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.printer.lexicalpreservation;
import com.github.javaparser.ast.Node;
import java.util.LinkedList;
import java.util.List;
/**
* This contains the lexical information for a single node.
* It is basically a list of tokens and children.
*/
class NodeText {
private final List<TextElement> elements;
public static final int NOT_FOUND = -1;
enum Option {
REMOVE_SPACE_IMMEDIATELY_AFTER,
EXCLUDE_START,
EXCLUDE_END
}
//
// Constructors
//
NodeText(List<TextElement> elements) {
this.elements = elements;
}
/**
* Initialize with an empty list of elements.
*/
NodeText() {
this(new LinkedList<>());
}
//
// Adding elements
//
/**
* Add an element at the end.
*/
void addElement(TextElement nodeTextElement) {
this.elements.add(nodeTextElement);
}
/**
* Add an element at the given position.
*/
void addElement(int index, TextElement nodeTextElement) {
this.elements.add(index, nodeTextElement);
}
void addChild(Node child) {
addElement(new ChildTextElement(child));
}
void addChild(int index, Node child) {
addElement(index, new ChildTextElement(child));
}
void addToken(int tokenKind, String text) {
elements.add(new TokenTextElement(tokenKind, text));
}
void addToken(int index, int tokenKind, String text) {
elements.add(index, new TokenTextElement(tokenKind, text));
}
//
// Finding elements
//
int findElement(TextElementMatcher matcher) {
return findElement(matcher, 0);
}
int findElement(TextElementMatcher matcher, int from) {
int res = tryToFindElement(matcher, from);
if (res == NOT_FOUND) {
throw new IllegalArgumentException(
String.format("I could not find child '%s' from position %d. Elements: %s",
matcher, from, elements));
} else {
return res;
}
}
int tryToFindElement(TextElementMatcher matcher, int from) {
for (int i=from; i<elements.size(); i++) {
TextElement element = elements.get(i);
if (matcher.match(element)) {
return i;
}
}
return NOT_FOUND;
}
int findChild(Node child) {
return findChild(child, 0);
}
int findChild(Node child, int from) {
return findElement(TextElementMatchers.byNode(child), from);
}
int tryToFindChild(Node child) {
return tryToFindChild(child, 0);
}
int tryToFindChild(Node child, int from) {
return tryToFindElement(TextElementMatchers.byNode(child), from);
}
//
// Removing single elements
//
void remove(TextElementMatcher matcher) {
elements.removeIf(matcher::match);
}
public void remove(TextElementMatcher matcher, boolean potentiallyFollowingWhitespace) {
int i=0;
for (TextElement e : elements) {
if (matcher.match(e)) {
elements.remove(e);
if (potentiallyFollowingWhitespace) {
if (i < elements.size()) {
if (elements.get(i).isWhiteSpace()) {
elements.remove(i);
}
} else {
throw new UnsupportedOperationException();
}
}
return;
}
}
throw new IllegalArgumentException();
}
//
// Removing sequences
//
void removeElement(int index) {
elements.remove(index);
}
//
// Replacing elements
//
void replace(TextElementMatcher position, TextElement newElement) {
int index = findElement(position, 0);
elements.remove(index);
elements.add(index, newElement);
}
//
// Other methods
//
/**
* Generate the corresponding string.
*/
String expand() {
StringBuffer sb = new StringBuffer();
elements.forEach(e -> sb.append(e.expand()));
return sb.toString();
}
// Visible for testing
int numberOfElements() {
return elements.size();
}
// Visible for testing
TextElement getTextElement(int index) {
return elements.get(index);
}
// Visible for testing
List<TextElement> getElements() {
return elements;
}
@Override
public String toString() {
return "NodeText{" + elements + '}';
}
}
|
