- 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 android.support.v4.util;
import java.util.LinkedHashMap;
import java.util.Map;
/**
- Static library version of {@link android.util.LruCache}. Used to write apps
- that run on API levels prior to 12. When running on API level 12 or above,
- this implementation is still used; it does not try to switch to the
- framework’s implementation. See the framework SDK documentation for a class
- overview.
*/
public class LruCache<K, V> {
private final LinkedHashMap<K, V> map;
/** Size of this cache in units. Not necessarily the number of elements. */
private int size; //当前cache的大小
private int maxSize; //cache最大大小
private int putCount; //put的次数
private int createCount; //create的次数
private int evictionCount; //回收的次数
private int hitCount; //命中的次数
private int missCount; //未命中次数
/**
- @param maxSize for caches that do not override {@link #sizeOf}, this is
-
the maximum number of entries in the cache. For all other caches, -
this is the maximum sum of the sizes of the entries in this cache.
*/
public LruCache(int maxSize) {
if (maxSize <= 0) {
throw new IllegalArgumentException(“maxSize <= 0”);
}
this.maxSize = maxSize;
//将LinkedHashMap的accessOrder设置为true来实现LRU
this.map = new LinkedHashMap<K, V>(0, 0.75f, true);
}
/**
- Returns the value for {@code key} if it exists in the cache or can be
- created by {@code #create}. If a value was returned, it is moved to the
- head of the queue. This returns null if a value is not cached and cannot
- be created.
- 通过key获取相应的item，或者创建返回相应的item。相应的item会移动到队列的尾部，
- 如果item的value没有被cache或者不能被创建，则返回null。
*/
public final V get(K key) {
if (key == null) {
throw new NullPointerException(“key == null”);
}
V mapValue;
synchronized (this) {
mapValue = map.get(key);
if (mapValue != null) {
//mapValue不为空表示命中，hitCount+1并返回mapValue对象
hitCount++;
return mapValue;
}
missCount++; //未命中
}
/*
- Attempt to create a value. This may take a long time, and the map
- may be different when create() returns. If a conflicting value was
- added to the map while create() was working, we leave that value in
- the map and release the created value.
- 如果未命中，则试图创建一个对象，这里create方法返回null,并没有实现创建对象的方法
- 如果需要事项创建对象的方法可以重写create方法。因为图片缓存时内存缓存没有命中会去
- 文件缓存中去取或者从网络下载，所以并不需要创建。
*/
V createdValue = create(key);
if (createdValue == null) {
return null;
}
//假如创建了新的对象，则继续往下执行
synchronized (this) {
createCount++;
//将createdValue加入到map中，并且将原来键为key的对象保存到mapValue
mapValue = map.put(key, createdValue);
if (mapValue != null) {
// There was a conflict so undo that last put
//如果mapValue不为空，则撤销上一步的put操作。
map.put(key, mapValue);
} else {
//加入新创建的对象之后需要重新计算size大小
size += safeSizeOf(key, createdValue);
}
}
if (mapValue != null) {
entryRemoved(false, key, createdValue, mapValue);
return mapValue;
} else {
//每次新加入对象都需要调用trimToSize方法看是否需要回收
trimToSize(maxSize);
return createdValue;
}
}
/**
- Caches {@code value} for {@code key}. The value is moved to the head of
- the queue.
- @return the previous value mapped by {@code key}.
*/
public final V put(K key, V value) {
if (key == null || value == null) {
throw new NullPointerException(“key == null || value == null”);
}
V previous;
synchronized (this) {
putCount++;
size += safeSizeOf(key, value); //size加上预put对象的大小
previous = map.put(key, value);
if (previous != null) {
//如果之前存在键为key的对象，则size应该减去原来对象的大小
size -= safeSizeOf(key, previous);
}
}
if (previous != null) {
entryRemoved(false, key, previous, value);
}
//每次新加入对象都需要调用trimToSize方法看是否需要回收
trimToSize(maxSize);
return previous;
}
/**
- @param maxSize the maximum size of the cache before returning. May be -1
-
to evict even 0-sized elements. - 此方法根据maxSize来调整内存cache的大小，如果maxSize传入-1，则清空缓存中的所有对象
*/
private void trimToSize(int maxSize) {
while (true) {
K key;
V value;
synchronized (this) {
if (size < 0 || (map.isEmpty() && size != 0)) {
throw new IllegalStateException(getClass().getName()
- “.sizeOf() is reporting inconsistent results!”);
}
//如果当前size小于maxSize或者map没有任何对象,则结束循环
if (size <= maxSize || map.isEmpty()) {
break;
}
//移除链表头部的元素，并进入下一次循环
Map.Entry<K, V> toEvict = map.entrySet().iterator().next();
key = toEvict.getKey();
value = toEvict.getValue();
map.remove(key);
size -= safeSizeOf(key, value);
evictionCount++; //回收次数+1
}
entryRemoved(true, key, value, null);
}
}
/**
- Removes the entry for {@code key} if it exists.
- @return the previous value mapped by {@code key}.
- 从内存缓存中根据key值移除某个对象并返回该对象
*/
public final V remove(K key) {
if (key == null) {
throw new NullPointerException(“key == null”);
}
V previous;
synchronized (this) {
previous = map.remove(key);
if (previous != null) {
size -= safeSizeOf(key, previous);
}
}
if (previous != null) {
entryRemoved(false, key, previous, null);
}
return previous;
}
/**
- Called for entries that have been evicted or removed. This method is
- invoked when a value is evicted to make space, removed by a call to
- {@link #remove}, or replaced by a call to {@link #put}. The default
- implementation does nothing.
-
The method is called without synchronization: other threads may
- access the cache while this method is executing.
- @param evicted true if the entry is being removed to make space, false
-
if the removal was caused by a {@link #put} or {@link #remove}. - @param newValue the new value for {@code key}, if it exists. If non-null,
-
this removal was caused by a {@link #put}. Otherwise it was caused by -
an eviction or a {@link #remove}.
*/
protected void entryRemoved(boolean evicted, K key, V oldValue, V newValue) {}
/**
- Called after a cache miss to compute a value for the corresponding key.
- Returns the computed value or null if no value can be computed. The
- default implementation returns null.
-
The method is called without synchronization: other threads may
- access the cache while this method is executing.
-
If a value for {@code key} exists in the cache when this method
- returns, the created value will be released with {@link #entryRemoved}
- and discarded. This can occur when multiple threads request the same key
- at the same time (causing multiple values to be created), or when one
- thread calls {@link #put} while another is creating a value for the same
- key.
*/
protected V create(K key) {
return null;
}
private int safeSizeOf(K key, V value) {
int result = sizeOf(key, value);
if (result < 0) {
throw new IllegalStateException("Negative size: " + key + “=” + value);
}
return result;
}
/**
- Returns the size of the entry for {@code key} and {@code value} in
- user-defined units. The default implementation returns 1 so that size
- is the number of entries and max size is the maximum number of entries.
-
An entry's size must not change while it is in the cache.
- 用来计算单个对象的大小，这里默认返回1，一般需要重写该方法来计算对象的大小
- xUtils中创建LruMemoryCache时就重写了sizeOf方法来计算bitmap的大小
- mMemoryCache = new LruMemoryCache<MemoryCacheKey, Bitmap>(globalConfig.getMemoryCacheSize()) {
-
@Override -
先自我介绍一下，小编13年上海交大毕业，曾经在小公司待过，也去过华为、OPPO等大厂，18年进入阿里一直到现在。protected int sizeOf(MemoryCacheKey key, Bitmap bitmap) {
深知大多数初中级Android工程师，想要提升技能，往往是自己摸索成长或者是报班学习，但对于培训机构动则近万的学费，着实压力不小。自己不成体系的自学效果低效又漫长，而且极易碰到天花板技术停滞不前！
因此收集整理了一份《Android移动开发全套学习资料》送给大家，初衷也很简单，就是希望能够帮助到想自学提升又不知道该从何学起的朋友，同时减轻大家的负担。
由于文件比较大，这里只是将部分目录截图出来，每个节点里面都包含大厂面经、学习笔记、源码讲义、实战项目、讲解视频
如果你觉得这些内容对你有帮助，可以扫码领取！！！！
总结
写到这里也结束了，在文章最后放上一个小小的福利，以下为小编自己在学习过程中整理出的一个关于Flutter的学习思路及方向，从事互联网开发，最主要的是要学好技术，而学习技术是一条慢长而艰苦的道路，不能靠一时激情，也不是熬几天几夜就能学好的，必须养成平时努力学习的习惯，更加需要准确的学习方向达到有效的学习效果。
由于内容较多就只放上一个大概的大纲，需要更及详细的学习思维导图的
还有高级UI、性能优化、架构师课程、NDK、混合式开发（ReactNative+Weex）微信小程序、Flutter全方面的Android进阶实践技术资料，并且还有技术大牛一起讨论交流解决问题。
《Android学习笔记总结+移动架构视频+大厂面试真题+项目实战源码》，点击传送门，即可免费领取！
效果。
由于内容较多就只放上一个大概的大纲，需要更及详细的学习思维导图的
还有高级UI、性能优化、架构师课程、NDK、混合式开发（ReactNative+Weex）微信小程序、Flutter全方面的Android进阶实践技术资料，并且还有技术大牛一起讨论交流解决问题。**
[外链图片转存中…(img-UBDLNa3x-1711289380671)]
《Android学习笔记总结+移动架构视频+大厂面试真题+项目实战源码》，点击传送门，即可免费领取！
75
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
