-
-
Notifications
You must be signed in to change notification settings - Fork 44
/
TreeHashSet.java
49 lines (41 loc) · 1.07 KB
/
TreeHashSet.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
package me.nallar.tickthreading.collections;
import java.util.Collections;
import java.util.Iterator;
import java.util.Set;
import java.util.TreeSet;
import java.util.concurrent.ConcurrentHashMap;
import me.nallar.tickthreading.Log;
public class TreeHashSet<T> extends TreeSet<T> {
private final Set internalHashSet = Collections.newSetFromMap(new ConcurrentHashMap());
public Iterator concurrentIterator() {
return internalHashSet.iterator();
}
@Override
public boolean contains(Object o) {
return internalHashSet.contains(o);
}
@Override
public synchronized boolean add(T o) {
if (internalHashSet.add(o)) {
super.add(o);
if (size() > 5000 && size() % 64 == 0) {
Log.info("Spammy TickNextTickList updates", new Throwable());
}
return true;
}
return false;
}
@Override
public synchronized boolean remove(Object o) {
if (internalHashSet.remove(o)) {
super.remove(o);
return true;
}
return false;
}
@Override
public synchronized void clear() {
super.clear();
internalHashSet.clear();
}
}