HashMap 容量为2次幂的原理

学习自 https://www.zhihu.com/question/20733617 hash static final int hash(Object key) { int h; return (key == null) ? 0 : (h = key.hashCode()) ^ (h >>> 16); } 然后 (n - 1) & hash 首先介绍(n - 1) & hash

>>阅读原文<<