- 博客(2)
- 资源 (1)
- 收藏
- 关注
原创 concurrenthashmap
concurrenthashmap putVal()方法 final V putVal(K key, V value, boolean onlyIfAbsent) { if (key == null || value == null) throw new NullPointerException(); //计算hash值 int hash = spread(key.hashCode()); int binCount = 0; /
2021-04-20 11:08:56 55
原创 HashMap
初始化 指定长度的初始化: static final int tableSizeFor(int cap) { int n = cap - 1; n |= n >>> 1; n |= n >>> 2; n |= n >>> 4; n |= n >>> 8; n |= n >>> 16; return (n &l
2020-12-07 21:08:42 57
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人