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
|
package com.github.javaparser.ast;
import com.github.javaparser.HasParentNode;
import com.github.javaparser.ast.visitor.Visitable;
import com.github.javaparser.ast.visitor.GenericVisitor;
import com.github.javaparser.ast.visitor.VoidVisitor;
import java.util.*;
import java.util.stream.Stream;
/**
* A list of nodes.
*
* @param <N> the type of nodes contained.
*/
public class NodeList<N extends Node> implements Iterable<N>, HasParentNode<NodeList<N>>, Visitable {
private List<N> innerList = new ArrayList<>(0);
private Node parentNode;
public NodeList() {
this(null);
}
public NodeList(Node parent) {
setParentNode(parent);
}
public NodeList<N> add(N node) {
own(node);
innerList.add(node);
return this;
}
private void own(N node) {
if (node == null) {
return;
}
setAsParentNodeOf(node);
}
public boolean remove(Node node) {
boolean remove = innerList.remove(node);
node.setParentNode(null);
return remove;
}
public static <X extends Node> NodeList<X> nodeList(X... nodes) {
final NodeList<X> nodeList = new NodeList<>();
for (X node : nodes) {
nodeList.add(node);
}
return nodeList;
}
public static <X extends Node> NodeList<X> nodeList(Collection<X> nodes) {
final NodeList<X> nodeList = new NodeList<>();
for (X node : nodes) {
nodeList.add(node);
}
return nodeList;
}
public static <X extends Node> NodeList<X> nodeList(NodeList<X> nodes) {
final NodeList<X> nodeList = new NodeList<>();
for (X node : nodes) {
nodeList.add(node);
}
return nodeList;
}
public boolean contains(N node) {
return innerList.contains(node);
}
public Stream<N> stream() {
return innerList.stream();
}
public int size() {
return innerList.size();
}
public N get(int i) {
return innerList.get(i);
}
@Override
public Iterator<N> iterator() {
// TODO take care of "Iterator.remove"
return innerList.iterator();
}
public NodeList<N> set(int index, N element) {
setAsParentNodeOf(element);
innerList.set(index, element);
return this;
}
public NodeList<N> remove(int index) {
innerList.remove(index);
return this;
}
public boolean isEmpty() {
return innerList.isEmpty();
}
public void sort(Comparator<? super N> comparator) {
Collections.sort(innerList, comparator);
}
public void addAll(NodeList<N> otherList) {
for (N node : otherList) {
add(node);
}
}
public NodeList<N> add(int index, N node) {
own(node);
innerList.add(index, node);
return this;
}
@Override
public Node getParentNode() {
return parentNode;
}
@Override
public NodeList<N> setParentNode(Node parentNode) {
this.parentNode = parentNode;
setAsParentNodeOf(innerList);
return this;
}
@Override
public Node getParentNodeForChildren() {
return parentNode;
}
public <R, A> R accept(final GenericVisitor<R, A> v, final A arg) {
return v.visit(this, arg);
}
public <A> void accept(final VoidVisitor<A> v, final A arg) {
v.visit(this, arg);
}
}
|
