-
private int maxSize; //规定的最大存储空间
-
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;
-
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) {
-
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.
-
* 如果丢失了就试图创建一个item
-
*/
-
V createdValue = create(key);
-
if (createdValue == null) {
-
return null;
-
}
-
synchronized (this) {
-
createCount++;//创建++
-
mapValue = map.put(key, createdValue);
-
if (mapValue != null) {
-
// There was a conflict so undo that last put
-
//如果前面存在oldValue,那么撤销put()
-
map.put(key, mapValue);
-
} else {
-
size += safeSizeOf(key, createdValue);
-
}
-
}
-
if (mapValue != null) {
-
entryRemoved(false, key, createdValue, mapValue);
-
return mapValue;
-
} else {
-
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);
-
previous = map.put(key, value);
-
if (previous != null) { //返回的先前的value值
-
size -= safeSizeOf(key, previous);
-
}
-
}
-
if (previous != null) {
-
entryRemoved(false, key, previous, value);
-
}
-
trimToSize(maxSize);
-
return previous;
-
}
-
/**
-
* @param maxSize the maximum size of the cache before returning. May be -1
-
* to evict even 0-sized elements.
-
* 清空cache空间
-
*/
-
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!”);
-
}
-
if (size <= maxSize) {
-
break;
-
}
-
Map.Entry<K, V> toEvict = map.eldest();
-
if (toEvict == null) {
-
break;
-
}
-
key = toEvict.getKey();
-
value = toEvict.getValue();
-
map.remove(key);
-
size -= safeSizeOf(key, value);
-
evictionCount++;
-
}
-
entryRemoved(true, key, value, null);
-
}
-
}
-
/**
-
* Removes the entry for {@code key} if it exists.
-
* 删除key相应的cache项,返回相应的value
-
* @return the previous value mapped by {@code 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.
-
* 当item被回收或者删掉时调用。改方法当value被回收释放存储空间时被remove调用,
-
* 或者替换item值时put调用,默认实现什么都没做。
-
*
The method is called without synchronization: other threads may
自我介绍一下,小编13年上海交大毕业,曾经在小公司待过,也去过华为、OPPO等大厂,18年进入阿里一直到现在。
深知大多数初中级安卓工程师,想要提升技能,往往是自己摸索成长,但自己不成体系的自学效果低效又漫长,而且极易碰到天花板技术停滞不前!
因此收集整理了一份《2024年最新Android移动开发全套学习资料》送给大家,初衷也很简单,就是希望能够帮助到想自学提升又不知道该从何学起的朋友,同时减轻大家的负担。
由于文件比较大,这里只是将部分目录截图出来,每个节点里面都包含大厂面经、学习笔记、源码讲义、实战项目、讲解视频
如果你觉得这些内容对你有帮助,可以添加下面V无偿领取!(备注Android)
总结
其实要轻松掌握很简单,要点就两个:
- 找到一套好的视频资料,紧跟大牛梳理好的知识框架进行学习。
- 多练。 (视频优势是互动感强,容易集中注意力)
你不需要是天才,也不需要具备强悍的天赋,只要做到这两点,短期内成功的概率是非常高的。
对于很多初中级Android工程师而言,想要提升技能,往往是自己摸索成长,不成体系的学习效果低效漫长且无助。下面资料部分截图是我花费几个月时间整理的,诚意满满:特别适合有3-5年开发经验的Android程序员们学习。
- 自行下载直达领取链接:【点击我即可获得!】
- 以上进阶BATJ大厂学习资料可以免费分享给大家,需要完整版的朋友,【点这里可以看到全部内容】。
你不需要是天才,也不需要具备强悍的天赋,只要做到这两点,短期内成功的概率是非常高的。
对于很多初中级Android工程师而言,想要提升技能,往往是自己摸索成长,不成体系的学习效果低效漫长且无助。下面资料部分截图是我花费几个月时间整理的,诚意满满:特别适合有3-5年开发经验的Android程序员们学习。
- 自行下载直达领取链接:【点击我即可获得!】
- 以上进阶BATJ大厂学习资料可以免费分享给大家,需要完整版的朋友,【点这里可以看到全部内容】。
[外链图片转存中…(img-b1oU62nS-1710568646109)]