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

Merge pull request #2150 from cxhello/main

Browse Source 
Update linkedhashmap-source-code.md
This commit is contained in:
Guide 2023-08-31 19:14:57 +08:00 committed by GitHub
commit ae8ae6cd32
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File 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,