summaryrefslogtreecommitdiff
path: root/packages/SystemUI/src/com/android/systemui/util/leak/WeakIdentityHashMap.java
blob: d370ac1e7e82b60bf4667d50ae9e554716a12812 (plain)
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
/*
 * Copyright (C) 2017 The Android Open Source Project
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package com.android.systemui.util.leak;

import java.lang.ref.Reference;
import java.lang.ref.ReferenceQueue;
import java.lang.ref.WeakReference;
import java.util.Collection;
import java.util.HashMap;
import java.util.Map;
import java.util.Set;

/**
 * Like WeakHashMap, but uses identity instead of equality when comparing keys.
 */
public class WeakIdentityHashMap<K,V> {

    private final HashMap<WeakReference<K>,V> mMap = new HashMap<>();
    private final ReferenceQueue<Object> mRefQueue = new ReferenceQueue<>();

    private void cleanUp() {
        Reference<?> ref;
        while ((ref = mRefQueue.poll()) != null) {
            mMap.remove(ref);
        }
    }

    public void put(K key, V value) {
        cleanUp();
        mMap.put(new CmpWeakReference<>(key, mRefQueue), value);
    }

    public V get(K key) {
        cleanUp();
        return mMap.get(new CmpWeakReference<>(key));
    }

    public Collection<V> values() {
        cleanUp();
        return mMap.values();
    }

    public Set<Map.Entry<WeakReference<K>, V>> entrySet() {
        return mMap.entrySet();
    }

    public int size() {
        cleanUp();
        return mMap.size();
    }

    public boolean isEmpty() {
        cleanUp();
        return mMap.isEmpty();
    }

    private static class CmpWeakReference<K> extends WeakReference<K> {
        private final int mHashCode;

        public CmpWeakReference(K key) {
            super(key);
            mHashCode = System.identityHashCode(key);
        }

        public CmpWeakReference(K key, ReferenceQueue<Object> refQueue) {
            super(key, refQueue);
            mHashCode = System.identityHashCode(key);
        }

        @Override
        public boolean equals(Object o) {
            if (o == this) {
                return true;
            }
            K k = get();
            if (k != null && o instanceof CmpWeakReference) {
                return ((CmpWeakReference) o).get() == k;
            }
            return false;
        }

        @Override
        public int hashCode() {
            return mHashCode;
        }
    }
}