From 57ad034df5c7ee488bfcd7f6bbe456f848122e8e Mon Sep 17 00:00:00 2001 From: hackyminer Date: Wed, 26 Dec 2018 14:43:55 +0900 Subject: [PATCH] mobile, p2p, swam: fix comment typos --- mobile/context.go | 2 +- p2p/protocols/protocol.go | 2 +- swarm/pot/doc.go | 2 +- 3 files changed, 3 insertions(+), 3 deletions(-) diff --git a/mobile/context.go b/mobile/context.go index f1fff90114..76b4c54642 100644 --- a/mobile/context.go +++ b/mobile/context.go @@ -24,7 +24,7 @@ import ( "time" ) -// Context carries a deadline, a cancelation signal, and other values across API +// Context carries a deadline, a cancellation signal, and other values across API // boundaries. type Context struct { context context.Context diff --git a/p2p/protocols/protocol.go b/p2p/protocols/protocol.go index bf879b9851..dc6381a60f 100644 --- a/p2p/protocols/protocol.go +++ b/p2p/protocols/protocol.go @@ -18,7 +18,7 @@ Package protocols is an extension to p2p. It offers a user friendly simple way to define devp2p subprotocols by abstracting away code standardly shared by protocols. -* automate assigments of code indexes to messages +* automate assignments of code indexes to messages * automate RLP decoding/encoding based on reflecting * provide the forever loop to read incoming messages * standardise error handling related to communication diff --git a/swarm/pot/doc.go b/swarm/pot/doc.go index cb6faea57b..127fb601c7 100644 --- a/swarm/pot/doc.go +++ b/swarm/pot/doc.go @@ -69,7 +69,7 @@ retrieve items has a logarithmic distribution. As a consequence one can organise the tree so that items that need faster access are torwards the top. In particular for any subset where popularity has a power -distriution that is independent of proximity order (content addressed storage of +distribution that is independent of proximity order (content addressed storage of chunks), it is in principle possible to create a pot where the steps needed to access an item is inversely proportional to its popularity. Such organisation is not implemented as yet.