Hacktoberfest 2026: the issues maintainers tagged for October, open and beginner-friendly. Browse Hacktoberfest issues

HashMap(JDK1.8)源码+底层数据结构分析.md中put方法的流程图,转变红黑树时的疑问

Open
#1,087 8 comments 1 reaction 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
2/5
Estimated time
1-3 hours
Newbie friendliness
35/100
Issue type
Documentation
Clarity
Mostly clear
Activity status
Stale
Tech stack
java
Domain
documentation

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.

Description

doc-bug enhancement
屏幕截图 2021-02-17 171926

这里应该是先链表尾插,然后treeifyBin(tab, hash);跳出循环,执行最后面的++modCount;和判断是否需要扩容了吧?

Dominant language
JavaScript
Stars
159k
Forks
46.1k
Avg merge
1d 8h
Merged PRs (30d)
10

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from Snailclimb/JavaGuide

All issues in Snailclimb/JavaGuide

Similar issues

More JavaScript issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.