8000 fixed deterministic logic for first findnode method by jeongkyun-oh · Pull Request #1835 · klaytn/klaytn · GitHub
[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to content
This repository was archived by the owner on Aug 19, 2024. It is now read-only.

fixed deterministic logic for first findnode method #1835

Merged
merged 1 commit into from
May 1, 2023
Merged

fixed deterministic logic for first findnode method #1835

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 3 additions & 1 deletion networks/p2p/discover/table.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -275,7 +275,9 @@ func (tab *Table) findNewNode(seeds *nodesByDistance, targetID NodeID, targetNT
for _, n := range <-reply {
if n != nil && !seen[n.ID] {
seen[n.ID] = true
seeds.push(n, max)
if len(seeds.entries) < max {
seeds.entries = append(seeds.entries, n)
}
}
}
}
Expand Down
0