From 92290ebb9968c9fb1f6fac93d7b07ac74b512485 Mon Sep 17 00:00:00 2001 From: Kenji Kaneda Date: Tue, 31 Mar 2015 07:34:03 -0700 Subject: [PATCH] Two tiny comment fixes to the gossip package - s/sentinelGossip/sentinel gossip keyed by KeySentinel/ a97fee5d removed SentinelGossip and added KeySentinel - s/maxWaitForNewGossip is minimum wait/maxWaitForNewGossip is maximum wait/ --- gossip/client.go | 2 +- gossip/gossip.go | 4 ++-- 2 files changed, 3 insertions(+), 3 deletions(-) diff --git a/gossip/client.go b/gossip/client.go index 44533b5901c0..74d4f1173072 100644 --- 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 index d28f827562b3..5573fbfb1f60 100644 --- 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