Java集合类源码(粒度：方法层面)
ArrayList
构造方法，有三种
public ArrayList(int initialCapacity)
/*
初始化容量>0,分配空间
初始化容量=0，赋值空数组
否则抛IllegalArgumentException异常
*/
public ArrayList() //直接赋值空数组
public ArrayList(Collection<? extends E> c)
/*
对于集合C,若集合不为空，将C赋给底层数组，否则赋值空数组。
*/
其他方法
public void trimToSize() //将数组的空余位置全剪掉
public void ensureCapacity(int minCapacity)
//判断是否容量是否大于等于minCapacity，否则扩容
private static int calculateCapacity(Object[] elementData, int minCapacity)
//计算数组的容量(默认为10),返回max(10,minCapacity)
private void ensureCapacityInternal(int minCapacity)
private void ensureExplicitCapacity(int minCapacity)
//以上三个函数配套，判断当前数组容量>=minCapacity,否则扩容
private void grow(int minCapacity)
//扩容，将原来容量扩到1.5倍，取与minCapacity的较大值，不超过INT.MAX_VALUE
private static int hugeCapacity(int minCapacity)
/*
判断minCapacity<0,小于0证明溢出了，报错。
比较minCapacity与MAX_ARRAY_SIZE的大小，
如果比MAX_ARRAY_SIZE大，则返回int的最大值，否则返回MAX_ARRAY_SIZE
*/
public int size() //返回当前数组包含的元素个数
public boolean isEmpty()//判空
public boolean contains(Object o)//判断list是否存在元素o
public int indexOf(Object o) //返回元素o出现的第一个位置，没出现返回-1
public int lastIndexOf(Object o)返回元素o出现的最后一个位置，没出现返回-1
public Object clone()//返回数组的浅拷贝
public Object[] toArray()//返回list的静态数组
其他的，增删有操作一个元素，有操作多个元素。
删除具有快速失败机制，发现modCount和之前不对，就返回删除失败，
清空数组，
实现迭代器Iterator功能，
序列化。
HashMap
成员变量
static final int DEFAULT_INITIAL_CAPACITY = 1 << 4; // 默认容量
static final int MAXIMUM_CAPACITY = 1 << 30;//最大容量
static final float DEFAULT_LOAD_FACTOR = 0.75f;//负载因子，当占用空间超过容量的这个比例就会扩容
static final int TREEIFY_THRESHOLD = 8;//节点树化阈值，（插入后）链表节点数大于这个值则树化
static final int UNTREEIFY_THRESHOLD = 6;//退化成链表的阈值
static final int MIN_TREEIFY_CAPACITY = 64;//节点树化的条件之一：要满足整体容量>=64
transient Node<K,V>[] table;//底层数组
transient Set<Map.Entry<K,V>> entrySet;
final float loadFactor;//负载因子
transient int modCount;
transient int size;
int threshold;//当map元素个数达到threshold个，发生扩容
重点方法
- 添加元素putval
//所有的添加，最后都是走这里
/*
hash:key的hash值
onlyIfAbsent :true的话，不替代原有元素，false替换
evict：false表示刚创建map时添加初始元素，true表示建map后添加新元素
*/
final V putVal(int hash, K key, V value, boolean onlyIfAbsent,
boolean evict) {
Node<K,V>[] tab; Node<K,V> p; int n, i;
//判断tab为空
if ((tab = table) == null || (n = tab.length) == 0)
n = (tab = resize()).length;//扩容
//i存储在tab数组下标位置，下面判断到该位置没有被占
if ((p = tab[i = (n - 1) & hash]) == null)
tab[i] = newNode(hash, key, value, null);
else {
Node<K,V> e; K k;
//如果当前位置的key相同，替换
if (p.hash == hash &&
((k = p.key) == key || (key != null && key.equals(k))))
e = p;
//如果是树化节点，就遍历树，找到合适位置插入
else if (p instanceof TreeNode)
e = ((TreeNode<K,V>)p).putTreeVal(this, tab, hash, key, value);
//普通链表节点
else {
for (int binCount = 0; ; ++binCount) {
if ((e = p.next) == null) {
p.next = newNode(hash, key, value, null);
//如果该条链已经大于等于8个了，树化
if (binCount >= TREEIFY_THRESHOLD - 1) // -1 for 1st
treeifyBin(tab, hash);
break;
}
//找到相同key的键值对
if (e.hash == hash &&
((k = e.key) == key || (key != null && key.equals(k))))
break;
p = e;
}
}
if (e != null) { // existing mapping for key
V oldValue = e.value;
if (!onlyIfAbsent || oldValue == null)
e.value = value;
afterNodeAccess(e);
return oldValue;
}
}
++modCount;
if (++size > threshold)
resize();
afterNodeInsertion(evict);
return null;
}
- 扩容resize
final Node<K,V>[] resize() {
Node<K,V>[] oldTab = table;
int oldCap = (oldTab == null) ? 0 : oldTab.length;//数组容量
int oldThr = threshold;//当前数组元素个数
int newCap, newThr = 0;
if (oldCap > 0) {
//达到最大，扩不了，将threshold调到最大，能装多少就装多少
if (oldCap >= MAXIMUM_CAPACITY) {
threshold = Integer.MAX_VALUE;
return oldTab;
}
else if ((newCap = oldCap << 1) < MAXIMUM_CAPACITY &&
oldCap >= DEFAULT_INITIAL_CAPACITY)
//扩容到原来的两倍
newThr = oldThr << 1; // double threshold
}
else if (oldThr > 0) // initial capacity was placed in threshold
newCap = oldThr;
else { // zero initial threshold signifies using defaults
newCap = DEFAULT_INITIAL_CAPACITY;
newThr = (int)(DEFAULT_LOAD_FACTOR * DEFAULT_INITIAL_CAPACITY);
}
if (newThr == 0) {
float ft = (float)newCap * loadFactor;
newThr = (newCap < MAXIMUM_CAPACITY && ft < (float)MAXIMUM_CAPACITY ?
(int)ft : Integer.MAX_VALUE);
}
threshold = newThr;
@SuppressWarnings({"rawtypes","unchecked"})
Node<K,V>[] newTab = (Node<K,V>[])new Node[newCap];
table = newTab;
//重新放置原来的元素，
/*
对于链表或红黑树，将它们分成两条链，低位链和高位链，再根据链长度选择树化，最后接到数组位置。
*/
if (oldTab != null) {
for (int j = 0; j < oldCap; ++j) {
Node<K,V> e;
if ((e = oldTab[j]) != null) {
oldTab[j] = null;
//只有一个节点
if (e.next == null)
newTab[e.hash & (newCap - 1)] = e;
//树
else if (e instanceof TreeNode)
((TreeNode<K,V>)e).split(this, newTab, j, oldCap);
//链表
else { // preserve order
Node<K,V> loHead = null, loTail = null;//低位链
Node<K,V> hiHead = null, hiTail = null;//高位链
Node<K,V> next;
do {
next = e.next;
if ((e.hash & oldCap) == 0) {
if (loTail == null)
loHead = e;
else
loTail.next = e;
loTail = e;
}
else {
if (hiTail == null)
hiHead = e;
else
hiTail.next = e;
hiTail = e;
}
} while ((e = next) != null);
if (loTail != null) {
loTail.next = null;
newTab[j] = loHead;
}
if (hiTail != null) {
hiTail.next = null;
newTab[j + oldCap] = hiHead;
}
}
}
}
}
return newTab;
}
- 树节点的Split方法，用来扩容时重新分位置。可以看到和上面链表的分链一模一样。
final void split(HashMap<K,V> map, Node<K,V>[] tab, int index, int bit) {
TreeNode<K,V> b = this;
// Relink into lo and hi lists, preserving order
TreeNode<K,V> loHead = null, loTail = null;
TreeNode<K,V> hiHead = null, hiTail = null;
int lc = 0, hc = 0;
for (TreeNode<K,V> e = b, next; e != null; e = next) {
next = (TreeNode<K,V>)e.next;
e.next = null;
if ((e.hash & bit) == 0) {
if ((e.prev = loTail) == null)
loHead = e;
else
loTail.next = e;
loTail = e;
++lc;
}
else {
if ((e.prev = hiTail) == null)
hiHead = e;
else
hiTail.next = e;
hiTail = e;
++hc;
}
}
/*
和链表分链的唯一区别是判断是否要树化或反树化
*/
if (loHead != null) {
if (lc <= UNTREEIFY_THRESHOLD)
tab[index] = loHead.untreeify(map);
else {
tab[index] = loHead;
if (hiHead != null) // (else is already treeified)
loHead.treeify(tab);
}
}
if (hiHead != null) {
if (hc <= UNTREEIFY_THRESHOLD)
tab[index + bit] = hiHead.untreeify(map);
else {
tab[index + bit] = hiHead;
if (loHead != null)
hiHead.treeify(tab);
}
}
}
- 节点树化 treeify，将链表建成红黑树
final void treeify(Node<K,V>[] tab) {
TreeNode<K,V> root = null;
for (TreeNode<K,V> x = this, next; x != null; x = next) {
next = (TreeNode<K,V>)x.next;
x.left = x.right = null;
if (root == null) {
x.parent = null;
x.red = false;//根节点是黑色的
root = x;
}
else {
K k = x.key;
int h = x.hash;
Class<?> kc = null;
for (TreeNode<K,V> p = root;;) {
int dir, ph;
K pk = p.key;
if ((ph = p.hash) > h)
dir = -1;
else if (ph < h)
dir = 1;
else if ((kc == null &&
(kc = comparableClassFor(k)) == null) ||
(dir = compareComparables(kc, k, pk)) == 0)
dir = tieBreakOrder(k, pk);
TreeNode<K,V> xp = p;
if ((p = (dir <= 0) ? p.left : p.right) == null) {
x.parent = xp;
if (dir <= 0)
xp.left = x;
else
xp.right = x;
root = balanceInsertion(root, x);
break;
}
}
}
}
moveRootToFront(tab, root);
}
- 反树化untreeify，就是将treeNode变回Node，化链。
final Node<K,V> untreeify(HashMap<K,V> map) {
Node<K,V> hd = null, tl = null;
for (Node<K,V> q = this; q != null; q = q.next) {
Node<K,V> p = map.replacementNode(q, null);
if (tl == null)
hd = p;
else
tl.next = p;
tl = p;
}
return hd;
}