forked from soot-oss/soot
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathHashMultiMap.java
More file actions
228 lines (196 loc) · 4.92 KB
/
HashMultiMap.java
File metadata and controls
228 lines (196 loc) · 4.92 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
221
222
223
224
225
226
227
228
package soot.util;
import java.util.Collection;
/*-
* #%L
* Soot - a J*va Optimization Framework
* %%
* Copyright (C) 2002 Ondrej Lhotak
* %%
* 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.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
/**
* A map with sets as values, HashMap implementation.
*
* @author Ondrej Lhotak
*/
public class HashMultiMap<K, V> extends AbstractMultiMap<K, V> {
private static final long serialVersionUID = -1928446853508616896L;
private static final float DEFAULT_LOAD_FACTOR = 0.7f;
protected final Map<K, Set<V>> m;
protected final float loadFactor;
protected Map<K, Set<V>> createMap() {
return createMap(0);
}
protected Map<K, Set<V>> createMap(int initialSize) {
return new HashMap<K, Set<V>>(initialSize, loadFactor);
}
public HashMultiMap() {
this.loadFactor = DEFAULT_LOAD_FACTOR;
this.m = createMap();
}
public HashMultiMap(int initialSize) {
this.loadFactor = DEFAULT_LOAD_FACTOR;
this.m = createMap(initialSize);
}
public HashMultiMap(int initialSize, float loadFactor) {
this.loadFactor = loadFactor;
this.m = createMap(initialSize);
}
public HashMultiMap(MultiMap<K, V> m) {
this.loadFactor = DEFAULT_LOAD_FACTOR;
this.m = createMap();
putAll(m);
}
public HashMultiMap(Map<K, Collection<V>> m) {
this.loadFactor = DEFAULT_LOAD_FACTOR;
this.m = createMap();
putAll(m);
}
@Override
public int numKeys() {
return m.size();
}
@Override
public boolean containsKey(Object key) {
return m.containsKey(key);
}
@Override
public boolean containsValue(V value) {
for (Set<V> s : m.values()) {
if (s.contains(value)) {
return true;
}
}
return false;
}
protected Set<V> newSet() {
return new HashSet<V>(4);
}
private Set<V> findSet(K key) {
Set<V> s = m.get(key);
if (s == null) {
s = newSet();
m.put(key, s);
}
return s;
}
@Override
public boolean put(K key, V value) {
return findSet(key).add(value);
}
@Override
public boolean putAll(K key, Collection<V> values) {
if (values.isEmpty()) {
return false;
}
return findSet(key).addAll(values);
}
@Override
public boolean remove(K key, V value) {
Set<V> s = m.get(key);
if (s == null) {
return false;
}
boolean ret = s.remove(value);
if (s.isEmpty()) {
m.remove(key);
}
return ret;
}
@Override
public boolean remove(K key) {
return null != m.remove(key);
}
@Override
public boolean removeAll(K key, Collection<V> values) {
Set<V> s = m.get(key);
if (s == null) {
return false;
}
boolean ret = s.removeAll(values);
if (s.isEmpty()) {
m.remove(key);
}
return ret;
}
@Override
public Set<V> get(K o) {
Set<V> ret = m.get(o);
return (ret == null) ? Collections.emptySet() : ret;
}
@Override
public Set<K> keySet() {
return m.keySet();
}
@Override
public Set<V> values() {
Set<V> ret = new HashSet<V>(m.size());
for (Set<V> s : m.values()) {
ret.addAll(s);
}
return ret;
}
@Override
public boolean equals(Object o) {
if (!(o instanceof MultiMap)) {
return false;
}
@SuppressWarnings("unchecked")
MultiMap<K, V> mm = (MultiMap<K, V>) o;
if (!keySet().equals(mm.keySet())) {
return false;
}
Iterator<Map.Entry<K, Set<V>>> it = m.entrySet().iterator();
while (it.hasNext()) {
Map.Entry<K, Set<V>> e = it.next();
Set<V> s = e.getValue();
if (!s.equals(mm.get(e.getKey()))) {
return false;
}
}
return true;
}
@Override
public int hashCode() {
return m.hashCode();
}
@Override
public int size() {
return m.size();
}
@Override
public void clear() {
m.clear();
}
@Override
public String toString() {
StringBuilder builder = new StringBuilder();
for (Entry<K, Set<V>> entry : m.entrySet()) {
builder.append(entry.getKey()).append(":\n").append(entry.getValue().toString()).append("\n\n");
}
if (builder.length() > 2) {
builder.delete(builder.length() - 2, builder.length());
}
return builder.toString();
}
}