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
|
/*
* Copyright (C) 2019 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.quickstep.util;
import android.util.Log;
import com.android.systemui.shared.recents.model.Task.TaskKey;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.function.Predicate;
/**
* A simple LRU cache for task key entries
* @param <V> The type of the value
*/
public class TaskKeyLruCache<V> {
private final MyLinkedHashMap<V> mMap;
public TaskKeyLruCache(int maxSize) {
mMap = new MyLinkedHashMap<>(maxSize);
}
/**
* Removes all entries from the cache
*/
public synchronized void evictAll() {
mMap.clear();
}
/**
* Removes a particular entry from the cache
*/
public synchronized void remove(TaskKey key) {
mMap.remove(key.id);
}
/**
* Removes all entries matching keyCheck
*/
public synchronized void removeAll(Predicate<TaskKey> keyCheck) {
mMap.entrySet().removeIf(e -> keyCheck.test(e.getValue().mKey));
}
/**
* Gets the entry if it is still valid
*/
public synchronized V getAndInvalidateIfModified(TaskKey key) {
Entry<V> entry = mMap.get(key.id);
if (entry != null && entry.mKey.windowingMode == key.windowingMode
&& entry.mKey.lastActiveTime == key.lastActiveTime) {
return entry.mValue;
} else {
remove(key);
return null;
}
}
/**
* Adds an entry to the cache, optionally evicting the last accessed entry
*/
public final synchronized void put(TaskKey key, V value) {
if (key != null && value != null) {
mMap.put(key.id, new Entry<>(key, value));
} else {
Log.e("TaskKeyCache", "Unexpected null key or value: " + key + ", " + value);
}
}
/**
* Updates the cache entry if it is already present in the cache
*/
public synchronized void updateIfAlreadyInCache(int taskId, V data) {
Entry<V> entry = mMap.get(taskId);
if (entry != null) {
entry.mValue = data;
}
}
private static class Entry<V> {
final TaskKey mKey;
V mValue;
Entry(TaskKey key, V value) {
mKey = key;
mValue = value;
}
@Override
public int hashCode() {
return mKey.id;
}
}
private static class MyLinkedHashMap<V> extends LinkedHashMap<Integer, Entry<V>> {
private final int mMaxSize;
MyLinkedHashMap(int maxSize) {
super(0, 0.75f, true /* accessOrder */);
mMaxSize = maxSize;
}
@Override
protected boolean removeEldestEntry(Map.Entry<Integer, TaskKeyLruCache.Entry<V>> eldest) {
return size() > mMaxSize;
}
}
}
|
