forked from soot-oss/soot
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathIterableSet.java
More file actions
220 lines (192 loc) · 4.9 KB
/
IterableSet.java
File metadata and controls
220 lines (192 loc) · 4.9 KB
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
218
219
220
package soot.util;
/*-
* #%L
* Soot - a J*va Optimization Framework
* %%
* Copyright (C) 2002 Sable Research Group
* %%
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation, either version 2.1 of the
* License, or (at your option) any later version.
*
* This program 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 General Lesser Public License for more details.
*
* You should have received a copy of the GNU General Lesser Public
* License along with this program. If not, see
* <http://www.gnu.org/licenses/lgpl-2.1.html>.
* #L%
*/
import java.util.Collection;
import java.util.Set;
public class IterableSet<T> extends HashChain<T> implements Set<T> {
public IterableSet(Collection<T> c) {
super();
addAll(c);
}
public IterableSet() {
super();
}
@Override
public boolean add(T o) {
if (o == null) {
throw new IllegalArgumentException("Cannot add \"null\" to an IterableSet.");
}
if (contains(o)) {
return false;
}
return super.add(o);
}
@Override
public boolean remove(Object o) {
if (o == null || !contains(o)) {
return false;
}
return super.remove(o);
}
@Override
public boolean equals(Object o) {
if (o == null) {
return false;
}
if (this == o) {
return true;
}
if (!(o instanceof IterableSet)) {
return false;
}
IterableSet<?> other = (IterableSet<?>) o;
if (this.size() != other.size()) {
return false;
}
for (T t : this) {
if (!other.contains(t)) {
return false;
}
}
return true;
}
@Override
public int hashCode() {
int code = 23 * size();
for (T t : this) {
// use addition here to have hash code independent of order
code += t.hashCode();
}
return code;
}
@Override
public Object clone() {
IterableSet<T> s = new IterableSet<T>();
s.addAll(this);
return s;
}
public boolean isSubsetOf(IterableSet<T> other) {
if (other == null) {
throw new IllegalArgumentException("Cannot set compare an IterableSet with \"null\".");
}
if (this.size() > other.size()) {
return false;
}
for (T t : this) {
if (!other.contains(t)) {
return false;
}
}
return true;
}
public boolean isSupersetOf(IterableSet<T> other) {
if (other == null) {
throw new IllegalArgumentException("Cannot set compare an IterableSet with \"null\".");
}
if (this.size() < other.size()) {
return false;
}
for (T t : other) {
if (!contains(t)) {
return false;
}
}
return true;
}
public boolean isStrictSubsetOf(IterableSet<T> other) {
if (other == null) {
throw new IllegalArgumentException("Cannot set compare an IterableSet with \"null\".");
}
if (this.size() >= other.size()) {
return false;
}
return isSubsetOf(other);
}
public boolean isStrictSupersetOf(IterableSet<T> other) {
if (other == null) {
throw new IllegalArgumentException("Cannot set compare an IterableSet with \"null\".");
}
if (this.size() <= other.size()) {
return false;
}
return isSupersetOf(other);
}
public boolean intersects(IterableSet<T> other) {
if (other == null) {
throw new IllegalArgumentException("Cannot set intersect an IterableSet with \"null\".");
}
if (other.size() < this.size()) {
for (T t : other) {
if (this.contains(t)) {
return true;
}
}
} else {
for (T t : this) {
if (other.contains(t)) {
return true;
}
}
}
return false;
}
public IterableSet<T> intersection(IterableSet<T> other) {
if (other == null) {
throw new IllegalArgumentException("Cannot set intersect an IterableSet with \"null\".");
}
IterableSet<T> c = new IterableSet<T>();
if (other.size() < this.size()) {
for (T t : other) {
if (this.contains(t)) {
c.add(t);
}
}
} else {
for (T t : this) {
if (other.contains(t)) {
c.add(t);
}
}
}
return c;
}
public IterableSet<T> union(IterableSet<T> other) {
if (other == null) {
throw new IllegalArgumentException("Cannot set union an IterableSet with \"null\".");
}
IterableSet<T> c = new IterableSet<T>();
c.addAll(this);
c.addAll(other);
return c;
}
@Override
public String toString() {
StringBuilder b = new StringBuilder();
for (T t : this) {
b.append(t.toString()).append('\n');
}
return b.toString();
}
public UnmodifiableIterableSet<T> asUnmodifiable() {
return new UnmodifiableIterableSet<T>(this);
}
}