yaclty/Java-Interview-Guide
1
0
Fork 0
mirror of https://github.com/Snailclimb/JavaGuide synced 2025-08-10 00:41:37 +08:00
Code Issues Projects Releases Wiki Activity

Compare commits

base: yaclty:ae8ae6cd3215c68a6c25e2ed2a548c8b9ec22562
Branches Tags
yaclty:main
yaclty:master
..
compare: yaclty:9fbfcee3b53f946fe941cf06e41c2bd31e0c08d6
Branches Tags
yaclty:main
yaclty:master

No commits in common. "ae8ae6cd3215c68a6c25e2ed2a548c8b9ec22562" and "9fbfcee3b53f946fe941cf06e41c2bd31e0c08d6" have entirely different histories.
ae8ae6cd32 ... 9fbfcee3b5

1 changed files with 2 additions and 2 deletions
Show Stats Expand all files Collapse all files

2
docs/java/collection/linkedhashmap-source-code.md
View File

@ -314,7 +314,7 @@ void afterNodeAccess(Node < K, V > e) { // move node to last
### remove 方法后置操作——afterNodeRemoval ### remove 方法后置操作——afterNodeRemoval
`LinkedHashMap` 并没有对 `remove` 方法进行重写，而是直接继承 `HashMap` 的 `remove` 方法，为了保证键值对移除后双向链表中的节点也会同步被移除，`LinkedHashMap` 重写了 `HashMap` 的空实现方法 `afterNodeRemoval`。 `LinkedHashMap` 并没有对 `remove` 方法进行重写，而实直接继承 `HashMap` 的 `remove` 方法，为了保证键值对移除后双向链表中的节点也会同步被移除，`LinkedHashMap` 重写了 `HashMap` 的空实现方法 `afterNodeRemoval`。
```java ```java
final Node<K,V> removeNode(int hash, Object key, Object value, final Node<K,V> removeNode(int hash, Object key, Object value,