Snailclimb / Snailclimb/JavaGuide
HashMap(JDK1.8)源码+底层数据结构分析.md中put方法的流程图，转变红黑树时的疑问
Open
Nobody has claimed this yet.
doc-bug
enhancement
- Dominant language
- JavaScript
- Stars
- 159k
- Forks
- 46.1k
- Avg merge
- 14h 36m
- Merged PRs (30d)
- 6
Description
这里应该是先链表尾插，然后treeifyBin(tab, hash);跳出循环，执行最后面的++modCount;和判断是否需要扩容了吧？
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Open HashMap(JDK1.8)源码+底层数据结构分析.md and inspect the put-method flowchart referenced in the issue. Compare the diagram with the JDK 1.8 HashMap put flow, including the linked-list insertion, treeifyBin call, modCount update, and resize check. Done when the diagram accurately reflects that control flow.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- java
- Domain
- documentation
- Issue type
- Documentation
- Difficulty
- 2/5
- Estimated time
- 1-3 hours
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100