HashMap源码逐行分析
1.数据结构
1.Node
static class Node<K,V> implements Map.Entry<K,V> {
final int hash;
final K key;
V value;
Node<K,V> next;
Node(int hash, K key, V value, Node<K,V> next) {
this.hash = hash;
this.key = key;
this.value = va
原创
2021-09-16 17:07:49 ·
198 阅读 ·
1 评论