文章目录
TreeSet vs HashSet vs LinkedHashSet
TreeSet红黑树,指定排序字段,查找效率O(logN)
HashSet 查找效率O(1)
LinkedHashSet内部使用双向链表维护插入顺序
迭代器模式
hash的迭代器实现
ArrayList
扩容1.5倍
Fast Fail
迭代器会每次更新这个值所以不会抛异常,foreach则会抛异常
CopyOnWriteArrayList
Copy一份用来加锁写
掩码计算方法(mask)
int n = cap - 1;
n |= n >>> 1;
n |= n >>> 2;
n |= n >>> 4;
n |= n >>> 8;
n |= n >>> 16;
return (n < 0) ? 1 : (n >= MAXIMUM_CAPACITY) ? MAXIMUM_CAPACITY : n + 1;
LinkedHashMap 实现LRU
关键方法
afterNodeaccess
afterNodeInsertion
accessOrder可以在初始化时候设置
removeEldestEntry
自己实现,默认为false
class LRUCache<K, V> extends LinkedHashMap<K, V> {
private static final int MAX_SIZE = 5;
protected boolean removeEldestEntry(Map.Entry<K,V> eldest) {
return size() > MAX_SIZE;
}
LRUCache() {
super(MAX_SIZE, 0.75f, true);
}
}
public static void main(String[] args) {
LRUCache<Integer, String> cache = new LRUCache<>();
cache.put(1, "a");
cache.put(2, "b");
cache.put(3, "c");
cache.get(1);
cache.put(4, "d");
System.out.println(cache.keySet());
}