mirror of
https://github.com/ethereum/go-ethereum.git
synced 2026-08-20 02:42:27 +00:00
mobile, p2p, swam: fix comment typos
This commit is contained in:
parent
4eee99aac5
commit
57ad034df5
3 changed files with 3 additions and 3 deletions
|
|
@ -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
|
||||
|
|
|
|||
|
|
@ -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
|
||||
|
|
|
|||
|
|
@ -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.
|
||||
|
|
|
|||
Loading…
Reference in a new issue