-
-
Notifications
You must be signed in to change notification settings - Fork 44
/
TimedHashMapQueue.java
269 lines (222 loc) · 6.37 KB
/
TimedHashMapQueue.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
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
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
package me.nallar.tickthreading.collections;
import java.util.Collection;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;
public class TimedHashMapQueue<K> extends HashMap<K, Integer> {
private int ticks = Integer.MIN_VALUE;
private static final long serialVersionUID = 7249069246763182397L;
private final TreeHashSet<Node<K>> nodes;
private final Set<Map.Entry<K, Integer>> entries = new Set<Map.Entry<K, Integer>>() {
@Override
public int size() {
return TimedHashMapQueue.this.size();
}
@Override
public boolean isEmpty() {
return size() > 0;
}
@Override
public boolean contains(final Object o) {
throw new UnsupportedOperationException("Doesn't make sense with this collection choice.");
}
@Override
public Iterator<Map.Entry<K, Integer>> iterator() {
ticks++;
return new Iterator<Map.Entry<K, Integer>>() {
private final Iterator<Node<K>> nodeIterator = nodes.iterator();
private Node<K> last = null;
@Override
public boolean hasNext() {
if (!nodeIterator.hasNext()) {
return false;
}
Node<K> node = nodeIterator.next();
if (node.time > ticks) {
return false;
}
last = node;
return true;
}
@Override
public Map.Entry<K, Integer> next() {
Node<K> node = last;
if (node == null) {
if (!hasNext()) {
throw new IllegalStateException("Called .next() without .hasNex()");
}
node = last;
}
return new Entry<K>(node.value, node.time);
}
@Override
public void remove() {
if (last == null) {
throw new IllegalStateException("Removed without .next() call, or removed repeatedly.");
}
nodes.remove(last);
last = null;
}
};
}
@Override
public Object[] toArray() {
throw new UnsupportedOperationException("Doesn't make sense with this collection choice.");
}
@Override
public <T> T[] toArray(final T[] a) {
throw new UnsupportedOperationException("Doesn't make sense with this collection choice.");
}
@Override
public boolean add(final Map.Entry<K, Integer> kIntegerEntry) {
throw new UnsupportedOperationException("Doesn't make sense with this collection choice.");
}
@Override
public boolean remove(final Object o) {
throw new UnsupportedOperationException("Doesn't make sense with this collection choice.");
}
@Override
public boolean containsAll(final Collection<?> c) {
throw new UnsupportedOperationException("Doesn't make sense with this collection choice.");
}
@Override
public boolean addAll(final Collection<? extends Map.Entry<K, Integer>> c) {
throw new UnsupportedOperationException("Doesn't make sense with this collection choice.");
}
@Override
public boolean retainAll(final Collection<?> c) {
throw new UnsupportedOperationException("Doesn't make sense with this collection choice.");
}
@Override
public boolean removeAll(final Collection<?> c) {
throw new UnsupportedOperationException("Doesn't make sense with this collection choice.");
}
@Override
public void clear() {
throw new UnsupportedOperationException("Doesn't make sense with this collection choice.");
}
};
public TimedHashMapQueue(int initialCapacity, float loadFactor) {
this();
}
public TimedHashMapQueue(int initialCapacity) {
this();
}
public TimedHashMapQueue() {
nodes = new TreeHashSet<Node<K>>();
}
public TimedHashMapQueue(Map<? extends K, ? extends Integer> m) {
this();
this.putAll(m);
}
@Override
public int size() {
return nodes.size();
}
@Override
public boolean isEmpty() {
return nodes.isEmpty();
}
@Override
public Integer get(Object key) {
throw new UnsupportedOperationException("Doesn't make sense with this collection choice.");
}
@Override
public boolean containsKey(Object key) {
return key != null && nodes.contains(new Node<K>((K) key, null));
}
@Override
public Integer put(K key, Integer value) {
nodes.add(new Node<K>(key, ticks + value));
return null;
}
@Override
public void putAll(Map<? extends K, ? extends Integer> m) {
for (Map.Entry<? extends K, ? extends Integer> entry : m.entrySet()) {
put(entry.getKey(), entry.getValue());
}
}
@Override
public Integer remove(Object key) {
if (key != null) {
if (nodes.remove(new Node<K>((K) key, null))) {
return 1;
}
}
return null;
}
@Override
public void clear() {
nodes.clear();
}
@Override
public boolean containsValue(Object value) {
throw new UnsupportedOperationException("Doesn't make sense with this collection choice.");
}
@Override
public Set<K> keySet() {
throw new UnsupportedOperationException("Doesn't make sense with this collection choice.");
}
@Override
public Collection<Integer> values() {
throw new UnsupportedOperationException("Doesn't make sense with this collection choice.");
}
@Override
public Set<Map.Entry<K, Integer>> entrySet() {
return entries;
}
@SuppressWarnings ("EqualsWhichDoesntCheckParameterClass")
@Override
public boolean equals(Object o) {
return nodes.equals(o);
}
@Override
public int hashCode() {
return nodes.hashCode();
}
@Override
public String toString() {
return nodes.toString();
}
private static class Entry<K> implements Map.Entry<K, Integer> {
private final K key;
private final Integer value;
Entry(final K key, final Integer value) {
this.key = key;
this.value = value;
}
@Override
public K getKey() {
return key;
}
@Override
public Integer getValue() {
return value;
}
@Override
public Integer setValue(final Integer value) {
throw new UnsupportedOperationException("Doesn't make sense with this collection choice.");
}
}
private class Node<K> implements Comparable<Node<K>> {
final K value;
final Integer time;
private Node(final K value, final Integer time) {
this.value = value;
this.time = time;
}
@Override
public boolean equals(Object a) {
return a instanceof Node && value.equals(((Node) a).value);
}
@Override
public int hashCode() {
return value.hashCode();
}
@Override
public int compareTo(final Node<K> node) {
return time.compareTo(node.time);
}
}
}