aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorSheldon <374662347@qq.com>2018-07-24 16:24:27 +0800
committerPéter Szilágyi <peterke@gmail.com>2018-07-24 16:24:27 +0800
commit9e24491c65120d3fb36da45e57a0cb87c549f621 (patch)
tree9c2694aaf30202c4aef8774560b06e623ab9ca8a
parentb536460f8e4166e1a884fd30290b56a85289503f (diff)
downloaddexon-9e24491c65120d3fb36da45e57a0cb87c549f621.tar.gz
dexon-9e24491c65120d3fb36da45e57a0cb87c549f621.tar.zst
dexon-9e24491c65120d3fb36da45e57a0cb87c549f621.zip
core/bloombits, light: fix typos (#17235)
-rw-r--r--core/bloombits/matcher.go10
-rw-r--r--core/bloombits/matcher_test.go2
-rw-r--r--light/lightchain_test.go2
3 files changed, 7 insertions, 7 deletions
diff --git a/core/bloombits/matcher.go b/core/bloombits/matcher.go
index 8d78adb75..3ec0d5ae9 100644
--- a/core/bloombits/matcher.go
+++ b/core/bloombits/matcher.go
@@ -59,7 +59,7 @@ type partialMatches struct {
// It can also have the actual results set to be used as a delivery data struct.
//
// The contest and error fields are used by the light client to terminate matching
-// early if an error is enountered on some path of the pipeline.
+// early if an error is encountered on some path of the pipeline.
type Retrieval struct {
Bit uint
Sections []uint64
@@ -218,7 +218,7 @@ func (m *Matcher) Start(ctx context.Context, begin, end uint64, results chan uin
// run creates a daisy-chain of sub-matchers, one for the address set and one
// for each topic set, each sub-matcher receiving a section only if the previous
// ones have all found a potential match in one of the blocks of the section,
-// then binary AND-ing its own matches and forwaring the result to the next one.
+// then binary AND-ing its own matches and forwarding the result to the next one.
//
// The method starts feeding the section indexes into the first sub-matcher on a
// new goroutine and returns a sink channel receiving the results.
@@ -543,7 +543,7 @@ func (s *MatcherSession) Error() error {
}
// AllocateRetrieval assigns a bloom bit index to a client process that can either
-// immediately reuest and fetch the section contents assigned to this bit or wait
+// immediately request and fetch the section contents assigned to this bit or wait
// a little while for more sections to be requested.
func (s *MatcherSession) AllocateRetrieval() (uint, bool) {
fetcher := make(chan uint)
@@ -599,8 +599,8 @@ func (s *MatcherSession) DeliverSections(bit uint, sections []uint64, bitsets []
}
}
-// Multiplex polls the matcher session for rerieval tasks and multiplexes it into
-// the reuested retrieval queue to be serviced together with other sessions.
+// Multiplex polls the matcher session for retrieval tasks and multiplexes it into
+// the requested retrieval queue to be serviced together with other sessions.
//
// This method will block for the lifetime of the session. Even after termination
// of the session, any request in-flight need to be responded to! Empty responses
diff --git a/core/bloombits/matcher_test.go b/core/bloombits/matcher_test.go
index 7a5f78ef3..91143e525 100644
--- a/core/bloombits/matcher_test.go
+++ b/core/bloombits/matcher_test.go
@@ -156,7 +156,7 @@ func testMatcher(t *testing.T, filter [][]bloomIndexes, start, blocks uint64, in
// Track the number of retrieval requests made
var requested uint32
- // Start the matching session for the filter and the retriver goroutines
+ // Start the matching session for the filter and the retriever goroutines
quit := make(chan struct{})
matches := make(chan uint64, 16)
diff --git a/light/lightchain_test.go b/light/lightchain_test.go
index c0aa51da2..5f0baaf4c 100644
--- a/light/lightchain_test.go
+++ b/light/lightchain_test.go
@@ -326,7 +326,7 @@ func TestBadHeaderHashes(t *testing.T) {
func TestReorgBadHeaderHashes(t *testing.T) {
bc := newTestLightChain()
- // Create a chain, import and ban aferwards
+ // Create a chain, import and ban afterwards
headers := makeHeaderChainWithDiff(bc.genesisBlock, []int{1, 2, 3, 4}, 10)
if _, err := bc.InsertHeaderChain(headers, 1); err != nil {