Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Two tiny comment fixes to the gossip package #521

Merged
merged 1 commit into from
Mar 31, 2015
Merged

Two tiny comment fixes to the gossip package #521

Show file tree
Hide file tree
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
2 changes: 1 addition & 1 deletion gossip/client.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -30,7 +30,7 @@ import (
)

const (
// maxWaitForNewGossip is minimum wait for new gossip before a
// maxWaitForNewGossip is maximum wait for new gossip before a
// peer is considered a poor source of good gossip and is GC'd.
maxWaitForNewGossip = 1 * time.Minute
)
Expand Down
4 changes: 2 additions & 2 deletions gossip/gossip.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -41,8 +41,8 @@ the system with minimal total hops. The algorithm is as follows:
connected peers < maxPeers, choose random peer from those
originating info > maxToleratedHops, start it, and goto #2.

c. If sentinelGossip is missing or expired, node is considered
partitioned; goto #1.
c. If sentinel gossip keyed by KeySentinel is missing or expired,
node is considered partitioned; goto #1.

3 On connect, if node has too many connected clients, gossip requests
are returned immediately with an alternate address set to a random
Expand Down