WeakHashSet.java
1.46 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
/*
* Decompiled with CFR 0_118.
*/
package com.adobe.internal.util;
import java.util.AbstractSet;
import java.util.Collection;
import java.util.Iterator;
import java.util.Set;
import java.util.WeakHashMap;
public class WeakHashSet
extends AbstractSet
implements Set {
private transient WeakHashMap map;
private static final Object dummy = new Object();
public WeakHashSet() {
this.map = new WeakHashMap();
}
public WeakHashSet(Collection c) {
this.map = new WeakHashMap(Math.max((int)((float)c.size() / 0.75f) + 1, 16));
this.addAll(c);
}
public WeakHashSet(int initialCapacity, float loadFactor) {
this.map = new WeakHashMap(initialCapacity, loadFactor);
}
public WeakHashSet(int initialCapacity) {
this.map = new WeakHashMap(initialCapacity);
}
@Override
public Iterator iterator() {
return this.map.keySet().iterator();
}
@Override
public int size() {
return this.map.size();
}
@Override
public boolean isEmpty() {
return this.map.isEmpty();
}
@Override
public boolean contains(Object obj) {
return this.map.containsKey(obj);
}
@Override
public boolean add(Object obj) {
return this.map.put(obj, dummy) == null;
}
@Override
public boolean remove(Object obj) {
return this.map.remove(obj) == dummy;
}
@Override
public void clear() {
this.map.clear();
}
}