查看IDEA中的原码
案例
public static void main(String[] args) {
HashMap<String,String> map = new HashMap<String, String>();
map.put("a","aaa");
map.put("b","bbb");
map.put("c","ccc");
String key = "c";
boolean contains = map.containsKey("c");
if (contains){
System.out.println("map 中包含键值为c的key");
}else {
System.out.println("map 中不包含键值为c 的key ");
}
}
读源码
学习containsKey() 方法原码:
public boolean containsKey(Object key) {
return getNode(hash(key), key) != null;
}
读 getNode() 方法原码
final Node<K,V> getNode(int hash, Object key) {
Node<K,V>[] tab; Node<K,V> first, e; int n; K k;
if ((tab = table) != null && (n = tab.length) > 0 &&
(first = tab[(n - 1) & hash]) != null) {
if (first.hash == hash && // always check first node
((k = first.key) == key || (key != null && key.equals(k))))
return first;
if ((e = first.next) != null) {
if (first instanceof TreeNode)
return ((TreeNode<K,V>)first).getTreeNode(hash, key);
do {
if (e.hash == hash &&
((k = e.key) == key || (key != null && key.equals(k))))
return e;
} while ((e = e.next) != null);
}
}
return null;
}
static final int hash(Object key) {
int h;
return (key == null) ? 0 : (h = key.hashCode()) ^ (h >>> 16);
}