1.hashmap的存储方式结构
在jdk1.8之前是数据+链表方式存`在这里插入代码片`储,从jdk、1,.8开始以数据+链表+红黑树方式存储,
具体的存储方式时根据key来hash碰撞计算key的hash值,来找到对应的数组中的下标,在判断链表的next存储,当单个链表多于8个,并且总的数多于64是启动resize从新排序,此时才加入红黑树
2hashmap初始化方式
// hashmap的初始化的方式,注意的是这里的初始化是不会创建对象的,只是设置了初始化因子
// 包含初始化容量和初始化因子
public HashMap(int initialCapacity, float loadFactor) {
if (initialCapacity < 0)
throw new IllegalArgumentException("Illegal initial capacity: " +initialCapacity);
if (initialCapacity > MAXIMUM_CAPACITY)
initialCapacity = MAXIMUM_CAPACITY;
if (loadFactor <= 0 || Float.isNaN(loadFactor))
throw new IllegalArgumentException("Illegal load factor: " + loadFactor);
this.loadFactor = loadFactor;
this.threshold = tableSizeFor(initialCapacity);
}
// 2.值设置初始化容量
public HashMap(int initialCapacity) {
this(initialCapacity, DEFAULT_LOAD_FACTOR);
}
// 采用默认的初始化,容量为16.加载因子为0.75
public HashMap() {
this.loadFactor = DEFAULT_LOAD_FACTOR; // all other fields defaulted
}
// 采用基础的方式赋初值
public HashMap(Map<? extends K, ? extends V> m) {
this.loadFactor = DEFAULT_LOAD_FACTOR;
putMapEntries(m, false);
}
3.hashmap存储方式
// resize冲源码的注释上可以了解到此方法不仅仅用来扩大空间,还用来初始化
final Node<K,V>[] resize() {
// 这里获取的是map的一个节点,因为map中是使用node方式存储的
Node<K,V>[] oldTab = table;
int oldCap = (oldTab == null) ? 0 : oldTab.length;
int oldThr = threshold;
int newCap, newThr = 0;
// 判断map中是否有元素
if (oldCap > 0) {
// 判断其中的个数是否超过了最大的数量
if (oldCap >= MAXIMUM_CAPACITY) {
threshold = Integer.MAX_VALUE;
return oldTab;
}
// 扩容,这里采用的是左移1位,即扩大1倍的方式,这是计算机友好的方式买这种效率比较高
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;
// 16*0.75 判断是否达到扩容的条件,返回一个扩容的界限
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) {
// 扩容后需要把之前的元素拷贝到新的节点中,jdk中采用的是尾插法,在jdk1.8之前采用的是头插法
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;
}
// hashmap的移除
public V remove(Object key) {
Node<K,V> e;
return (e = removeNode(hash(key), key, null, false, true)) == null ?
null : e.value;
}
final Node<K,V> removeNode(int hash, Object key, Object value,
boolean matchValue, boolean movable) {
Node<K,V>[] tab; Node<K,V> p; int n, index;
if ((tab = table) != null && (n = tab.length) > 0 &&
(p = tab[index = (n - 1) & hash]) != null) {
Node<K,V> node = null, e; K k; V v;
if (p.hash == hash &&
((k = p.key) == key || (key != null && key.equals(k))))
node = p;
else if ((e = p.next) != null) {
if (p instanceof TreeNode)
node = ((TreeNode<K,V>)p).getTreeNode(hash, key);
else {
do {
if (e.hash == hash &&
((k = e.key) == key ||
(key != null && key.equals(k)))) {
node = e;
break;
}
p = e;
} while ((e = e.next) != null);
}
}
if (node != null && (!matchValue || (v = node.value) == value ||
(value != null && value.equals(v)))) {
if (node instanceof TreeNode)
((TreeNode<K,V>)node).removeTreeNode(this, tab, movable);
else if (node == p)
tab[index] = node.next;
else
p.next = node.next;
++modCount;
--size;
afterNodeRemoval(node);
return node;
}
}
return null;
}
// 清空map集合
public void clear() {
Node<K,V>[] tab;
modCount++;
if ((tab = table) != null && size > 0) {
size = 0;
for (int i = 0; i < tab.length; ++i)
tab[i] = null;
}
}
// map的映射,值映射可以值
public Set<K> keySet() {
Set<K> ks = keySet;
if (ks == null) {
ks = new KeySet();
keySet = ks;
}
return ks;
}
// values的映射
public Collection<V> values() {
Collection<V> vs = values;
if (vs == null) {
vs = new Values();
values = vs;
}
return vs;
}
// 一个键值对的映射,可以把entry理解为set中的元素
public Set<Map.Entry<K,V>> entrySet() {
Set<Map.Entry<K,V>> es;
return (es = entrySet) == null ? (entrySet = new EntrySet()) : es;
}
***注意:***map集合不可以在循环中增删集合元素,但是在迭代器中可以使用迭代器的删除, *延伸:*hashmap是排序的,也是有一定顺序的,他是按照key的hash碰撞计算输出的
有序是指输出顺序是按照插入顺序输出的,
排序是指按照一定顺序排序的
无序是指插入的顺序和保存的顺序不一致