Merge pull request #521 from kkaneda/kkaneda/gossip_comment

Two tiny comment fixes to the gossip package
cockroachdb · Mar 31, 2015 · c9e61e8 · c9e61e8
2 parents 3187089 + 92290eb
commit c9e61e8
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 3 deletions.
diff --git a/gossip/client.go b/gossip/client.go
@@ -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
 )

diff --git a/gossip/gossip.go b/gossip/gossip.go
@@ -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