HashMap原理解析
final V putVal(int hash, K key, V value, boolean onlyIfAbsent, boolean evict) { Node[] tab; Node p; int n, i; if ((tab = table) == null || (n = tab.length) == 0) n = (tab = resize()).length; if ((p =
原创
2017-06-06 21:48:26 ·
224 阅读 ·
0 评论