-
-
Notifications
You must be signed in to change notification settings - Fork 44
/
CHashtable.java
170 lines (137 loc) · 3.27 KB
/
CHashtable.java
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
package nallar.collections;
import nallar.tickthreading.util.EnumerationIteratorWrapper;
import java.util.*;
import java.util.concurrent.*;
public class CHashtable<K, V> extends Hashtable<K, V> {
private final ConcurrentHashMap<K, V> m;
public CHashtable(final int initialCapacity, final float loadFactor) {
m = new ConcurrentHashMap<K, V>(initialCapacity, loadFactor);
}
public CHashtable(final int initialCapacity) {
m = new ConcurrentHashMap<K, V>(initialCapacity);
}
public CHashtable() {
m = new ConcurrentHashMap<K, V>();
}
public CHashtable(final Map<K, V> map) {
m = new ConcurrentHashMap<K, V>(map);
}
@Override
public int size() {
return m.size();
}
@Override
public boolean isEmpty() {
return m.isEmpty();
}
@Override
public Enumeration<K> keys() {
return new EnumerationIteratorWrapper<K>(keySet().iterator());
}
@Override
public Enumeration<V> elements() {
return new EnumerationIteratorWrapper<V>(values().iterator());
}
@Override
public boolean contains(final Object value) {
return m.contains(value);
}
@Override
public boolean containsKey(final Object key) {
return m.containsKey(key);
}
@Override
public V get(final Object key) {
return m.get(key);
}
@Override
protected void rehash() {
// Do nothing, CHM does this automatically.
}
@Override
public V put(final Object key, final Object value) {
return m.put((K) key, (V) value);
}
@Override
public V remove(final Object key) {
return m.remove(key);
}
@Override
public void putAll(final Map<? extends K, ? extends V> map) {
m.putAll(map);
}
@Override
public void clear() {
m.clear();
}
@Override
public Object clone() {
throw new UnsupportedOperationException("Not implemented");
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder("{");
boolean second = false;
for (final Map.Entry<K, V> entry : entrySet()) {
if (second) {
sb.append(", ");
}
K key = entry.getKey();
V value = entry.getValue();
sb.append(key == this ? "(this Map)" : key.toString());
sb.append('=');
sb.append(value == this ? "(this Map)" : value.toString());
second = true;
}
return sb.append('}').toString();
}
@Override
public Set<K> keySet() {
return m.keySet();
}
@Override
public Set<Map.Entry<K, V>> entrySet() {
return m.entrySet();
}
@Override
public Collection<V> values() {
return m.values();
}
@Override
public boolean equals(Object o) {
if (o == this) {
return true;
}
if (!(o instanceof Map)) {
return false;
}
Map<K, V> t = (Map<K, V>) o;
if (t.size() != size()) {
return false;
}
try {
for (final Map.Entry<K, V> e : entrySet()) {
K key = e.getKey();
V value = e.getValue();
if (value == null) {
if (!(t.get(key) == null && t.containsKey(key))) {
return false;
}
} else {
if (!value.equals(t.get(key))) {
return false;
}
}
}
} catch (ClassCastException ignored) {
return false;
} catch (NullPointerException ignored) {
return false;
}
return true;
}
@Override
public int hashCode() {
return System.identityHashCode(this);
}
}