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
|
/*
* 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.utils;
import java.util.Collection;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;
import java.util.stream.Collectors;
import com.github.javaparser.ast.Node;
import com.github.javaparser.ast.visitor.GenericVisitor;
import com.github.javaparser.ast.visitor.Visitable;
import com.github.javaparser.ast.visitor.VoidVisitor;
/**
* A set that overrides the equals and hashcode calculation of the added nodes
* by using another equals and hashcode visitor for those methods.
*/
public class VisitorSet<N extends Node> implements Set<N> {
private final Set<EqualsHashcodeOverridingFacade> innerSet = new HashSet<>();
private final GenericVisitor<Integer, Void> hashcodeVisitor;
private final GenericVisitor<Boolean, Visitable> equalsVisitor;
/**
* Pass the visitors to use for equals and hashcode.
*/
public VisitorSet(GenericVisitor<Integer, Void> hashcodeVisitor, GenericVisitor<Boolean, Visitable> equalsVisitor) {
this.hashcodeVisitor = hashcodeVisitor;
this.equalsVisitor = equalsVisitor;
}
@Override
public boolean add(N elem) {
return innerSet.add(new EqualsHashcodeOverridingFacade(elem));
}
@Override
public boolean addAll(Collection<? extends N> col) {
boolean modified = false;
for (N elem : col)
if (add(elem))
modified = true;
return modified;
}
@Override
public void clear() {
innerSet.clear();
}
@Override
public boolean contains(Object elem) {
return innerSet.contains(new EqualsHashcodeOverridingFacade((N) elem));
}
@Override
public boolean containsAll(Collection<?> col) {
for (Object elem : col)
if (!contains(elem))
return false;
return true;
}
@Override
public boolean isEmpty() {
return innerSet.isEmpty();
}
@Override
public Iterator<N> iterator() {
return new Iterator<N>() {
final Iterator<EqualsHashcodeOverridingFacade> itr = innerSet.iterator();
@Override
public boolean hasNext() {
return itr.hasNext();
}
@Override
public N next() {
return itr.next().overridden;
}
@Override
public void remove() {
itr.remove();
}
};
}
@Override
public boolean remove(Object elem) {
return innerSet.remove(new EqualsHashcodeOverridingFacade((N) elem));
}
@Override
public boolean removeAll(Collection<?> col) {
boolean modified = false;
for (Object elem : col)
if (remove(elem))
modified = true;
return modified;
}
@Override
public boolean retainAll(Collection<?> col) {
int oldSize = size();
clear();
addAll((Collection<? extends N>) col);
return size() != oldSize;
}
@Override
public int size() {
return innerSet.size();
}
@Override
public Object[] toArray() {
return innerSet.stream().map(facade -> facade.overridden).collect(Collectors.toList()).toArray();
}
@Override
public <T> T[] toArray(T[] arr) {
return innerSet.stream().map(facade -> facade.overridden).collect(Collectors.toList()).toArray(arr);
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder("[");
if (size() == 0)
return sb.append("]").toString();
for (EqualsHashcodeOverridingFacade facade : innerSet) {
sb.append(facade.overridden.toString() + ",");
}
return sb.replace(sb.length() - 2, sb.length(), "]").toString();
}
private class EqualsHashcodeOverridingFacade implements Visitable {
private final N overridden;
EqualsHashcodeOverridingFacade(N overridden) {
this.overridden = overridden;
}
@Override
public <R, A> R accept(GenericVisitor<R, A> v, A arg) {
throw new AssertionError();
}
@Override
public <A> void accept(VoidVisitor<A> v, A arg) {
throw new AssertionError();
}
@Override
public final int hashCode() {
return overridden.accept(hashcodeVisitor, null);
}
@Override
public boolean equals(final Object obj) {
if (obj == null || !(obj instanceof VisitorSet.EqualsHashcodeOverridingFacade)) {
return false;
}
return overridden.accept(equalsVisitor, ((EqualsHashcodeOverridingFacade) obj).overridden);
}
}
}
|
