forks/go-ethereum
1
0
Fork 1
mirror of https://github.com/ethereum/go-ethereum.git synced 2026-08-20 02:42:27 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

mobile, p2p, swam: fix comment typos

Browse source
This commit is contained in:
hackyminer 2018-12-26 14:43:55 +09:00
parent 4eee99aac5
commit 57ad034df5
No known key found for this signature in database
GPG key ID: 46D453DDCA4B766F
3 changed files with 3 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
mobile/context.go
View file

@ -24,7 +24,7 @@ import (
"time" "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. // boundaries.
type Context struct { type Context struct {
context context.Context context context.Context

2
p2p/protocols/protocol.go
View file

@ -18,7 +18,7 @@
Package protocols is an extension to p2p. It offers a user friendly simple way to define 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. 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 * automate RLP decoding/encoding based on reflecting
* provide the forever loop to read incoming messages * provide the forever loop to read incoming messages
* standardise error handling related to communication * standardise error handling related to communication

2
swarm/pot/doc.go
View file

@ -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 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 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 chunks), it is in principle possible to create a pot where the steps needed to
access an item is inversely proportional to its popularity. access an item is inversely proportional to its popularity.
Such organisation is not implemented as yet. Such organisation is not implemented as yet.